Levenshtein algorithm
Description: A string-comparison algorithm that calculates the minimum number of single-character insertions, deletions, or substitutions needed to transform one string into another.
Primary topic: Algorithms and Data Compression (21%)
Wikidata ID: wiki/Q5338467
OpenAlex ID: keywords/levenshtein-algorithm
