| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lily (0) - 44 freq lilo (1) - 1 freq ily (1) - 2 freq lili (1) - 2 freq lil (1) - 10 freq likly (1) - 20 freq loly (1) - 1 freq lilty (1) - 1 freq oily (1) - 7 freq mily (1) - 2 freq wily (1) - 6 freq lilt (1) - 22 freq lila (1) - 1 freq lile (1) - 1 freq lied (2) - 15 freq jill (2) - 14 freq ledy (2) - 1 freq lickly (2) - 3 freq lvl (2) - 1 freq gely (2) - 2 freq zil (2) - 1 freq ilky (2) - 61 freq ill (2) - 405 freq vile (2) - 14 freq fly (2) - 179 freq |
lily (0) - 44 freq lile (1) - 1 freq lila (1) - 1 freq loly (1) - 1 freq lil (1) - 10 freq lilo (1) - 1 freq lili (1) - 2 freq ll (2) - 69 freq ill (2) - 405 freq lyle (2) - 3 freq lulu (2) - 2 freq leil (2) - 5 freq lol (2) - 1606 freq lal (2) - 1 freq ally (2) - 309 freq uill (2) - 4 freq olly (2) - 6 freq oily (2) - 7 freq mily (2) - 2 freq lilty (2) - 1 freq likly (2) - 20 freq ily (2) - 2 freq lle (2) - 1 freq wily (2) - 6 freq yill (2) - 59 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 |
LILY |
| Time to execute Levenshtein function - 0.275494 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.502461 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.029147 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.043471 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.000853 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. |