Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I am working on address book synchronization algorithm. I would like to reuse some code if there exists, but couldn’t find one yet.
Does someone know about an algorithm that will tell me in numbers/float/procent how much two names are identical. Levenstein distance is not good in this approach, as names and our adddress books are matching the begining of each of the name sections.
John Smith should match
Smith Jon, Jonathan Smith, Johnny Smith
Have a look at the Jaro Winkler algorithm too. It is good for names.
http://en.wikipedia.org/wiki/Jaro%E2%80%93Winkler_distance
If you have first name, last name issues then you could just sort them to make sure Smith John is saved as John Smith