| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uninvitin (0) - 1 freq invitin (2) - 16 freq uninvited (2) - 3 freq uninveetin (2) - 1 freq incitin (3) - 1 freq uinitie (3) - 1 freq urinatin (3) - 1 freq ïnvitin (3) - 1 freq unitin (3) - 2 freq inviting (3) - 3 freq invitit (3) - 39 freq intin (4) - 2 freq inbidin (4) - 5 freq invintit (4) - 1 freq unnerpin (4) - 1 freq 'tintin (4) - 1 freq ignitin (4) - 1 freq unwintit (4) - 3 freq unwittin (4) - 1 freq uinioun (4) - 1 freq peintin (4) - 5 freq inpittin (4) - 1 freq daikitin (4) - 1 freq invited (4) - 38 freq tintin (4) - 7 freq |
uninvitin (0) - 1 freq uninveetin (2) - 1 freq uninvited (3) - 3 freq invitin (3) - 16 freq ninevites (5) - 2 freq anointin (5) - 1 freq innovation (5) - 6 freq invitit (5) - 39 freq non-votin (5) - 1 freq enunciatin (5) - 1 freq urinatin (5) - 1 freq inviting (5) - 3 freq incitin (5) - 1 freq ïnvitin (5) - 1 freq unitin (5) - 2 freq undulatin (6) - 1 freq lintin (6) - 2 freq nittin (6) - 3 freq pintin (6) - 17 freq investin (6) - 6 freq ninian (6) - 5 freq pinntin (6) - 2 freq insinuatin (6) - 2 freq reunitin (6) - 1 freq invite (6) - 44 freq |
SoundEx code - U551 unimportant - 18 freq uninvited - 3 freq unemployment - 14 freq uninveetin - 1 freq unemployed - 6 freq unimpressed - 3 freq unambiguous - 2 freq uninvitin - 1 freq uninhabitable - 2 freq unionprisoner - 2 freq uninformed - 1 freq |
MetaPhone code - UNNFTN uninveetin - 1 freq uninvitin - 1 freq |
UNINVITIN |
| Time to execute Levenshtein function - 0.602900 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.812622 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.063151 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.038107 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.001071 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. |