| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| casualties (0) - 5 freq cruelties (3) - 1 freq casualty (3) - 13 freq casualness (3) - 1 freq facultie (4) - 1 freq casenotes (4) - 1 freq cairties (4) - 1 freq saltires (4) - 6 freq casually (4) - 14 freq backarties (4) - 3 freq shelties (4) - 4 freq crafties (4) - 1 freq akuallie (4) - 1 freq safties (4) - 6 freq sunties (4) - 2 freq paulmies (4) - 1 freq casumptious (4) - 1 freq capsules (4) - 1 freq caunles (4) - 13 freq chaunties (4) - 1 freq castiel (4) - 1 freq craalies (4) - 3 freq warranties (4) - 2 freq cavities (4) - 1 freq castellis (4) - 1 freq |
casualties (0) - 5 freq casualty (4) - 13 freq cruelties (4) - 1 freq costies (5) - 8 freq casenotes (5) - 1 freq casualness (5) - 1 freq cutties (6) - 3 freq cuties (6) - 2 freq penalties (6) - 11 freq multies (6) - 1 freq nasties (6) - 1 freq chanties (6) - 1 freq casual (6) - 22 freq causies (6) - 6 freq calfies (6) - 4 freq saxties (6) - 4 freq catties (6) - 3 freq royalties (6) - 2 freq castles (6) - 26 freq assaults (6) - 1 freq consulates (6) - 1 freq saalts (6) - 2 freq salts (6) - 1 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 casualties - 5 freq chocolate-box - 1 freq chocolates - 15 freq chocolately - 1 freq chocolate-makkin - 1 freq chocolate-coatit - 3 freq chocolate-mixin - 2 freq chocolate's - 1 freq cycled - 3 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.208401 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.361801 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.028546 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.037720 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.000818 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. |