| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lolly (0) - 1 freq lowly (1) - 5 freq lally (1) - 2 freq holly (1) - 17 freq lonly (1) - 2 freq lolls (1) - 2 freq dolly (1) - 109 freq olly (1) - 6 freq molly (1) - 10 freq polly (1) - 12 freq loly (1) - 1 freq jolly (1) - 19 freq folly (1) - 15 freq golly (1) - 4 freq colly (1) - 1 freq hooly (2) - 6 freq felly (2) - 1 freq loudly (2) - 27 freq lll (2) - 3 freq oily (2) - 7 freq polls (2) - 20 freq holla (2) - 1 freq wooly (2) - 7 freq filly (2) - 8 freq €™lly (2) - 2 freq |
lolly (0) - 1 freq lally (1) - 2 freq jolly (2) - 19 freq loly (2) - 1 freq folly (2) - 15 freq polly (2) - 12 freq lull (2) - 8 freq lll (2) - 3 freq golly (2) - 4 freq colly (2) - 1 freq lowly (2) - 5 freq molly (2) - 10 freq holly (2) - 17 freq lonly (2) - 2 freq dolly (2) - 109 freq olly (2) - 6 freq lolls (2) - 2 freq lols (3) - 2 freq killy (3) - 9 freq welly (3) - 5 freq folla (3) - 19 freq foully (3) - 1 freq nilly (3) - 1 freq luvly (3) - 5 freq jelly (3) - 14 freq |
SoundEx code - L400 leal - 43 freq lull - 8 freq loyal - 19 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 - 8 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 |
LOLLY |
| Time to execute Levenshtein function - 0.270354 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.440900 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.032415 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.040473 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.001233 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. |