| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lol (0) - 1606 freq ol (1) - 5 freq loo (1) - 26 freq lvl (1) - 1 freq loly (1) - 1 freq vol (1) - 1 freq bol (1) - 2 freq ool (1) - 8 freq low (1) - 210 freq lod (1) - 2 freq lil (1) - 10 freq lox (1) - 1 freq lgl (1) - 1 freq ll (1) - 69 freq hol (1) - 11 freq col (1) - 11 freq ldl (1) - 2 freq pol (1) - 4 freq log (1) - 36 freq nol (1) - 1 freq lou (1) - 31 freq lll (1) - 3 freq xol (1) - 1 freq lal (1) - 1 freq loc (1) - 1 freq |
lol (0) - 1606 freq lil (1) - 10 freq ll (1) - 69 freq loly (1) - 1 freq lal (1) - 1 freq lilo (2) - 1 freq los (2) - 9 freq oll (2) - 1 freq leil (2) - 5 freq lily (2) - 44 freq lof (2) - 1 freq fol (2) - 2 freq lulu (2) - 2 freq lo (2) - 32 freq lob (2) - 5 freq dol (2) - 1 freq lyle (2) - 3 freq ell (2) - 1 freq ull (2) - 24 freq ill (2) - 405 freq lili (2) - 2 freq lael (2) - 6 freq all (2) - 1278 freq lile (2) - 1 freq loyal (2) - 18 freq |
SoundEx code - L400 leal - 43 freq lull - 7 freq loyal - 18 freq lily - 44 freq lilo - 1 freq lowly - 5 freq leill - 1 freq leil - 5 freq lal - 1 freq lila - 1 freq lillie - 4 freq lyle - 3 freq lael - 6 freq lallie - 1 freq lili - 2 freq lyall - 9 freq €˜lily - 1 freq leal- - 1 freq 'leal - 1 freq loly - 1 freq lolly - 1 freq lulu - 2 freq lil - 10 freq lally - 2 freq €˜leal - 1 freq lol - 1606 freq ‘loyalÂ’ - 1 freq lile - 1 freq |
MetaPhone code - LL leal - 43 freq lull - 7 freq lily - 44 freq lilo - 1 freq lowly - 5 freq leill - 1 freq leil - 5 freq lal - 1 freq lila - 1 freq lillie - 4 freq lyle - 3 freq lael - 6 freq lallie - 1 freq lili - 2 freq €˜lily - 1 freq leal- - 1 freq 'leal - 1 freq loly - 1 freq lolly - 1 freq lulu - 2 freq lil - 10 freq lally - 2 freq €˜leal - 1 freq lol - 1606 freq lile - 1 freq |
LOL lol - 1606 freq lols - 2 freq |
| Time to execute Levenshtein function - 0.185696 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.333516 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.028239 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.037563 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.000993 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. |