| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| miserly (0) - 1 freq misery (1) - 31 freq mistry (2) - 2 freq ainerly (2) - 2 freq wisely (2) - 8 freq miser's (2) - 1 freq sisterly (2) - 1 freq mistery (2) - 1 freq miserie (2) - 5 freq miser (2) - 4 freq misel (2) - 14 freq mosely (2) - 2 freq mitherly (2) - 3 freq misers (2) - 1 freq mirly (2) - 1 freq midderly (2) - 1 freq miserably (2) - 3 freq widely (3) - 25 freq mister- (3) - 1 freq mieras (3) - 5 freq mirky (3) - 17 freq miner (3) - 6 freq masell (3) - 67 freq mesell (3) - 2 freq timely (3) - 4 freq |
miserly (0) - 1 freq misery (2) - 31 freq mosely (3) - 2 freq misers (3) - 1 freq misel (3) - 14 freq misrule (3) - 1 freq miser (3) - 4 freq miserably (3) - 3 freq mirly (3) - 1 freq miserie (3) - 5 freq misured (4) - 4 freq miserable (4) - 56 freq muscly (4) - 4 freq mesel (4) - 59 freq moistly (4) - 1 freq merely (4) - 12 freq miseries (4) - 2 freq mostly (4) - 15 freq missile (4) - 6 freq misures (4) - 9 freq moseley (4) - 1 freq maistly (4) - 222 freq seerly (4) - 13 freq miesel (4) - 1 freq mineral (4) - 8 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.200259 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.458724 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.026884 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.040393 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.001043 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. |