The edit-distance package

[Tags: bsd3, library]

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


[Skip to ReadMe]

Properties

Versions0.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
Change logNone available
Dependenciesarray (>=0.1), base (>=4.5 && <5), containers (>=0.1.0.1), random (>=1.0) [details]
LicenseBSD3
Copyright(c) 2008-2013 Maximilian Bolinbroke
AuthorMax Bolingbroke <batterseapower@hotmail.com>
MaintainerOleg Grenrus <oleg.grenrus@iki.fi>
CategoryAlgorithms
Home pagehttp://github.com/phadej/edit-distance
Source repositoryhead: git clone https://github.com/phadej/edit-distance.git
UploadedSun Jul 12 17:57:09 UTC 2015 by phadej
DistributionsDebian:0.2.2.1, Fedora:0.2.1.2, FreeBSD:0.2.2.1, LTSHaskell:0.2.2.1, NixOS:0.2.2.1, Stackage:0.2.2.1
Downloads8331 total (514 in last 30 days)
Votes
0 []
StatusDocs available [build log]
Last success reported on 2015-07-12 [all 1 reports]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees

Readme for edit-distance-0.2.2.1

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

Links