textmetrics alternatives and similar packages
Based on the "Algorithms" category.
Alternatively, view textmetrics alternatives based on common mentions on social networks and blogs.

arithmoi
Number theory: primes, arithmetic functions, modular computations, special sequences 
presburger
Decision procedures for Presburger arithmetic in Haskell 
imjanimation
Monorepo for a multiplayer game engine, and game examples 
searchalgorithms
Haskell library containing common graph search algorithms 
lca
Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing 
integerlogarithms
Integer logarithms, originally split from arithmoi package 
incrementalsatsolver
Simple, Incremental SAT Solving as a Haskell Library 
treeviz
Haskell library for visualizing algorithmic decomposition of computations. 
nonlinearoptimizationad
Wrapper of nonlinearoptimization package for using with ad and backprop packages 
GraphSCC
Tarjan's algorithm for computing strongly connected components 
infinitesearch
An implementation of Martin Escardo's exhaustively searchable sets in Haskell. 
editdistancevector
Calculate edit scripts and distances between Vectors. 
primesieve
A collection of packages related to math, algorithms and science, in Haskell. 
adpmulti
Prototype of ADP for MCFL (multiple contextfree languages) 
graphgenerators
A Haskell library for creating random Data.Graph instances using several pop 
epanethaskell
Call the EPANET toolkit via Haskell's Foreign Function Interface 
editdistancelinear
Levenshtein edit distance in linear memory (also turns out to be faster than C++) 
bordacount
Haskell implementation of the Borda count election method
Less time debugging, more time building
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of textmetrics or a related project?
README
Text Metrics
The library provides efficient implementations of various strings metric
algorithms. It works with strict Text
values.
The current version of the package implements:
 Levenshtein distance
 Normalized Levenshtein distance
 DamerauLevenshtein distance
 Normalized DamerauLevenshtein distance
 Hamming distance
 Jaro distance
 JaroWinkler distance
 Overlap coefficient
 Jaccard similarity coefficient
Comparison with the editdistance
package
There is
editdistance
package
whose scope overlaps with the scope of this package. The differences are:
editdistance
allows to specify costs for every operation when calculating Levenshtein distance (insertion, deletion, substitution, and transposition). This is rarely needed though in realworld applications, IMO.editdistance
only provides Levenshtein distance,textmetrics
aims to provide implementations of most string metrics algorithms.editdistance
works onStrings
, whiletextmetrics
works on strictText
values.
Implementation
Although we originally used C for speed, currently all functions are pure Haskell tuned for performance. See this blog post for more info.
Contribution
Issues, bugs, and questions may be reported in the GitHub issue tracker for this project.
Pull requests are also welcome.
License
Copyright © 2016–present Mark Karpov
Distributed under BSD 3 clause license.
*Note that all licence references and agreements mentioned in the textmetrics README section above
are relevant to that project's source code only.