I am working on address book synchronization algorithm. I want to reuse some code if someone exists, But no one can get it yet.
Does anyone know about an algorithm that will tell me in the number / float / number how many names are equal to i Levenstein distance is not good in this approach, as the name and our additional books name All classes of matches match.
John Smith must match Jonathan Smith , Johnny Smith
Just take a look at the Winkler algorithm, it's good for names
If you have The first is the name, the last name is the problems, so you can sort them just to ensure that Smith John is saved as John Smith