| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| idzg (0) - 1 freq kdz (2) - 1 freq ida (2) - 127 freq iday (2) - 19 freq idda (2) - 89 freq iz' (2) - 2 freq idhu (2) - 1 freq ikzxg (2) - 1 freq ozg (2) - 1 freq ids (2) - 63 freq idot (2) - 1 freq ddg (2) - 1 freq kidz (2) - 1 freq ize (2) - 1 freq ndz (2) - 1 freq iyz (2) - 1 freq idjz (2) - 1 freq dzf (2) - 1 freq ijz (2) - 1 freq ig (2) - 16 freq 'dog (2) - 2 freq zg (2) - 6 freq iddq (2) - 1 freq id- (2) - 1 freq idee (2) - 17 freq |
idzg (0) - 1 freq dug (3) - 576 freq adz (3) - 1 freq dtg (3) - 1 freq edg (3) - 1 freq dig (3) - 85 freq dg (3) - 19 freq dzd (3) - 1 freq dz (3) - 3 freq dgg (3) - 1 freq deg (3) - 2 freq lzg (3) - 1 freq dag (3) - 2 freq pzg (3) - 1 freq zzg (3) - 1 freq dog (3) - 157 freq zg (3) - 6 freq dze (3) - 1 freq ozg (3) - 1 freq dzf (3) - 1 freq ddg (3) - 1 freq dge (4) - 1 freq dugg (4) - 3 freq ding (4) - 87 freq dang (4) - 12 freq |
SoundEx code - I320 'it's - 315 freq it's - 5544 freq its - 3335 freq ideas - 148 freq idaias - 6 freq itch - 5 freq itchy - 36 freq 'its - 8 freq idees - 3 freq idiocy - 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 €˜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 - ITSK idzg - 1 freq |
IDZG |
| Time to execute Levenshtein function - 0.176728 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.343472 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.035973 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.040489 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.000845 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. |