Javadoc: Fix format nit

garydgregory · garydgregory · commit 47bb0bfafbd1 · 2024-11-11T09:29:42.000-05:00
diff --git 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 static LevenshteinDistance getDefaultInstance() {
      *
      * <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>

Original file line number	Diff line number	Diff line change
`@@ -52,7 +52,7 @@ public static LevenshteinDistance getDefaultInstance() {`
`52`	`52`	`*`
`53`	`53`	`* <p>`
`54`	`54`	`* This implementation follows from Algorithms on Strings, Trees and Sequences by Dan Gusfield and Chas Emerick's implementation of the Levenshtein distance`
`55`		`- * algorithm from <a href="http://www.merriampark.com/ld.htm" >http://www.merriampark.com/ld.htm</a>`
	`55`	`+ * algorithm from <a href="http://www.merriampark.com/ld.htm">http://www.merriampark.com/ld.htm</a>`
`56`	`56`	`* </p>`
`57`	`57`	`*`
`58`	`58`	`* <pre>`