Levenshtein distance

Rarity: Uncommon

A topic a little better known than average, read and translated beyond its own country.

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, 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.

Excerpt from the Wikipedia article “Levenshtein distance”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: Napsternxg, CC BY-SA 4.0, via Wikimedia Commons.