STRDIST L1,L2
computes Levenshtein distance
between strings given on edit lines L1,L2.
See e.g. www.merriampark.com/ld.htm
Levenshtein (edit) distance is a measure of the similarity between two
strings s and t. The distance is the number of deletions, insertions, or
substitutions required to transform s into t.
Levenshtein distance is named after the Russian scientist Vladimir
Levenshtein, who devised the algorithm in 1965.
The Levenshtein distance algorithm has been used in
Spell checking, Speech recognition, DNA analysis, Plagiarism detection,
etc.
In Survo, Levenshtein distance is used for detecting typos in command and
specification words (see ERROR?) and in heuristic searches by
the FIND command (see HFIND?).
The standard measure is slightly modified by permitting an interchange of
two consecutive characters as one of the edit operations.
Example:
STRDIST CUR+1,CUR+2 / Levenshtein distance is 2 (1)
HEIGHTS
HEIGTHS
Thus the original distance is 2 (2 substitutions) and the modified
one is 1 (1 interchange).
Help System (web edition)