| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lump (0) - 62 freq lum (1) - 140 freq lup (1) - 1 freq dump (1) - 31 freq pump (1) - 31 freq lume (1) - 1 freq lumpy (1) - 4 freq plump (1) - 16 freq bump (1) - 23 freq lumps (1) - 24 freq lumn (1) - 1 freq hump (1) - 15 freq limp (1) - 20 freq slump (1) - 6 freq gump (1) - 1 freq lums (1) - 34 freq lamp (1) - 79 freq lumi (1) - 2 freq sump (1) - 3 freq clump (1) - 18 freq tump (1) - 1 freq jump (1) - 85 freq mump (1) - 3 freq rump (1) - 10 freq cump (1) - 1 freq |
lump (0) - 62 freq limp (1) - 20 freq lamp (1) - 79 freq lumpy (1) - 4 freq rump (2) - 10 freq lums (2) - 34 freq cump (2) - 1 freq lumi (2) - 2 freq sump (2) - 3 freq tump (2) - 1 freq gump (2) - 1 freq clump (2) - 18 freq jump (2) - 85 freq mump (2) - 3 freq pump (2) - 31 freq dump (2) - 31 freq lum (2) - 140 freq slump (2) - 6 freq lume (2) - 1 freq lup (2) - 1 freq plump (2) - 16 freq hump (2) - 15 freq lumps (2) - 24 freq lumn (2) - 1 freq bump (2) - 23 freq |
SoundEx code - L510 lump - 62 freq lamp - 79 freq limp - 20 freq limb - 14 freq lamb - 63 freq lambie - 3 freq launfaa - 2 freq 'lamb - 1 freq loompa - 1 freq lounfu - 1 freq lumpy - 4 freq line-up - 4 freq lanewife - 1 freq limbie - 1 freq lineup - 1 freq lambo - 1 freq lmfao - 1 freq lmvh - 1 freq |
MetaPhone code - LMP lump - 62 freq lamp - 79 freq limp - 20 freq loompa - 1 freq lumpy - 4 freq |
LUMP |
| Time to execute Levenshtein function - 0.191600 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.319818 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.028804 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.037207 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.000908 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. |