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:
“I do believe that the outward and the inward life correspond; that if any should succeed to live a higher life, others would not know of it; that difference and distance are one. To set about living a true life is to go on a journey to a distant country, gradually to find ourselves surrounded by new scenes and men; and as long as the old are around me, I know that I am not in any true sense living a new or a better life.”
—Henry David Thoreau (1817–1862)