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
All algorithms are ranging over the bytes of strings, which leads to different results for multibyte and singlebyte UTF-8 characters.
Example using WagnerFischer(a, b, 1, 1, 1):
"szellemhaj" - "szellemhajo" distance is 1 "szellemhaj" - "szellemhajó" distance is 2
Ranging over runes of strings would result 1,1 distance. It's is slower but more accurate for non-ascii characters.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
All algorithms are ranging over the bytes of strings, which leads to different results for multibyte and singlebyte UTF-8 characters.
Example using WagnerFischer(a, b, 1, 1, 1):
"szellemhaj" - "szellemhajo" distance is 1
"szellemhaj" - "szellemhajó" distance is 2
Ranging over runes of strings would result 1,1 distance.
It's is slower but more accurate for non-ascii characters.
The text was updated successfully, but these errors were encountered: