| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| laldie (0) - 7 freq laddie (1) - 567 freq baldie (1) - 23 freq laldi (1) - 1 freq laldee (1) - 1 freq lahldie (1) - 1 freq lawdie (1) - 4 freq lallie (1) - 1 freq yaldie (1) - 3 freq faldie (1) - 1 freq gadie (2) - 5 freq laldy' (2) - 1 freq laudies (2) - 1 freq adie (2) - 16 freq randie (2) - 8 freq palmie (2) - 1 freq lathie (2) - 1 freq lillie (2) - 4 freq allie (2) - 9 freq dallie (2) - 13 freq halie (2) - 83 freq laavie (2) - 1 freq aedie (2) - 1 freq laidit (2) - 9 freq lawtie (2) - 1 freq |
laldie (0) - 7 freq laldee (1) - 1 freq laldi (1) - 1 freq yaldie (2) - 3 freq laldy (2) - 42 freq lallie (2) - 1 freq faldie (2) - 1 freq laddie (2) - 567 freq lawdie (2) - 4 freq baldie (2) - 23 freq lahldie (2) - 1 freq loddie (3) - 5 freq lilied (3) - 1 freq kildie (3) - 5 freq lanladie (3) - 1 freq allied (3) - 3 freq beldie (3) - 74 freq ivaldie (3) - 2 freq yaldi (3) - 2 freq ladye (3) - 5 freq laude (3) - 1 freq goldie (3) - 3 freq leddie (3) - 28 freq bauldie (3) - 2 freq lade (3) - 26 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 |
LALDIE |
| Time to execute Levenshtein function - 0.212683 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.375445 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.027943 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.036835 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.000858 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. |