| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| muckler (0) - 10 freq muckle' (1) - 3 freq muckles (1) - 1 freq mucker (1) - 11 freq muckle (1) - 2854 freq mukkler (1) - 1 freq mucklef (1) - 1 freq buckles (2) - 2 freq mueckle (2) - 2 freq uckle (2) - 1 freq 'muckle (2) - 2 freq mucklest (2) - 8 freq mucked (2) - 4 freq fucker (2) - 22 freq kuckles (2) - 1 freq pucker (2) - 1 freq huckle (2) - 11 freq buckled (2) - 7 freq sucker (2) - 3 freq mucke (2) - 1 freq suckled (2) - 3 freq luckier (2) - 5 freq tickler (2) - 4 freq zucker (2) - 1 freq ruckle (2) - 2 freq |
muckler (0) - 10 freq mukkler (2) - 1 freq mucklef (2) - 1 freq muckle (2) - 2854 freq mucker (2) - 11 freq muckle' (2) - 3 freq muckles (2) - 1 freq tickler (3) - 4 freq mucklie (3) - 1 freq mickle (3) - 13 freq mueckle (3) - 2 freq muckly (3) - 1 freq cockler (3) - 1 freq bucklet (4) - 1 freq ruckles (4) - 1 freq huckles (4) - 1 freq buckle (4) - 12 freq muckers (4) - 4 freq muffler (4) - 1 freq mockery (4) - 9 freq muckle-ye (4) - 1 freq muckletae (4) - 2 freq puckles (4) - 14 freq muckle's (4) - 13 freq mukle (4) - 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 |
MUCKLER |
| Time to execute Levenshtein function - 0.215706 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.423974 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.034170 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.039973 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.001004 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. |