| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ogmd (0) - 1 freq omg (2) - 13 freq ocd (2) - 4 freq ovid (2) - 1 freq owld (2) - 166 freq aged (2) - 34 freq xgm (2) - 1 freq gd (2) - 12 freq gnd (2) - 1 freq omm (2) - 1 freq gud (2) - 43 freq god (2) - 969 freq agm (2) - 2 freq old (2) - 178 freq bmd (2) - 1 freq odd (2) - 142 freq gmde (2) - 1 freq gmx (2) - 1 freq ogfc (2) - 1 freq obed (2) - 27 freq xmd (2) - 1 freq rgdd (2) - 1 freq oaged (2) - 1 freq ohms (2) - 1 freq ond (2) - 1 freq |
ogmd (0) - 1 freq gmde (2) - 1 freq cumd (3) - 1 freq pmd (3) - 1 freq amd (3) - 2 freq ymd (3) - 2 freq egid (3) - 1 freq gad (3) - 2 freq agad (3) - 1 freq gmdx (3) - 1 freq wmd (3) - 1 freq gyd (3) - 1 freq gamed (3) - 1 freq gwd (3) - 1 freq ged (3) - 18 freq agtd (3) - 1 freq gme (3) - 45 freq gomed (3) - 18 freq gmb (3) - 4 freq gm (3) - 10 freq oaged (3) - 1 freq gdd (3) - 2 freq gnd (3) - 1 freq gud (3) - 43 freq god (3) - 969 freq |
SoundEx code - O253 o'shanter - 7 freq oo-soond - 1 freq o'shanter's - 5 freq ogmd - 1 freq oqmdhtl - 1 freq o'shanter' - 5 freq oshanter - 1 freq |
MetaPhone code - OKMT ogmd - 1 freq |
OGMD |
| Time to execute Levenshtein function - 0.214229 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.359363 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.029385 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.038530 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.000865 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. |