| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| leill (0) - 1 freq neill (1) - 17 freq weill (1) - 378 freq feill (1) - 3 freq leil (1) - 5 freq ee'll (2) - 12 freq leitil (2) - 1 freq levils (2) - 1 freq swill (2) - 2 freq spill (2) - 24 freq deila (2) - 1 freq heile (2) - 1 freq refill (2) - 3 freq lyall (2) - 9 freq deil (2) - 196 freq nell (2) - 13 freq dell (2) - 8 freq yill (2) - 59 freq haill (2) - 411 freq ye'll (2) - 962 freq ie'll (2) - 1 freq will (2) - 3306 freq thill (2) - 1 freq atill (2) - 3 freq leif (2) - 2 freq |
leill (0) - 1 freq neill (2) - 17 freq lll (2) - 3 freq lyall (2) - 9 freq lull (2) - 8 freq feill (2) - 3 freq leil (2) - 5 freq weill (2) - 378 freq weell (3) - 1 freq lilt (3) - 22 freq neilly (3) - 12 freq bell (3) - 215 freq yell (3) - 57 freq oneill (3) - 2 freq mill (3) - 82 freq alll (3) - 1 freq hell (3) - 375 freq pill (3) - 12 freq duill (3) - 1 freq uill (3) - 4 freq lekly (3) - 2 freq wuill (3) - 1 freq kell (3) - 1 freq faill (3) - 1 freq level (3) - 148 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 |
LEILL |
| Time to execute Levenshtein function - 0.478203 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.759507 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.052810 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.043333 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.001011 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. |