| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| invitatioun (0) - 1 freq invitation (1) - 27 freq invitations (2) - 4 freq invitaetion (2) - 2 freq indication (3) - 5 freq invasioun (3) - 6 freq inventioun (3) - 1 freq imitation (3) - 4 freq inflatioun (3) - 1 freq inspiratioun (3) - 1 freq irritation (3) - 4 freq invocation (3) - 1 freq initiation (3) - 2 freq visitation (4) - 1 freq meditation (4) - 12 freq notation (4) - 1 freq connotatioun (4) - 1 freq i'station (4) - 2 freq indications (4) - 2 freq implicatioun (4) - 1 freq innovation (4) - 6 freq vindication (4) - 4 freq intonation (4) - 11 freq investigatioun (4) - 1 freq institutiouns (4) - 1 freq |
invitatioun (0) - 1 freq invitation (1) - 27 freq invitaetion (2) - 2 freq invitations (3) - 4 freq initiation (4) - 2 freq inventioun (4) - 1 freq invocation (4) - 1 freq invention (5) - 22 freq inpittin (5) - 1 freq infatuation (5) - 1 freq notation (5) - 1 freq navigation (5) - 3 freq invasioun (5) - 6 freq indication (5) - 5 freq irritation (5) - 4 freq imitation (5) - 4 freq inflatioun (5) - 1 freq invitin (5) - 16 freq limitation (6) - 1 freq inventin (6) - 22 freq reputatioun (6) - 2 freq indicatin (6) - 8 freq invasion (6) - 15 freq insitutions (6) - 1 freq naitioun (6) - 7 freq |
SoundEx code - I513 impatiently - 20 freq invitation - 27 freq inbetween - 3 freq inevitably - 10 freq infatuation - 1 freq impatient - 16 freq inveetit - 4 freq inobedience - 2 freq inevitable - 29 freq impediment - 10 freq invite - 44 freq invitin - 16 freq inpit - 49 freq invited - 38 freq impident - 8 freq invaders - 9 freq invites - 11 freq impudent - 2 freq impidence - 8 freq invitit - 39 freq inpitten - 2 freq inaboot - 35 freq impty - 14 freq invade - 5 freq infatuated - 1 freq invadit - 5 freq invadin - 5 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 invye't - 1 freq inbidin - 5 freq inbye't - 1 freq ineptly - 1 freq inhibit - 2 freq invyte - 1 freq invied - 1 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 - INFTXN invitation - 27 freq infatuation - 1 freq invitatioun - 1 freq invitaetion - 2 freq |
INVITATIOUN |
| Time to execute Levenshtein function - 0.328454 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.684350 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.032056 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.096042 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.000876 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. |