| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nudged (0) - 5 freq nudges (1) - 4 freq budged (1) - 1 freq nidged (1) - 1 freq ludged (1) - 7 freq mudged (1) - 1 freq judged (1) - 16 freq nudge (1) - 79 freq nagged (2) - 3 freq dodged (2) - 6 freq cudgel (2) - 1 freq hedged (2) - 2 freq nodded (2) - 70 freq trudged (2) - 6 freq mugged (2) - 1 freq nursed (2) - 5 freq dunged (2) - 1 freq nidge (2) - 2 freq nudie (2) - 2 freq edged (2) - 9 freq hudded (2) - 1 freq lunged (2) - 3 freq ludger (2) - 4 freq grudged (2) - 1 freq bulged (2) - 4 freq |
nudged (0) - 5 freq nidged (1) - 1 freq nudge (2) - 79 freq mudged (2) - 1 freq judged (2) - 16 freq nudges (2) - 4 freq ludged (2) - 7 freq budged (2) - 1 freq cadged (3) - 1 freq juidged (3) - 4 freq lodged (3) - 6 freq neded (3) - 3 freq radged (3) - 1 freq wedged (3) - 3 freq knidged (3) - 1 freq hodged (3) - 3 freq nigged (3) - 1 freq nudgin (3) - 4 freq wadged (3) - 1 freq fidged (3) - 7 freq nidge (3) - 2 freq nodded (3) - 70 freq nudgit (3) - 1 freq hedged (3) - 2 freq dodged (3) - 6 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 |
NUDGED |
| Time to execute Levenshtein function - 0.212447 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.336826 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.027754 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.038272 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. |