| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lampan (0) - 1 freq lamban (1) - 2 freq tampan (1) - 1 freq rampan (1) - 2 freq lampin (1) - 6 freq lappan (1) - 1 freq clappan (2) - 2 freq laran (2) - 2 freq laufan (2) - 1 freq laffan (2) - 1 freq limpar (2) - 1 freq lepan (2) - 1 freq lankan (2) - 2 freq lammin (2) - 2 freq gampin (2) - 1 freq lallan (2) - 6 freq lamland (2) - 1 freq rampin (2) - 4 freq lafan (2) - 1 freq laepin (2) - 1 freq bampin (2) - 1 freq japan (2) - 10 freq damian (2) - 2 freq campain (2) - 3 freq gaspan (2) - 1 freq |
lampan (0) - 1 freq lampin (1) - 6 freq lumpen (2) - 1 freq limpin (2) - 3 freq lappan (2) - 1 freq lumpin (2) - 1 freq lamban (2) - 2 freq rampan (2) - 2 freq tampan (2) - 1 freq lambin (3) - 19 freq lamps (3) - 36 freq laipin (3) - 1 freq clampin (3) - 3 freq lamped (3) - 2 freq leman (3) - 3 freq campin (3) - 4 freq laupin (3) - 2 freq jumpan (3) - 8 freq lappin (3) - 20 freq dampen (3) - 1 freq lowpan (3) - 2 freq lapin (3) - 1 freq flampin (3) - 1 freq lippan (3) - 1 freq campain (3) - 3 freq |
SoundEx code - L515 lampin - 6 freq lambin - 19 freq lanfine - 1 freq lamban - 2 freq lambing - 1 freq limpin - 3 freq lambeen - 3 freq lampan - 1 freq lumpen - 1 freq lumpin - 1 freq €˜lambing - 1 freq lambeens - 2 freq lumphinnans - 1 freq lumphanan - 1 freq lanabanana - 6 freq |
MetaPhone code - LMPN lampin - 6 freq limpin - 3 freq lampan - 1 freq lumpen - 1 freq lumpin - 1 freq |
LAMPAN |
| Time to execute Levenshtein function - 0.194841 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.344709 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.027564 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.037341 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.000957 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. |