| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| feedit (0) - 1 freq seedit (1) - 1 freq weedit (1) - 1 freq feemit (1) - 1 freq feddit (1) - 1 freq fedit (1) - 1 freq feedin (1) - 55 freq heedit (1) - 6 freq needit (1) - 167 freq fendit (1) - 11 freq heedin (2) - 11 freq leetit (2) - 6 freq needid (2) - 1 freq fettit (2) - 1 freq deeit (2) - 1 freq feelt (2) - 22 freq fleetit (2) - 2 freq fendt (2) - 2 freq edit (2) - 17 freq laedit (2) - 1 freq fergit (2) - 2 freq eegit (2) - 4 freq reddit (2) - 13 freq redit (2) - 2 freq flexit (2) - 1 freq |
feedit (0) - 1 freq fedit (1) - 1 freq heedit (2) - 6 freq fendit (2) - 11 freq feedin (2) - 55 freq fadit (2) - 10 freq needit (2) - 167 freq seedit (2) - 1 freq feddit (2) - 1 freq weedit (2) - 1 freq feemit (2) - 1 freq headit (3) - 19 freq fleudit (3) - 2 freq fee't (3) - 3 freq heidit (3) - 60 freq fundit (3) - 19 freq feeds (3) - 23 freq feudin (3) - 1 freq feed (3) - 225 freq fleit (3) - 2 freq endit (3) - 55 freq fludit (3) - 1 freq eediot (3) - 5 freq feet (3) - 960 freq feidin (3) - 1 freq |
SoundEx code - F330 fadit - 10 freq faded - 16 freq fauted - 1 freq fittit - 26 freq fetid - 3 freq fitted - 27 freq fiytit - 1 freq f-teeth - 1 freq fited - 1 freq fittet - 3 freq feedeth - 1 freq fit-hadd - 1 freq feddit - 1 freq fedit - 1 freq footed - 1 freq fated - 1 freq fithaud - 3 freq feedit - 1 freq fautit - 3 freq fittid - 1 freq fettit - 1 freq fittaedee - 1 freq |
MetaPhone code - FTT fadit - 10 freq faded - 16 freq fauted - 1 freq fittit - 26 freq fetid - 3 freq fitted - 27 freq fiytit - 1 freq votit - 42 freq fited - 1 freq voted - 41 freq fittet - 3 freq votet - 1 freq feddit - 1 freq fedit - 1 freq photied - 1 freq footed - 1 freq fated - 1 freq vottit - 1 freq feedit - 1 freq fautit - 3 freq fittid - 1 freq fettit - 1 freq fittaedee - 1 freq vetoed - 1 freq vdett - 1 freq ftd - 1 freq |
FEEDIT |
| Time to execute Levenshtein function - 0.196368 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.370569 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.027434 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.070313 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.001213 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. |