text-metrics

Calculate various string metrics efficiently

BSD-3-Clause licensed and maintained by Mark Karpov

This version can be pinned in stack with:text-metrics-0.3.0@sha256:c1567c9f77f4e4c43e64225a950d873c5b2bf27197fabf7846ec39fd11bbf371,2985

Depends on 4 packages(full list with versions):

Used by 2 packages in lts-11.22(full list with versions):

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:

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 on Strings, while text-metrics works on strict Text values.

Although we originally used C for speed, currently all functions are pure Haskell tuned for performance. See this blog post for more info.

Distributed under BSD 3 clause license.

All functions are now implemented in pure Haskell.
All functions return Int or Ratio Int instead of Natural and Ratio Natural.
Added overlap (returns overlap coefficient) and jaccard (returns Jaccard similarity coefficient).

Made the levenshtein, levenshteinNorm, damerauLevenshtein, and demerauLevenshtein more efficient.
Added jaro and jaroWinkler functions.