| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| japan (0) - 10 freq jaan (1) - 1 freq javan (1) - 4 freq jaas (2) - 15 freq satan (2) - 24 freq apae (2) - 4 freq pagan (2) - 17 freq lapin (2) - 1 freq jakin (2) - 1 freq haman (2) - 1 freq raxan (2) - 3 freq jaa (2) - 31 freq jaupin (2) - 1 freq faan (2) - 70 freq jappt (2) - 1 freq papay (2) - 8 freq eatan (2) - 1 freq awan (2) - 1 freq laran (2) - 2 freq naan (2) - 2 freq lafan (2) - 1 freq aman (2) - 2 freq cavan (2) - 1 freq jason (2) - 24 freq savan (2) - 1 freq |
japan (0) - 10 freq jaupin (2) - 1 freq japanee (2) - 7 freq jaan (2) - 1 freq javan (2) - 4 freq jumpan (3) - 8 freq apin (3) - 13 freq rapin (3) - 2 freq paean (3) - 2 freq hopan (3) - 6 freq jap (3) - 2 freq jonan (3) - 2 freq 'apen (3) - 2 freq apen (3) - 70 freq apon (3) - 90 freq papin (3) - 2 freq copan (3) - 1 freq capon (3) - 1 freq jape (3) - 6 freq yappan (3) - 1 freq gupan (3) - 1 freq rypan (3) - 1 freq jappin (3) - 1 freq jan (3) - 27 freq span (3) - 17 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 |
JAPAN |
| Time to execute Levenshtein function - 0.184955 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.350058 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.028311 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.039718 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.001188 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. |