Re: Your dictionaries online!

Benct Philip Jonsson wrote:

> BTW how does levenshtein work? (The for dummies version, please! ;-)
The Levenshtein distance between two sequences (such as a word, phrase, or
other kind of string) is the minimum amount of edits (such as substitutions,
insertions, deletions and transpositions) needed to change one to the other.
For example, the distance between 'sit' and 'hit' or 'sit' and 'sat' is one
because in each case, one edit (a letter substitution) was made, and between
'sit' and 'hat', it's two because two substitutions were made.

K.

Reply