| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gladly (0) - 7 freq glaidly (1) - 2 freq gledly (1) - 5 freq ladny (2) - 1 freq madly (2) - 5 freq glad (2) - 105 freq glarry (2) - 2 freq gladys (2) - 4 freq flatly (2) - 3 freq badly (2) - 30 freq sadly (2) - 70 freq glaury (2) - 14 freq slawly (2) - 49 freq blady (2) - 1 freq deadly (2) - 18 freq lally (2) - 2 freq godly (2) - 6 freq lady (2) - 163 freq guidly (2) - 4 freq glade (2) - 1 freq glassy (2) - 2 freq glumly (2) - 1 freq ladle (2) - 8 freq laddy (2) - 1 freq glegly (2) - 18 freq |
gladly (0) - 7 freq gledly (1) - 5 freq glaidly (1) - 2 freq glade (3) - 1 freq guidly (3) - 4 freq ladle (3) - 8 freq gledlie (3) - 5 freq godly (3) - 6 freq glegly (3) - 18 freq glumly (3) - 1 freq gladys (3) - 4 freq glad (3) - 105 freq gall (4) - 4 freq glaid (4) - 26 freq girdle (4) - 15 freq golly (4) - 4 freq godley (4) - 1 freq galle (4) - 1 freq glyl (4) - 1 freq gauld (4) - 1 freq galley (4) - 4 freq glidin (4) - 7 freq ldl (4) - 2 freq guddle (4) - 34 freq gledge (4) - 1 freq |
SoundEx code - G434 glottal - 11 freq gledlie - 5 freq gladly - 7 freq glaidly - 2 freq gledly - 5 freq guiltless - 1 freq goldie-leukin - 2 freq glottals - 1 freq gleyt-like - 1 freq €˜goldilocks - 1 freq goldilocks - 1 freq 'glottal - 1 freq |
MetaPhone code - KLTL glottal - 11 freq gledlie - 5 freq gladly - 7 freq kiltle - 1 freq glaidly - 2 freq gledly - 5 freq cauldly - 4 freq cowldly - 1 freq 'glottal - 1 freq |
GLADLY |
| Time to execute Levenshtein function - 0.174833 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.340065 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.027692 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.038479 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.000935 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. |