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
commit eb479f31be081cfe6a49706091549334705121a5
Author: Gary D. Gregory <garydgreg...@gmail.com>
AuthorDate: Sun Jul 20 09:29:31 2025 -0400
Javadoc
---
.../java/org/apache/commons/text/similarity/LevenshteinDistance.java | 5 ++++-
1 file changed, 4 insertions(+), 1 deletion(-)
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 01f3494c..ced47297 100644
--- a/src/main/java/org/apache/commons/text/similarity/LevenshteinDistance.java
+++ b/src/main/java/org/apache/commons/text/similarity/LevenshteinDistance.java
@@ -19,7 +19,8 @@ package org.apache.commons.text.similarity;
import java.util.Arrays;
/**
- * An algorithm for measuring the difference between two character sequences.
+ * An algorithm for measuring the difference between two character sequences
using the <a
href="https://en.wikipedia.org/wiki/Levenshtein_distance";>Levenshtein
+ * Distance</a>.
*
* <p>
* This is the number of changes needed to change one sequence into another,
where each change is a single character modification (deletion, insertion or
@@ -30,6 +31,8 @@ import java.util.Arrays;
* </p>
*
* @since 1.0
+ * @see <a
href="https://en.wikipedia.org/wiki/Levenshtein_distance";>Levenshtein
Distance</a> on Wikipedia
+ * @see <a
href="https://xlinux.nist.gov/dads/HTML/Levenshtein.html";>Levenshtein
Distance</a> on NIST
*/
public class LevenshteinDistance implements EditDistance<Integer> {
