| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zjfu (0) - 3 freq zjf (1) - 1 freq jf (2) - 1 freq zu (2) - 4 freq jfk (2) - 1 freq edfu (2) - 1 freq tju (2) - 1 freq zjmp (2) - 1 freq jfa (2) - 1 freq zif (2) - 13 freq jfv (2) - 1 freq zbu (2) - 1 freq 'fu (2) - 1 freq fu (2) - 379 freq zfe (2) - 1 freq fju (2) - 1 freq xju (2) - 1 freq zj (2) - 1 freq awfu (2) - 132 freq bfu (2) - 1 freq zmf (2) - 1 freq hjf (2) - 1 freq zf (2) - 2 freq zntu (2) - 1 freq tofu (2) - 2 freq |
zjfu (0) - 3 freq zjf (1) - 1 freq zmf (3) - 1 freq zj (3) - 1 freq hjf (3) - 1 freq jfi (3) - 1 freq zje (3) - 1 freq njfa (3) - 1 freq zf (3) - 2 freq zfe (3) - 1 freq jfa (3) - 1 freq jf (3) - 1 freq zif (3) - 13 freq zhuf (4) - 1 freq zojyr (4) - 1 freq zijc (4) - 1 freq zulu (4) - 2 freq jpu (4) - 1 freq zajym (4) - 1 freq xfu (4) - 1 freq jru (4) - 1 freq ju (4) - 6 freq adjf (4) - 1 freq joyfu (4) - 10 freq arfu (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 |
ZJFU |
| Time to execute Levenshtein function - 0.406577 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.566963 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.034567 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.042303 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.000892 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. |