| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zjf (0) - 1 freq zjfu (1) - 3 freq zif (1) - 13 freq zje (1) - 1 freq hjf (1) - 1 freq jf (1) - 1 freq zj (1) - 1 freq zmf (1) - 1 freq zf (1) - 2 freq kdf (2) - 1 freq uf (2) - 1 freq zu (2) - 4 freq bj (2) - 15 freq qlf (2) - 1 freq vj (2) - 8 freq zrr (2) - 1 freq jn (2) - 11 freq zbu (2) - 1 freq igf (2) - 1 freq ziw (2) - 1 freq js (2) - 5 freq ja (2) - 7 freq ljh (2) - 1 freq zha (2) - 1 freq zg (2) - 6 freq |
zjf (0) - 1 freq zjfu (1) - 3 freq zmf (2) - 1 freq jf (2) - 1 freq zf (2) - 2 freq zj (2) - 1 freq zif (2) - 13 freq zje (2) - 1 freq hjf (2) - 1 freq xajf (3) - 1 freq njfa (3) - 1 freq jof (3) - 1 freq zfe (3) - 1 freq adjf (3) - 1 freq zijc (3) - 1 freq jfa (3) - 1 freq zhuf (3) - 1 freq jfi (3) - 1 freq sj (4) - 2 freq owf (4) - 1 freq sjb (4) - 1 freq ju (4) - 6 freq aj (4) - 6 freq zil (4) - 1 freq fpf (4) - 1 freq |
SoundEx code - Z100 zif - 13 freq zip - 10 freq zeph - 1 freq zippy - 3 freq zap - 1 freq zjgb - 1 freq zhbh - 1 freq zypvb - 1 freq zwhfp - 1 freq zbu - 1 freq zv - 3 freq zfe - 1 freq zob - 1 freq zb - 3 freq zp - 6 freq zvi - 1 freq zppow - 2 freq zjf - 1 freq zf - 2 freq zhuf - 1 freq zsb - 1 freq zxcb - 1 freq zjfu - 3 freq zippo - 1 freq |
MetaPhone code - SJF xajf - 1 freq xijph - 1 freq zjf - 1 freq zjfu - 3 freq |
ZJF |
| Time to execute Levenshtein function - 0.230367 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.366617 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.028070 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.049113 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.000879 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. |