| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mclilvanney (0) - 1 freq mcilvanney (1) - 9 freq mcivanney (2) - 1 freq mclilveen (4) - 1 freq mcilvanneys (4) - 1 freq mcginley (5) - 1 freq mcmillan's (5) - 2 freq marianne (5) - 1 freq liammcilvanney (5) - 4 freq mclellan's (5) - 2 freq mcinnes (5) - 19 freq mcmillan (5) - 8 freq mclellan (5) - 15 freq mulaney (5) - 1 freq mcleans (6) - 1 freq cannen (6) - 3 freq mcginty (6) - 7 freq clearances (6) - 12 freq cowlraine (6) - 2 freq manned (6) - 6 freq mclver (6) - 2 freq mcgincy (6) - 1 freq mcmillen (6) - 1 freq delaney (6) - 10 freq livener (6) - 1 freq |
mclilvanney (0) - 1 freq mcilvanney (2) - 9 freq mcivanney (4) - 1 freq mclilveen (5) - 1 freq mclellan (7) - 15 freq millennia (8) - 4 freq mcilvanneys (8) - 1 freq mclennan (8) - 10 freq mcglynn (8) - 2 freq mcmillan (8) - 8 freq mclellan's (8) - 2 freq cuillanain (8) - 1 freq liammcilvanney (8) - 4 freq mcalpine (9) - 8 freq millans (9) - 1 freq scotlann (9) - 1 freq mccann (9) - 10 freq macmillan (9) - 8 freq mckelvie (9) - 1 freq maclunkey (9) - 1 freq mcllroy (9) - 1 freq mclaren (9) - 1 freq clelland (9) - 2 freq millan (9) - 1 freq imcmillan (9) - 2 freq |
SoundEx code - M244 mclellan - 15 freq mclellan's - 2 freq mclilvanney - 1 freq muzzle-loader - 1 freq maclellan's - 1 freq mclilveen - 1 freq mcclelland - 1 freq |
MetaPhone code - MKLLFN mclilvanney - 1 freq mclilveen - 1 freq |
MCLILVANNEY |
| Time to execute Levenshtein function - 1.001116 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 - 2.097747 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.100664 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.210797 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.075868 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. |