被引用次数最多的版本是0.4.0 ，其被引用次数为1 。
YET ANOTHER IMPLEMENTATION OF LEVENSHTEIN DISTANCE GenericLevenshtein is an implementation of Minimum Edit Distance, also called Levenshtein Distance, written by Ramon Ziai and Niels Ott. This algorithm is very popular and it is often used to compute the similarity of strings. The difference in the presented implementation is that it can operate on sequences of any Java object implementing equals(Object). So no matter if you want to compare genome sequences or sequences of numbers, or just strings, here you go! Furthermore, the costs of the replace, insert, and delete operations can be customized by implementing the simple WeightCalculator
interface. In that case it is not a requirement to rely on equals(Object) as your implementation can do whatever you like it to do in oder to compare objects.