# Minimum edit distance (Levenshtein distance) algorithm explained with examples in JavaScript

github.com
Submitted by **trekhleb**
in **programming**

natural language translation based on translation memory. You may find detailed explanation of [Levenshtein Distance Algorithm](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/levenshtein-distance) in [JavaScript Algorithms and Data Structures](https://github.com/trekhleb/javascript-algorithms/tree/master/src/algorithms/string/levenshtein-distance) repository