| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lila (0) - 1 freq nila (1) - 1 freq lily (1) - 44 freq lilt (1) - 22 freq lili (1) - 2 freq tila (1) - 1 freq lisa (1) - 16 freq liga (1) - 1 freq lilac (1) - 3 freq lile (1) - 1 freq lima (1) - 2 freq lika (1) - 1 freq lina (1) - 1 freq lil (1) - 10 freq lilo (1) - 1 freq eile (2) - 1 freq il (2) - 39 freq lqha (2) - 1 freq dina (2) - 43 freq eild (2) - 17 freq luca (2) - 6 freq sill (2) - 19 freq wil (2) - 13 freq wida (2) - 5 freq lama (2) - 17 freq |
lila (0) - 1 freq lile (1) - 1 freq lili (1) - 2 freq lilo (1) - 1 freq lily (1) - 44 freq lil (1) - 10 freq ill (2) - 411 freq lal (2) - 1 freq lol (2) - 1606 freq ella (2) - 26 freq ll (2) - 69 freq yill (2) - 59 freq lle (2) - 1 freq leil (2) - 5 freq loly (2) - 1 freq lulu (2) - 2 freq yilla (2) - 1 freq uill (2) - 4 freq lyle (2) - 3 freq lina (2) - 1 freq lilac (2) - 3 freq liga (2) - 1 freq lima (2) - 2 freq tila (2) - 1 freq lisa (2) - 16 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 |
LILA |
| Time to execute Levenshtein function - 0.315144 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.439381 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.027430 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.037054 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.000867 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. |