| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lonly (0) - 2 freq 'only (1) - 3 freq fonly (1) - 1 freq loly (1) - 1 freq lolly (1) - 1 freq lonely (1) - 38 freq lowly (1) - 5 freq loney (1) - 1 freq only (1) - 1876 freq onay (2) - 1 freq lanely (2) - 33 freq lorry (2) - 14 freq lundy (2) - 1 freq folly (2) - 15 freq onby (2) - 1 freq monty (2) - 23 freq lanl (2) - 1 freq ponny (2) - 1 freq only (2) - 1 freq pony (2) - 13 freq aenly (2) - 1 freq fooly (2) - 1 freq poly (2) - 12 freq lobby (2) - 87 freq blinly (2) - 2 freq |
lonly (0) - 2 freq lonely (1) - 38 freq lanlay (2) - 2 freq lanley (2) - 1 freq lonlie (2) - 1 freq lanl (2) - 1 freq lanely (2) - 33 freq only (2) - 1876 freq fonly (2) - 1 freq 'only (2) - 3 freq loly (2) - 1 freq lolly (2) - 1 freq lowly (2) - 5 freq loney (2) - 1 freq lone (3) - 9 freq lovinly (3) - 2 freq looney (3) - 3 freq onli (3) - 40 freq lovely (3) - 165 freq plenly (3) - 1 freq loner (3) - 1 freq long (3) - 549 freq lny (3) - 1 freq aznly (3) - 1 freq oanly (3) - 7 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 |
LONLY |
| Time to execute Levenshtein function - 0.208982 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.356388 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.035233 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.042464 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.001049 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. |