| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| feddit (0) - 1 freq feedit (1) - 1 freq reddit (1) - 13 freq fendit (1) - 11 freq fedit (1) - 1 freq feddin (1) - 1 freq heddit (1) - 1 freq beddit (1) - 16 freq fendt (2) - 2 freq steddit (2) - 1 freq fedd (2) - 1 freq eddir (2) - 10 freq daddit (2) - 5 freq neddir (2) - 3 freq reddir (2) - 6 freq nedeit (2) - 1 freq beddin (2) - 16 freq faddim (2) - 1 freq eddi (2) - 1 freq weddin (2) - 40 freq endit (2) - 55 freq fledgit (2) - 1 freq fuddim (2) - 1 freq fundit (2) - 19 freq fearit (2) - 3 freq |
feddit (0) - 1 freq beddit (2) - 16 freq feedit (2) - 1 freq feddin (2) - 1 freq heddit (2) - 1 freq reddit (2) - 13 freq fedit (2) - 1 freq fendit (2) - 11 freq hoddit (3) - 1 freq fedder (3) - 36 freq noddit (3) - 122 freq fludit (3) - 1 freq fleudit (3) - 2 freq widdit (3) - 2 freq hiddit (3) - 2 freq roddit (3) - 1 freq fuddilt (3) - 2 freq wuddit (3) - 1 freq faddie (3) - 2 freq addit (3) - 97 freq waddit (3) - 3 freq foldit (3) - 12 freq loddit (3) - 2 freq fidgit (3) - 3 freq fiddil (3) - 2 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 |
FEDDIT |
| Time to execute Levenshtein function - 0.311867 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.606249 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.028082 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.076161 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.001129 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. |