Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
-
Updated
May 1, 2023 - JavaScript
Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
A routine for assigning spam probability to a given set of text messages by comparing each text to the rest of the corpus, checking the frequency of spam and non-spam messages in the corpus. The probability is ranged from 0 to 1, where 0 is no spam and 1 is certain spam.
Finds degree of similarity between two strings, based on Dice's Coefficient and Levenshtein Distance.
lightweight npm package to calculate string similarity
Similarity Clustering of HashTags
Add a description, image, and links to the dice-coefficient topic page so that developers can more easily learn about it.
To associate your repository with the dice-coefficient topic, visit your repo's landing page and select "manage topics."