- A string metric for measuring the difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one word into the other. It is named after the mathematician Vladimir Levenshtein, who considered this distance in 1965. ← Wikipedia
- Related terms: Hamming distance, Leading
- Previous term: Level of effort
- Next term: Lexical scope
- Random term: Star hack (webglossary.info/random 🎲)