| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| limpits (0) - 1 freq limits (1) - 15 freq limpit (1) - 1 freq limpets (1) - 2 freq jimpit (2) - 5 freq limnins (2) - 1 freq lippit (2) - 2 freq lumpit (2) - 1 freq limit (2) - 27 freq inpits (2) - 5 freq lippies (2) - 1 freq limpin (2) - 3 freq lempit (2) - 2 freq limpet (2) - 5 freq limps (2) - 1 freq lumpots (2) - 1 freq lampit (2) - 2 freq airmpits (2) - 1 freq lempets (2) - 2 freq impit (2) - 1 freq clampit (3) - 4 freq lillies (3) - 1 freq dampit (3) - 1 freq lilties (3) - 2 freq imprints (3) - 2 freq |
limpits (0) - 1 freq limpets (1) - 2 freq lumpots (2) - 1 freq lempets (2) - 2 freq limits (2) - 15 freq limpit (2) - 1 freq lampit (3) - 2 freq lempit (3) - 2 freq limpet (3) - 5 freq airmpits (3) - 1 freq limps (3) - 1 freq lumpit (3) - 1 freq laments (4) - 9 freq olympics (4) - 10 freq lamposts (4) - 1 freq tempts (4) - 2 freq lamps (4) - 36 freq leemits (4) - 19 freq lump's (4) - 2 freq bampots (4) - 8 freq lumps (4) - 24 freq impetus (4) - 3 freq inpits (4) - 5 freq limit (4) - 27 freq impit (4) - 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 - LMPTS lempets - 2 freq limpets - 2 freq limpits - 1 freq lumpots - 1 freq |
LIMPITS |
| Time to execute Levenshtein function - 0.236493 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.484089 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.029598 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.043137 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. |