| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lamps (0) - 36 freq lamas (1) - 20 freq lams (1) - 2 freq lamp (1) - 79 freq camps (1) - 15 freq limps (1) - 1 freq lumps (1) - 24 freq ramps (1) - 2 freq lames (1) - 1 freq laumps (1) - 1 freq laps (1) - 7 freq lambs (1) - 57 freq swamps (2) - 2 freq stamps (2) - 14 freq laws (2) - 64 freq lapis (2) - 1 freq laiks (2) - 3 freq ramos (2) - 2 freq laegs (2) - 3 freq laes (2) - 2 freq plamts (2) - 1 freq raps (2) - 1 freq rasps (2) - 11 freq lands (2) - 59 freq lambs' (2) - 3 freq |
lamps (0) - 36 freq lumps (1) - 24 freq limps (1) - 1 freq laumps (1) - 1 freq laps (2) - 7 freq ramps (2) - 2 freq lames (2) - 1 freq lambs (2) - 57 freq lamas (2) - 20 freq camps (2) - 15 freq lams (2) - 2 freq lamp (2) - 79 freq lums (3) - 34 freq leps (3) - 1 freq campos (3) - 1 freq lammas (3) - 8 freq flumps (3) - 1 freq lemes (3) - 2 freq maps (3) - 36 freq lumpy (3) - 4 freq lumms (3) - 1 freq lump (3) - 62 freq jumps (3) - 18 freq jimps (3) - 2 freq loops (3) - 4 freq |
SoundEx code - L512 lamps - 36 freq limbs - 41 freq lambs - 57 freq lumps - 24 freq line-ups - 1 freq lambies - 4 freq lamb-stew - 1 freq lambeg - 5 freq lump's - 2 freq lamppost - 1 freq lambs' - 3 freq lumbs - 1 freq lumpposts - 1 freq lampposts - 5 freq lampstan - 1 freq lamb's - 2 freq lambegs - 1 freq lambie-sheep - 1 freq lamposts - 1 freq laumps - 1 freq lambikie - 1 freq lampshade - 1 freq limps - 1 freq lewmpgxkiz - 1 freq lmubkyb - 1 freq lanpaisleymp - 2 freq lambast - 1 freq llmvc - 1 freq lnwfj - 1 freq lampjaded - 1 freq |
MetaPhone code - LMPS lamps - 36 freq lumps - 24 freq lump's - 2 freq laumps - 1 freq limps - 1 freq |
LAMPS |
| Time to execute Levenshtein function - 0.202175 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.345902 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.027438 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.037752 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.000969 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. |