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.

Sign up for GitHub

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

Jump to bottom

Incorporate the levenshtein distance algorithm to help find the best matching unit from a provided character sequence. #21

Open

isaaclafrance opened this issue Sep 10, 2017 · 1 comment

Assignees

Owner

isaaclafrance commented Sep 10, 2017

No description provided.

isaaclafrance self-assigned this

Owner Author

isaaclafrance commented Feb 16, 2018

Investigate also potentially using Soundex or its more optimized variants, i.e. Metaphone.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment