Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
noddit (0) - 122 freq hoddit (1) - 1 freq noddet (1) - 1 freq loddit (1) - 2 freq noddin (1) - 38 freq roddit (1) - 1 freq roddin (2) - 8 freq roadit (2) - 6 freq heddit (2) - 1 freq loadit (2) - 19 freq noaddin (2) - 5 freq hoidit (2) - 3 freq goddis (2) - 3 freq coddilt (2) - 1 freq addit (2) - 97 freq nedeit (2) - 1 freq goadit (2) - 3 freq hoodit (2) - 1 freq neddie (2) - 1 freq nudgit (2) - 1 freq widdit (2) - 2 freq waddit (2) - 3 freq neddir (2) - 3 freq nodding (2) - 4 freq nordic (2) - 9 freq |
noddit (0) - 122 freq noddet (1) - 1 freq noddin (2) - 38 freq roddit (2) - 1 freq hoddit (2) - 1 freq loddit (2) - 2 freq paddit (3) - 2 freq daddit (3) - 5 freq wuddit (3) - 1 freq neddir (3) - 3 freq noddle (3) - 2 freq waddit (3) - 3 freq noddy (3) - 1 freq kiddit (3) - 1 freq noddan (3) - 1 freq widdit (3) - 2 freq haddit (3) - 1 freq beddit (3) - 16 freq sneddit (3) - 11 freq neddie (3) - 1 freq noaddin (3) - 5 freq nudgit (3) - 1 freq heddit (3) - 1 freq reddit (3) - 13 freq nodded (3) - 70 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 |
NODDIT |
Time to execute Levenshtein function - 0.223841 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.369441 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.030784 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.038357 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.000941 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. |