| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| invitit (0) - 39 freq invitet (1) - 4 freq invitin (1) - 16 freq invintit (1) - 1 freq ïnvitit (2) - 2 freq invokit (2) - 3 freq ignitit (2) - 1 freq invite (2) - 43 freq invited (2) - 38 freq inveetit (2) - 4 freq invertit (2) - 3 freq intit (2) - 11 freq evitit (2) - 2 freq investit (2) - 3 freq unitit (2) - 29 freq invitit's (2) - 1 freq inactit (2) - 4 freq inhibit (2) - 2 freq inveit (2) - 5 freq insistit (2) - 19 freq invadit (2) - 4 freq inventit (2) - 23 freq inviting (2) - 3 freq incitin (2) - 1 freq invites (2) - 11 freq |
invitit (0) - 39 freq invitet (1) - 4 freq inveetit (2) - 4 freq invintit (2) - 1 freq invitin (2) - 16 freq inactit (3) - 4 freq unitit (3) - 29 freq inveit (3) - 5 freq invites (3) - 11 freq investit (3) - 3 freq inventit (3) - 23 freq invadit (3) - 4 freq evitit (3) - 2 freq invite (3) - 43 freq invokit (3) - 3 freq invertit (3) - 3 freq invited (3) - 38 freq intit (3) - 11 freq nottit (4) - 3 freq antit (4) - 1 freq inveits (4) - 1 freq invent (4) - 11 freq deviatit (4) - 2 freq devotit (4) - 5 freq anointit (4) - 2 freq |
SoundEx code - I513 impatiently - 19 freq invitation - 27 freq inbetween - 3 freq inevitably - 10 freq infatuation - 1 freq impatient - 16 freq inveetit - 4 freq inobedience - 2 freq inevitable - 26 freq impediment - 10 freq invite - 43 freq invitin - 16 freq inpit - 49 freq invited - 38 freq impident - 8 freq invaders - 8 freq invites - 11 freq impudent - 2 freq impidence - 8 freq invitit - 39 freq inpitten - 2 freq inaboot - 35 freq impty - 14 freq invitatioun - 1 freq invaded - 4 freq 'invited' - 2 freq impidint - 1 freq invitit's - 1 freq impetus - 3 freq impeedence - 1 freq inhabitants - 8 freq inhabit - 3 freq input - 4 freq invitet - 4 freq invading - 1 freq inaboots - 3 freq innovations - 4 freq inviterate - 1 freq inpits - 5 freq inpittin - 1 freq inveit - 5 freq invitaetion - 2 freq infodump - 1 freq invitin's - 1 freq inviting - 3 freq in-aboots - 1 freq in-aboot - 1 freq inybuddy - 1 freq invitations - 4 freq innovation - 6 freq innovative - 9 freq in-betweenies - 2 freq impit - 1 freq inapt - 1 freq invade - 4 freq invadit - 4 freq invye't - 1 freq inbidin - 5 freq inbye't - 1 freq ineptly - 1 freq inhibit - 2 freq invyte - 1 freq invied - 1 freq invadin - 4 freq inhabiters - 1 freq inveterate - 1 freq in-between - 1 freq in-pittin - 1 freq infit - 1 freq inveits - 1 freq inhabited - 2 freq impediments - 2 freq inevitability - 2 freq innovator - 1 freq impetuous - 2 freq impudence - 2 freq invitingly - 1 freq inhabitit - 1 freq impiddently - 1 freq imbued - 1 freq impotence - 1 freq inhibition - 1 freq inabootcomer - 1 freq ianbhood - 2 freq inhibitions - 1 freq inept - 1 freq ineptitude - 1 freq infidelnumber - 5 freq |
MetaPhone code - INFTT inveetit - 4 freq invited - 38 freq invitit - 39 freq invaded - 4 freq 'invited' - 2 freq invitet - 4 freq invadit - 4 freq |
INVITIT |
| Time to execute Levenshtein function - 0.190726 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.352927 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.027207 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.042215 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. |