| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lexicon (0) - 9 freq mexico (2) - 8 freq mexican (2) - 2 freq legion (2) - 26 freq flexion (2) - 1 freq lexical (2) - 25 freq helicon (2) - 1 freq lenin (3) - 1 freq deacon (3) - 6 freq leuikin (3) - 1 freq lehin (3) - 4 freq lotion (3) - 4 freq leino (3) - 1 freq rubicon (3) - 3 freq levin (3) - 1 freq leivin (3) - 62 freq leich (3) - 1 freq hexagon (3) - 1 freq lexis (3) - 4 freq lexi (3) - 1 freq merican (3) - 1 freq leain (3) - 23 freq lennon (3) - 10 freq lemmon (3) - 1 freq liaison (3) - 3 freq |
lexicon (0) - 9 freq lexical (3) - 25 freq mexican (3) - 2 freq mexicano (4) - 4 freq lecn (4) - 1 freq helicon (4) - 1 freq mexico (4) - 8 freq legion (4) - 26 freq flexion (4) - 1 freq ixion (5) - 1 freq dextcn (5) - 1 freq lilico (5) - 1 freq leein (5) - 29 freq lebanon (5) - 7 freq leason (5) - 1 freq recon (5) - 1 freq vexin (5) - 5 freq leiden (5) - 3 freq silicon (5) - 1 freq leon (5) - 2 freq mexicans (5) - 1 freq lxawen (5) - 1 freq lucan (5) - 2 freq lacin (5) - 1 freq isxcn (5) - 1 freq |
SoundEx code - L225 lasagne - 11 freq lasagna - 2 freq lauchsm - 1 freq loughshannagh - 1 freq lassies-in-waitin - 4 freq lexicon - 9 freq lisaknappmusic - 1 freq lukejenglish - 2 freq lucyjanewheeler - 1 freq lisasmith - 1 freq lochkengallery - 1 freq ljesmsbrs - 1 freq |
MetaPhone code - LKSKN lexicon - 9 freq |
LEXICON |
| Time to execute Levenshtein function - 0.193193 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.321641 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.027626 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.037117 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.000895 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. |