levenshtein-distance

I implemented the Levenshtein algorithm in Java and am now getting the corrections made by the algorithm, a.k.a. the cost. This does help a little but not much since I want the results as a percentage. So I want to know how to calculate those similarity points. I would also like to know how you people do it and why. Ralph The Levenshtein distance between two strings is defined as the minimum number of edits needed to transform one string into the other, with the allowable edit operations being insertion, deletion, or substitution of a single character. (Wikipedia) So a Levenshtein distance of

I have on PHP array, for example: $arr = array("hello", "try", "hel", "hey hello"); Now I want to do rearrange of the array which will be based on the most nearly close words between the array and my $search var. How can I do that? This could be a quick solution by using http://php.net/manual/en/function.similar-text.php : This calculates the similarity between two strings as described in Programming Classics: Implementing the World's Best Algorithms by Oliver (ISBN 0-131-00413-1). Note that this implementation does not use a stack as in Oliver's pseudo code, but recursive calls which may or

I would like to compare two strings and get some score how much these look alike. For example "The sentence is almost similar" and "The sentence is similar" . I'm not familiar with existing methods in Java, but for PHP I know the levenshtein function . Are there better methods in Java? Joey The Levensthein distance is a measure for how similar strings are. Or, more precisely, how many alterations have to be made that they are the same. The algorithm is available in pseudo-code on Wikipedia. Converting that to Java shouldn't be much of a problem, but it's not built-in into the base class

I have a set (2k - 4k) of small strings (3-6 characters) and I want to cluster them. Since I use strings, previous answers on How does clustering (especially String clustering) work? , informed me that Levenshtein distance is good to be used as a distance function for strings. Also, since I do not know in advance the number of clusters, hierarchical clustering is the way to go and not k-means. Although I get the problem in its abstract form, I do not know what is the easie way to actually do it. For example, is MATLAB or R a better choice for the actual implementation of hierarchical