From e859329c271e8b1b41e7442efbabf94dd57c2081 Mon Sep 17 00:00:00 2001 From: matthieugomez Date: Tue, 20 Aug 2019 13:22:49 -0400 Subject: [PATCH] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 4716e08..1d9e3ec 100644 --- a/README.md +++ b/README.md @@ -116,7 +116,7 @@ find_all("New York", ["NewYork", "Newark", "San Francisco"], Levenshtein(); min_ #> "NewYork" ``` -These functions are optimized for `Levenshtein` and `DamerauLevenshtein` distances (as well as their modifications via `Partial`, `TokenSort`, `TokenSet`, or `TokenMax`) +While these functions are defined for any distance, they are particularly optimized for `Levenshtein` and `DamerauLevenshtein` distances (as well as their modifications via `Partial`, `TokenSort`, `TokenSet`, or `TokenMax`) ## Which distance should I use?