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

[ algorithms, bsd3, library ] [ Propose Tags ] [ Report a vulnerability ]

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


[Skip to Readme]

Modules

[Index]

Downloads

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

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1, 0.1.1, 0.1.2, 0.2.0, 0.2.1, 0.2.1.1, 0.2.1.2, 0.2.1.3, 0.2.2.1
Dependencies array (>=0.1), base (>=4.5 && <5), containers (>=0.1.0.1), random (>=1.0) [details]
License BSD-3-Clause
Copyright (c) 2008-2013 Maximilian Bolinbroke
Author Max Bolingbroke <batterseapower@hotmail.com>
Maintainer Oleg Grenrus <oleg.grenrus@iki.fi>
Revised Revision 1 made by phadej at 2016-08-10T15:33:44Z
Category Algorithms
Home page http://github.com/phadej/edit-distance
Source repo head: git clone https://github.com/phadej/edit-distance.git
Uploaded by phadej at 2015-07-12T17:57:09Z
Distributions Arch:0.2.2.1, Debian:0.2.2.1, Fedora:0.2.2.1, FreeBSD:0.2.2.1, LTSHaskell:0.2.2.1, NixOS:0.2.2.1, Stackage:0.2.2.1, openSUSE:0.2.2.1
Reverse Dependencies 24 direct, 30 indirect [details]
Downloads 56749 total (189 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2015-07-12 [all 1 reports]

Readme for edit-distance-0.2.2.1

[back to package description]

Edit Distance Algorithms

Build Status Hackage

Installing

To just install the library:

cabal configure
cabal build
cabal install

Description

Edit distances algorithms for fuzzy matching. Specifically, this library provides:

They have been fairly heavily optimized. Indeed, for situations where one of the strings is under 64 characters long we use a rather neat "bit vector" algorithm: see the authors paper and the associated errata for more information. The algorithms could be faster, but they aren't yet slow enough to force us into improving the situation.

Example

Text.EditDistance> levenshteinDistance defaultEditCosts "witch" "kitsch"
2