| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ithergaits (0) - 9 freq ithergait (1) - 1 freq itherairts (2) - 1 freq iddergaits (2) - 1 freq ithergates (2) - 13 freq itherweis (3) - 1 freq itherweys (4) - 9 freq naegaits (4) - 5 freq thermals (4) - 9 freq themsails (4) - 1 freq intergity (4) - 1 freq terrains (4) - 1 freq theats (4) - 2 freq contergaits (4) - 8 freq ither-bill (4) - 1 freq ither-weys (4) - 1 freq itherhaun (4) - 1 freq therties (4) - 1 freq itherwyss (4) - 5 freq itherwise (4) - 59 freq ithers (4) - 574 freq traits (4) - 4 freq inthergrate (4) - 1 freq aitherins (4) - 1 freq utheris (4) - 1 freq |
ithergaits (0) - 9 freq ithergates (2) - 13 freq ithergait (2) - 1 freq itherairts (3) - 1 freq iddergaits (4) - 1 freq thraets (5) - 1 freq throats (5) - 8 freq threats (5) - 17 freq therties (5) - 1 freq threits (5) - 4 freq itherweis (5) - 1 freq theraboots (6) - 1 freq thirties (6) - 15 freq itherroads (6) - 1 freq nethergate (6) - 13 freq thraiks (6) - 1 freq thrait (6) - 2 freq hermits (6) - 1 freq ithers (6) - 1 freq thereabouts (6) - 1 freq etherwaves (6) - 4 freq thurties (6) - 1 freq thiriggies (6) - 1 freq thusgates (6) - 22 freq throtts (6) - 1 freq |
SoundEx code - I362 ithers - 574 freq ithergaits - 9 freq itherwise - 59 freq itherwise' - 4 freq ither's - 12 freq ithergates - 13 freq ithergait - 1 freq itricht - 1 freq ithers' - 6 freq ithers'll - 1 freq itherweese - 1 freq idderwise - 4 freq idders - 40 freq idder's - 1 freq itherwyes - 2 freq itherwyss - 5 freq iddir'as - 1 freq i'tears - 1 freq ithirs - 10 freq i'dark - 1 freq iddirs - 2 freq idderwyes - 1 freq iddergaits - 1 freq itherwyce - 3 freq iddirwise - 1 freq itherwice - 2 freq itherweys - 9 freq itherwyse - 1 freq iuterestin - 1 freq ither-weys - 1 freq itherweis - 1 freq ithers - 1 freq |
MetaPhone code - I0RKTS ithergaits - 9 freq ithergates - 13 freq |
ITHERGAITS |
| Time to execute Levenshtein function - 0.229913 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.365148 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.027348 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.037188 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.000786 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. |