Papalocal
Loading…
Papalocal · Things
Work

Levenshtein distance

Levenshtein distance is a computer science metric for string similarity. It came out in 1965.

Released
1965
All 3 facts, and where they come from

Facts

3 facts · 0 confirmed by two sources · 0 cited · 3 from one source

What it is
algorithm One source
Released
1965 One source
Named after

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 18, 2026 · revision 2568854119
Described as
computer science metric for string similarity
Other names
edit distance, Levenshtein edit distance
What it is
algorithm
Released
1965
Named after
Vladimir Levenshtein
Wikipedias with a page
45

Wikidata item Q496939 (wikidata.org/wiki/Q496939), public domain (CC0). Copied 2026-11-18.

What Wikipedia says · copied November 18, 2026 · revision 1382725447

In information theory, linguistics, and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences. For two strings, it is the minimum number of single-symbol edits—insertions, deletions, or substitutions—required to transform one string into the other. Each edit has unit cost in the classical definition.
The distance is named after Soviet mathematician Vladimir Levenshtein, who introduced it in 1965 in the context of error-correcting codes. Levenshtein distance is a particular form of edit distance; the latter term is also used for broader models in which the set of allowed operations or their costs differ. It is closely related to sequence alignment.

From the Wikipedia article “Levenshtein distance” (en.wikipedia.org/wiki/Levenshtein_distance), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-18; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

People connected 1

Known for it