| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| menchies (0) - 1 freq munchies (1) - 2 freq techies (2) - 2 freq frenchies (2) - 4 freq munchie (2) - 4 freq merches (2) - 3 freq menzies (2) - 17 freq mercies (2) - 3 freq lenches (2) - 1 freq menties (2) - 1 freq feechies (2) - 1 freq wenches (2) - 2 freq benches (2) - 13 freq eechie (3) - 8 freq pinches (3) - 2 freq mulches (3) - 3 freq leeches (3) - 4 freq marches (3) - 16 freq belches (3) - 1 freq munchers (3) - 3 freq matches (3) - 41 freq kinches (3) - 8 freq weechils (3) - 1 freq pencils (3) - 9 freq mackies (3) - 4 freq |
menchies (0) - 1 freq munchies (1) - 2 freq wenches (3) - 2 freq lenches (3) - 1 freq merches (3) - 3 freq munchie (3) - 4 freq benches (3) - 13 freq manchem (4) - 1 freq bunches (4) - 7 freq munch's (4) - 4 freq lunches (4) - 7 freq inchees (4) - 1 freq inches (4) - 98 freq menaces (4) - 1 freq munchin (4) - 12 freq minchin (4) - 2 freq punches (4) - 5 freq minces (4) - 1 freq dunches (4) - 1 freq munched (4) - 3 freq finches (4) - 1 freq manche (4) - 1 freq inchis (4) - 1 freq feechies (4) - 1 freq pinches (4) - 2 freq |
SoundEx code - M522 monkey's - 3 freq manages - 14 freq menchies - 1 freq monica's - 1 freq munages - 1 freq monkhoose - 1 freq mungo's - 1 freq monkeys - 18 freq munchkin - 3 freq minces - 1 freq munch's - 4 freq meniscus - 1 freq menzies - 17 freq munka-hooses - 1 freq mankiest - 1 freq mansie's - 3 freq mumsake - 1 freq menaces - 1 freq manchester - 10 freq mangos - 1 freq mingus - 1 freq €œmingus - 1 freq mowences - 1 freq monkey-chatter - 1 freq menses - 1 freq man-size - 1 freq munchkins - 3 freq munchies - 2 freq memesisdeen - 2 freq managagin - 1 freq munchausen's - 1 freq mungoshifi - 1 freq monkeysmedia - 2 freq |
MetaPhone code - MNXS menchies - 1 freq munch's - 4 freq munchies - 2 freq |
MENCHIES |
| Time to execute Levenshtein function - 0.218047 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.372929 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.027806 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.038480 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.000940 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. |