| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fadit (0) - 10 freq ladit (1) - 2 freq fadin (1) - 19 freq wadit (1) - 1 freq fawit (1) - 2 freq falit (1) - 1 freq fedit (1) - 1 freq fait (1) - 6 freq fauldit (2) - 16 freq fae't (2) - 5 freq ratit (2) - 1 freq wanit (2) - 1 freq makit (2) - 41 freq faif (2) - 1 freq faalt (2) - 4 freq fykit (2) - 1 freq raxit (2) - 13 freq harit (2) - 1 freq fat (2) - 295 freq mait (2) - 84 freq faaldit (2) - 4 freq fruit (2) - 137 freq fidgit (2) - 3 freq hait (2) - 16 freq fade (2) - 41 freq |
fadit (0) - 10 freq fedit (1) - 1 freq fait (2) - 6 freq falit (2) - 1 freq feedit (2) - 1 freq ladit (2) - 2 freq fawit (2) - 2 freq fadin (2) - 19 freq wadit (2) - 1 freq firit (3) - 1 freq fads (3) - 2 freq wydit (3) - 1 freq bidit (3) - 30 freq widit (3) - 1 freq bydit (3) - 8 freq fautit (3) - 3 freq fado (3) - 1 freq readit (3) - 3 freq forit (3) - 1 freq feit (3) - 24 freq fault (3) - 72 freq fleit (3) - 1 freq faat (3) - 15 freq fadge (3) - 8 freq fad (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 - 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 |
FADIT |
| Time to execute Levenshtein function - 0.177004 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.323468 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.027123 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.037191 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.000838 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. |