| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fetid (0) - 3 freq feid (1) - 1 freq feein (2) - 4 freq feil (2) - 7 freq felix (2) - 1 freq ftd (2) - 1 freq fet (2) - 2 freq festie (2) - 11 freq fettit (2) - 1 freq fedd (2) - 1 freq fee'd (2) - 14 freq nekid (2) - 1 freq fertin (2) - 1 freq fete (2) - 1 freq seid (2) - 11 freq feir (2) - 7 freq feth (2) - 45 freq meid (2) - 4 freq ostid (2) - 1 freq neid (2) - 1 freq elid (2) - 2 freq ktid (2) - 1 freq fett (2) - 1 freq fentit (2) - 3 freq fuid (2) - 37 freq |
fetid (0) - 3 freq fited (2) - 1 freq ftd (2) - 1 freq fated (2) - 1 freq feid (2) - 1 freq ferd (3) - 2 freq fid (3) - 4 freq feytin (3) - 1 freq feeld (3) - 1 freq fluid (3) - 17 freq notid (3) - 1 freq fethy (3) - 2 freq fetes (3) - 1 freq fraid (3) - 3 freq metad (3) - 1 freq fitin (3) - 4 freq tid (3) - 25 freq gtid (3) - 1 freq feild (3) - 1 freq stid (3) - 11 freq fed (3) - 161 freq fauted (3) - 1 freq footed (3) - 1 freq feed (3) - 225 freq meted (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 |
FETID |
| Time to execute Levenshtein function - 0.196279 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.411733 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.032517 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.041583 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.000984 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. |