问题
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?
回答1:
Maybe you can try Levenshtein distance
回答2:
Soundex
回答3:
You might find the results the MITRE name matching challenge interesting.
http://www.mitre.org/work/challenge/
来源：https://stackoverflow.com/questions/7946192/good-algorithm-for-matching-names