Levenshtein distance
July 28th, 2010
No comments
In information theory and computer science, the Levenshtein distance is a metric for measuring the amount of difference between two sequences (i.e. an edit distance). The term edit distance is often used to refer specifically to Levenshtein distance.
The Levenshtein distance between two strings is defined as the minimum number of edits needed to transform one string into the other, with the allowable edit operations being insertion, deletion, or substitution of a single character. It is named after Vladimir Levenshtein, who considered this distance in 1965. (wikipedia with code, russian version)
- Levenshtein Distance, in Three Flavors (java applet)
- Damerau–Levenshtein distance
- Levenstein distance.beam (slideshare presentation)
