| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| juppen (0) - 4 freq wuppen (1) - 1 freq suppen (1) - 1 freq cruppen (2) - 4 freq jumper (2) - 43 freq jumpe (2) - 1 freq suppin (2) - 9 freq jurgen (2) - 1 freq heppen (2) - 11 freq tuppens (2) - 1 freq 'upper (2) - 1 freq tuppeny (2) - 1 freq wupped (2) - 7 freq happen (2) - 386 freq upped (2) - 5 freq wappen (2) - 5 freq upper (2) - 55 freq jappin (2) - 1 freq supper (2) - 173 freq jungen (2) - 1 freq cuppin (2) - 6 freq jumpan (2) - 8 freq supped (2) - 4 freq suppan (2) - 1 freq muppet (2) - 11 freq |
juppen (0) - 4 freq suppen (2) - 1 freq jappin (2) - 1 freq wuppen (2) - 1 freq cuppin (3) - 6 freq appen (3) - 25 freq pappen (3) - 1 freq yappen (3) - 5 freq jumpan (3) - 8 freq suppan (3) - 1 freq japped (3) - 2 freq nippen (3) - 1 freq oppen (3) - 31 freq wappen (3) - 5 freq gappen (3) - 2 freq jumpin (3) - 61 freq 'appen (3) - 1 freq suppin (3) - 9 freq uppin (3) - 1 freq toppen (3) - 1 freq rippen (3) - 5 freq heppen (3) - 11 freq tuppeny (3) - 1 freq wuppin (3) - 1 freq happen (3) - 386 freq |
SoundEx code - J150 japan - 10 freq jabbin - 8 freq jaupin - 1 freq jobnny - 1 freq jeavin - 1 freq jowpin - 1 freq jovian - 3 freq juppen - 4 freq japanee - 7 freq javan - 4 freq jaw-bane - 1 freq jappin - 1 freq jpm - 1 freq jvooeom - 1 freq |
MetaPhone code - JPN japan - 10 freq jaupin - 1 freq gypin - 3 freq jowpin - 1 freq juppen - 4 freq japanee - 7 freq jappin - 1 freq |
JUPPEN |
| Time to execute Levenshtein function - 0.209789 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.355524 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.034117 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.038654 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.000948 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. |