| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lal (0) - 1 freq bal (1) - 6 freq yal (1) - 2 freq cal (1) - 29 freq pal (1) - 508 freq leal (1) - 43 freq law (1) - 295 freq al (1) - 237 freq eal (1) - 1 freq lae (1) - 28 freq tal (1) - 6 freq lad (1) - 563 freq lan (1) - 139 freq lab (1) - 29 freq la (1) - 116 freq lay (1) - 386 freq gal (1) - 4 freq lat (1) - 555 freq fal (1) - 4 freq lap (1) - 71 freq 'al (1) - 3 freq lah (1) - 1 freq las (1) - 8 freq lam (1) - 1 freq lag (1) - 5 freq |
lal (0) - 1 freq ll (1) - 69 freq lael (1) - 6 freq lil (1) - 10 freq leal (1) - 43 freq lol (1) - 1606 freq lila (2) - 1 freq aal (2) - 755 freq laa (2) - 114 freq sal (2) - 56 freq lau (2) - 1 freq all (2) - 1296 freq lao (2) - 3 freq hal (2) - 4 freq lgl (2) - 1 freq wal (2) - 24 freq dal (2) - 2 freq yall (2) - 3 freq ull (2) - 24 freq ell (2) - 1 freq loyal (2) - 19 freq lile (2) - 1 freq ill (2) - 411 freq leil (2) - 5 freq lily (2) - 44 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 |
LAL |
| Time to execute Levenshtein function - 0.169722 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.319020 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.027516 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.037006 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.000848 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. |