| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| noted (0) - 23 freq toted (1) - 1 freq note (1) - 238 freq notid (1) - 1 freq doted (1) - 1 freq notes (1) - 113 freq nosed (1) - 6 freq voted (1) - 39 freq notted (1) - 1 freq ooted (1) - 1 freq noked (1) - 1 freq ted (2) - 13 freq posted (2) - 20 freq jolted (2) - 4 freq doated (2) - 1 freq roed (2) - 1 freq rowed (2) - 73 freq insted (2) - 5 freq nord (2) - 1 freq dote (2) - 2 freq poked (2) - 5 freq nate (2) - 9 freq noxfd (2) - 1 freq dotted (2) - 10 freq noticed (2) - 223 freq |
noted (0) - 23 freq notid (1) - 1 freq ooted (2) - 1 freq toted (2) - 1 freq inated (2) - 1 freq notted (2) - 1 freq united (2) - 75 freq noked (2) - 1 freq doted (2) - 1 freq note (2) - 238 freq voted (2) - 39 freq notes (2) - 113 freq nosed (2) - 6 freq outed (3) - 2 freq node (3) - 4 freq nimed (3) - 1 freq douted (3) - 1 freq njoyed (3) - 4 freq notre (3) - 1 freq notar (3) - 2 freq notys (3) - 3 freq notin (3) - 6 freq fated (3) - 1 freq gated (3) - 1 freq dooted (3) - 4 freq |
SoundEx code - N330 noddit - 122 freq needit - 167 freq nodded - 70 freq noted - 23 freq needed - 143 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 - 70 freq noted - 23 freq knottit - 6 freq needed - 143 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 |
NOTED |
| Time to execute Levenshtein function - 0.215078 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.351098 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.026872 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.036696 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.000867 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. |