Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
jump (0) - 84 freq jum (1) - 3 freq lump (1) - 62 freq jimp (1) - 34 freq 'jump (1) - 2 freq jamp (1) - 34 freq jumpe (1) - 1 freq bump (1) - 23 freq sump (1) - 3 freq jumps (1) - 18 freq jumpy (1) - 2 freq pump (1) - 29 freq hump (1) - 15 freq rump (1) - 10 freq jumpt (1) - 8 freq dump (1) - 30 freq gump (1) - 1 freq cump (1) - 1 freq mump (1) - 3 freq kums (2) - 5 freq jugs (2) - 4 freq pumpt (2) - 1 freq jure (2) - 1 freq yum (2) - 22 freq jame (2) - 3 freq |
jump (0) - 84 freq jumpy (1) - 2 freq jumpe (1) - 1 freq jamp (1) - 34 freq jimp (1) - 34 freq rump (2) - 10 freq mump (2) - 3 freq jumpt (2) - 8 freq gump (2) - 1 freq hump (2) - 15 freq cump (2) - 1 freq dump (2) - 30 freq 'jump (2) - 2 freq pump (2) - 29 freq jum (2) - 3 freq bump (2) - 23 freq lump (2) - 62 freq jumps (2) - 18 freq sump (2) - 3 freq hemp (3) - 3 freq limp (3) - 19 freq jampt (3) - 1 freq jimpt (3) - 1 freq hmp (3) - 1 freq mup (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 |
JUMP jump - 84 freq jumpin - 61 freq jumps - 18 freq jumping - 9 freq jumped - 66 freq jumper - 43 freq jumpit - 25 freq jumpt - 8 freq jumpan - 8 freq jumpsuit - 3 freq |
Time to execute Levenshtein function - 0.215945 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.365034 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.027901 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.036929 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.000909 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. |