Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
nidgin (0) - 3 freq aidgin (1) - 1 freq pidgin (1) - 4 freq fidgin (1) - 13 freq knidgin (1) - 2 freq nudgin (1) - 4 freq widdin (2) - 4 freq judgin (2) - 17 freq bingin (2) - 1 freq riggin (2) - 20 freq nippin (2) - 31 freq bidein (2) - 6 freq dodgin (2) - 4 freq piggin (2) - 10 freq hodgin (2) - 3 freq ringin (2) - 42 freq nickin (2) - 8 freq smidgin (2) - 2 freq fidgan (2) - 1 freq ludgin (2) - 7 freq hiddin (2) - 1 freq tidyin (2) - 6 freq diggin (2) - 44 freq hidlin (2) - 1 freq sidlin (2) - 1 freq |
nidgin (0) - 3 freq nudgin (1) - 4 freq aidgin (2) - 1 freq pidgin (2) - 4 freq knidgin (2) - 2 freq fidgin (2) - 13 freq wedgin (3) - 1 freq nyiggin (3) - 1 freq lodgin (3) - 5 freq nidge (3) - 2 freq gadgin (3) - 1 freq wadgin (3) - 4 freq nidged (3) - 1 freq nogin (3) - 1 freq nedin (3) - 1 freq jeidgin (3) - 1 freq ludgin (3) - 7 freq ingin (3) - 18 freq noddin (3) - 39 freq fidgan (3) - 1 freq waidgin (3) - 1 freq budgin (3) - 3 freq dodgin (3) - 4 freq nudgit (3) - 2 freq cadgin (3) - 2 freq |
SoundEx code - N325 noticin - 20 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 |
NIDGIN |
Time to execute Levenshtein function - 0.315626 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.523298 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.063642 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.037516 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.000900 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. |