| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| laldi (0) - 1 freq laldie (1) - 7 freq aldi (1) - 9 freq laldy (1) - 42 freq yaldi (1) - 2 freq lady (2) - 158 freq laads (2) - 7 freq lally (2) - 2 freq lardit (2) - 1 freq galti (2) - 1 freq nald (2) - 1 freq lahldie (2) - 1 freq landit (2) - 52 freq laed (2) - 23 freq lands (2) - 56 freq laidin (2) - 2 freq laldy' (2) - 1 freq laedin (2) - 1 freq lad' (2) - 3 freq waldo (2) - 1 freq laude (2) - 1 freq cali (2) - 3 freq mardi (2) - 2 freq cardi (2) - 2 freq lcxdi (2) - 1 freq |
laldi (0) - 1 freq laldy (1) - 42 freq laldie (1) - 7 freq laldee (2) - 1 freq yaldi (2) - 2 freq aldi (2) - 9 freq wald (3) - 2 freq baldy (3) - 28 freq lallie (3) - 1 freq baldie (3) - 23 freq laud (3) - 5 freq landy (3) - 9 freq ald (3) - 14 freq lawdie (3) - 4 freq lalldy (3) - 1 freq waldy (3) - 1 freq lad (3) - 548 freq laddie (3) - 567 freq laid (3) - 269 freq lawd (3) - 1 freq land (3) - 340 freq alfdi (3) - 1 freq bald (3) - 16 freq yaldie (3) - 3 freq lal (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 |
LALDI |
| Time to execute Levenshtein function - 0.247296 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.353681 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.028473 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.040286 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.000882 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. |