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:
“Are we not madder than those first inhabitants of the plain of Sennar? We know that the distance separating the earth from the sky is infinite, and yet we do not stop building our tower.”
—Denis Diderot (1713–1784)