| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nudgin (0) - 4 freq nidgin (1) - 3 freq nudgit (1) - 1 freq judgin (1) - 17 freq budgin (1) - 3 freq ludgin (1) - 7 freq gudgie (2) - 1 freq tuggin (2) - 7 freq fidgin (2) - 13 freq pidgin (2) - 4 freq buddin (2) - 11 freq budgie (2) - 9 freq rudkin (2) - 2 freq pudgie (2) - 3 freq nudge (2) - 79 freq dodgin (2) - 4 freq judging (2) - 2 freq nuppin (2) - 1 freq nutkin (2) - 1 freq nuttin (2) - 49 freq noggin (2) - 1 freq mudgit (2) - 1 freq mungin (2) - 2 freq naggin (2) - 10 freq nuhin (2) - 48 freq |
nudgin (0) - 4 freq nidgin (1) - 3 freq budgin (2) - 3 freq ludgin (2) - 7 freq judgin (2) - 17 freq nudgit (2) - 1 freq naggin (3) - 10 freq nudged (3) - 5 freq noggin (3) - 1 freq aidgin (3) - 1 freq nedin (3) - 1 freq edgin (3) - 3 freq juidgin (3) - 2 freq knidgin (3) - 2 freq judgan (3) - 1 freq wadgin (3) - 4 freq dodgin (3) - 4 freq pidgin (3) - 4 freq nudges (3) - 4 freq fidgin (3) - 13 freq nogin (3) - 1 freq hodgin (3) - 3 freq cadgin (3) - 2 freq wedgin (3) - 1 freq lodgin (3) - 5 freq |
SoundEx code - N325 noticin - 18 freq nidgin - 3 freq nudgin - 4 freq nudge-nudge - 1 freq nutkin - 1 freq notican - 1 freq needsna - 2 freq noticing - 3 freq naedugnoo - 1 freq nedknwmy - 1 freq ndwkinmriy - 1 freq nowthisnews - 2 freq noitisnae - 1 freq |
MetaPhone code - NJN nidgin - 3 freq nudgin - 4 freq knidgin - 2 freq nogin - 1 freq |
NUDGIN |
| Time to execute Levenshtein function - 0.241300 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.361182 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.028356 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.036789 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.000834 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. |