(definition)
Definition: See Levenshtein distance.
Author: CRC-A
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 22 June 2015.
HTML page formatted Mon Jul 20 14:31:11 2015.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "Levenshtein string distance", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 22 June 2015. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/LevenshteinStringDistance.html