| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jumpers (0) - 16 freq jumper (1) - 43 freq dumpers (1) - 1 freq jumper's (1) - 1 freq humphers (2) - 1 freq kempers (2) - 2 freq aumers (2) - 4 freq bumper's (2) - 1 freq japers (2) - 15 freq suppers (2) - 22 freq jimper (2) - 2 freq campers (2) - 2 freq bumper (2) - 4 freq summers (2) - 13 freq bummers (2) - 18 freq nummers (2) - 110 freq fuspers (2) - 1 freq tempers (2) - 2 freq lumper's (2) - 1 freq jumps (2) - 18 freq cumers (2) - 1 freq uppers (2) - 2 freq dumper (2) - 1 freq umbers (2) - 1 freq jumpe (2) - 1 freq |
jumpers (0) - 16 freq dumpers (2) - 1 freq jumper's (2) - 1 freq jumper (2) - 43 freq campers (3) - 2 freq tempers (3) - 2 freq jumps (3) - 18 freq jimper (3) - 2 freq jump's (3) - 1 freq kempers (3) - 2 freq japers (3) - 15 freq comperes (4) - 1 freq jumpet (4) - 1 freq jumpe (4) - 1 freq umbers (4) - 1 freq numbers (4) - 65 freq jumped (4) - 68 freq jimps (4) - 2 freq humphers (4) - 1 freq suppers (4) - 22 freq lumbers (4) - 3 freq dumper (4) - 1 freq chumpers (4) - 1 freq bummers (4) - 18 freq summers (4) - 13 freq |
SoundEx code - J516 jumpers - 16 freq jumper - 43 freq jumper's - 1 freq jennifer - 14 freq jennifer's - 1 freq jump-for-joy - 1 freq jimper - 2 freq junipere - 15 freq jamphery - 1 freq jamiefairbairn - 18 freq jnfr - 1 freq juniperquineabz - 1 freq jimmyfer - 4 freq jamiebrysoncpni - 2 freq jimfairlielogie - 1 freq janefraseralba - 1 freq janforindy - 3 freq jennifermjones - 1 freq johnfergusonhh - 1 freq johnburnswriter - 1 freq jimfairlie - 8 freq johnbrash - 25 freq jamiebrodie - 4 freq jamieparkuk - 1 freq jamiehepburn - 1 freq jschamberlain - 1 freq |
MetaPhone code - JMPRS jumpers - 16 freq jumper's - 1 freq |
JUMPERS jumper - 43 freq jumpers - 16 freq jumpe - 1 freq |
| Time to execute Levenshtein function - 0.187388 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.443428 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.030265 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.073864 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.001152 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. |