-
Notifications
You must be signed in to change notification settings - Fork 18
Open
Description
I would like to suggest a possibility to compare persons names by using the Levenshtein Distance algorithm. See http://en.wikipedia.org/wiki/Levenshtein_distance
My genealogical 'research' is primarily related to Sweden. Very often persons have their name spelled a little different in various sourcedocuments.
Example: Kristina - Cristina - Christina - Chrestina - Christine
Using this suggested algorithm and allowing some (fairly small) maximum distance would be most helpful when trying to find duplicate persons in my database.
Reactions are currently unavailable
Metadata
Metadata
Assignees
Labels
No labels