Answer by Donatello for What is the best algorithm for matching two string...
Did you take a look at the levenshtein distance ?int org.apache.commons.lang.StringUtils.getLevenshteinDistance(String s, String t)Find the Levenshtein distance between two Strings.This is the number...
View ArticleAnswer by applecrusher for What is the best algorithm for matching two string...
Interesting. Have you thought about a radix sort?http://en.wikipedia.org/wiki/Radix_sortThe concept behind the radix sort is that it is a non-comparative integer sorting algorithm that sorts data with...
View ArticleAnswer by M.P. Korstanje for What is the best algorithm for matching two...
They're all good. They work on different properties of strings and have different matching properties. What works best for you depends on what you need.I'm using the JaccardSimilarity to match names. I...
View ArticleAnswer by Jase Pellerin for What is the best algorithm for matching two...
Each algorithm is going to focus on a similar, but slightly different aspect of the two strings. Honestly, it depends entirely on what you are trying to accomplish. You say that the algorithm needs to...
View ArticleAnswer by Mikhail for What is the best algorithm for matching two string...
You are likely need to solve a string-to-string correction problem. Levenshtein distance algorithm is implemented in many languages. Before running it I'd remove all spaces from string, because they...
View ArticleWhat is the best algorithm for matching two string containing less than 10...
I'm comparing song titles, using Latin script (although not always), my aim is an algorithm that gives a high score if the two song titles seem to be the same same title and a very low score if they...
View Article
