Levenshtein Distance Software Package

See: Levenshtein Distance Software Package, String Distance Software Package, Levenshtein Distance Function.

References

http://alias-i.com/lingpipe/demos/tutorial/stringCompare/read-me.html
- String comparison attempts to measure the similarity between strings. This is useful for applications ranging from database deduplication and record linkage to terminology extraction, spell checking, and k-nearest-neighbors classifiers.
- In this tutorial, we demonstrate the ways in which string comparisons are used in LingPipe.

http://search.cpan.org/~jgoldberg/Text-Levenshtein-0.05/Levenshtein.pm
- This module implements the Levenshtein edit distance. The Levenshtein edit distance is a measure of the degree of proximity between two strings. This distance is the number of substitutions, deletions or insertions ("edits") needed to transform one string into the other one (and vice versa). When two strings have distance 0, they are the same. A good point to start is: <http://www.merriampark.com/ld.htm>
http://www.merriampark.com/ld.htm
- The purpose of this short essay is to describe the Levenshtein distance algorithm and show how it can be implemented in three different programming languages.