| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| modest (0) - 8 freq modes (1) - 2 freq modesty (1) - 5 freq modelt (1) - 1 freq moidert (2) - 1 freq modus (2) - 1 freq modem (2) - 2 freq model (2) - 78 freq fokest (2) - 1 freq moist (2) - 9 freq oldest (2) - 3 freq midst (2) - 33 freq merest (2) - 6 freq loodest (2) - 3 freq fondest (2) - 1 freq rodent (2) - 4 freq motes (2) - 3 freq models (2) - 18 freq honest (2) - 190 freq moses (2) - 68 freq moves (2) - 34 freq modern (2) - 144 freq moness (2) - 2 freq mostest (2) - 1 freq moyes (2) - 10 freq |
modest (0) - 8 freq modesty (1) - 5 freq midst (2) - 33 freq modelt (2) - 1 freq modes (2) - 2 freq modestie (2) - 3 freq mosst (3) - 53 freq loudest (3) - 9 freq majest (3) - 1 freq eldest (3) - 18 freq maddest (3) - 3 freq most (3) - 237 freq maest (3) - 15 freq aldest (3) - 1 freq nudest (3) - 1 freq oddest (3) - 1 freq midmest (3) - 1 freq widest (3) - 3 freq mods (3) - 3 freq oldest (3) - 3 freq merest (3) - 6 freq moist (3) - 9 freq modus (3) - 1 freq moidert (3) - 1 freq amidst (3) - 6 freq |
SoundEx code - M323 matched - 8 freq maddest - 3 freq midst - 33 freq matchit - 1 freq mates'd - 1 freq modesty - 5 freq mitigation - 2 freq matst - 1 freq midgets - 5 freq modest - 8 freq midget - 6 freq medication - 8 freq modestie - 3 freq modestine - 3 freq modestine's - 2 freq metched - 3 freq mid-east - 1 freq mid-eichties - 1 freq midgates - 1 freq matchwid - 1 freq mudgit - 1 freq mudged - 1 freq meadowsweet - 1 freq mitigate - 1 freq mydoghatesme - 1 freq midstock - 1 freq mid-echties - 1 freq midstquarter - 1 freq |
MetaPhone code - MTST maddest - 3 freq midst - 33 freq mates'd - 1 freq modesty - 5 freq matst - 1 freq modest - 8 freq modestie - 3 freq mid-east - 1 freq |
MODEST |
| Time to execute Levenshtein function - 0.175991 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.353406 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.029052 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.043309 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.001048 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. |