text-metrics

Calculate various string metrics efficiently https://github.com/mrkkrp/text-metrics

LTS Haskell 9.1:0.3.0
Stackage Nightly 2017-08-17:0.3.0
Latest on Hackage:0.3.0
BSD3 licensed and maintained by Mark Karpov

Module documentation for 0.3.0

There are no documented modules for this package.

Text Metrics

License BSD3 Hackage Stackage Nightly Stackage LTS Build Status Coverage Status

The library provides efficient implementations of various strings metric algorithms. It works with strict Text values.

The current version of the package implements:

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

License

Copyright © 2016–2017 Mark Karpov

Distributed under BSD 3 clause license.

Changes

Text Metrics 0.3.0

  • 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).

Text Metrics 0.2.0

  • Made the levenshtein, levenshteinNorm, damerauLevenshtein, and demerauLevenshtein more efficient.

  • Added jaro and jaroWinkler functions.

Text Metrics 0.1.0

  • Initial release.
Depends on:
Used by 3 packages:
comments powered byDisqus