Sorensen–Dice coefficient: Difference between revisions
tidy up task description
m (→{{header|Wren}}: Changed to Wren S/H) |
(tidy up task description) |
||
Line 1:
{{task}}
The [[wp:Sørensen–Dice coefficient|Sørensen–Dice coefficient]], also known as the Sørensen–Dice index (or sdi, or sometimes by one of the individual names: sorensen or dice
The original use was in botany
[[Levenshtein distance|Levenshtein]]
Sørensen–Dice is more useful for 'fuzzy' matching partial
There are several different methods to tokenize objects for Sørensen–Dice comparisons. The most typical tokenizing scheme for text is to break the words up into bi-grams: groups of two consecutive letters.
Line 22:
Sørensen–Dice measures the similarity of two groups by dividing twice the intersection token count by the total token count of both groups
The Sørensen–Dice coefficient is thus a ratio between 0.0 and 1.0 giving the "percent similarity" between the two populations
▲ SDI = 2 × (A ∩ B) / (A ⊎ B)
▲The Sørensen–Dice coefficient is a "percent similarity" between the two populations between 0.0 and 1.0.
▲SDI ''can'' by used for spellchecking, but it's not really good at it, especially for short words. Where it really shines is for fuzzy matching of short phrases like book or movie titles. It may not return exactly what you are looking for, but often gets remarkably close with some pretty poor inputs.
Line 41 ⟶ 39:
How you get the task names is peripheral to the task. You can [[:Category:Programming_Tasks|web-scrape]] them or [[Sorensen–Dice coefficient/Tasks|download them to a file]], whatever.
If there is a built-in or easily, freely available library implementation for Sørensen–Dice coefficient calculations, it is acceptable to use that with a pointer to where it may be obtained.
| |||