Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Levenshtein name comparisons #7

Open
BrJohan opened this issue Mar 18, 2014 · 1 comment
Open

Levenshtein name comparisons #7

BrJohan opened this issue Mar 18, 2014 · 1 comment

Comments

@BrJohan
Copy link

BrJohan commented Mar 18, 2014

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.

@MinchinWeb
Copy link

I think you might be better off with Soundex or something similar. Soundex assigns a value to a word, such that words that are pronounced the same as assigned the same value.

The fuzzy library ( https://pypi.python.org/pypi/Fuzzy ) might be a good place to start.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants