Skip to content

Commit 4f35559

Browse files
committed
No need for Latin
1 parent 57f1978 commit 4f35559

File tree

2 files changed

+4
-2
lines changed

2 files changed

+4
-2
lines changed

src/main/java/org/apache/commons/text/similarity/LevenshteinDetailedDistance.java

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -168,7 +168,8 @@ private static <E> LevenshteinResults limitedCompare(SimilarityInput<E> left, Si
168168
* of the cost table. It is also possible to use this to compute the unbounded Levenshtein distance by starting the threshold at 1 and doubling each
169169
* time until the distance is found; this is O(dm), where d is the distance.
170170
*
171-
* One subtlety comes from needing to ignore entries on the border of our stripe eg. p[] = |#|#|#|* d[] = *|#|#|#| We must ignore the entry to the left
171+
* One subtlety comes from needing to ignore entries on the border of our stripe, for example,
172+
* p[] = |#|#|#|* d[] = *|#|#|#| We must ignore the entry to the left
172173
* of the leftmost member We must ignore the entry above the rightmost member
173174
*
174175
* Another subtlety comes from our stripe running off the matrix if the strings aren't of the same size. Since string s is always swapped to be the

src/main/java/org/apache/commons/text/similarity/LevenshteinDistance.java

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -91,7 +91,8 @@ private static <E> int limitedCompare(SimilarityInput<E> left, SimilarityInput<E
9191
* of the cost table. It is also possible to use this to compute the unbounded Levenshtein distance by starting the threshold at 1 and doubling each
9292
* time until the distance is found; this is O(dm), where d is the distance.
9393
*
94-
* One subtlety comes from needing to ignore entries on the border of our stripe eg. p[] = |#|#|#|* d[] = *|#|#|#| We must ignore the entry to the left
94+
* One subtlety comes from needing to ignore entries on the border of our stripe, for example,
95+
* p[] = |#|#|#|* d[] = *|#|#|#| We must ignore the entry to the left
9596
* of the leftmost member We must ignore the entry above the rightmost member
9697
*
9798
* Another subtlety comes from our stripe running off the matrix if the strings aren't of the same size. Since string s is always swapped to be the

0 commit comments

Comments
 (0)