jLevenshtein Compare your strings with this Java application
Download

jLevenshtein Ranking & Summary

jLevenshtein Tags

string compare comparison compare string compare sequence

jLevenshtein Description

jLevenshtein was developed as a Java project that is able to provide several computations that are related to the edit distance of strings. Other than the basic Levenshtein, this algorithm can rearange words when comparing. The class can also provide details of how words could be transformed. Main features: compares two strings compares two sequences of words (word to word, with respect to the position in the sequence) offers string comparison objects for long term storage and precomputation gives detailed information on the transformation process allows comparison of XSAMPA sequences allows usage of individual phonetic mappings offers many user flags that alter the transformation process offers individual setting of transformation costs

jLevenshtein Related Software