List of utility methods to do String Levenshtein Distance Get
int | computeLevenshteinDistance(CharSequence str1, CharSequence str2) compute Levenshtein Distance int commonPrefixLength = findCommonPrefixLength(str1, str2); if (commonPrefixLength == str1.length() && commonPrefixLength == str2.length()) { return 0; int commonSuffixLength = findCommonSuffixLength(str1, str2, commonPrefixLength); str1 = str1.subSequence(commonPrefixLength, str1.length() ... |