This repository was archived by the owner on May 1, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 129
Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
License
aceakash/string-similarity
ErrorLooks like something went wrong!
About
Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
Topics
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published