Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
illeeterate (0) - 2 freq illiterate (2) - 3 freq leeterate (2) - 9 freq illustrate (3) - 14 freq inveterate (3) - 1 freq leeterati (3) - 1 freq €˜leeberate (3) - 1 freq dileeberate (3) - 1 freq deleeberate (3) - 3 freq leiterate (3) - 1 freq literate (4) - 9 freq inviterate (4) - 1 freq obliterate (4) - 1 freq ‘illiterate (4) - 1 freq leeteracy (4) - 15 freq illustrated (4) - 10 freq illustrater (4) - 1 freq leeteratur (4) - 21 freq alleiterative (4) - 1 freq leeteral (4) - 2 freq leeterary (4) - 19 freq leeterar (4) - 14 freq alleeteration (4) - 1 freq electorate (4) - 18 freq leeterature (4) - 15 freq |
illeeterate (0) - 2 freq illiterate (2) - 3 freq leeterate (3) - 9 freq leiterate (4) - 1 freq leeterati (4) - 1 freq illustrate (4) - 14 freq literate (5) - 9 freq obliterate (5) - 1 freq electorate (5) - 18 freq deleeberate (5) - 3 freq inveterate (5) - 1 freq alleiterative (5) - 1 freq alleeteration (5) - 1 freq dileeberate (5) - 1 freq lĂterate (6) - 1 freq deleiberate (6) - 3 freq letterit (6) - 1 freq lettert (6) - 8 freq illnaturet (6) - 1 freq alluterlie (6) - 1 freq alliterative (6) - 2 freq literati (6) - 3 freq illustrates (6) - 4 freq leeterature (6) - 15 freq ‘illiterate (6) - 1 freq |
SoundEx code - I436 ill-daers - 1 freq ill-trickit - 14 freq illtrickit - 2 freq ill-traetit - 1 freq ill-turn - 1 freq ill-trickid - 3 freq ill-thraan - 1 freq ill-trivven - 1 freq ill-treatit - 1 freq illeeterate - 2 freq ill-doers - 1 freq illiterate - 3 freq €˜illiteracy - 1 freq ill-trikkit - 1 freq ‘illiterate - 1 freq |
MetaPhone code - ILTRT illeeterate - 2 freq illiterate - 3 freq ‘illiterate - 1 freq |
ILLEETERATE |
Time to execute Levenshtein function - 0.197149 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.419467 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.035740 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.038719 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.001055 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. |