Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
mclarenmerc (0) - 1 freq clarence's (4) - 1 freq clarence (4) - 2 freq mclaren (4) - 1 freq careert (5) - 1 freq coarners (5) - 9 freq clarker (5) - 4 freq clanger (5) - 1 freq clarendon (5) - 1 freq careers (5) - 12 freq gadarenesc (5) - 1 freq 'lavender (5) - 1 freq maclaren's (5) - 1 freq mccartney (5) - 1 freq clarinet (5) - 3 freq ecoarner (5) - 1 freq carpenter (5) - 4 freq coarner (5) - 47 freq clammert (5) - 1 freq mariner (5) - 4 freq career (5) - 66 freq capener (5) - 36 freq charmer (5) - 3 freq larners (5) - 10 freq pilgremer (5) - 1 freq |
mclarenmerc (0) - 1 freq mclaren (7) - 1 freq clarence (7) - 2 freq maclaren's (8) - 1 freq clarence's (8) - 1 freq larners (9) - 10 freq mariner (9) - 4 freq clangers (9) - 1 freq charmer (9) - 3 freq sclammer (9) - 2 freq cranmore (9) - 1 freq clearance (9) - 16 freq amilaurenreid (9) - 2 freq coarner (9) - 47 freq sclenters (9) - 1 freq clairance (9) - 1 freq clammert (9) - 1 freq clarker (9) - 4 freq clanger (9) - 1 freq clarendon (9) - 1 freq glirnmerin (9) - 1 freq lornmac (9) - 1 freq ecoarner (9) - 1 freq clarinet (9) - 3 freq coarners (9) - 9 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 - MKLRNMRK mclarenmerc - 1 freq |
MCLARENMERC |
Time to execute Levenshtein function - 0.397408 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.602041 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.039214 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.063964 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.001119 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. |