| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| maudlin (0) - 1 freq maudling (1) - 1 freq meddlin (2) - 5 freq haundlin (2) - 10 freq haunlin (2) - 5 freq haudin (2) - 380 freq mullin (2) - 3 freq saulin (2) - 2 freq haulin (2) - 19 freq laudin (2) - 1 freq baudkin (2) - 1 freq daudin (2) - 2 freq maukin (2) - 35 freq mauchlin (2) - 13 freq middlin (2) - 10 freq mandolin (2) - 14 freq dawdlin (2) - 2 freq moulin (2) - 1 freq mailin (2) - 3 freq paddlin (2) - 5 freq muslin (2) - 2 freq paidlin (2) - 1 freq hauflin (2) - 14 freq waddlin (2) - 2 freq laidlin (2) - 1 freq |
maudlin (0) - 1 freq maudling (2) - 1 freq madeline (3) - 1 freq moulin (3) - 1 freq paidlin (3) - 1 freq laidlin (3) - 1 freq middlin (3) - 10 freq meddlin (3) - 5 freq mailin (3) - 3 freq mandolin (3) - 14 freq muslin (3) - 2 freq mullin (3) - 3 freq maiden (4) - 18 freq madman (4) - 7 freq mullan (4) - 2 freq mirlin (4) - 3 freq amblin (4) - 3 freq millin (4) - 6 freq dailin (4) - 1 freq madmen (4) - 1 freq madainn (4) - 1 freq doodlin (4) - 2 freq weedlin (4) - 1 freq medsin (4) - 1 freq marilyn (4) - 4 freq |
SoundEx code - M345 middlins - 2 freq middlin - 10 freq midlantic - 1 freq madeline - 1 freq modellin - 3 freq meddlin - 5 freq middling - 2 freq midleen - 1 freq maitland - 27 freq middlemen - 1 freq mïddlin - 2 freq middlin-sized - 1 freq maudlin - 1 freq middlin' - 2 freq middlemist - 1 freq medallion - 1 freq midlands - 3 freq metalinguistic - 1 freq middleen - 2 freq middle-england - 1 freq maitlands - 2 freq maudling - 1 freq madeleinakay - 1 freq midlandsafa - 1 freq |
MetaPhone code - MTLN middlin - 10 freq madeline - 1 freq modellin - 3 freq meddlin - 5 freq midleen - 1 freq mïddlin - 2 freq maudlin - 1 freq middlin' - 2 freq medallion - 1 freq middleen - 2 freq |
MAUDLIN |
| Time to execute Levenshtein function - 0.259373 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.455271 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.063197 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.037671 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.000898 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. |