| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jimp (0) - 34 freq jims (1) - 2 freq jump (1) - 84 freq jimpt (1) - 1 freq jip (1) - 4 freq gimp (1) - 3 freq limp (1) - 19 freq jimi (1) - 1 freq jimps (1) - 2 freq imp (1) - 3 freq jim (1) - 234 freq wimp (1) - 1 freq jamp (1) - 34 freq zjmp (2) - 1 freq jint (2) - 6 freq rump (2) - 10 freq jaup (2) - 3 freq temp (2) - 734 freq pip (2) - 7 freq camp (2) - 53 freq dims (2) - 3 freq aims (2) - 13 freq sip (2) - 23 freq jike (2) - 5 freq imn (2) - 2 freq |
jimp (0) - 34 freq jamp (1) - 34 freq jump (1) - 84 freq imp (2) - 3 freq jim (2) - 234 freq jumpe (2) - 1 freq jumpy (2) - 2 freq jimps (2) - 2 freq wimp (2) - 1 freq jimpt (2) - 1 freq jimi (2) - 1 freq gimp (2) - 3 freq jip (2) - 4 freq jims (2) - 2 freq limp (2) - 19 freq bump (3) - 23 freq romp (3) - 2 freq dump (3) - 30 freq jimmy (3) - 136 freq pomp (3) - 2 freq kemp (3) - 46 freq jumps (3) - 18 freq jap (3) - 2 freq jimbo (3) - 1 freq jimac (3) - 2 freq |
SoundEx code - J510 jump - 84 freq jumpy - 2 freq 'jump - 2 freq jamph - 1 freq jamb - 2 freq jamp - 34 freq jimp - 34 freq jumbo - 13 freq jumpe - 1 freq 'jump' - 2 freq jambo - 5 freq jimbo - 1 freq jnb - 1 freq jmwv - 1 freq jeanef - 3 freq janephi - 1 freq |
MetaPhone code - JMP jump - 84 freq jumpy - 2 freq gimp - 3 freq 'jump - 2 freq jamp - 34 freq jimp - 34 freq jumpe - 1 freq 'jump' - 2 freq |
JIMP |
| Time to execute Levenshtein function - 0.210811 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.320704 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.027494 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.036592 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.000856 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. |