| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| izatt (0) - 2 freq izat (1) - 1 freq irate (2) - 1 freq izzat (2) - 2 freq 'att (2) - 1 freq izal (2) - 1 freq yatt (2) - 2 freq blatt (2) - 2 freq hatt (2) - 1 freq zzat (2) - 1 freq iatj (2) - 1 freq tatt (2) - 1 freq pratt (2) - 1 freq inate (2) - 1 freq izzata (2) - 1 freq zact (2) - 4 freq twatt (2) - 7 freq matt (2) - 29 freq itt (2) - 2 freq latt (2) - 3 freq katt (2) - 1 freq izatt's (2) - 1 freq batt (2) - 1 freq zat (2) - 11 freq gatt (2) - 1 freq |
izatt (0) - 2 freq izat (2) - 1 freq latt (3) - 3 freq itt (3) - 2 freq katt (3) - 1 freq zact (3) - 4 freq batt (3) - 1 freq matt (3) - 29 freq watt (3) - 27 freq izt (3) - 1 freq satt (3) - 2 freq att (3) - 451 freq izzata (3) - 1 freq zat (3) - 11 freq gatt (3) - 1 freq 'att (3) - 1 freq hatt (3) - 1 freq yatt (3) - 2 freq izzat (3) - 2 freq zzat (3) - 1 freq tatt (3) - 1 freq zowt (4) - 1 freq zit (4) - 2 freq zct (4) - 1 freq elatit (4) - 1 freq |
SoundEx code - I230 iced - 14 freq izzat - 2 freq is-'the - 1 freq ight - 1 freq is't - 47 freq 'is't - 1 freq iste - 1 freq i-ight - 1 freq ist - 11 freq iiokket - 1 freq iikit - 1 freq izat - 1 freq issued - 6 freq is-the - 1 freq ict - 1 freq i'stew - 1 freq i'cat - 1 freq i'settee - 1 freq i'shade - 5 freq iside - 1 freq izatt - 2 freq ischewed - 1 freq €™ist - 2 freq isit - 1 freq issit - 1 freq izzata - 1 freq ixd - 1 freq izt - 1 freq isd - 1 freq iogjkota - 1 freq iscot - 1 freq isaidaye - 2 freq ikcd - 1 freq |
MetaPhone code - IST iced - 14 freq izzat - 2 freq is't - 47 freq 'is't - 1 freq iste - 1 freq ist - 11 freq izat - 1 freq issued - 6 freq i'stew - 1 freq i'settee - 1 freq iside - 1 freq izatt - 2 freq €™ist - 2 freq isit - 1 freq issit - 1 freq izzata - 1 freq izt - 1 freq isd - 1 freq |
IZATT |
| Time to execute Levenshtein function - 0.322149 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.567644 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.029850 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.082746 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.000969 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. |