hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-11-10 11:09:43 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix typo (#350)

Browse Source
This commit is contained in:
Go 2020-12-21 04:06:36 +09:00 committed by GitHub
parent fa1f930c99
commit f617569760
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats 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`.