| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ithaca (0) - 2 freq thaa (2) - 1 freq thack (2) - 2 freq lithca (2) - 1 freq ithrr (3) - 1 freq whack (3) - 16 freq shaa (3) - 51 freq thare (3) - 505 freq itsa (3) - 1 freq fithaud (3) - 3 freq thalm (3) - 1 freq innaa (3) - 1 freq thaur (3) - 49 freq thatz (3) - 2 freq hac (3) - 1 freq thay (3) - 706 freq taa (3) - 3 freq 'thair (3) - 2 freq than (3) - 2763 freq tha' (3) - 11 freq thain (3) - 6 freq schaa (3) - 1 freq thora (3) - 1 freq thase (3) - 13 freq taco (3) - 1 freq |
ithaca (0) - 2 freq thc (3) - 3 freq lithca (3) - 1 freq ethic (3) - 1 freq thack (3) - 2 freq thaa (3) - 1 freq thaun (4) - 2 freq thay' (4) - 1 freq thraa (4) - 5 freq ethical (4) - 5 freq thuma (4) - 1 freq itc (4) - 1 freq thoch (4) - 2 freq ithe (4) - 14 freq thra (4) - 8 freq ith (4) - 2 freq thaot (4) - 1 freq thak (4) - 1 freq thame (4) - 27 freq thair (4) - 1955 freq thaum (4) - 1 freq that (4) - 27092 freq thait (4) - 3 freq thick (4) - 227 freq ithout (4) - 11 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 - I0K ithaca - 2 freq |
ITHACA |
| Time to execute Levenshtein function - 0.346510 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.541458 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.034933 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.047758 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.001064 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. |