This is an automated email from the ASF dual-hosted git repository.
paulk pushed a commit to branch asf-site
in repository https://gitbox.apache.org/repos/asf/groovy-website.git
The following commit(s) were added to refs/heads/asf-site by this push:
new 0d0c4c1 add JaroWinkler description
0d0c4c1 is described below
commit 0d0c4c154af748f2bd88bdde39de24ce10fcd2c9
Author: Paul King <[email protected]>
AuthorDate: Sun Feb 2 09:36:15 2025 +1000
add JaroWinkler description
---
site/src/site/blog/groovy-text-similarity.adoc | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/site/src/site/blog/groovy-text-similarity.adoc
b/site/src/site/blog/groovy-text-similarity.adoc
index c0bf459..ac79424 100644
--- a/site/src/site/blog/groovy-text-similarity.adoc
+++ b/site/src/site/blog/groovy-text-similarity.adoc
@@ -128,7 +128,7 @@ Longest commons subsequence is the algorithm behind the
popular `diff` tool.
Groovy has in fact a built-in example of a variant of the Levenshtein measure
it uses for error reporting. Groovy uses a variant known as the
Damerau-Levenshtein distance.
-This variant counts transposing two characters within the original word as one
"edit".
+This variant counts transposing two adjacent characters within the original
word as one "edit".
The Levenshtein distance of `fish` and ifsh` is 2.
The Damerau-Levenshtein distance of `fish` and ifsh` is 1.
