| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| innimy (0) - 1 freq inimy (1) - 1 freq inny (2) - 3 freq inning (2) - 1 freq infamy (2) - 5 freq innit (2) - 10 freq inemy (2) - 8 freq innins (2) - 17 freq innmo (2) - 1 freq innin (2) - 34 freq idyims (3) - 2 freq annuity (3) - 2 freq inite (3) - 6 freq minnit (3) - 5 freq noisy (3) - 13 freq hnnin (3) - 1 freq dinnil (3) - 1 freq isney (3) - 1 freq infinity (3) - 1 freq infit (3) - 1 freq linnin (3) - 2 freq indigo (3) - 2 freq incy (3) - 1 freq pinny (3) - 7 freq naime (3) - 7 freq |
innimy (0) - 1 freq inimy (2) - 1 freq innmo (2) - 1 freq annum (3) - 2 freq inemy (3) - 8 freq innin (3) - 34 freq innit (3) - 10 freq inny (3) - 3 freq infamy (3) - 5 freq onny (4) - 3 freq tonimo (4) - 18 freq innes (4) - 14 freq onnay (4) - 1 freq annay (4) - 4 freq yintim (4) - 1 freq inn' (4) - 2 freq injum (4) - 1 freq incum (4) - 1 freq ennit (4) - 2 freq angim (4) - 1 freq inns (4) - 8 freq annoy (4) - 12 freq innaa (4) - 1 freq incam (4) - 3 freq onnly (4) - 37 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 - INM innimy - 1 freq inimy - 1 freq inemy - 8 freq inimie - 2 freq innmo - 1 freq ihnm - 1 freq ianhm - 1 freq |
INNIMY |
| Time to execute Levenshtein function - 0.500515 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.495987 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.033815 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.077183 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.000860 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. |