Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
edit (0) - 17 freq exit (1) - 27 freq fedit (1) - 1 freq edict (1) - 2 freq redit (1) - 2 freq edgit (1) - 1 freq ejit (1) - 1 freq ediot (1) - 1 freq emit (1) - 4 freq ledit (1) - 1 freq edih (1) - 1 freq edi (1) - 1 freq endit (1) - 55 freq edith (1) - 18 freq ekit (1) - 1 freq edin (1) - 4 freq eit (1) - 644 freq eqio (2) - 1 freq nekit (2) - 2 freq edj (2) - 1 freq ait (2) - 138 freq ezi (2) - 1 freq est (2) - 22 freq eikit (2) - 65 freq evie (2) - 8 freq |
edit (0) - 17 freq ediot (1) - 1 freq dyit (2) - 2 freq deeit (2) - 1 freq deit (2) - 9 freq idot (2) - 1 freq det (2) - 3 freq dat (2) - 1391 freq doit (2) - 3 freq diet (2) - 70 freq edyta (2) - 7 freq idiot (2) - 21 freq audit (2) - 12 freq dt (2) - 3 freq dot (2) - 47 freq eediot (2) - 5 freq eidiot (2) - 1 freq aidit (2) - 1 freq edgit (2) - 1 freq edih (2) - 1 freq ejit (2) - 1 freq emit (2) - 4 freq edith (2) - 18 freq ekit (2) - 1 freq redit (2) - 2 freq |
SoundEx code - E330 edith - 18 freq eidiot - 1 freq eidiot' - 1 freq edit - 17 freq eediot - 5 freq etude - 1 freq 'edit' - 1 freq eatit - 1 freq edyta - 7 freq €œedith - 3 freq eyeteeth - 1 freq ediot - 1 freq |
MetaPhone code - ETT eidiot - 1 freq eidiot' - 1 freq edit - 17 freq eediot - 5 freq etude - 1 freq 'edit' - 1 freq eatit - 1 freq edyta - 7 freq ediot - 1 freq |
EDIT |
Time to execute Levenshtein function - 0.248702 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.398256 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.027554 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.040993 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.001207 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. |