| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nedeit (0) - 1 freq ledeit (1) - 2 freq deceit (2) - 5 freq neukit (2) - 1 freq redit (2) - 2 freq nevet (2) - 1 freq nede (2) - 3 freq bekeit (2) - 1 freq nesbit (2) - 1 freq nudest (2) - 1 freq neebit (2) - 2 freq neckit (2) - 2 freq weeit (2) - 1 freq needit (2) - 167 freq nudgit (2) - 2 freq sneddit (2) - 11 freq ledit (2) - 1 freq noddit (2) - 122 freq needet (2) - 2 freq neddir (2) - 3 freq neest (2) - 88 freq nekit (2) - 2 freq redein (2) - 1 freq nebbit (2) - 5 freq neddie (2) - 1 freq |
nedeit (0) - 1 freq neidit (2) - 1 freq needet (2) - 2 freq needit (2) - 167 freq ledeit (2) - 2 freq nedin (3) - 1 freq neded (3) - 3 freq nekit (3) - 2 freq neddie (3) - 1 freq edit (3) - 17 freq neext (3) - 1 freq deit (3) - 9 freq endet (3) - 42 freq endit (3) - 55 freq needty (3) - 1 freq deeit (3) - 1 freq neibit (3) - 3 freq fedit (3) - 1 freq neest (3) - 88 freq nedes (3) - 2 freq neukit (3) - 1 freq neebit (3) - 2 freq nudest (3) - 1 freq nudgit (3) - 2 freq nevet (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 |
NEDEIT |
| Time to execute Levenshtein function - 0.251337 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.362795 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.029262 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.038267 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.001004 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. |