| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| laldy (0) - 45 freq baldy (1) - 35 freq lally (1) - 2 freq laldy' (1) - 1 freq lady (1) - 163 freq landy (1) - 9 freq laldi (1) - 1 freq lalldy (1) - 1 freq waldy (1) - 1 freq yaldy (1) - 3 freq laidy (1) - 1 freq laddy (1) - 1 freq mally (2) - 1 freq ledy (2) - 1 freq alky (2) - 14 freq waly (2) - 27 freq lands (2) - 59 freq lade (2) - 26 freq lacky (2) - 1 freq lalor (2) - 8 freq waldo (2) - 1 freq lawvy (2) - 1 freq land (2) - 352 freq lealty (2) - 5 freq aly (2) - 5 freq |
laldy (0) - 45 freq laldi (1) - 1 freq laldee (2) - 1 freq laidy (2) - 1 freq laddy (2) - 1 freq laldie (2) - 7 freq waldy (2) - 1 freq yaldy (2) - 3 freq lalldy (2) - 1 freq baldy (2) - 35 freq lally (2) - 2 freq laldy' (2) - 1 freq landy (2) - 9 freq lady (2) - 163 freq ald (3) - 14 freq cald (3) - 8 freq laed (3) - 23 freq lindy (3) - 1 freq blady (3) - 1 freq loly (3) - 1 freq lloyd (3) - 1 freq lundy (3) - 1 freq lealry (3) - 1 freq lapd (3) - 1 freq vald (3) - 1 freq |
SoundEx code - L430 lilt - 22 freq lealtie - 9 freq laldy - 45 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 - 9 freq laldy - 45 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.174934 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.367083 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.027931 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.037417 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.000926 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. |