| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| notit (0) - 12 freq notin (1) - 6 freq notict (1) - 1 freq notis (1) - 1 freq notie (1) - 8 freq nott (1) - 55 freq nottit (1) - 3 freq votit (1) - 42 freq notid (1) - 1 freq dotit (1) - 1 freq flotit (2) - 1 freq totie (2) - 18 freq snokit (2) - 2 freq forit (2) - 1 freq yokit (2) - 72 freq intit (2) - 11 freq denotit (2) - 1 freq nestit (2) - 3 freq snortit (2) - 16 freq rottit (2) - 9 freq nakit (2) - 30 freq fotie (2) - 5 freq loutit (2) - 3 freq noir (2) - 3 freq nosie (2) - 1 freq |
notit (0) - 12 freq nott (1) - 55 freq dotit (2) - 1 freq nutt (2) - 2 freq unitit (2) - 29 freq antit (2) - 1 freq intit (2) - 11 freq notid (2) - 1 freq notict (2) - 1 freq notin (2) - 6 freq votit (2) - 42 freq notis (2) - 1 freq nottit (2) - 3 freq notie (2) - 8 freq netta (3) - 6 freq noth (3) - 5 freq noust (3) - 2 freq citit (3) - 2 freq notion (3) - 223 freq doutit (3) - 4 freq nowt (3) - 116 freq ott (3) - 4 freq natty (3) - 2 freq mootit (3) - 1 freq nots (3) - 2 freq |
SoundEx code - N330 noddit - 122 freq needit - 167 freq nodded - 71 freq noted - 23 freq needed - 148 freq notit - 12 freq nit-wit - 1 freq neidit - 1 freq noadded - 2 freq needet - 2 freq noddet - 1 freq notted - 1 freq nottit - 3 freq neded - 3 freq €™nittit - 1 freq nedeit - 1 freq nittet - 1 freq noo-hatit - 1 freq notid - 1 freq needid - 1 freq |
MetaPhone code - NTT noddit - 122 freq needit - 167 freq nodded - 71 freq noted - 23 freq knottit - 6 freq needed - 148 freq needty - 1 freq notit - 12 freq knittit - 7 freq knitted - 13 freq neidit - 1 freq noadded - 2 freq needet - 2 freq noddet - 1 freq knittet - 2 freq knotted - 8 freq notted - 1 freq nottit - 3 freq knottied - 1 freq neded - 3 freq €™nittit - 1 freq nedeit - 1 freq nittet - 1 freq notid - 1 freq needid - 1 freq |
NOTIT |
| Time to execute Levenshtein function - 0.611463 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 - 1.185678 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.089171 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.102175 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.000981 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. |