| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nodded (0) - 70 freq noadded (1) - 2 freq noddet (1) - 1 freq bedded (2) - 8 freq brodded (2) - 1 freq noddle (2) - 2 freq noaked (2) - 1 freq coded (2) - 2 freq nedder (2) - 18 freq noked (2) - 1 freq noddin (2) - 38 freq wedded (2) - 4 freq folded (2) - 14 freq coddled (2) - 1 freq loaded (2) - 22 freq node (2) - 4 freq bodied (2) - 2 freq padded (2) - 13 freq needed (2) - 143 freq nceded (2) - 1 freq nudged (2) - 5 freq hooded (2) - 1 freq clodded (2) - 2 freq rodden (2) - 15 freq nocked (2) - 1 freq |
nodded (0) - 70 freq noadded (1) - 2 freq noddet (2) - 1 freq redded (3) - 2 freq wadded (3) - 1 freq hudded (3) - 1 freq noddy (3) - 1 freq nudged (3) - 5 freq dadded (3) - 1 freq kidded (3) - 1 freq widded (3) - 1 freq neded (3) - 3 freq noddit (3) - 122 freq nidder (3) - 6 freq noddan (3) - 1 freq nceded (3) - 1 freq toddied (3) - 1 freq nidged (3) - 1 freq added (3) - 173 freq noddin (3) - 38 freq nedder (3) - 18 freq noddle (3) - 2 freq bedded (3) - 8 freq needed (3) - 143 freq wedded (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 |
NODDED |
| Time to execute Levenshtein function - 0.215399 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.325116 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.028794 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.036607 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.000842 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. |