| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lempets (0) - 2 freq limpets (1) - 2 freq leemeets (2) - 1 freq kempers (2) - 2 freq tempers (2) - 2 freq leets (2) - 18 freq tempts (2) - 2 freq limpits (2) - 1 freq lempit (2) - 2 freq leemets (2) - 1 freq lumpots (2) - 1 freq limpet (2) - 5 freq lepers (2) - 4 freq lemes (2) - 2 freq leipers (2) - 2 freq hamlets (3) - 1 freq limits (3) - 15 freq empty (3) - 207 freq keppers (3) - 1 freq leps (3) - 1 freq lessens (3) - 1 freq teets (3) - 2 freq gemme's (3) - 5 freq lamposts (3) - 1 freq lees (3) - 63 freq |
lempets (0) - 2 freq limpets (1) - 2 freq limpits (2) - 1 freq lumpots (2) - 1 freq leemeets (3) - 1 freq limpet (3) - 5 freq leemets (3) - 1 freq lempit (3) - 2 freq tempts (3) - 2 freq leemits (4) - 18 freq elemints (4) - 1 freq lamps (4) - 36 freq lampit (4) - 1 freq competes (4) - 1 freq elements (4) - 35 freq limps (4) - 1 freq laments (4) - 9 freq lamposts (4) - 1 freq impetus (4) - 3 freq lumps (4) - 21 freq limpit (4) - 1 freq lumpit (4) - 1 freq limits (4) - 15 freq tempers (4) - 2 freq leets (4) - 18 freq |
SoundEx code - L513 limbed - 1 freq lamb-pot - 1 freq lambed - 2 freq lempets - 2 freq limpet - 5 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 lampit - 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 |
LEMPETS |
| Time to execute Levenshtein function - 0.423384 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.626937 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.068000 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.039422 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.000997 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. |