| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nudgit (0) - 1 freq mudgit (1) - 1 freq ludgit (1) - 5 freq nudgin (1) - 4 freq nidgin (2) - 3 freq gudgie (2) - 1 freq ruggit (2) - 26 freq pudgie (2) - 3 freq huggit (2) - 1 freq noddit (2) - 122 freq nursit (2) - 1 freq nudge (2) - 79 freq naggit (2) - 1 freq furgit (2) - 2 freq fidgit (2) - 3 freq nudged (2) - 5 freq snuggit (2) - 2 freq uggit (2) - 1 freq audit (2) - 12 freq auldgit (2) - 1 freq wuddit (2) - 1 freq wudfit (2) - 2 freq judgin (2) - 17 freq nedeit (2) - 1 freq nugget (2) - 8 freq |
nudgit (0) - 1 freq mudgit (2) - 1 freq nudgin (2) - 4 freq ludgit (2) - 5 freq auldgit (3) - 1 freq nudged (3) - 5 freq nedeit (3) - 1 freq nudest (3) - 1 freq budget (3) - 31 freq edgit (3) - 1 freq fidgit (3) - 3 freq nugget (3) - 8 freq nudges (3) - 4 freq noddit (3) - 122 freq nudge (3) - 79 freq nidgin (3) - 3 freq naggit (3) - 1 freq indulgit (4) - 1 freq midget (4) - 6 freq nudie (4) - 2 freq nidged (4) - 1 freq fudgie (4) - 4 freq neidit (4) - 1 freq budgin (4) - 3 freq needit (4) - 167 freq |
SoundEx code - N323 neatest - 1 freq noticed - 223 freq notict - 1 freq nithsdale - 7 freq noddy-cuddie - 1 freq notyst - 2 freq nottesed - 1 freq noteyst - 2 freq noteys't - 1 freq notteyst - 1 freq neediest - 1 freq noteeced - 1 freq notice't - 8 freq nudged - 5 freq naewithstannin - 1 freq nidged - 1 freq noticet - 1 freq notished - 1 freq nudest - 1 freq noteesed - 2 freq notticed - 2 freq nudgit - 1 freq neducation - 4 freq nddusty - 1 freq needstisherpinup - 1 freq noticd - 1 freq natashadevan - 1 freq ntcztnv - 1 freq |
MetaPhone code - NJT nudged - 5 freq nidged - 1 freq knidged - 1 freq nudgit - 1 freq njdy - 1 freq |
NUDGIT |
| Time to execute Levenshtein function - 0.213790 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.350316 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.028602 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.039098 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.000816 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. |