| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| japanee (0) - 7 freq japanese (1) - 16 freq japan (2) - 10 freq jaanie (2) - 1 freq jaupanese (2) - 1 freq jeanef (3) - 3 freq capone (3) - 1 freq joanie (3) - 1 freq daaner (3) - 1 freq jane (3) - 50 freq abane (3) - 28 freq apace (3) - 1 freq patane (3) - 1 freq faansee (3) - 1 freq laanen (3) - 2 freq paree (3) - 2 freq aaner (3) - 1 freq panes (3) - 9 freq janet (3) - 75 freq pane (3) - 18 freq eapbee (3) - 1 freq eapand (3) - 1 freq capable (3) - 25 freq matinee (3) - 4 freq jeane (3) - 1 freq |
japanee (0) - 7 freq japan (2) - 10 freq japanese (2) - 16 freq jaupanese (3) - 1 freq jaanie (3) - 1 freq jape (4) - 6 freq jayne (4) - 2 freq javan (4) - 4 freq jaune (4) - 1 freq joanne (4) - 1 freq jaan (4) - 1 freq japer (4) - 1 freq apone (4) - 3 freq japes (4) - 1 freq jaupin (4) - 1 freq jeanie (4) - 34 freq jeane (4) - 1 freq janie (4) - 1 freq janey (4) - 10 freq jannie (4) - 10 freq jeanne (4) - 1 freq pane (4) - 18 freq joanie (4) - 1 freq jane (4) - 50 freq capone (4) - 1 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 |
JAPANEE |
| Time to execute Levenshtein function - 0.303183 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.550790 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.028261 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.069392 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.000899 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. |