We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
The current method is a handmade algorithm which is not very efficient. A Levenshtein Distance based algo will be good to have.
Levenshtein Distance
The text was updated successfully, but these errors were encountered:
Fun concept for a project. Just pulled and working on this now.
Sorry, something went wrong.
No branches or pull requests
The current method is a handmade algorithm which is not very efficient. A
Levenshtein Distance
based algo will be good to have.The text was updated successfully, but these errors were encountered: