| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jamp (0) - 34 freq jams (1) - 3 freq jarmp (1) - 1 freq jamph (1) - 1 freq camp (1) - 53 freq jap (1) - 2 freq jam (1) - 80 freq jaup (1) - 3 freq lamp (1) - 79 freq amp (1) - 10 freq damp (1) - 83 freq jimp (1) - 34 freq ramp (1) - 13 freq jamb (1) - 2 freq jame (1) - 3 freq jump (1) - 84 freq jampt (1) - 1 freq kaip (2) - 2 freq jaan (2) - 1 freq limp (2) - 19 freq jammt (2) - 1 freq fami (2) - 1 freq jappt (2) - 1 freq bams (2) - 19 freq jag (2) - 26 freq |
jamp (0) - 34 freq jimp (1) - 34 freq jump (1) - 84 freq ramp (2) - 13 freq jumpy (2) - 2 freq jumpe (2) - 1 freq jame (2) - 3 freq damp (2) - 83 freq jampt (2) - 1 freq jamb (2) - 2 freq jamph (2) - 1 freq amp (2) - 10 freq jams (2) - 3 freq camp (2) - 53 freq jarmp (2) - 1 freq jap (2) - 2 freq lamp (2) - 79 freq jaup (2) - 3 freq jam (2) - 80 freq temp (3) - 734 freq rmp (3) - 1 freq jambo (3) - 5 freq jim (3) - 234 freq jammy (3) - 19 freq jamie (3) - 118 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 |
JAMP |
| Time to execute Levenshtein function - 0.196522 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.405972 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.031832 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.038550 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.000942 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. |