| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| chocolatiers (0) - 1 freq chocolates (2) - 17 freq chocolate's (2) - 1 freq chocolatey (3) - 1 freq chocolately (3) - 1 freq chocolate (3) - 226 freq chocolat (4) - 1 freq shocolate (4) - 2 freq coortiers (4) - 3 freq 'chocolate' (4) - 1 freq proclaimers (5) - 5 freq cheaters (5) - 1 freq compluthers (5) - 1 freq coulters (5) - 1 freq shoolders (5) - 6 freq circulates (5) - 1 freq shoothers (5) - 26 freq sclaters (5) - 4 freq calculations (5) - 1 freq choacalate (5) - 1 freq clootie's (5) - 1 freq cooties (5) - 1 freq chocolate-box (5) - 1 freq polaties (5) - 1 freq coonters (5) - 1 freq |
chocolatiers (0) - 1 freq chocolate's (3) - 1 freq chocolates (3) - 17 freq chocolate (5) - 226 freq chocolatey (5) - 1 freq chocolately (5) - 1 freq calculators (6) - 2 freq chocolat (6) - 1 freq sclaters (7) - 4 freq calculations (7) - 1 freq choacalate (7) - 1 freq chevaliers (7) - 1 freq chollers (7) - 1 freq circulates (7) - 1 freq cheaters (7) - 1 freq coulters (7) - 1 freq 'chocolate' (7) - 1 freq calculaetors (7) - 1 freq shocolate (7) - 2 freq coortiers (7) - 3 freq claturs (8) - 1 freq choctaws (8) - 1 freq hulters (8) - 2 freq cheeters (8) - 1 freq chuckers (8) - 1 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 - XKLTRS chocolatiers - 1 freq |
CHOCOLATIERS |
| Time to execute Levenshtein function - 0.270437 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.553660 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.032131 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.076259 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.001073 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. |