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:
“The mystery of the evening-star brilliant in silence and distance between the downward-surging plunge of the sun and the vast, hollow seething of inpouring night. The magnificence of the watchful morning-star, that watches between the night and the day, the gleaming clue to the two opposites.”
—D.H. (David Herbert)