| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lanely (0) - 33 freq lakely (1) - 2 freq lonely (1) - 38 freq anely (1) - 328 freq lately (1) - 57 freq lapels (2) - 1 freq laetly (2) - 2 freq ladel (2) - 3 freq lovely (2) - 165 freq lanky (2) - 12 freq likely (2) - 311 freq rarely (2) - 43 freq labelt (2) - 2 freq lively (2) - 10 freq lanes (2) - 11 freq awely (2) - 8 freq ralely (2) - 5 freq panels (2) - 15 freq lanlay (2) - 2 freq blately (2) - 2 freq langelt (2) - 1 freq lavey (2) - 2 freq lane' (2) - 2 freq largely (2) - 6 freq luvely (2) - 9 freq |
lanely (0) - 33 freq lonely (1) - 38 freq lanlay (2) - 2 freq lanley (2) - 1 freq lanl (2) - 1 freq lanelie (2) - 1 freq lonly (2) - 2 freq lakely (2) - 2 freq anely (2) - 328 freq lately (2) - 57 freq laytly (3) - 1 freq landy (3) - 9 freq loney (3) - 1 freq lane (3) - 240 freq manly (3) - 7 freq laekly (3) - 29 freq anly (3) - 1 freq lapel (3) - 3 freq oanly (3) - 7 freq lael (3) - 6 freq finely (3) - 3 freq label (3) - 57 freq panel (3) - 29 freq lionel (3) - 2 freq lazily (3) - 12 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 |
LANELY |
| Time to execute Levenshtein function - 0.186468 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.330561 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.027579 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.036920 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.000903 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. |