| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| innin (0) - 34 freq tinnin (1) - 1 freq winnin (1) - 90 freq innit (1) - 10 freq sinnin (1) - 2 freq inning (1) - 1 freq linnin (1) - 2 freq finnin (1) - 40 freq rinnin (1) - 331 freq injin (1) - 33 freq intin (1) - 2 freq innins (1) - 17 freq inkin (1) - 1 freq ingin (1) - 18 freq pinnin (1) - 4 freq hnnin (1) - 1 freq ennin (1) - 2 freq tirnin (2) - 5 freq issin (2) - 1 freq fintin (2) - 1 freq windin (2) - 28 freq innmo (2) - 1 freq dinin (2) - 25 freq invie (2) - 1 freq honin (2) - 2 freq |
innin (0) - 34 freq ennin (1) - 2 freq hnnin (2) - 1 freq inkin (2) - 1 freq pinnin (2) - 4 freq onnen (2) - 2 freq annan (2) - 4 freq unenin (2) - 1 freq innins (2) - 17 freq nonin (2) - 1 freq ingin (2) - 18 freq winnin (2) - 90 freq intin (2) - 2 freq innit (2) - 10 freq sinnin (2) - 2 freq tinnin (2) - 1 freq linnin (2) - 2 freq injin (2) - 33 freq inning (2) - 1 freq rinnin (2) - 331 freq finnin (2) - 40 freq kinnon (3) - 12 freq ennit (3) - 2 freq inben (3) - 5 freq linnie (3) - 3 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 - INN innin - 34 freq inane - 2 freq inion - 1 freq |
INNIN |
| Time to execute Levenshtein function - 0.274090 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.495667 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.027611 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.072747 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.000906 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. |