| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| laldi (0) - 1 freq laldy (1) - 45 freq laldie (1) - 7 freq yaldi (1) - 2 freq aldi (1) - 9 freq cald (2) - 8 freq laedin (2) - 1 freq lawd (2) - 1 freq audi (2) - 1 freq lassi (2) - 3 freq lallie (2) - 1 freq laidin (2) - 2 freq lade (2) - 26 freq wali (2) - 1 freq malti (2) - 1 freq waldit (2) - 1 freq laddy (2) - 1 freq cali (2) - 3 freq laudin (2) - 1 freq alki (2) - 1 freq baldie (2) - 23 freq laedit (2) - 1 freq bald (2) - 18 freq lapd (2) - 1 freq baldin (2) - 1 freq |
laldi (0) - 1 freq laldy (1) - 45 freq laldie (1) - 7 freq laldee (2) - 1 freq aldi (2) - 9 freq yaldi (2) - 2 freq land (3) - 352 freq lard (3) - 4 freq aald (3) - 202 freq baldy (3) - 35 freq yaldy (3) - 3 freq laid (3) - 270 freq laude (3) - 1 freq wald (3) - 2 freq waldo (3) - 1 freq lalldy (3) - 1 freq vald (3) - 1 freq laldy' (3) - 1 freq lili (3) - 2 freq laud (3) - 5 freq laada (3) - 2 freq ald (3) - 14 freq yaldie (3) - 3 freq lal (3) - 1 freq laidy (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 |
LALDI |
| Time to execute Levenshtein function - 0.186237 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.380502 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.040145 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.037709 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.000907 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. |