left, Si
*
*
*
- * The previous implementation of the Levenshtein distance algorithm was from
- * http://www.merriampark.com/ld.htm
- *
- *
- *
* Chas Emerick has written an implementation in Java, which avoids an OutOfMemoryError which can occur when my Java implementation is used with very large
* strings.
*
- *
- * This implementation of the Levenshtein distance algorithm is from
- * http://www.merriampark.com/ldjava.htm
- *
*
*
* unlimitedCompare(null, *) = Throws {@link IllegalArgumentException}
@@ -416,18 +407,9 @@ public LevenshteinDetailedDistance(final Integer threshold) {
*
*
*
- * The previous implementation of the Levenshtein distance algorithm was from
- * http://www.merriampark.com/ld.htm
- *
- *
- *
* Chas Emerick has written an implementation in Java, which avoids an OutOfMemoryError which can occur when my Java implementation is used with very large
* strings.
*
- *
- * This implementation of the Levenshtein distance algorithm is from
- * http://www.merriampark.com/ldjava.htm
- *
*
*
* distance.apply(null, *) = Throws {@link IllegalArgumentException}
@@ -461,18 +443,9 @@ public LevenshteinResults apply(final CharSequence left, final CharSequence righ
*
*
*
- * The previous implementation of the Levenshtein distance algorithm was from
- * http://www.merriampark.com/ld.htm
- *
- *
- *
* Chas Emerick has written an implementation in Java, which avoids an OutOfMemoryError which can occur when my Java implementation is used with very large
* strings.
*
- *
- * This implementation of the Levenshtein distance algorithm is from
- * http://www.merriampark.com/ldjava.htm
- *
*
*
* distance.apply(null, *) = Throws {@link IllegalArgumentException}
diff --git a/src/main/java/org/apache/commons/text/similarity/LevenshteinDistance.java b/src/main/java/org/apache/commons/text/similarity/LevenshteinDistance.java
index d8b9e121ae..479b3fadea 100644
--- a/src/main/java/org/apache/commons/text/similarity/LevenshteinDistance.java
+++ b/src/main/java/org/apache/commons/text/similarity/LevenshteinDistance.java
@@ -55,7 +55,7 @@ public static LevenshteinDistance getDefaultInstance() {
*
*
* This implementation follows from Algorithms on Strings, Trees and Sequences by Dan Gusfield and Chas Emerick's implementation of the Levenshtein distance
- * algorithm from http://www.merriampark.com/ld.htm
+ * algorithm.
*
*
*
@@ -204,12 +204,6 @@ private static int limitedCompare(SimilarityInput left, SimilarityInput
*
*
- * The previous implementation of the Levenshtein distance algorithm was from
- *
- * https://web.archive.org/web/20120526085419/http://www.merriampark.com/ldjava.htm
- *
- *
- *
* This implementation only need one single-dimensional arrays of length s.length() + 1
*
*
@@ -320,18 +314,9 @@ public LevenshteinDistance(final Integer threshold) {
*
*
*
- * The previous implementation of the Levenshtein distance algorithm was from
- * http://www.merriampark.com/ld.htm
- *
- *
- *
* Chas Emerick has written an implementation in Java, which avoids an OutOfMemoryError which can occur when my Java implementation is used with very large
* strings.
*
- *
- * This implementation of the Levenshtein distance algorithm is from
- * http://www.merriampark.com/ldjava.htm
- *
*
*
* distance.apply(null, *) = Throws {@link IllegalArgumentException}
From 7b76a31ba0ff432df88b7c2b1f9a52401d45120c Mon Sep 17 00:00:00 2001
From: Gary Gregory
Date: Fri, 13 Mar 2026 09:08:53 -0400
Subject: [PATCH 08/10] Bump commons.bytebuddy.version from 1.18.4 to 1.18.7.
---
pom.xml | 2 +-
src/changes/changes.xml | 1 +
2 files changed, 2 insertions(+), 1 deletion(-)
diff --git a/pom.xml b/pom.xml
index 9f9b598f9a..bc8e9a9200 100644
--- a/pom.xml
+++ b/pom.xml
@@ -48,7 +48,7 @@
https://svn.apache.org/repos/infra/websites/production/commons/content/proper/commons-text
site-content
3.20.0
- 1.18.4
+ 1.18.7
1.6
false
1.37
diff --git a/src/changes/changes.xml b/src/changes/changes.xml
index 55725d0208..a3ae6cc2bc 100644
--- a/src/changes/changes.xml
+++ b/src/changes/changes.xml
@@ -52,6 +52,7 @@ The type attribute can be add,update,fix,remove.
Bump org.apache.commons:commons-parent from 93 to 97.
Bump the level of test coverage checks.
Bump commons.bytebuddy.version from 1.18.2 to 1.18.4 #734.
+ Bump commons.bytebuddy.version from 1.18.4 to 1.18.7.
From 6e2b964ae83f0bf020b6236cb97fb85795ddfc4b Mon Sep 17 00:00:00 2001
From: Gary Gregory
Date: Thu, 19 Mar 2026 23:46:54 +0000
Subject: [PATCH 09/10] Add a reference to safe deserlialization
---
src/site/xdoc/security.xml | 7 ++++++-
1 file changed, 6 insertions(+), 1 deletion(-)
diff --git a/src/site/xdoc/security.xml b/src/site/xdoc/security.xml
index b211fd77bd..150584ad35 100644
--- a/src/site/xdoc/security.xml
+++ b/src/site/xdoc/security.xml
@@ -114,5 +114,10 @@
-