| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| limps (0) - 1 freq limes (1) - 1 freq limms (1) - 1 freq lips (1) - 198 freq jimps (1) - 2 freq limos (1) - 1 freq gimps (1) - 4 freq pimps (1) - 1 freq limp (1) - 20 freq limbs (1) - 41 freq lims (1) - 2 freq glimps (1) - 1 freq wimps (1) - 1 freq lamps (1) - 36 freq lumps (1) - 24 freq imps (1) - 3 freq lisps (1) - 1 freq lipn (2) - 1 freq limpin (2) - 3 freq glimpse (2) - 20 freq leps (2) - 1 freq lemes (2) - 2 freq clims (2) - 1 freq limpets (2) - 2 freq glims (2) - 8 freq |
limps (0) - 1 freq lumps (1) - 24 freq lamps (1) - 36 freq laumps (2) - 1 freq wimps (2) - 1 freq lips (2) - 198 freq imps (2) - 3 freq limes (2) - 1 freq lisps (2) - 1 freq glimps (2) - 1 freq limms (2) - 1 freq jimps (2) - 2 freq lims (2) - 2 freq gimps (2) - 4 freq limos (2) - 1 freq pimps (2) - 1 freq limp (2) - 20 freq limbs (2) - 41 freq limpet (3) - 5 freq leaps (3) - 7 freq pumps (3) - 13 freq kemps (3) - 4 freq limpit (3) - 1 freq flumps (3) - 1 freq lumpy (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 |
LIMPS |
| Time to execute Levenshtein function - 0.219315 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.363859 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.027724 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.053026 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.000931 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. |