| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| innins (0) - 17 freq ingins (1) - 15 freq innin (1) - 34 freq finnins (1) - 1 freq injins (1) - 1 freq winnins (1) - 4 freq inning (1) - 1 freq innit (2) - 10 freq dinning (2) - 1 freq finnin (2) - 40 freq ownins (2) - 1 freq dinnis (2) - 1 freq findins (2) - 4 freq rinning (2) - 7 freq ennin (2) - 2 freq hnnin (2) - 1 freq ingin (2) - 18 freq inns (2) - 8 freq inkin (2) - 1 freq mindins (2) - 20 freq winniks (2) - 2 freq fynnins (2) - 7 freq tinnies (2) - 6 freq injin's (2) - 6 freq annies (2) - 1 freq |
innins (0) - 17 freq inning (2) - 1 freq injins (2) - 1 freq winnins (2) - 4 freq ingins (2) - 15 freq finnins (2) - 1 freq innin (2) - 34 freq linins (3) - 1 freq inn's (3) - 1 freq indians (3) - 11 freq nannies (3) - 2 freq kinnens (3) - 4 freq inions (3) - 1 freq wunnins (3) - 1 freq fennins (3) - 1 freq kennins (3) - 6 freq ingines (3) - 4 freq endins (3) - 13 freq ingens (3) - 1 freq innes (3) - 14 freq hinnies (3) - 6 freq ninians (3) - 3 freq ingans (3) - 9 freq annint (3) - 1 freq sinnons (3) - 1 freq |
SoundEx code - I552 inions - 1 freq immense - 14 freq immunised - 2 freq innins - 17 freq immensely - 2 freq i'meenister - 1 freq i'mannie's - 1 freq inimies - 2 freq inemies - 3 freq inning - 1 freq immensities - 1 freq ionamckay - 11 freq |
MetaPhone code - INNS inions - 1 freq innins - 17 freq |
INNINS |
| Time to execute Levenshtein function - 0.185730 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.339843 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.027414 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.039245 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.000888 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. |