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
Is there any way to match on normalized string distance?
Ie for osa, lv, and dl, dividing by the nchar of the longest word, or for lcs the additive lengths of both?
1 letter off of a 4 letter string is quite different than 1 letter off of a 20 character string.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Is there any way to match on normalized string distance?
Ie for osa, lv, and dl, dividing by the nchar of the longest word, or for lcs the additive lengths of both?
1 letter off of a 4 letter string is quite different than 1 letter off of a 20 character string.
The text was updated successfully, but these errors were encountered: