Replies: 1 comment 1 reply
-
Beta Was this translation helpful? Give feedback.
1 reply
-
|
Excellent! |
Beta Was this translation helpful? Give feedback.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
V's string module has the Levenshtein distance algorithm (here). In many cases where people would be looking at Levenshtein, they may also want to consider Jaro and Jaro-Winkler.
V already has examples of both at Rosetta Code, Jaro and Jaro-Winkler.
Beta Was this translation helpful? Give feedback.
All reactions