algorithm/javascript-algorithms
1
0
Fork 0
mirror of https://github.com/trekhleb/javascript-algorithms.git synced 2026-03-13 08:51:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge branch 'merge' of https://github.com/trekhleb/javascript-algorithms into merge

Browse Source
This commit is contained in:
Oleksii Trekhleb
2020-12-20 20:09:37 +01:00
parent 86dea85d97 e076203590
commit c44bb91ec4
3 changed files with 3 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/algorithms/string/levenshtein-distance/README.md
View File

@@ -50,7 +50,7 @@ to assist natural language translation based on translation memory.
Let’s take a simple example of finding minimum edit distance between
strings `ME` and `MY`. Intuitively you already know that minimum edit distance
here is `1` operation and this operation. And it is replacing `E` with `Y`. But
here is `1` operation, which is replacing `E` with `Y`. But
let’s try to formalize it in a form of the algorithm in order to be able to
do more complex examples like transforming `Saturday` into `Sunday`.