| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fiytit (0) - 1 freq fittit (1) - 26 freq hiltit (2) - 1 freq skytit (2) - 9 freq fintin (2) - 1 freq wiltit (2) - 1 freq feintit (2) - 1 freq flirtit (2) - 1 freq evytit (2) - 1 freq fautit (2) - 3 freq fiypt (2) - 1 freq dytit (2) - 2 freq fittin (2) - 44 freq sintit (2) - 3 freq firrit (2) - 1 freq fiiit (2) - 1 freq histit (2) - 1 freq giftit (2) - 5 freq wytit (2) - 20 freq ditit (2) - 1 freq flytin (2) - 35 freq fistin (2) - 1 freq kiltit (2) - 4 freq flypit (2) - 3 freq fixit (2) - 7 freq |
fiytit (0) - 1 freq fautit (2) - 3 freq fitt (2) - 42 freq iftit (2) - 1 freq fittit (2) - 26 freq fittie (2) - 131 freq feytin (3) - 1 freq fittid (3) - 1 freq fitin (3) - 4 freq riftit (3) - 1 freq hiftit (3) - 1 freq fiftiet (3) - 1 freq intit (3) - 11 freq fittet (3) - 3 freq flotit (3) - 1 freq citit (3) - 2 freq firit (3) - 1 freq liftit (3) - 135 freq futt (3) - 1 freq faintit (3) - 7 freq fottie (3) - 1 freq fitty (3) - 3 freq fattie (3) - 2 freq fettit (3) - 1 freq awytit (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 |
FIYTIT |
| Time to execute Levenshtein function - 0.193485 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.346879 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.028579 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.044810 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.000930 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. |