| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| immune (0) - 6 freq impure (2) - 1 freq imbue (2) - 1 freq immense (2) - 11 freq mune (2) - 60 freq commune (2) - 3 freq toune (3) - 2 freq shune (3) - 39 freq ioun (3) - 1 freq amene (3) - 1 freq somane (3) - 1 freq sune (3) - 82 freq nimmle (3) - 2 freq i'dunce (3) - 1 freq timmle (3) - 4 freq mauned (3) - 1 freq mourne (3) - 6 freq maine (3) - 1 freq mute (3) - 11 freq impugn (3) - 2 freq somene (3) - 4 freq humane (3) - 4 freq i'lane (3) - 1 freq jimmie (3) - 9 freq ileene (3) - 1 freq |
immune (0) - 6 freq umman (3) - 15 freq commune (3) - 3 freq mune (3) - 60 freq immense (3) - 11 freq famine (4) - 15 freq maun (4) - 1160 freq imno (4) - 1 freq manne (4) - 1 freq mmcn (4) - 1 freq simone (4) - 4 freq immunity (4) - 3 freq imma (4) - 1 freq mylne (4) - 1 freq ermine (4) - 7 freq amun (4) - 5 freq mone (4) - 15 freq imorn (4) - 6 freq myne (4) - 30 freq mun (4) - 20 freq immer (4) - 2 freq meine (4) - 5 freq mauna (4) - 8 freq remine (4) - 2 freq mamen (4) - 16 freq |
SoundEx code - I550 innin - 34 freq immune - 6 freq innimy - 1 freq i'meen - 6 freq i'man - 1 freq i'mannie - 6 freq inane - 2 freq inimy - 1 freq inn-man - 1 freq inemy - 8 freq inimie - 2 freq inion - 1 freq ianhm - 1 freq |
MetaPhone code - IMN immune - 6 freq i'meen - 6 freq i'man - 1 freq i'mannie - 6 freq imno - 1 freq imn - 2 freq imna - 1 freq |
IMMUNE |
| Time to execute Levenshtein function - 0.283692 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.515830 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.027345 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.069566 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.000895 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. |