Minimum edit distance (Levenshtein distance) algorithm explained with examples in JavaScript github.com

Submitted by trekhleb in programming

The Levenshtein distance is 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.

This has a wide range of applications, for instance, spell checkers, correction systems for optical character recognition, fuzzy string searching, and software to assist natural language translation based on translation memory.

You may find detailed explanation of Levenshtein Distance Algorithm in JavaScript Algorithms and Data Structures repository.


You must log in or register to comment.