Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
mcfadyen (0) - 1 freq macfadyen (1) - 1 freq mcfadden (1) - 2 freq mcfadyn (1) - 1 freq madmen (3) - 1 freq mcfadden's (3) - 1 freq mcfables (3) - 1 freq mcdade (3) - 171 freq madden (3) - 3 freq mcfarlan (3) - 10 freq mclaren (3) - 1 freq mcalpin (4) - 3 freq mindeen (4) - 5 freq mcmahon (4) - 2 freq maiden (4) - 18 freq fatten (4) - 1 freq faaen (4) - 11 freq mcredie (4) - 1 freq cradlet (4) - 1 freq caasen (4) - 1 freq mcann (4) - 1 freq mccabes (4) - 1 freq maynen (4) - 1 freq faye (4) - 7 freq cradle (4) - 23 freq |
mcfadyen (0) - 1 freq mcfadyn (1) - 1 freq macfadyen (1) - 1 freq mcfadden (2) - 2 freq mcfarlan (5) - 10 freq mclaren (5) - 1 freq mcdade (5) - 171 freq madden (5) - 3 freq mcbane (6) - 7 freq mccann (6) - 10 freq mcaloon (6) - 2 freq magadan (6) - 1 freq cruden (6) - 26 freq cowden (6) - 7 freq fadin (6) - 19 freq millden (6) - 1 freq myndeen (6) - 3 freq midden (6) - 92 freq mendeen (6) - 1 freq mcqueen (6) - 1 freq mcbayne (6) - 1 freq mcfarlane (6) - 13 freq mcmann (6) - 1 freq mcbain (6) - 15 freq middeen (6) - 2 freq |
SoundEx code - M213 misobeyed - 2 freq moskovitch - 1 freq misbehauden - 1 freq misbehaudin - 1 freq macbeth - 11 freq mcbeath - 1 freq misfitted - 5 freq 'megabytes' - 1 freq mcfadyen - 1 freq mcfadden - 2 freq mcvitie's - 1 freq makshift - 3 freq megabyte - 1 freq 'macbeth' - 3 freq macbeth' - 1 freq macbeth-like - 1 freq macfadyen - 1 freq mcfadden's - 1 freq mcaveety - 2 freq misfittit - 3 freq mcfadyn - 1 freq makk-shift - 1 freq makkshift - 2 freq mesopotamia - 1 freq misfit - 1 freq misfits - 1 freq mishapit - 1 freq macfadyenangus - 1 freq missspatrice - 1 freq mockchopped - 1 freq misspotkin - 13 freq mwqhpd - 1 freq mcptrishy - 3 freq mcbot - 1 freq mkbbdkjya - 1 freq muckbootco - 1 freq mjbooth - 1 freq |
MetaPhone code - MKFTYN mcfadyen - 1 freq macfadyen - 1 freq |
MCFADYEN |
Time to execute Levenshtein function - 0.204727 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.349728 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.027036 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.037041 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.000843 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. |