https://dbbd.sg/wiki/index.php?action=history&feed=atom&title=Levenshtein_distanceLevenshtein distance - Revision history2026-06-23T05:18:45ZRevision history for this page on the wikiMediaWiki 1.27.4https://dbbd.sg/wiki/index.php?title=Levenshtein_distance&diff=5916&oldid=prevWikiSysop at 06:49, 31 October 20112011-10-31T06:49:47Z<p></p>
<p><b>New page</b></p><div>In information theory and computer science, the Levenshtein distance is a metric for measuring the amount of difference between two sequences (i.e. an edit distance). The term edit distance is often used to refer specifically to Levenshtein distance.<br />
<br />
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</div>WikiSysop