(definition)
Definition: See Levenshtein distance.
Author: CRC-A
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 15 May 2019.
HTML page formatted Wed May 15 15:26:26 2019.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "Levenshtein string distance", in
Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 15 May 2019. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/LevenshteinStringDistance.html