| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| leal (0) - 43 freq meal (1) - 130 freq teal (1) - 2 freq lea (1) - 155 freq 'leal (1) - 1 freq leil (1) - 5 freq lea' (1) - 1 freq feal (1) - 1 freq heal (1) - 27 freq leaz (1) - 1 freq leav (1) - 1 freq peal (1) - 3 freq leas (1) - 14 freq deal (1) - 194 freq lead (1) - 193 freq leah (1) - 1 freq legal (1) - 85 freq weal (1) - 8 freq leat (1) - 1 freq zeal (1) - 2 freq leak (1) - 8 freq leal- (1) - 1 freq beal (1) - 3 freq leaf (1) - 40 freq veal (1) - 2 freq |
leal (0) - 43 freq lal (1) - 1 freq leil (1) - 5 freq leap (2) - 17 freq seal (2) - 31 freq eal (2) - 1 freq leam (2) - 17 freq lear (2) - 107 freq leaf (2) - 40 freq neal (2) - 1 freq veal (2) - 2 freq lean (2) - 48 freq lael (2) - 6 freq lil (2) - 10 freq yell (2) - 57 freq loyal (2) - 19 freq iell (2) - 2 freq beal (2) - 3 freq ell (2) - 1 freq lol (2) - 1606 freq real (2) - 592 freq ll (2) - 69 freq feal (2) - 1 freq heal (2) - 27 freq leaz (2) - 1 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 |
LEAL |
| Time to execute Levenshtein function - 0.190437 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.378288 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.059069 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.038127 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.000916 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. |