| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| loyal (0) - 19 freq local (1) - 413 freq locyal (1) - 3 freq royal (1) - 174 freq toyal (1) - 1 freq royals (2) - 9 freq modal (2) - 7 freq rosal (2) - 1 freq foal (2) - 2 freq total (2) - 98 freq royaal (2) - 1 freq lotae (2) - 1 freq wdyal (2) - 1 freq floral (2) - 3 freq layan (2) - 1 freq lovan (2) - 3 freq yoal (2) - 1 freq tonal (2) - 8 freq global (2) - 51 freq loaf (2) - 82 freq lyan (2) - 29 freq coal (2) - 134 freq legal (2) - 85 freq 'royal (2) - 3 freq loma (2) - 2 freq |
loyal (0) - 19 freq lol (2) - 1606 freq lal (2) - 1 freq toyal (2) - 1 freq leal (2) - 43 freq royal (2) - 174 freq locyal (2) - 3 freq local (2) - 413 freq lyall (3) - 9 freq lovel (3) - 1 freq load (3) - 134 freq hoal (3) - 4 freq ryal (3) - 3 freq locail (3) - 44 freq loat (3) - 42 freq lora (3) - 1 freq yal (3) - 2 freq loyalty (3) - 10 freq goal (3) - 90 freq loas (3) - 2 freq poal (3) - 1 freq lya (3) - 1 freq youll (3) - 2 freq ll (3) - 69 freq lael (3) - 6 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 - LYL loyal - 19 freq lyall - 9 freq ‘loyal’ - 1 freq |
LOYAL |
| Time to execute Levenshtein function - 0.208931 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.510300 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.027947 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.068093 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.000909 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. |