| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yummy (0) - 2 freq hummy (1) - 1 freq dummy (1) - 27 freq rummy (1) - 1 freq mummy (1) - 12 freq nyummy (1) - 1 freq gummy (1) - 6 freq tummy (1) - 4 freq limmy (2) - 2 freq lumpy (2) - 4 freq plummy (2) - 2 freq bumpy (2) - 1 freq humfy (2) - 1 freq tommy (2) - 100 freq yum (2) - 22 freq lumms (2) - 1 freq rummys (2) - 1 freq tammy (2) - 48 freq yums (2) - 3 freq cammy (2) - 10 freq nummi (2) - 3 freq dumfy (2) - 3 freq ammy (2) - 4 freq sammy (2) - 44 freq hummly (2) - 1 freq |
yummy (0) - 2 freq tummy (2) - 4 freq ymm (2) - 1 freq ammy (2) - 4 freq nyummy (2) - 1 freq gummy (2) - 6 freq dummy (2) - 27 freq hummy (2) - 1 freq mummy (2) - 12 freq rummy (2) - 1 freq simmy (3) - 1 freq mommy (3) - 2 freq summ (3) - 1 freq mumzy (3) - 1 freq hammy (3) - 7 freq mammy (3) - 198 freq gammy (3) - 8 freq jimmy (3) - 136 freq amm (3) - 1 freq mma (3) - 3 freq mm (3) - 18 freq mum (3) - 179 freq omm (3) - 1 freq emma (3) - 42 freq numm (3) - 1 freq |
SoundEx code - Y500 yin - 3088 freq yon - 1555 freq yuan - 8 freq 'yon - 14 freq 'yin - 10 freq yinee - 5 freq yun - 140 freq yn - 6 freq yawin - 1 freq yawn - 12 freq yin' - 5 freq yon' - 2 freq yoam - 5 freq yome - 2 freq yim - 1 freq ym - 2 freq yoonne - 1 freq yan - 1 freq yaain - 1 freq yum - 22 freq yam - 2 freq yn - 1 freq y'm - 1 freq yaan - 8 freq 'yin' - 2 freq yone - 7 freq yon - 5 freq Ðyn - 1 freq yin - 2 freq yom - 1 freq yin - 4 freq yon - 2 freq yüen - 1 freq yon - 1 freq yum - 1 freq yon - 1 freq yin - 2 freq 'yon' - 1 freq yona - 12 freq yoon - 6 freq ymm - 1 freq yyhn - 1 freq yynno - 1 freq yhn - 2 freq ynu - 9 freq yummy - 2 freq yin - 1 freq yoeim - 1 freq 'yum' - 1 freq |
MetaPhone code - YM yoam - 5 freq yome - 2 freq yim - 1 freq yum - 22 freq yam - 2 freq yom - 1 freq yum - 1 freq yummy - 2 freq yoeim - 1 freq 'yum' - 1 freq |
YUMMY |
| Time to execute Levenshtein function - 0.290464 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.576750 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.027534 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.087686 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.000840 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. |