Levenshtein distance

Summary

Levenshtein distance is an algorithm^[1]. It ranks in the top 0.59% of algorithm entities by monthly Wikipedia readership (1,281 views/month, #2 of 337).^[2]

Key Facts

• Levenshtein distance is credited with the discovery of Vladimir Levenshtein^[3].
• Levenshtein distance's instance of is recorded as algorithm^[4].
• Vladimir Levenshtein is named after Levenshtein distance^[5].
• Levenshtein distance's subclass of is recorded as distance^[6].
• Levenshtein distance's subclass of is recorded as norm^[7].
• Levenshtein distance's subclass of is recorded as string metric^[8].
• Levenshtein distance's subclass of is recorded as edit distance^[9].
• Levenshtein distance's publication date is recorded as +1965-00-00T00:00:00Z^[10].
• Levenshtein distance's Freebase ID is recorded as /m/024h6k^[11].
• Levenshtein distance's Stack Exchange tag is recorded as https://stackoverflow.com/tags/levenshtein-distance^[12].
• Levenshtein distance's different from is recorded as Damerau–Levenshtein distance^[13].
• Levenshtein distance's different from is recorded as Levenshtein automaton^[14].
• Levenshtein distance's different from is recorded as edit distance^[15].
• Levenshtein distance's uses is recorded as logical negation^[16].
• Levenshtein distance's uses is recorded as insert^[17].
• Levenshtein distance's uses is recorded as delete^[18].
• Levenshtein distance's uses is recorded as substitution^[19].
• Levenshtein distance's defining formula is recorded as \operatorname{lev}(a,b)=\begin{cases}|a|&\text{if }|b|=0\|b|&\text{if }|a|=0\\operatorname{lev}(\operatorname{tail}(a),\operatorname{tail}(b))&\text{if }a[0]=b[0]\1+\min\begin{cases}\operatorname{lev}(\operatorname{tail}(a),b)\\operatorname{lev}(a,\operatorname{tail}(b))\\operatorname{lev}(\operatorname{tail}(a),\operatorname{tail}(b))\\end{cases}&\text{otherwise}\end{cases}^[20].
• Levenshtein distance's studied by is recorded as category theory^[21].
• Levenshtein distance's Quora topic ID is recorded as Levenshtein-Distance^[22].
• Levenshtein distance's Dictionary of Algorithms and Data Structures ID is recorded as Levenshtein^[23].
• Levenshtein distance's Dictionary of Algorithms and Data Structures ID is recorded as LevenshteinStringDistance^[24].
• Levenshtein distance's maintained by WikiProject is recorded as WikiProject Mathematics^[25].
• Levenshtein distance's Microsoft Academic ID is recorded as 2777515626^[26].
• Levenshtein distance's in defining formula is recorded as |a|^[27].

Body

Designation and Status

Levenshtein distance's instance of is recorded as algorithm^[4].

History and Context

Vladimir Levenshtein is named after Levenshtein distance^[5].

Why It Matters

Levenshtein distance ranks in the top 0.59% of algorithm entities by monthly Wikipedia readership (1,281 views/month, #2 of 337).^[2] It has Wikipedia articles in 22 language editions, a strong signal of global cultural recognition.^[28] It is known by 49 alternative names across languages and contexts.^[29]