| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lonely (0) - 38 freq lovely (1) - 162 freq loney (1) - 1 freq lanely (1) - 31 freq 'lonely (1) - 1 freq lonly (1) - 2 freq honey (2) - 413 freq lakely (2) - 2 freq boney (2) - 9 freq 'lovely (2) - 1 freq toney (2) - 1 freq loodly (2) - 11 freq 'only (2) - 3 freq loosely (2) - 4 freq homely (2) - 2 freq loly (2) - 1 freq lovel (2) - 1 freq luvely (2) - 9 freq only (2) - 1847 freq lolly (2) - 1 freq closely (2) - 21 freq lowly (2) - 5 freq onnly (2) - 37 freq likely (2) - 305 freq loudly (2) - 27 freq |
lonely (0) - 38 freq lonly (1) - 2 freq lanely (1) - 31 freq lionel (2) - 2 freq 'lonely (2) - 1 freq lovely (2) - 162 freq loney (2) - 1 freq finely (3) - 3 freq lively (3) - 10 freq looney (3) - 3 freq fonly (3) - 1 freq anely (3) - 323 freq i'lonely (3) - 12 freq lone (3) - 9 freq lanl (3) - 1 freq loner (3) - 1 freq lanley (3) - 1 freq lanlay (3) - 2 freq lanelie (3) - 1 freq lately (3) - 57 freq loudly (3) - 27 freq longley (3) - 2 freq kinely (3) - 4 freq lonlie (3) - 1 freq lovel (3) - 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 |
LONELY |
| Time to execute Levenshtein function - 0.505761 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.672450 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.029570 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.075353 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.000830 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. |