| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mumping (0) - 1 freq mumpin (1) - 6 freq pumping (1) - 2 freq humping (1) - 1 freq dumping (1) - 1 freq bumping (1) - 1 freq jumping (1) - 9 freq mumphin (2) - 1 freq cuming (2) - 1 freq dumpling (2) - 3 freq dumpin (2) - 5 freq lumpin (2) - 1 freq mumpit (2) - 2 freq cupping (2) - 1 freq pumpin (2) - 19 freq musing (2) - 1 freq humpin (2) - 1 freq fuming (2) - 2 freq humming (2) - 3 freq jumpin (2) - 61 freq burping (2) - 1 freq mumbling (2) - 1 freq whumping (2) - 1 freq thumping (2) - 2 freq bumming (2) - 2 freq |
mumping (0) - 1 freq bumping (2) - 1 freq jumping (2) - 9 freq dumping (2) - 1 freq humping (2) - 1 freq mumpin (2) - 6 freq pumping (2) - 2 freq camping (3) - 3 freq bumming (4) - 2 freq sumhing (4) - 4 freq thumping (4) - 2 freq whumping (4) - 1 freq mumbling (4) - 1 freq mugging (4) - 2 freq numbing (4) - 1 freq mumphin (4) - 1 freq bumpin (4) - 9 freq cumming (4) - 1 freq cuming (4) - 1 freq burping (4) - 1 freq jumpin' (4) - 7 freq mumpit (4) - 2 freq cupping (4) - 1 freq dumpin (4) - 5 freq dumpling (4) - 3 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 - MMPNK mumping - 1 freq |
MUMPING |
| Time to execute Levenshtein function - 0.252370 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.414896 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.031852 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.037711 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.000870 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. |