| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lanl (0) - 1 freq lan' (1) - 8 freq lael (1) - 6 freq land (1) - 352 freq lang (1) - 3250 freq lal (1) - 1 freq lan (1) - 139 freq lank (1) - 6 freq lann (1) - 1 freq lans (1) - 15 freq lane (1) - 240 freq loan (2) - 42 freq wan' (2) - 2 freq lenz (2) - 6 freq langt (2) - 2 freq lane' (2) - 2 freq vans (2) - 22 freq lyns (2) - 1 freq lfn (2) - 1 freq laam (2) - 1 freq ldl (2) - 2 freq plant (2) - 82 freq lade (2) - 26 freq anw (2) - 1 freq pall (2) - 5 freq |
lanl (0) - 1 freq lanlay (2) - 2 freq lans (2) - 15 freq lanley (2) - 1 freq lanely (2) - 33 freq lonly (2) - 2 freq lann (2) - 1 freq lane (2) - 240 freq land (2) - 352 freq lael (2) - 6 freq lank (2) - 6 freq lang (2) - 3250 freq lan (2) - 139 freq lan' (2) - 8 freq lal (2) - 1 freq lean (3) - 48 freq panel (3) - 29 freq line (3) - 497 freq laen (3) - 3 freq nal (3) - 1 freq snl (3) - 2 freq lain (3) - 18 freq lonely (3) - 38 freq laun (3) - 76 freq lny (3) - 1 freq |
SoundEx code - L540 lonely - 38 freq lanelie - 1 freq lanl - 1 freq lanely - 33 freq lionel - 2 freq loonie'll - 1 freq lonly - 2 freq linmill - 3 freq 'lonely - 1 freq lonlie - 1 freq lanlay - 2 freq lanley - 1 freq |
MetaPhone code - LNL lonely - 38 freq lanelie - 1 freq lanl - 1 freq lanely - 33 freq lionel - 2 freq loonie'll - 1 freq lonly - 2 freq 'lonely - 1 freq lonlie - 1 freq lanlay - 2 freq lanley - 1 freq |
LANL |
| Time to execute Levenshtein function - 0.316127 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.570778 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.027821 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.070222 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.000876 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. |