An application of Levenshtein algorithm in vocabulary learning

In this paper it is presented a new application of Levenshtein distance algorithm, for the selection of choices in a vocabulary quiz. Levenshtein distance is a measure for the similarity of two strings. In order to make the quiz more difficult, the choices for the correct word are selected using the calculated degree of similarity with the correct word. We developed a Java graphical application that illustrates this new way of choices selection. The vocabulary words examples are developed for the English language, but they can be easily modified for other foreign languages.