| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mcllroy (0) - 1 freq mcilroy (1) - 1 freq milroy (2) - 3 freq molloy (2) - 4 freq mckilroy (2) - 1 freq mclardy (2) - 1 freq million (3) - 156 freq melro (3) - 1 freq mellay (3) - 1 freq mckirdy (3) - 1 freq elroy (3) - 2 freq cllrs (3) - 1 freq clerty (3) - 2 freq mclerse (3) - 2 freq mctardy (3) - 1 freq mellow (3) - 4 freq mullion (3) - 1 freq clarty (3) - 56 freq cllr (3) - 3 freq mcleod (3) - 10 freq mchardy (3) - 8 freq mullguy (3) - 1 freq mccoy (3) - 63 freq cloy (3) - 1 freq mally (3) - 1 freq |
mcllroy (0) - 1 freq mcilroy (2) - 1 freq mckilroy (3) - 1 freq cllr (4) - 3 freq mclardy (4) - 1 freq milroy (4) - 3 freq molloy (4) - 4 freq mcgerry (5) - 1 freq clarry (5) - 2 freq molly (5) - 10 freq mally (5) - 1 freq mclver (5) - 2 freq scullery (5) - 91 freq miller (5) - 56 freq mccleery (5) - 1 freq millar (5) - 11 freq mullguy (5) - 1 freq mcclure (5) - 20 freq mclaren (5) - 1 freq mcaloon (5) - 2 freq mcgrory (5) - 2 freq mclerse (5) - 2 freq mellow (5) - 4 freq cllrs (5) - 1 freq melro (5) - 1 freq |
SoundEx code - M246 muscular - 8 freq muckler - 10 freq mukkler - 1 freq mcclure - 20 freq mccleery - 1 freq mckilroy - 1 freq mislearit - 6 freq macclure - 1 freq mcllroy - 1 freq mcilroy - 1 freq maclaren's - 1 freq mucklewrath's - 1 freq myslary - 1 freq mcclure's - 2 freq mcclurg - 17 freq mackellar - 1 freq mclerse - 2 freq mckellar - 1 freq mclaren - 1 freq misleart - 1 freq meiklewartle - 1 freq mglr - 1 freq mcilroyrory - 2 freq michaelrosenyes - 2 freq michelrouxjr - 1 freq mclarenmerc - 1 freq missclark - 2 freq mclardy - 1 freq |
MetaPhone code - MKLR muckler - 10 freq mukkler - 1 freq mckilroy - 1 freq mcllroy - 1 freq mackellar - 1 freq mckellar - 1 freq mglr - 1 freq |
MCLLROY |
| Time to execute Levenshtein function - 0.460443 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.722978 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.086573 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.098594 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.000989 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. |