Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
miserly (0) - 1 freq misery (1) - 31 freq miser's (2) - 1 freq mirly (2) - 1 freq mosely (2) - 2 freq mitherly (2) - 3 freq miserably (2) - 3 freq wisely (2) - 8 freq midderly (2) - 1 freq mistery (2) - 1 freq miser (2) - 4 freq sisterly (2) - 1 freq mistry (2) - 2 freq ainerly (2) - 2 freq misers (2) - 1 freq misel (2) - 14 freq miserie (2) - 5 freq isella (3) - 1 freq likely (3) - 311 freq missty (3) - 1 freq mily (3) - 2 freq mystery (3) - 72 freq hinnerly (3) - 1 freq majorly (3) - 2 freq mesel (3) - 59 freq |
miserly (0) - 1 freq misery (2) - 31 freq misel (3) - 14 freq miser (3) - 4 freq miserably (3) - 3 freq miserie (3) - 5 freq misers (3) - 1 freq misrule (3) - 1 freq mirly (3) - 1 freq mosely (3) - 2 freq moistly (4) - 1 freq mistral (4) - 2 freq maistly (4) - 226 freq muscly (4) - 4 freq mesell (4) - 2 freq seerly (4) - 13 freq maseyl (4) - 2 freq merle (4) - 5 freq misured (4) - 4 freq mineral (4) - 8 freq moseley (4) - 1 freq merely (4) - 12 freq meiserie (4) - 1 freq misure (4) - 8 freq meesery (4) - 5 freq |
SoundEx code - M264 mcguire'll - 1 freq mackerel - 8 freq makrel - 1 freq majorly - 2 freq micro-licht - 1 freq makar-like - 1 freq measureless - 1 freq mackerrell - 1 freq microloans - 1 freq miserly - 1 freq macsorley - 1 freq mcarle - 2 freq mccarlie - 1 freq mozzarella - 1 freq misrule - 1 freq |
MetaPhone code - MSRL miserly - 1 freq mozzarella - 1 freq misrule - 1 freq |
MISERLY |
Time to execute Levenshtein function - 0.229489 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.408572 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.027543 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.037543 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.000988 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. |