| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| noted (0) - 23 freq voted (1) - 41 freq toted (1) - 1 freq note (1) - 240 freq notted (1) - 1 freq notid (1) - 1 freq notes (1) - 117 freq doted (1) - 1 freq noked (1) - 1 freq nosed (1) - 6 freq ooted (1) - 1 freq bowed (2) - 38 freq rowted (2) - 1 freq coded (2) - 2 freq outed (2) - 2 freq boxed (2) - 7 freq nested (2) - 1 freq pote (2) - 1 freq notepad (2) - 8 freq nate (2) - 9 freq boked (2) - 2 freq booed (2) - 40 freq cited (2) - 3 freq cowed (2) - 7 freq poked (2) - 5 freq |
noted (0) - 23 freq notid (1) - 1 freq noked (2) - 1 freq nosed (2) - 6 freq ooted (2) - 1 freq united (2) - 75 freq doted (2) - 1 freq inated (2) - 1 freq notes (2) - 117 freq voted (2) - 41 freq toted (2) - 1 freq note (2) - 240 freq notted (2) - 1 freq meted (3) - 2 freq ted (3) - 13 freq nite (3) - 87 freq intaed (3) - 1 freq booted (3) - 6 freq nied (3) - 3 freq nod (3) - 111 freq wated (3) - 1 freq doated (3) - 1 freq noties (3) - 2 freq ootd (3) - 2 freq notre (3) - 1 freq |
SoundEx code - N330 noddit - 122 freq needit - 167 freq nodded - 71 freq noted - 23 freq needed - 150 freq notit - 13 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 - 150 freq needty - 1 freq notit - 13 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.214753 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.375705 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.027442 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.037858 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.000940 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. |