logo GenericLevenshtein

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<T> 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.

fresh index:
last release: 4 years ago, first release: 4 years ago
packaging: jar
get this artifact from: central
see this artifact on: search.maven.org

How much is this artifact used as a dependency in other Maven artifacts in Central repository and GitHub:
How many Android projects use it:
How is this artifact used:

© Jiri Pinkas 2015 - 2017. All rights reserved. Admin login To submit bugs / feature requests please use this github page
related: JavaVids | Top Java Blogs | Java školení | 4npm - npm search | monitored using: sitemonitoring
Apache and Apache Maven are trademarks of the Apache Software Foundation. The Central Repository is a service mark of Sonatype, Inc.