I'm developing an app for mobile phones that syncs the contacts with the facebook account. So basically I have a list of my contacts names and a list of my facebook friends and I want to get the best possible matching between the two lists. Of course i can write something basic myself, but maybe there is a known algorithm out there that gets really good results.
What do you think?
Maybe you can try Levenshtein distance
Soundex
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With