| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| matches (0) - 41 freq catches (1) - 34 freq watches (1) - 29 freq patches (1) - 22 freq latches (1) - 2 freq marches (1) - 16 freq hatches (1) - 4 freq ratches (1) - 1 freq matched (1) - 10 freq maces (2) - 1 freq mathers (2) - 2 freq lathes (2) - 1 freq swatches (2) - 16 freq matthew (2) - 140 freq watched (2) - 259 freq hatchet (2) - 1 freq smatchet (2) - 1 freq mulches (2) - 3 freq mathews (2) - 1 freq manche (2) - 1 freq matties (2) - 1 freq marshes (2) - 1 freq matchin (2) - 17 freq manchem (2) - 1 freq matchit (2) - 1 freq |
matches (0) - 41 freq hatches (2) - 4 freq matched (2) - 10 freq marches (2) - 16 freq ratches (2) - 1 freq catches (2) - 34 freq latches (2) - 2 freq watches (2) - 29 freq patches (2) - 22 freq eitches (3) - 1 freq mitchel (3) - 1 freq pitches (3) - 15 freq matchit (3) - 1 freq taiches (3) - 1 freq notches (3) - 1 freq mairches (3) - 32 freq match (3) - 177 freq paitches (3) - 1 freq fetches (3) - 4 freq hitches (3) - 2 freq witches (3) - 35 freq watchees (3) - 1 freq metched (3) - 3 freq retches (3) - 1 freq matchin (3) - 17 freq |
SoundEx code - M322 matches - 41 freq midges - 26 freq mudchucks - 2 freq motoguzzi - 1 freq midges' - 1 freq midgies - 20 freq match-stick - 1 freq mudgos - 1 freq matchstick - 1 freq mudgies - 1 freq médicis - 1 freq mitchison - 4 freq mutchkin - 1 freq mudges - 1 freq mmtkyjr - 1 freq mdzyjyvtrl - 1 freq mwydzuk - 1 freq meatsack - 1 freq mdtyewcukz - 1 freq |
MetaPhone code - MXS matches - 41 freq mochs - 4 freq mauchs - 1 freq maeshies - 1 freq mesha's - 1 freq muchas - 1 freq |
MATCHES |
| Time to execute Levenshtein function - 0.287686 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.514510 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.060855 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.037143 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.000944 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. |