Damerau–Levenshtein distance
Damerau–Levenshtein distance
Common
Rarity: Common
The most frequent rarity: most Wikipedia articles become Commons.
Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.
At a glance
- Class
- Notion
- Domain
- Science and technology
- In collections
- Nobody has pulled it yet.
What Wikipedia says
In information theory and computer science, the Damerau–Levenshtein distance (named after Frederick J. Damerau and Vladimir I. Levenshtein) is a string metric for measuring the edit distance between two sequences.
Excerpt from the Wikipedia article “Damerau–Levenshtein distance”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Open free boosters and add Damerau–Levenshtein distance to your collection.
Play for free




