You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@commons.apache.org by gg...@apache.org on 2024/11/11 14:30:06 UTC
(commons-text) branch master updated: Javadoc: Fix format nit
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 47bb0bfa Javadoc: Fix format nit
new f5144882 Merge branch 'master' of https://gitbox.apache.org/repos/asf/commons-text.git
47bb0bfa is described below
commit 47bb0bfafbd199ef80b897f03d626f7913c408bd
Author: Gary Gregory <ga...@gmail.com>
AuthorDate: Mon Nov 11 09:29:42 2024 -0500
Javadoc: Fix format nit
---
.../java/org/apache/commons/text/similarity/LevenshteinDistance.java | 2 +-
1 file changed, 1 insertion(+), 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 0e69f8c7..34d65d13 100644
--- a/src/main/java/org/apache/commons/text/similarity/LevenshteinDistance.java
+++ b/src/main/java/org/apache/commons/text/similarity/LevenshteinDistance.java
@@ -52,7 +52,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="http://www.merriampark.com/ld.htm" >http://www.merriampark.com/ld.htm</a>
+ * algorithm from <a href="http://www.merriampark.com/ld.htm">http://www.merriampark.com/ld.htm</a>
* </p>
*
* <pre>