| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| marlon (0) - 1 freq marion (1) - 42 freq maroon (1) - 9 freq parton (2) - 4 freq marco (2) - 5 freq marten (2) - 1 freq barron (2) - 7 freq sablon (2) - 1 freq marley (2) - 4 freq barton (2) - 3 freq salon (2) - 10 freq parlor (2) - 1 freq maxton (2) - 1 freq matron (2) - 2 freq marlit (2) - 1 freq garron (2) - 6 freq gallon (2) - 13 freq marled (2) - 2 freq barlow (2) - 1 freq marrow (2) - 32 freq martin (2) - 47 freq carton (2) - 7 freq garson (2) - 2 freq margin (2) - 3 freq mirlin (2) - 3 freq |
marlon (0) - 1 freq merlin (2) - 6 freq marilyn (2) - 4 freq mirlin (2) - 3 freq marion (2) - 42 freq maroon (2) - 9 freq mairlan (2) - 1 freq tarlan (3) - 4 freq moron (3) - 4 freq muirlan (3) - 4 freq marlowe (3) - 1 freq carlin (3) - 6 freq markin (3) - 17 freq melon (3) - 6 freq marvin (3) - 8 freq marl (3) - 1 freq marconi (3) - 1 freq harlin (3) - 3 freq marlex (3) - 1 freq martyn (3) - 1 freq margin (3) - 3 freq marley (3) - 4 freq mailin (3) - 3 freq merton (3) - 4 freq marlit (3) - 1 freq |
SoundEx code - M645 mairlan - 1 freq maryland - 2 freq muirland - 6 freq morelaun - 1 freq marilyn - 4 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 - 4 freq mirrlin - 1 freq mirlin - 3 freq muirlan - 4 freq merlin - 6 freq muirlaun - 1 freq marlon - 1 freq |
MARLON |
| Time to execute Levenshtein function - 0.293755 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.392251 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.027755 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.037276 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.000878 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. |