public static int levenshteinDistance(java.lang.CharSequence word1,
Compute the Levenshtein distance between two words.
a number representing the distance between two words.
public static java.lang.String findNearestString(java.lang.String word,
From of list of candidate words, return the candidate that is the nearest
from the given word. The nearest word is the word whose position in a dictionary
is the closest to a given word, which is different from the Levenshtein distance.
For instance, "best" and "test" are very similar (one letter differs, that gives
short Levenshtein distance), but they are not near each other ("best" has its
entry in the "B" section of the dictionary, and "test" in the "T" one).
means the word whose entry in the list
is the close
the nearest word in the wordList
public static java.lang.String findNearestString(java.lang.String code,