Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
lalapie (0) - 1 freq lallie (2) - 1 freq laavie (2) - 1 freq lanladie (2) - 1 freq laldie (2) - 7 freq coapie (3) - 4 freq eulalie (3) - 1 freq campie (3) - 16 freq latchie (3) - 7 freq baabie (3) - 21 freq alfie (3) - 28 freq canopie (3) - 1 freq alpin (3) - 7 freq magpie (3) - 15 freq malkie (3) - 12 freq malawi (3) - 5 freq palace (3) - 98 freq lawtie (3) - 1 freq lawdie (3) - 4 freq lippie (3) - 1 freq dalai (3) - 2 freq laikie (3) - 1 freq happie (3) - 13 freq flakie (3) - 3 freq maasie (3) - 1 freq |
lalapie (0) - 1 freq lallie (3) - 1 freq laldie (3) - 7 freq lillie (4) - 4 freq lippie (4) - 1 freq kelpie (4) - 19 freq laldee (4) - 1 freq lealtie (4) - 8 freq laldi (4) - 1 freq allyie (4) - 1 freq laavie (4) - 1 freq lanladie (4) - 1 freq allie (4) - 9 freq eulalie (4) - 1 freq laalies (4) - 3 freq lapis (5) - 1 freq wallsie (5) - 1 freq laipin (5) - 1 freq lauddie (5) - 4 freq yallae (5) - 5 freq flaapin (5) - 2 freq lile (5) - 1 freq larrie (5) - 2 freq faldie (5) - 1 freq alikie (5) - 1 freq |
SoundEx code - L410 lullaby - 7 freq lowlife - 2 freq lullabye - 1 freq lalapie - 1 freq |
MetaPhone code - LLP lalapie - 1 freq |
LALAPIE |
Time to execute Levenshtein function - 0.203597 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.383166 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.027318 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.040373 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.001330 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. |