| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mucklewrath's (2) - 1 freq muckletae (4) - 2 freq muckle-great (4) - 1 freq mucklest (4) - 8 freq muckler (4) - 10 freq muckle-ish (4) - 1 freq muckle-maist (5) - 1 freq mucklef (5) - 1 freq muckle (5) - 2838 freq muckle's (5) - 13 freq lukewatt (5) - 1 freq 'celebrate (5) - 1 freq mucker (5) - 11 freq accelerate (5) - 1 freq muckle-big (5) - 1 freq bucklet (5) - 1 freq muckledom (5) - 1 freq muckers (5) - 4 freq mcgrath (5) - 1 freq clewran (5) - 1 freq duckworth (5) - 3 freq €˜celebrate (5) - 1 freq muckledug (5) - 1 freq muckleness (5) - 4 freq mcbeath (5) - 1 freq |
mucklewrath's (4) - 1 freq duckworth (7) - 3 freq muckler (7) - 10 freq muckle-ish (7) - 1 freq mucklest (7) - 8 freq muckle-great (7) - 1 freq muckletae (7) - 2 freq meiklewartle (8) - 1 freq mcgrath (8) - 1 freq micklemast (8) - 1 freq muckles (9) - 1 freq sulwath (9) - 4 freq muckle-scale (9) - 1 freq puckert (9) - 2 freq muckle-ye (9) - 1 freq muckle' (9) - 3 freq cacklefart (9) - 1 freq micro-waith (9) - 1 freq euanmcilwraith (9) - 3 freq meikleburgh (9) - 18 freq mackellar (9) - 1 freq mckletchy (9) - 1 freq mckellar (9) - 1 freq muckleboukit (9) - 1 freq hecklebrae (9) - 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 - MKLR0 |
MUCKLEWRATH |
| Time to execute Levenshtein function - 0.287748 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.575681 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.036988 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.046288 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.001097 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. |