| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| casualties (0) - 5 freq casuities (2) - 1 freq casualty (3) - 13 freq cruelties (3) - 1 freq casualness (3) - 1 freq auldies (4) - 1 freq paulmies (4) - 1 freq saxties (4) - 4 freq shanties (4) - 1 freq calfies (4) - 4 freq cavities (4) - 1 freq multies (4) - 1 freq caunopies (4) - 1 freq calvaries (4) - 1 freq cauldnes (4) - 1 freq sallies (4) - 3 freq penalties (4) - 11 freq smarties (4) - 6 freq cassies (4) - 6 freq chanties (4) - 1 freq aunties (4) - 16 freq casumptious (4) - 1 freq casually (4) - 16 freq sullies (4) - 3 freq akuallie (4) - 1 freq |
casualties (0) - 5 freq casuities (3) - 1 freq cruelties (4) - 1 freq casualty (4) - 13 freq casenotes (5) - 1 freq costies (5) - 8 freq casualness (5) - 1 freq castiel (6) - 1 freq visualises (6) - 1 freq capsules (6) - 1 freq loyalties (6) - 3 freq banalities (6) - 1 freq casual (6) - 22 freq safties (6) - 6 freq sunties (6) - 2 freq craalies (6) - 3 freq chaunties (6) - 1 freq qualities (6) - 9 freq castellis (6) - 1 freq cairties (6) - 1 freq crafties (6) - 1 freq saltires (6) - 6 freq insults (6) - 19 freq cushats (6) - 1 freq slates (6) - 53 freq |
SoundEx code - C243 chuckled - 12 freq chocolate - 226 freq chocolatey - 1 freq casualty - 13 freq cockled - 2 freq coogled - 1 freq cycled - 4 freq casualties - 5 freq chocolate-box - 1 freq chocolates - 17 freq chocolately - 1 freq chocolate-makkin - 1 freq chocolate-coatit - 3 freq chocolate-mixin - 2 freq chocolate's - 1 freq chocolatiers - 1 freq 'chocolate' - 1 freq cackled - 2 freq cackelt - 1 freq chiselled - 2 freq chocolat - 1 freq choklate - 1 freq coagulate - 1 freq cockslut - 2 freq cooclayton - 1 freq choacalate - 1 freq |
MetaPhone code - KSLTS casualties - 5 freq |
CASUALTIES |
| Time to execute Levenshtein function - 0.201880 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.383062 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.027471 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.037182 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000946 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |