| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lempit (0) - 2 freq lampit (1) - 2 freq leapit (1) - 2 freq tempit (1) - 11 freq lumpit (1) - 1 freq leipit (1) - 1 freq limpit (1) - 1 freq kempit (1) - 2 freq teapit (2) - 1 freq leivit (2) - 3 freq semit (2) - 1 freq clampit (2) - 4 freq legit (2) - 4 freq lumpin (2) - 1 freq keppit (2) - 17 freq limpet (2) - 5 freq leekit (2) - 1 freq limpin (2) - 3 freq lampin (2) - 6 freq leemit (2) - 14 freq leapt (2) - 11 freq leapin (2) - 6 freq clumpit (2) - 1 freq pumpit (2) - 3 freq lerrit (2) - 2 freq |
lempit (0) - 2 freq lumpit (1) - 1 freq limpit (1) - 1 freq lampit (1) - 2 freq kempit (2) - 2 freq limpet (2) - 5 freq leipit (2) - 1 freq leapit (2) - 2 freq tempit (2) - 11 freq bumpit (3) - 4 freq laupit (3) - 1 freq limit (3) - 27 freq humpit (3) - 1 freq jimpit (3) - 5 freq slumpit (3) - 2 freq impit (3) - 1 freq leimit (3) - 1 freq dampit (3) - 1 freq lowpit (3) - 72 freq dumpit (3) - 6 freq blempt (3) - 2 freq limpits (3) - 1 freq jumpit (3) - 25 freq lempets (3) - 2 freq loppit (3) - 1 freq |
SoundEx code - L513 limbed - 1 freq lamb-pot - 1 freq lambed - 2 freq lempets - 2 freq limpet - 5 freq lampit - 2 freq lamped - 2 freq limpets - 2 freq limpits - 1 freq lumped - 2 freq lumpots - 1 freq lempit - 2 freq lumpit - 1 freq limped - 1 freq lo-an-behaud - 1 freq limpit - 1 freq |
MetaPhone code - LMPT lamb-pot - 1 freq limpet - 5 freq lampit - 2 freq lamped - 2 freq lumped - 2 freq lempit - 2 freq lumpit - 1 freq limped - 1 freq limpit - 1 freq |
LEMPIT |
| Time to execute Levenshtein function - 0.233233 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.357125 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.027612 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.037596 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.001179 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. |