All Downloads are FREE. Search and download functionalities are using the official Maven repository.

Download oz-generic-levenshtein JAR file with all dependencies

Search JAR files by class name

oz-generic-levenshtein from group de.linuxusers.levenshtein (version 0.4.0)

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.

Group: de.linuxusers.levenshtein Artifact: oz-generic-levenshtein
Show documentation Show source 
 

0 downloads
Artifact oz-generic-levenshtein
Group de.linuxusers.levenshtein
Version 0.4.0
Last update 11. September 2012
Organization not specified
URL http://niels.drni.de/s9y/pages/generic-levenshtein.html
License Apache License 2.0
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!



Page 1 from 1 (items total 1)


© 2015 - 2024 Weber Informatics LLC | Privacy Policy