| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| iced (0) - 14 freq ieed (1) - 1 freq ice (1) - 254 freq diced (1) - 4 freq ices (1) - 2 freq imed (1) - 1 freq iled (1) - 1 freq icey (1) - 3 freq lced (1) - 1 freq ticed (1) - 2 freq licet (2) - 1 freq owed (2) - 13 freq iand (2) - 1 freq acad (2) - 2 freq wined (2) - 4 freq mickd (2) - 6 freq item (2) - 17 freq ded (2) - 4 freq pied (2) - 4 freq kicked (2) - 63 freq 'cud (2) - 2 freq eked (2) - 3 freq eyed (2) - 21 freq vice (2) - 66 freq bed (2) - 930 freq |
iced (0) - 14 freq acud (2) - 1 freq cede (2) - 1 freq cad (2) - 40 freq acad (2) - 2 freq ceud (2) - 1 freq cid (2) - 25 freq cod (2) - 20 freq ocd (2) - 4 freq acid (2) - 6 freq cd (2) - 50 freq caed (2) - 4 freq cud (2) - 955 freq icey (2) - 3 freq lced (2) - 1 freq iled (2) - 1 freq imed (2) - 1 freq diced (2) - 4 freq ices (2) - 2 freq ice (2) - 254 freq ticed (2) - 2 freq ieed (2) - 1 freq cec (3) - 1 freq voiced (3) - 16 freq daed (3) - 19 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 |
ICED |
| Time to execute Levenshtein function - 0.205731 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.448523 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.028029 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.071359 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.000937 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. |