| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mump (0) - 3 freq cump (1) - 1 freq bump (1) - 23 freq sump (1) - 3 freq mum (1) - 181 freq dump (1) - 31 freq mup (1) - 2 freq rump (1) - 10 freq tump (1) - 1 freq jump (1) - 85 freq mumps (1) - 3 freq mum' (1) - 1 freq mumpt (1) - 2 freq mumph (1) - 1 freq gump (1) - 1 freq pump (1) - 31 freq mums (1) - 11 freq hump (1) - 15 freq lump (1) - 62 freq mm (2) - 19 freq rum (2) - 32 freq mummy (2) - 12 freq mumzy (2) - 1 freq mml (2) - 1 freq summ (2) - 1 freq |
mump (0) - 3 freq mumph (2) - 1 freq mumpt (2) - 2 freq mum' (2) - 1 freq gump (2) - 1 freq pump (2) - 31 freq cump (2) - 1 freq hump (2) - 15 freq mums (2) - 11 freq mumps (2) - 3 freq lump (2) - 62 freq jump (2) - 85 freq sump (2) - 3 freq bump (2) - 23 freq dump (2) - 31 freq mum (2) - 181 freq mup (2) - 2 freq tump (2) - 1 freq rump (2) - 10 freq mmm (3) - 21 freq mumbo (3) - 5 freq mom (3) - 12 freq macp (3) - 1 freq jamp (3) - 34 freq mama (3) - 2 freq |
SoundEx code - M510 moniaive - 1 freq mump - 3 freq many've - 1 freq minefu - 1 freq mumbo - 5 freq moniave - 3 freq maunbe - 2 freq mumph - 1 freq minfu - 1 freq munf - 1 freq |
MetaPhone code - MMP mump - 3 freq |
MUMP |
| Time to execute Levenshtein function - 0.499308 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 - 1.116698 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.093605 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.099153 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.000986 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. |