| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mudgies (0) - 1 freq budgies (1) - 1 freq midgies (1) - 20 freq mudges (1) - 1 freq pudgie (2) - 3 freq luggies (2) - 7 freq moggies (2) - 1 freq huddies (2) - 1 freq duddies (2) - 2 freq mudgit (2) - 1 freq nudges (2) - 4 freq fudgie (2) - 4 freq midges (2) - 26 freq mudgos (2) - 1 freq buggies (2) - 3 freq cludgies (2) - 7 freq maggies (2) - 2 freq ludgins (2) - 8 freq budgie (2) - 9 freq gadgies (2) - 28 freq judges (2) - 19 freq murgis (2) - 1 freq mudge (2) - 2 freq buddies (2) - 14 freq budgie's (2) - 1 freq |
mudgies (0) - 1 freq midgies (1) - 20 freq mudges (1) - 1 freq budgies (2) - 1 freq mudgos (2) - 1 freq midges (2) - 26 freq murgis (3) - 1 freq gadgies (3) - 28 freq mudge (3) - 2 freq judges (3) - 19 freq maddies (3) - 1 freq mudged (3) - 1 freq smudges (3) - 2 freq maggies (3) - 2 freq fudges (3) - 1 freq ludges (3) - 2 freq midgie (3) - 27 freq nudges (3) - 4 freq mudgit (3) - 1 freq moggies (3) - 1 freq medias (4) - 1 freq midget (4) - 6 freq mugs (4) - 17 freq modules (4) - 2 freq modifies (4) - 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 |
MUDGIES |
| Time to execute Levenshtein function - 0.381165 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.798760 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.030331 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.076715 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.000771 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. |