Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit f617569

Browse files
fix typo (trekhleb#350)
1 parent fa1f930 commit f617569

File tree

1 file changed

+1
-1
lines changed
  • src/algorithms/string/levenshtein-distance

1 file changed

+1
-1
lines changed

‎src/algorithms/string/levenshtein-distance/README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -50,7 +50,7 @@ to assist natural language translation based on translation memory.
5050

5151
Let’s take a simple example of finding minimum edit distance between
5252
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
53+
here is `1` operation, which is replacing `E` with `Y`. But
5454
let’s try to formalize it in a form of the algorithm in order to be able to
5555
do more complex examples like transforming `Saturday` into `Sunday`.
5656

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /