| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| inimities (0) - 1 freq inimies (2) - 2 freq infirmities (2) - 1 freq iniquities (2) - 1 freq inititives (2) - 1 freq inemies (3) - 3 freq pairities (3) - 1 freq infinitie (3) - 1 freq inmates (3) - 1 freq niceties (3) - 1 freq minorities (3) - 17 freq abilities (3) - 6 freq inimie (3) - 2 freq fifities (3) - 1 freq infirmitie (3) - 1 freq minimises (3) - 1 freq infinitives (3) - 2 freq numpties (3) - 28 freq nineties (3) - 7 freq entities (3) - 15 freq inanimitie (3) - 1 freq faimilies (3) - 43 freq invites (3) - 11 freq inquiries (3) - 1 freq initiatives (3) - 27 freq |
inimities (0) - 1 freq iniquities (3) - 1 freq inimies (3) - 2 freq inmates (3) - 1 freq niceties (4) - 1 freq entities (4) - 15 freq nineties (4) - 7 freq invites (4) - 11 freq numpties (4) - 28 freq infirmities (4) - 1 freq inititives (4) - 1 freq inemies (4) - 3 freq iniquitous (5) - 3 freq nutties (5) - 1 freq noties (5) - 2 freq animatit (5) - 3 freq limits (5) - 15 freq inveits (5) - 1 freq tomaties (5) - 1 freq inuits (5) - 2 freq ainimatit (5) - 1 freq unites (5) - 4 freq nemisis (5) - 1 freq inpits (5) - 5 freq animate (5) - 1 freq |
SoundEx code - I553 inundated - 2 freq i'month - 1 freq inimities - 1 freq inimitable - 1 freq immunity - 3 freq ianandrewauthor - 1 freq |
MetaPhone code - INMTS inmates - 1 freq inimities - 1 freq |
INIMITIES |
| Time to execute Levenshtein function - 0.629047 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 - 1.261848 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.032819 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.097582 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.000913 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. |