From f617569760979d540f795e41f039e93204c91af0 Mon Sep 17 00:00:00 2001 From: Go Date: Mon, 21 Dec 2020 04:06:36 +0900 Subject: [PATCH] fix typo (#350) --- src/algorithms/string/levenshtein-distance/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/algorithms/string/levenshtein-distance/README.md b/src/algorithms/string/levenshtein-distance/README.md index 4d4078b8..8876d679 100644 --- a/src/algorithms/string/levenshtein-distance/README.md +++ b/src/algorithms/string/levenshtein-distance/README.md @@ -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`.