| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gumption (0) - 12 freq gumptious (2) - 1 freq demption (2) - 1 freq dumpin (3) - 5 freq duration (3) - 5 freq lumpin (3) - 1 freq audition (3) - 8 freq gulpin (3) - 4 freq quastion (3) - 2 freq kempton (3) - 4 freq question (3) - 405 freq uptoon (3) - 1 freq assumption (3) - 12 freq dumplin (3) - 25 freq motion (3) - 45 freq gumpick (3) - 1 freq option (3) - 51 freq umpteen (3) - 15 freq summation (3) - 1 freq numptics (3) - 1 freq guttin (3) - 17 freq mutation (3) - 1 freq ruction (3) - 1 freq quistion (3) - 8 freq pumpin (3) - 17 freq |
gumption (0) - 12 freq demption (3) - 1 freq gumptious (3) - 1 freq umpteen (4) - 15 freq temptin (4) - 10 freq kempton (4) - 4 freq exemption (4) - 2 freq gampin (4) - 1 freq bumpin (5) - 9 freq adaption (5) - 1 freq grumpian (5) - 4 freq dumpin (5) - 5 freq jumpin (5) - 61 freq mumphin (5) - 1 freq humpin (5) - 1 freq emotion (5) - 18 freq mumpin (5) - 6 freq grumphin (5) - 2 freq caption (5) - 1 freq gummin (5) - 1 freq competin (5) - 3 freq ympteen (5) - 1 freq gemstone (5) - 1 freq egyptian (5) - 5 freq temptan (5) - 2 freq |
SoundEx code - G513 gaan-aboot - 1 freq gaun-aboot - 2 freq gumption - 12 freq gan-aboot - 1 freq gunpouder - 1 freq gun-butts - 1 freq gumptious - 1 freq gunpooder - 3 freq gunpowder - 1 freq gambitman - 1 freq goanabootbiddy - 7 freq gameofthrones - 1 freq gamebtw - 1 freq gkmmabt - 1 freq |
MetaPhone code - KMPXN gumption - 12 freq |
GUMPTION |
| Time to execute Levenshtein function - 0.279996 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.435668 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.033742 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.041827 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.001005 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. |