8000
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent fa1f930 commit f617569Copy full SHA for f617569
src/algorithms/string/levenshtein-distance/README.md
@@ -50,7 +50,7 @@ to assist natural language translation based on translation memory.
50
51
Let’s take a simple example of finding minimum edit distance between
52
strings `ME` and `MY`. Intuitively you already know that minimum edit distance
53
-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
54
let’s try to formalize it in a form of the algorithm in order to be able to
55
do more complex examples like transforming `Saturday` into `Sunday`.
56
0 commit comments