text-metrics alternatives and similar packages
Based on the "Algorithms" category.
Alternatively, view text-metrics 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 -
imj-animation
Monorepo for a multi-player game engine, and game examples -
search-algorithms
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 -
incremental-sat-solver
Simple, Incremental SAT Solving as a Haskell Library -
treeviz
Haskell library for visualizing algorithmic decomposition of computations. -
integer-logarithms
Integer logarithms, originally split from arithmoi package -
nonlinear-optimization-ad
Wrapper of nonlinear-optimization package for using with ad and backprop packages -
GraphSCC
Tarjan's algorithm for computing strongly connected components -
infinite-search
An implementation of Martin Escardo's exhaustively searchable sets in Haskell. -
edit-distance-vector
Calculate edit scripts and distances between Vectors. -
graph-generators
A Haskell library for creating random Data.Graph instances using several pop -
primesieve
A collection of packages related to math, algorithms and science, in Haskell. -
adp-multi
Prototype of ADP for MCFL (multiple context-free languages) -
epanet-haskell
Call the EPANET toolkit via Haskell's Foreign Function Interface -
MIP
Libraries for reading/writing MIP problem files, invoking external MIP solvers, etc. in Haskell -
edit-distance-linear
Levenshtein edit distance in linear memory (also turns out to be faster than C++)
Clean code begins in your IDE with SonarLint
* 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 text-metrics 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
- Damerau-Levenshtein distance
- Normalized Damerau-Levenshtein distance
- Hamming distance
- Jaro distance
- Jaro-Winkler distance
- Overlap coefficient
- Jaccard similarity coefficient
Comparison with the edit-distance
package
There is
edit-distance
package
whose scope overlaps with the scope of this package. The differences are:
edit-distance
allows to specify costs for every operation when calculating Levenshtein distance (insertion, deletion, substitution, and transposition). This is rarely needed though in real-world applications, IMO.edit-distance
only provides Levenshtein distance,text-metrics
aims to provide implementations of most string metrics algorithms.edit-distance
works onStrings
, whiletext-metrics
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 text-metrics README section above
are relevant to that project's source code only.