This is an automated email from the ASF dual-hosted git repository.
ggregory pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/commons-text.git
The following commit(s) were added to refs/heads/master by this push:
new a55f0085 Remove link to now malicious site
a55f0085 is described below
commit a55f00858246e19a4dfd3fb0ddba0700b04dc978
Author: Gary Gregory <[email protected]>
AuthorDate: Wed Mar 11 21:52:45 2026 -0400
Remove link to now malicious site
---
.../similarity/LevenshteinDetailedDistance.java | 29 +---------------------
.../text/similarity/LevenshteinDistance.java | 17 +------------
2 files changed, 2 insertions(+), 44 deletions(-)
diff --git
a/src/main/java/org/apache/commons/text/similarity/LevenshteinDetailedDistance.java
b/src/main/java/org/apache/commons/text/similarity/LevenshteinDetailedDistance.java
index 4b4740ea..8ea04009 100644
---
a/src/main/java/org/apache/commons/text/similarity/LevenshteinDetailedDistance.java
+++
b/src/main/java/org/apache/commons/text/similarity/LevenshteinDetailedDistance.java
@@ -132,7 +132,7 @@ public class LevenshteinDetailedDistance implements
EditDistance<LevenshteinResu
*
* <p>
* This implementation follows from Algorithms on Strings, Trees and
Sequences by Dan Gusfield and Chas Emerick's implementation of the Levenshtein
distance
- * algorithm from <a href="https://www.merriampark.com/ld.htm";
>http://www.merriampark.com/ld.htm</a>
+ * algorithm.
* </p>
*
* <pre>
@@ -271,18 +271,9 @@ public class LevenshteinDetailedDistance implements
EditDistance<LevenshteinResu
* </p>
*
* <p>
- * The previous implementation of the Levenshtein distance algorithm was
from
- * <a
href="https://www.merriampark.com/ld.htm";>http://www.merriampark.com/ld.htm</a>
- * </p>
- *
- * <p>
* 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.
* </p>
- * <p>
- * This implementation of the Levenshtein distance algorithm is from
- * <a
href="https://www.merriampark.com/ldjava.htm";>http://www.merriampark.com/ldjava.htm</a>
- * </p>
*
* <pre>
* unlimitedCompare(null, *) = Throws {@link
IllegalArgumentException}
@@ -416,18 +407,9 @@ public class LevenshteinDetailedDistance implements
EditDistance<LevenshteinResu
* </p>
*
* <p>
- * The previous implementation of the Levenshtein distance algorithm was
from
- * <a
href="https://www.merriampark.com/ld.htm";>http://www.merriampark.com/ld.htm</a>
- * </p>
- *
- * <p>
* 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.
* </p>
- * <p>
- * This implementation of the Levenshtein distance algorithm is from
- * <a
href="https://www.merriampark.com/ldjava.htm";>http://www.merriampark.com/ldjava.htm</a>
- * </p>
*
* <pre>
* distance.apply(null, *) = Throws {@link
IllegalArgumentException}
@@ -461,18 +443,9 @@ public class LevenshteinDetailedDistance implements
EditDistance<LevenshteinResu
* </p>
*
* <p>
- * The previous implementation of the Levenshtein distance algorithm was
from
- * <a
href="https://www.merriampark.com/ld.htm";>http://www.merriampark.com/ld.htm</a>
- * </p>
- *
- * <p>
* 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.
* </p>
- * <p>
- * This implementation of the Levenshtein distance algorithm is from
- * <a
href="https://www.merriampark.com/ldjava.htm";>http://www.merriampark.com/ldjava.htm</a>
- * </p>
*
* <pre>
* 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 d8b9e121..479b3fad 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 class LevenshteinDistance implements
EditDistance<Integer> {
*
* <p>
* This implementation follows from Algorithms on Strings, Trees and
Sequences by Dan Gusfield and Chas Emerick's implementation of the Levenshtein
distance
- * algorithm from <a
href="https://www.merriampark.com/ld.htm";>http://www.merriampark.com/ld.htm</a>
+ * algorithm.
* </p>
*
* <pre>
@@ -204,12 +204,6 @@ public class LevenshteinDistance implements
EditDistance<Integer> {
* </p>
*
* <p>
- * The previous implementation of the Levenshtein distance algorithm was
from
- * <a
href="https://web.archive.org/web/20120526085419/http://www.merriampark.com/ldjava.htm";>
- *
https://web.archive.org/web/20120526085419/http://www.merriampark.com/ldjava.htm</a>
- * </p>
- *
- * <p>
* This implementation only need one single-dimensional arrays of length
s.length() + 1
* </p>
*
@@ -320,18 +314,9 @@ public class LevenshteinDistance implements
EditDistance<Integer> {
* </p>
*
* <p>
- * The previous implementation of the Levenshtein distance algorithm was
from
- * <a
href="https://www.merriampark.com/ld.htm";>http://www.merriampark.com/ld.htm</a>
- * </p>
- *
- * <p>
* 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.
* </p>
- * <p>
- * This implementation of the Levenshtein distance algorithm is from
- * <a
href="https://www.merriampark.com/ldjava.htm";>http://www.merriampark.com/ldjava.htm</a>
- * </p>
*
* <pre>
* distance.apply(null, *) = Throws {@link
IllegalArgumentException}
