Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
merlin (0) - 6 freq merrin (1) - 1 freq mellin (1) - 64 freq mewlin (1) - 1 freq mertin (1) - 2 freq derlin (1) - 1 freq mirlin (1) - 3 freq berlin (1) - 14 freq merkin (1) - 6 freq smirlin (2) - 1 freq mercia (2) - 13 freq mailin (2) - 3 freq rellin (2) - 1 freq meelie (2) - 3 freq marvin (2) - 7 freq erling (2) - 1 freq setlin (2) - 1 freq meanin (2) - 200 freq declin (2) - 1 freq mellins (2) - 1 freq beilin (2) - 3 freq tellin (2) - 603 freq merrie (2) - 7 freq meetin (2) - 147 freq merci (2) - 1 freq |
merlin (0) - 6 freq mirlin (1) - 3 freq berlin (2) - 14 freq derlin (2) - 1 freq marlon (2) - 1 freq merkin (2) - 6 freq merrin (2) - 1 freq mertin (2) - 2 freq mewlin (2) - 1 freq mellin (2) - 64 freq yorlin (3) - 12 freq mormin (3) - 1 freq norlin (3) - 170 freq martin (3) - 47 freq mervelin (3) - 1 freq marilyn (3) - 3 freq purlin (3) - 1 freq millin (3) - 6 freq mirkin (3) - 1 freq hurlin (3) - 20 freq emergin (3) - 6 freq muirlan (3) - 4 freq merles (3) - 1 freq harlin (3) - 3 freq gurlin (3) - 4 freq |
SoundEx code - M645 mairlan - 1 freq maryland - 2 freq muirland - 6 freq morelaun - 1 freq marilyn - 3 freq mirrlin - 1 freq moorlaand - 1 freq mirlin - 3 freq mirrland - 2 freq muirlan - 4 freq moorland - 3 freq merlin - 6 freq muirlans - 1 freq muirlaun - 1 freq marlon - 1 freq merlin's - 2 freq merielmyers - 2 freq |
MetaPhone code - MRLN mairlan - 1 freq morelaun - 1 freq marilyn - 3 freq mirrlin - 1 freq mirlin - 3 freq muirlan - 4 freq merlin - 6 freq muirlaun - 1 freq marlon - 1 freq |
MERLIN |
Time to execute Levenshtein function - 0.513343 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 - 1.200923 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.095947 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.099194 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.000780 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. |