You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on May 1, 2023. It is now read-only.
@oom- Different algorithms will have different trade-offs. This library implements the Sørensen–Dice_coefficient as the similarity score. I would encourage you to try out other string comparison algorithms to see which one best fits your needs. This might be a good starting point.
I just tryed the example:
=> 80% for a 1 letter change.
=> 60% for 2 letter switching
Ok I get it but now I just try with another word that contains 1 letter less (5 char length vs 6)
=> 57% for a 1 letter change (just lost 23%)
=> 25% for a 1 letter change (just lost 35%)
Seems to me that less the string is long more the matching is severe.
Is there a way to make it "average" undepending of the length ?
The text was updated successfully, but these errors were encountered: