| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| x-medium (0) - 1 freq medium (2) - 71 freq imodium (3) - 1 freq smeddum (3) - 111 freq comedian (4) - 5 freq momentum (4) - 6 freq helium (4) - 8 freq imdoium (4) - 1 freq medi- (4) - 1 freq nomadism (4) - 1 freq medics (4) - 4 freq ummidius (4) - 2 freq 'heedrum (4) - 1 freq podium (4) - 6 freq humdrum (4) - 3 freq comedie (4) - 3 freq media' (4) - 1 freq sometim (4) - 1 freq msmedia (4) - 1 freq immediat (4) - 1 freq medias (4) - 1 freq eediom (4) - 15 freq €˜smeddum (4) - 1 freq medic (4) - 3 freq media (4) - 268 freq |
x-medium (0) - 1 freq medium (4) - 71 freq imodium (5) - 1 freq ex-meadow (6) - 1 freq ex-model (6) - 1 freq smeddum (6) - 111 freq imdoium (6) - 1 freq premium (7) - 2 freq madrum (7) - 1 freq mediat (7) - 1 freq xmd (7) - 1 freq media (7) - 268 freq comedic (7) - 1 freq remedies (7) - 4 freq modem (7) - 4 freq xmxm (7) - 1 freq madam (7) - 19 freq medic (7) - 3 freq elmadam (7) - 3 freq -dom (7) - 2 freq stadium (7) - 25 freq sodium (7) - 1 freq nomadism (7) - 1 freq media' (7) - 1 freq comedie (7) - 3 freq |
SoundEx code - X535 xanthin - 1 freq x-medium - 1 freq xndmni - 1 freq |
MetaPhone code - SMTM smeddum - 111 freq sometime - 30 freq sumtime - 3 freq sometim - 1 freq 'sometime - 1 freq sometym - 1 freq x-medium - 1 freq €˜smeddum - 1 freq 'smeddum' - 1 freq |
X-MEDIUM |
| Time to execute Levenshtein function - 0.216218 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.420652 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.035207 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.045420 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.000892 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. |