| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| xgm (0) - 1 freq agm (1) - 2 freq xgj (1) - 1 freq rgm (1) - 1 freq bgm (1) - 1 freq xm (1) - 1 freq xxm (1) - 1 freq gm (1) - 10 freq xoem (2) - 1 freq lgr (2) - 1 freq eum (2) - 1 freq egs (2) - 2 freq vcm (2) - 1 freq lum (2) - 139 freq mgv (2) - 1 freq t'm (2) - 3 freq xmxm (2) - 1 freq wgh (2) - 1 freq zm (2) - 1 freq ago (2) - 388 freq exxm (2) - 1 freq fhm (2) - 1 freq y'm (2) - 1 freq tm (2) - 7 freq ›m (2) - 2 freq |
xgm (0) - 1 freq xm (2) - 1 freq gm (2) - 10 freq bgm (2) - 1 freq xxm (2) - 1 freq rgm (2) - 1 freq xgj (2) - 1 freq agm (2) - 2 freq exam (3) - 19 freq ixgc (3) - 1 freq gym (3) - 40 freq gum (3) - 18 freq gam (3) - 2 freq xyam (3) - 1 freq agam (3) - 1 freq gim (3) - 1 freq vogm (3) - 1 freq gme (3) - 45 freq uxfm (3) - 1 freq xoom (3) - 1 freq gem (3) - 23 freq xtmy (3) - 1 freq exxm (3) - 1 freq xoem (3) - 1 freq kgs (4) - 1 freq |
SoundEx code - X500 xn - 3 freq xoom - 1 freq xyn - 1 freq xhyn - 1 freq xm - 1 freq xoem - 1 freq xnw - 1 freq xzn - 1 freq xno - 1 freq xyam - 1 freq xsmmme - 1 freq xni - 1 freq xxm - 1 freq xgm - 1 freq |
MetaPhone code - SKM skim - 38 freq skime - 4 freq scummy - 3 freq skeem - 1 freq scum - 11 freq skame - 4 freq scoom - 2 freq scam - 11 freq scma - 3 freq skaum - 1 freq xgm - 1 freq |
XGM |
| Time to execute Levenshtein function - 0.392611 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.612406 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.059180 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.043135 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.001101 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. |