| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lanlay (0) - 2 freq lanlady (1) - 5 freq lanley (1) - 1 freq wanlas (2) - 1 freq anly (2) - 1 freq landlady (2) - 9 freq lankan (2) - 2 freq manly (2) - 7 freq lallan (2) - 6 freq langa (2) - 1 freq lanely (2) - 31 freq allay (2) - 1 freq landan (2) - 2 freq laldy (2) - 42 freq aglay (2) - 1 freq lanky (2) - 11 freq sanday (2) - 13 freq lonly (2) - 2 freq lanl (2) - 1 freq lanka (2) - 7 freq malay (2) - 1 freq annay (2) - 4 freq landy (2) - 9 freq oanly (2) - 7 freq finlay (2) - 18 freq |
lanlay (0) - 2 freq lanley (1) - 1 freq lanely (2) - 31 freq lanl (2) - 1 freq lonly (2) - 2 freq lanlady (2) - 5 freq landy (3) - 9 freq oanly (3) - 7 freq lally (3) - 2 freq lonely (3) - 38 freq lanelie (3) - 1 freq lanky (3) - 11 freq finlay (3) - 18 freq lanka (3) - 7 freq manly (3) - 7 freq langa (3) - 1 freq lonlie (3) - 1 freq allay (3) - 1 freq anly (3) - 1 freq canal (4) - 27 freq laenan (4) - 1 freq dunloy (4) - 4 freq blinly (4) - 2 freq hanle (4) - 4 freq lanies (4) - 1 freq |
SoundEx code - L540 lonely - 38 freq lanelie - 1 freq lanl - 1 freq lanely - 31 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 - 31 freq lionel - 2 freq loonie'll - 1 freq lonly - 2 freq 'lonely - 1 freq lonlie - 1 freq lanlay - 2 freq lanley - 1 freq |
LANLAY |
| Time to execute Levenshtein function - 0.186330 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.351643 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.027061 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.037120 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.000818 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. |