| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| laldy (0) - 42 freq lady (1) - 158 freq laddy (1) - 1 freq laidy (1) - 1 freq landy (1) - 9 freq waldy (1) - 1 freq laldi (1) - 1 freq lally (1) - 2 freq yaldy (1) - 3 freq laldy' (1) - 1 freq lalldy (1) - 1 freq baldy (1) - 28 freq ladym (2) - 2 freq ladny (2) - 1 freq malty (2) - 6 freq lauds (2) - 1 freq lawd (2) - 1 freq lando (2) - 1 freq lay (2) - 385 freq malay (2) - 1 freq laud (2) - 5 freq dalry (2) - 3 freq tally (2) - 3 freq malky (2) - 5 freq pally (2) - 12 freq |
laldy (0) - 42 freq laldi (1) - 1 freq laldy' (2) - 1 freq baldy (2) - 28 freq laldie (2) - 7 freq lady (2) - 158 freq laldee (2) - 1 freq yaldy (2) - 3 freq lalldy (2) - 1 freq lally (2) - 2 freq laidy (2) - 1 freq laddy (2) - 1 freq landy (2) - 9 freq waldy (2) - 1 freq cald (3) - 8 freq lade (3) - 26 freq ledy (3) - 1 freq ally (3) - 309 freq moldy (3) - 1 freq lanlady (3) - 5 freq ald (3) - 14 freq lolly (3) - 1 freq blady (3) - 1 freq yaldi (3) - 2 freq nald (3) - 1 freq |
SoundEx code - L430 lilt - 22 freq lealtie - 8 freq laldy - 42 freq lulled - 3 freq lilied - 1 freq lealty - 5 freq lily-white - 2 freq lilith - 3 freq laldee - 1 freq lahldie - 1 freq loyalty - 10 freq laldie - 7 freq lullt - 1 freq lalldy - 1 freq €˜loyaltie - 1 freq loyaltie - 1 freq lilty - 1 freq laldi - 1 freq laldy' - 1 freq |
MetaPhone code - LLT lilt - 22 freq lealtie - 8 freq laldy - 42 freq lulled - 3 freq lilied - 1 freq lealty - 5 freq laldee - 1 freq lahldie - 1 freq laldie - 7 freq lullt - 1 freq lalldy - 1 freq lilty - 1 freq laldi - 1 freq laldy' - 1 freq |
LALDY |
| Time to execute Levenshtein function - 0.311183 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.519814 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.028944 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.071509 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.000970 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. |