| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lamp (0) - 79 freq lamm (1) - 3 freq limp (1) - 20 freq laep (1) - 2 freq lamb (1) - 63 freq clamp (1) - 3 freq lam (1) - 1 freq lump (1) - 62 freq camp (1) - 53 freq slamp (1) - 1 freq jamp (1) - 34 freq lams (1) - 2 freq lame (1) - 10 freq ramp (1) - 13 freq amp (1) - 10 freq lap (1) - 71 freq lamps (1) - 36 freq lamh (1) - 1 freq damp (1) - 83 freq lama (1) - 17 freq laws (2) - 64 freq lann (2) - 1 freq haap (2) - 1 freq glame (2) - 1 freq oam (2) - 2 freq |
lamp (0) - 79 freq lump (1) - 62 freq limp (1) - 20 freq lamh (2) - 1 freq lap (2) - 71 freq ramp (2) - 13 freq amp (2) - 10 freq damp (2) - 83 freq lamm (2) - 3 freq lumpy (2) - 4 freq lama (2) - 17 freq lame (2) - 10 freq lamps (2) - 36 freq clamp (2) - 3 freq lamb (2) - 63 freq lams (2) - 2 freq lam (2) - 1 freq laep (2) - 2 freq jamp (2) - 34 freq camp (2) - 53 freq slamp (2) - 1 freq mp (3) - 39 freq yalp (3) - 2 freq maup (3) - 1 freq rump (3) - 10 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 |
LAMP |
| Time to execute Levenshtein function - 0.243553 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.543044 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.027395 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.073171 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.000880 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. |