| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jampt (0) - 1 freq jammt (1) - 1 freq jamph (1) - 1 freq campt (1) - 2 freq jumpt (1) - 8 freq jappt (1) - 1 freq jamp (1) - 34 freq dampt (1) - 3 freq jimpt (1) - 1 freq jammy (2) - 19 freq lapt (2) - 3 freq appt (2) - 1 freq ramps (2) - 2 freq lamp (2) - 79 freq jump (2) - 85 freq jumpy (2) - 3 freq tamet (2) - 1 freq jaupit (2) - 1 freq james (2) - 283 freq jaips (2) - 1 freq compt (2) - 1 freq hapt (2) - 5 freq hempt (2) - 1 freq stampt (2) - 4 freq damt (2) - 2 freq |
jampt (0) - 1 freq jumpt (1) - 8 freq jimpt (1) - 1 freq campt (2) - 2 freq jammt (2) - 1 freq jumpit (2) - 25 freq jumpet (2) - 1 freq jimpit (2) - 5 freq jappt (2) - 1 freq jamph (2) - 1 freq jamp (2) - 34 freq dampt (2) - 3 freq lampit (3) - 2 freq jumps (3) - 18 freq pumpt (3) - 1 freq bampot (3) - 30 freq rampit (3) - 2 freq dampit (3) - 1 freq jimps (3) - 2 freq jammit (3) - 2 freq jimp (3) - 34 freq tempt (3) - 9 freq campit (3) - 2 freq mumpt (3) - 2 freq jumpe (3) - 1 freq |
SoundEx code - J513 jumped - 68 freq jumpit - 25 freq jimpit - 5 freq jumpet - 1 freq jimped - 6 freq jumpt - 8 freq jimpt - 1 freq jumbotronic - 1 freq jampt - 1 freq jumped-up - 1 freq jimbett - 1 freq johnnyabdn - 5 freq johnpdrummond - 6 freq johnfothering - 2 freq jamiepaterek - 8 freq joannafidalgo - 1 freq |
MetaPhone code - JMPT jumped - 68 freq jumpit - 25 freq jimpit - 5 freq jumpet - 1 freq jimped - 6 freq jumpt - 8 freq jimpt - 1 freq jampt - 1 freq |
JAMPT |
| Time to execute Levenshtein function - 0.193499 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.374995 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.030556 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.040147 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.005236 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. |