| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zajym (0) - 1 freq ajya (2) - 1 freq ladym (2) - 2 freq zojyr (2) - 1 freq ajm (2) - 1 freq wam (3) - 1 freq latyn (3) - 1 freq lavy (3) - 3 freq ady (3) - 2 freq navy (3) - 45 freq marye (3) - 1 freq iym (3) - 2 freq mary (3) - 770 freq pays (3) - 13 freq haim (3) - 39 freq ram (3) - 33 freq hayme (3) - 1 freq qalye (3) - 1 freq nary (3) - 2 freq camm (3) - 1 freq daryl (3) - 2 freq way- (3) - 1 freq amm (3) - 1 freq waurm (3) - 1 freq paty (3) - 1 freq |
zajym (0) - 1 freq ajm (3) - 1 freq zojyr (3) - 1 freq jojom (4) - 1 freq cjem (4) - 1 freq zjmp (4) - 1 freq vijm (4) - 1 freq zjf (4) - 1 freq injum (4) - 1 freq zjfu (4) - 3 freq ljm (4) - 1 freq jojum (4) - 1 freq kjm (4) - 1 freq jum (4) - 3 freq zoom (4) - 19 freq jm (4) - 57 freq zm (4) - 1 freq jom (4) - 1 freq zj (4) - 1 freq 'jam (4) - 1 freq zje (4) - 1 freq qjm (4) - 1 freq ladym (4) - 2 freq ajya (4) - 1 freq jim (4) - 235 freq |
SoundEx code - Z250 zaakin - 1 freq zajym - 1 freq zzizkhn - 1 freq |
MetaPhone code - SJM zajym - 1 freq |
ZAJYM |
| Time to execute Levenshtein function - 0.205950 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.373351 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.031105 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.039050 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.001014 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. |