| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| iddq (0) - 1 freq idda (1) - 89 freq iid (2) - 1 freq dd (2) - 1 freq zdd (2) - 1 freq inda (2) - 1 freq gdd (2) - 2 freq kidds (2) - 2 freq gdq (2) - 1 freq riddi (2) - 1 freq ridd (2) - 9 freq i'd (2) - 413 freq iicq (2) - 1 freq dq (2) - 7 freq isd (2) - 1 freq indy (2) - 57 freq i'da (2) - 1 freq adda (2) - 4 freq id'd (2) - 1 freq eddy (2) - 1 freq hdq (2) - 1 freq widds (2) - 35 freq ddd (2) - 13 freq ids (2) - 63 freq inde (2) - 4 freq |
iddq (0) - 1 freq idda (2) - 89 freq adds (3) - 22 freq eddi (3) - 1 freq mdduq (3) - 1 freq ydgq (3) - 1 freq idder (3) - 286 freq ddd (3) - 13 freq add (3) - 133 freq iddir (3) - 11 freq dqq (3) - 1 freq diddy (3) - 5 freq odds (3) - 89 freq addi (3) - 3 freq ddg (3) - 1 freq dixdq (3) - 3 freq hdq (3) - 1 freq addy (3) - 6 freq ldq (3) - 1 freq odd (3) - 134 freq gdq (3) - 1 freq adda (3) - 4 freq eddy (3) - 1 freq dd (3) - 1 freq dq (3) - 7 freq |
SoundEx code - I320 'it's - 303 freq it's - 5354 freq its - 3299 freq ideas - 145 freq idaias - 6 freq itch - 5 freq itchy - 36 freq 'its - 8 freq idees - 3 freq id's - 58 freq ids - 63 freq 'ides - 1 freq ida's - 1 freq i'tuck - 5 freq itis - 1 freq i'dugs - 2 freq i'days - 2 freq i'dough - 1 freq i'deck - 1 freq i'dock - 1 freq iydeas - 1 freq ithaca - 2 freq €˜itchy - 1 freq i'ts - 2 freq €œits - 12 freq €˜its - 3 freq itwes - 1 freq €œit's - 5 freq idiocy - 2 freq €˜it's - 1 freq itz - 2 freq its' - 2 freq itzjo - 1 freq itÂ’s - 256 freq idjz - 1 freq iddq - 1 freq iatj - 1 freq idk - 1 freq idzg - 1 freq itsa - 1 freq itc - 1 freq  'itÂ’s - 1 freq ‘itÂ’s - 1 freq it's' - 2 freq idiocy' - 1 freq idase - 1 freq |
MetaPhone code - ITK i'tuck - 5 freq i'deck - 1 freq i'dock - 1 freq iddq - 1 freq idk - 1 freq itc - 1 freq |
IDDQ |
| Time to execute Levenshtein function - 0.198475 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.347438 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.027397 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.036717 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.000834 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. |