| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| macmillan (0) - 8 freq mcmillan (1) - 8 freq macallan (2) - 3 freq imcmillan (2) - 2 freq mcmillen (2) - 1 freq macmillan's (2) - 2 freq maximilian (3) - 1 freq camilla (3) - 2 freq mclellan (3) - 15 freq mackellar (3) - 1 freq achillin (3) - 1 freq sammillar (3) - 1 freq manilla (3) - 1 freq maccolla (3) - 1 freq mairlan (3) - 1 freq mcmillan's (3) - 2 freq marvellan (3) - 1 freq millan (3) - 1 freq maclean (3) - 15 freq vanilla (4) - 6 freq milan (4) - 3 freq marzipan (4) - 2 freq galilean (4) - 2 freq sailan (4) - 5 freq mallae (4) - 4 freq |
macmillan (0) - 8 freq mcmillan (1) - 8 freq imcmillan (2) - 2 freq mcmillen (2) - 1 freq macallan (3) - 3 freq mclellan (4) - 15 freq macmillan's (4) - 2 freq mcmillan's (5) - 2 freq millan (5) - 1 freq maclean (5) - 15 freq maccolla (5) - 1 freq macavellian (5) - 1 freq marvellan (5) - 1 freq achillin (5) - 1 freq camilla (5) - 2 freq mackellar (5) - 1 freq maximilian (5) - 1 freq callan (6) - 3 freq macaloon (6) - 1 freq macfarlane (6) - 7 freq andymacmillan (6) - 1 freq mckellar (6) - 1 freq mullan (6) - 2 freq maccoll (6) - 4 freq mccolgan (6) - 3 freq |
SoundEx code - M254 macneil - 37 freq macneil's - 2 freq mcmillan - 8 freq mcmillan's - 2 freq macmillan - 8 freq macmillan's - 2 freq macsnail - 4 freq macsnail's - 1 freq mossmulloch - 1 freq mcneill - 5 freq mcneill's - 1 freq maximilian - 1 freq mcconnell - 4 freq magnolia - 2 freq macneill - 2 freq €˜maximalist - 1 freq mcnulty - 33 freq €˜mcnulty - 2 freq mcneil - 2 freq macgonnalie - 1 freq mckinlay - 8 freq mcmillen - 1 freq mcginley - 1 freq mikeymlot - 1 freq mcconnell's - 1 freq misshamiltoneng - 1 freq |
MetaPhone code - MKMLN mcmillan - 8 freq macmillan - 8 freq mcmillen - 1 freq |
MACMILLAN |
| Time to execute Levenshtein function - 0.218537 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.439512 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.028745 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.045000 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.001134 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. |