| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| idders (0) - 40 freq iddirs (1) - 2 freq midders (1) - 8 freq adders (1) - 1 freq idder's (1) - 1 freq idder (1) - 286 freq udders (1) - 4 freq widders (1) - 2 freq idlers (1) - 1 freq idder' (1) - 1 freq edders (1) - 1 freq edder (2) - 21 freq sinders (2) - 4 freq fiddlers (2) - 6 freq anders (2) - 1 freq tidder (2) - 50 freq widder (2) - 4 freq iddir (2) - 11 freq midder's (2) - 1 freq fadders (2) - 3 freq ladders (2) - 7 freq immers (2) - 2 freq waders (2) - 4 freq odgers (2) - 1 freq glidders (2) - 2 freq |
idders (0) - 40 freq udders (1) - 4 freq edders (1) - 1 freq adders (1) - 1 freq iddirs (1) - 2 freq idder' (2) - 1 freq widders (2) - 2 freq idlers (2) - 1 freq midders (2) - 8 freq idder's (2) - 1 freq idder (2) - 286 freq ryders (3) - 1 freq fedders (3) - 21 freq adder (3) - 4 freq ruders (3) - 1 freq yirders (3) - 2 freq aidder (3) - 1 freq riders (3) - 8 freq ledders (3) - 2 freq udder (3) - 1 freq budders (3) - 2 freq gadders (3) - 4 freq tedders (3) - 1 freq odder (3) - 1 freq widdirs (3) - 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 - ITRS idders - 40 freq idder's - 1 freq iddir'as - 1 freq i'tears - 1 freq iddirs - 2 freq |
IDDERS |
| Time to execute Levenshtein function - 0.227542 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.413728 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.027391 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.036785 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.000865 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. |