| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| innin (0) - 34 freq hnnin (1) - 1 freq linnin (1) - 2 freq innit (1) - 10 freq ennin (1) - 2 freq finnin (1) - 40 freq innins (1) - 16 freq rinnin (1) - 330 freq winnin (1) - 88 freq ingin (1) - 18 freq intin (1) - 2 freq injin (1) - 33 freq inkin (1) - 1 freq sinnin (1) - 2 freq inning (1) - 1 freq pinnin (1) - 4 freq tinnin (1) - 1 freq birnin (2) - 2 freq tannin (2) - 8 freq annan (2) - 4 freq ironin (2) - 8 freq inns (2) - 8 freq intil (2) - 549 freq liinnin (2) - 1 freq mindin (2) - 154 freq |
innin (0) - 34 freq ennin (1) - 2 freq inning (2) - 1 freq sinnin (2) - 2 freq inkin (2) - 1 freq pinnin (2) - 4 freq annan (2) - 4 freq onnen (2) - 2 freq unenin (2) - 1 freq injin (2) - 33 freq tinnin (2) - 1 freq nonin (2) - 1 freq hnnin (2) - 1 freq finnin (2) - 40 freq linnin (2) - 2 freq intin (2) - 2 freq innins (2) - 16 freq ingin (2) - 18 freq winnin (2) - 88 freq rinnin (2) - 330 freq innit (2) - 10 freq rinnie (3) - 1 freq unkin (3) - 4 freq hinnyin (3) - 1 freq pinnie (3) - 2 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.203889 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.351039 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.040605 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.054189 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.001080 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. |