| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mudges (0) - 1 freq nudges (1) - 4 freq fudges (1) - 2 freq mudgos (1) - 1 freq mudged (1) - 1 freq midges (1) - 26 freq judges (1) - 19 freq mudgies (1) - 1 freq smudges (1) - 2 freq ludges (1) - 2 freq mudge (1) - 2 freq nudge (2) - 79 freq munes (2) - 4 freq judge (2) - 222 freq badges (2) - 11 freq sudgers (2) - 5 freq edges (2) - 32 freq budge (2) - 12 freq rudge (2) - 1 freq budgets (2) - 6 freq modes (2) - 2 freq mages (2) - 1 freq dodges (2) - 1 freq hudge (2) - 1 freq midges' (2) - 1 freq |
mudges (0) - 1 freq midges (1) - 26 freq mudgies (1) - 1 freq mudgos (1) - 1 freq smudges (2) - 2 freq midgies (2) - 20 freq mudge (2) - 2 freq ludges (2) - 2 freq judges (2) - 19 freq nudges (2) - 4 freq fudges (2) - 2 freq mudged (2) - 1 freq radges (3) - 1 freq midgets (3) - 5 freq budgies (3) - 1 freq midge (3) - 10 freq hedges (3) - 38 freq mudgit (3) - 1 freq madge (3) - 9 freq aedges (3) - 3 freq murgis (3) - 1 freq gadges (3) - 1 freq fidges (3) - 2 freq wedges (3) - 1 freq wadges (3) - 1 freq |
SoundEx code - M322 matches - 41 freq midges - 26 freq mudchucks - 2 freq motoguzzi - 1 freq midges' - 1 freq midgies - 20 freq match-stick - 1 freq mudgos - 1 freq matchstick - 1 freq mudgies - 1 freq médicis - 1 freq mitchison - 4 freq mutchkin - 1 freq mudges - 1 freq mmtkyjr - 1 freq mdzyjyvtrl - 1 freq mwydzuk - 1 freq meatsack - 1 freq mdtyewcukz - 1 freq |
MetaPhone code - MJS midges - 26 freq mojo's - 1 freq midges' - 1 freq midgies - 20 freq mages - 1 freq mudgies - 1 freq mudges - 1 freq mbjs - 1 freq |
MUDGES |
| Time to execute Levenshtein function - 0.241841 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.356838 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.029575 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.037190 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.000893 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. |