| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| faded (0) - 16 freq fades (1) - 21 freq falded (1) - 1 freq waded (1) - 6 freq faaed (1) - 1 freq fawed (1) - 6 freq faced (1) - 68 freq fared (1) - 11 freq fade (1) - 41 freq laded (1) - 1 freq famed (1) - 8 freq fated (1) - 1 freq fazed (1) - 1 freq jaded (1) - 3 freq fused (2) - 5 freq frayed (2) - 2 freq faered (2) - 20 freq bared (2) - 6 freq faces (2) - 224 freq farel (2) - 1 freq maked (2) - 1 freq fraed (2) - 1 freq dauded (2) - 1 freq waxed (2) - 2 freq raked (2) - 16 freq |
faded (0) - 16 freq fated (2) - 1 freq famed (2) - 8 freq fazed (2) - 1 freq fudd (2) - 5 freq fidd (2) - 1 freq laded (2) - 1 freq jaded (2) - 3 freq fedd (2) - 1 freq falded (2) - 1 freq fades (2) - 21 freq fade (2) - 41 freq waded (2) - 6 freq faaed (2) - 1 freq fared (2) - 11 freq faced (2) - 68 freq fawed (2) - 6 freq badd (3) - 1 freq ceded (3) - 1 freq lauded (3) - 1 freq facedd (3) - 1 freq fixed (3) - 71 freq faird (3) - 3 freq bided (3) - 30 freq add (3) - 133 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 - 39 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 |
FADED |
| Time to execute Levenshtein function - 0.218492 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.373771 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.027026 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.037471 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.000821 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. |