paul_b wrote:Err ... that is the link I gave you!
Thanks for that. I did some searching on the net and found this which people might find interesting and useful. It also has the java implementation for it too.
Initially the alogrithm seemed perfect : ) Then I started to put in strange test string in(which are real user inputs) and it started to fail.Then you need to provide a metric.
My string can contain spaces as well.So what?
Maybe if I split the strings up and recursively go through the combination, to end up with best fit would be idea...
paul_b wrote:That depends on what you mean by "are". If you are asking whether somebody has designed any algorithm which suits your undocumented needs in a better way than the Levenshtein algorithm, then probably not. On the other hand I don't know what your needs are so I could be wrong.
Just coming back to this and wondering if there are any better algorithms that would be more suited to my needs?