| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gump (0) - 1 freq lump (1) - 62 freq gums (1) - 16 freq jump (1) - 85 freq mump (1) - 3 freq gup (1) - 2 freq gumph (1) - 1 freq gum (1) - 19 freq gulp (1) - 13 freq sump (1) - 3 freq gimp (1) - 3 freq pump (1) - 31 freq dump (1) - 31 freq cump (1) - 1 freq tump (1) - 1 freq rump (1) - 10 freq hump (1) - 15 freq grump (1) - 3 freq bump (1) - 23 freq dup (2) - 5 freq gap (2) - 49 freq damp (2) - 83 freq yum (2) - 22 freq aums (2) - 1 freq hup (2) - 6 freq |
gump (0) - 1 freq gimp (1) - 3 freq cump (2) - 1 freq dump (2) - 31 freq tump (2) - 1 freq pump (2) - 31 freq hump (2) - 15 freq gmpe (2) - 1 freq grump (2) - 3 freq rump (2) - 10 freq bump (2) - 23 freq jump (2) - 85 freq lump (2) - 62 freq gums (2) - 16 freq sump (2) - 3 freq mump (2) - 3 freq gulp (2) - 13 freq gup (2) - 2 freq gum (2) - 19 freq gumph (2) - 1 freq mp (3) - 39 freq hemp (3) - 3 freq gaip (3) - 1 freq jumpe (3) - 1 freq wimp (3) - 1 freq |
SoundEx code - G510 gimp - 3 freq geneva - 16 freq gnef - 1 freq gumph - 1 freq geneva' - 2 freq gnap - 1 freq gameboy - 1 freq gmb - 4 freq gmpe - 1 freq gambo - 1 freq gnev - 1 freq gump - 1 freq |
MetaPhone code - KMP camp - 53 freq compo - 2 freq comp - 3 freq kemp - 46 freq cump - 1 freq kempie - 1 freq kempe - 3 freq kempy - 2 freq 'camp - 1 freq campie - 16 freq gmpe - 1 freq compy - 1 freq gump - 1 freq |
GUMP |
| Time to execute Levenshtein function - 0.218667 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.352202 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.029115 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.037303 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.000933 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. |