| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| janmjax (0) - 3 freq manajan (3) - 1 freq janela (3) - 5 freq januar (3) - 34 freq janila (3) - 1 freq tanja (3) - 1 freq jakman (3) - 2 freq janwar (3) - 2 freq jannai (3) - 3 freq ajax (3) - 1 freq canmnae (3) - 1 freq jamma (3) - 1 freq janet (4) - 75 freq randan (4) - 5 freq ran-dan (4) - 2 freq jangle (4) - 5 freq wan-man (4) - 1 freq iammas (4) - 2 freq naamah (4) - 2 freq jammt (4) - 1 freq calmac (4) - 1 freq tamar (4) - 2 freq wanlas (4) - 1 freq janey (4) - 10 freq elemjay (4) - 2 freq |
janmjax (0) - 3 freq jamma (6) - 1 freq ajax (6) - 1 freq jonam (6) - 3 freq jonjo (6) - 3 freq jmaj (6) - 1 freq jannai (6) - 3 freq jinx (6) - 1 freq canmnae (6) - 1 freq januar (6) - 34 freq janela (6) - 5 freq manajan (6) - 1 freq janwar (6) - 2 freq janila (6) - 1 freq jakman (6) - 2 freq tanja (6) - 1 freq jane's (7) - 1 freq jonsar (7) - 588 freq jammy (7) - 19 freq banjo (7) - 17 freq animal (7) - 101 freq jammie (7) - 2 freq imax (7) - 3 freq janus (7) - 1 freq naaman (7) - 2 freq |
SoundEx code - J522 jamesy's - 1 freq jameses - 1 freq junkies - 9 freq janice's - 1 freq johnnycakes - 1 freq jimsie's - 7 freq junky's - 1 freq jamsie's - 1 freq €˜junkies - 1 freq jcjmjuoj - 1 freq jankosfuller - 1 freq janmjax - 3 freq jamiejaycar - 1 freq jameshogg - 1 freq |
MetaPhone code - JNMJKS janmjax - 3 freq |
JANMJAX |
| Time to execute Levenshtein function - 0.205406 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.343951 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.028361 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.037669 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.000902 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. |