edit-distance: Levenhstein and restricted Damerau-Levenshtein edit distances

[ algorithms, bsd3, library ] [ Propose Tags ]

Optimized edit distances for fuzzy matching, including Levenhstein and restricted Damerau-Levenshtein algorithms.

Versions [faq] 0.1, 0.1.1, 0.1.2, 0.2.0, 0.2.1,,,,
Dependencies array (>=0.1), base (<4.6), containers (>=, old-time (>=1.0), parallel (>=1.0), process (>=1.0), QuickCheck (>=1.1), random (>=1.0), unix (>=2.3) [details]
License BSD-3-Clause
Author Max Bolingbroke
Maintainer batterseapower@hotmail.com
Revised Revision 1 made by AdamBergmark at Wed Apr 8 18:50:02 UTC 2015
Category Algorithms
Uploaded by MaxBolingbroke at Wed Jul 30 18:26:50 UTC 2008
Distributions Arch:, Debian:, Fedora:, FreeBSD:, LTSHaskell:, NixOS:, Stackage:, openSUSE:
Executables edit-distance-benchmark, edit-distance-tests
Downloads 35254 total (288 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]





Enable building the tests and benchmark suite


Choose the new smaller, split-up base package


Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info


Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

For package maintainers and hackage trustees