In information theory and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, the Levenshtein distance between two words is equal to the number of single-character edits required to change one word into the other. The phrase 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. It is closely related to pairwise string alignments.
Read more about Levenshtein Distance: Definition, Example, Applications, Relationship With Other Edit Distance Metrics, Computing Levenshtein Distance
Famous quotes containing the word distance:
“Her personality had an architectonic quality; I think of her when I see some of the great London railway termini, especially St. Pancras, with its soot and turrets, and she overshadowed her own daughters, whom she did not understand—my mother, who liked things to be nice; my dotty aunt. But my mother had not the strength to put even some physical distance between them, let alone keep the old monster at emotional arm’s length.”
—Angela Carter (1940–1992)