| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mumbliin (0) - 1 freq mumblin (1) - 2 freq mumblan (2) - 1 freq rumblin (2) - 12 freq humblin (2) - 1 freq fumblin (2) - 1 freq tumblin (2) - 5 freq mumblins (2) - 1 freq mummlin (2) - 7 freq mumbling (2) - 1 freq jummlin (3) - 1 freq mummlan (3) - 2 freq bumflin (3) - 1 freq tummlin (3) - 26 freq rumplin (3) - 1 freq bumbling (3) - 2 freq dumplin (3) - 25 freq stumblin (3) - 9 freq mbblin (3) - 1 freq humbling (3) - 1 freq mumbles (3) - 4 freq rumblan (3) - 1 freq amblin (3) - 3 freq mullin (3) - 3 freq tumblan (3) - 2 freq |
mumbliin (0) - 1 freq mumblin (1) - 2 freq mumblan (2) - 1 freq mumblins (3) - 1 freq mummlin (3) - 7 freq tumblin (3) - 5 freq mumbling (3) - 1 freq fumblin (3) - 1 freq humblin (3) - 1 freq rumblin (3) - 12 freq gamblin (4) - 9 freq tumblan (4) - 2 freq amblin (4) - 3 freq mumble (4) - 3 freq mumbled (4) - 6 freq mummilin (4) - 1 freq rumblan (4) - 1 freq ramblin (4) - 4 freq mumblet (4) - 2 freq gemblin (4) - 1 freq mbblin (4) - 1 freq wamblin (4) - 1 freq mumbles (4) - 4 freq mummlan (4) - 2 freq mullion (5) - 1 freq |
SoundEx code - M514 mumbles - 4 freq minefield - 4 freq manipulate - 2 freq monopoly - 3 freq minneapolis - 1 freq mumble - 3 freq manipulatin - 4 freq minefields - 1 freq manfully - 1 freq mumbled - 6 freq mumbult - 2 freq mumblin - 2 freq menfolk - 1 freq mumblan - 1 freq monieplied - 1 freq maneepulaaters - 1 freq mumbliin - 1 freq manipulation - 2 freq manipulates - 2 freq manipulant - 1 freq mumblet - 2 freq mumblins - 1 freq manipulated - 1 freq mamaphilz - 1 freq man-flu - 1 freq mumbling - 1 freq mineapolis - 1 freq |
MetaPhone code - MMLN mummlin - 7 freq mummilin - 1 freq mumblin - 2 freq mummlan - 2 freq mumblan - 1 freq mumbliin - 1 freq |
MUMBLIIN |
| Time to execute Levenshtein function - 0.219389 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.393894 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.029110 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.037585 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.001042 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. |