| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eedjit (1) - 7 freq eedikt (1) - 1 freq eegit (1) - 4 freq heedit (1) - 6 freq eejit (1) - 69 freq eediot (1) - 5 freq endit (1) - 55 freq edit (1) - 17 freq needit (1) - 167 freq seedit (1) - 1 freq feedit (1) - 1 freq ledit (1) - 1 freq redit (1) - 2 freq fedit (1) - 1 freq eeyit (1) - 1 freq weedit (1) - 1 freq eekit (1) - 6 freq petit (2) - 1 freq medi- (2) - 1 freq keepit (2) - 151 freq eidiot (2) - 1 freq eikit (2) - 65 freq eadie (2) - 1 freq bodit (2) - 2 freq demit (2) - 2 freq |
edit (1) - 17 freq eediot (1) - 5 freq deeit (2) - 1 freq eidiot (2) - 1 freq weedit (2) - 1 freq eeyit (2) - 1 freq ediot (2) - 1 freq eedjit (2) - 7 freq audit (2) - 12 freq deit (2) - 9 freq fedit (2) - 1 freq aidit (2) - 1 freq eekit (2) - 6 freq needit (2) - 167 freq endit (2) - 55 freq redit (2) - 2 freq eejit (2) - 69 freq seedit (2) - 1 freq heedit (2) - 6 freq ledit (2) - 1 freq feedit (2) - 1 freq eedikt (2) - 1 freq eegit (2) - 4 freq needet (3) - 2 freq eet (3) - 581 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 |
EEDIT |
| Time to execute Levenshtein function - 0.375813 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.620268 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.076951 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.036529 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.000833 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. |