| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mumpin (0) - 6 freq mumphin (1) - 1 freq mumping (1) - 1 freq dumpin (1) - 5 freq jumpin (1) - 61 freq pumpin (1) - 17 freq mumpit (1) - 2 freq humpin (1) - 1 freq lumpin (1) - 1 freq bumpin (1) - 9 freq campin (2) - 4 freq muffin (2) - 16 freq sumin (2) - 6 freq gulpin (2) - 4 freq sumkin (2) - 1 freq muttin (2) - 3 freq humpie (2) - 1 freq rumlin (2) - 1 freq tumlin (2) - 1 freq muvin (2) - 12 freq cumin (2) - 70 freq clumpin (2) - 1 freq dumpie (2) - 1 freq cummin (2) - 30 freq mimin (2) - 2 freq |
mumpin (0) - 6 freq mumpit (2) - 2 freq lumpin (2) - 1 freq bumpin (2) - 9 freq pumpin (2) - 17 freq humpin (2) - 1 freq mumphin (2) - 1 freq jumpin (2) - 61 freq mumping (2) - 1 freq dumpin (2) - 5 freq sumpn (3) - 13 freq mumps (3) - 3 freq mump (3) - 3 freq moppin (3) - 2 freq lampin (3) - 6 freq mopin (3) - 1 freq bampin (3) - 1 freq jumpan (3) - 8 freq tempin (3) - 4 freq jimpin (3) - 4 freq moupin (3) - 1 freq mumped (3) - 1 freq kempin (3) - 5 freq momin (3) - 10 freq mumph (3) - 1 freq |
SoundEx code - M515 mumpin - 6 freq 'moonbeam - 1 freq muinbeam - 1 freq moonbeam - 1 freq muinbeams - 1 freq munebeams - 1 freq mumphin - 1 freq moonbeamsdidit - 2 freq mumping - 1 freq |
MetaPhone code - MMPN mumpin - 6 freq |
MUMPIN |
| Time to execute Levenshtein function - 0.311267 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.469059 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.026884 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.040937 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.001096 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. |