| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| znv (0) - 1 freq qnv (1) - 1 freq env (1) - 1 freq zns (1) - 1 freq zv (1) - 3 freq nv (1) - 5 freq znn (1) - 1 freq zn (1) - 1 freq tnv (1) - 1 freq jns (2) - 1 freq np (2) - 5 freq bov (2) - 1 freq xnw (2) - 1 freq un (2) - 31 freq dav (2) - 1 freq zeno (2) - 1 freq zap (2) - 1 freq uv (2) - 12 freq bnp (2) - 1 freq vv (2) - 1 freq ony (2) - 2222 freq 'na (2) - 58 freq kno (2) - 16 freq cnd (2) - 8 freq pnd (2) - 1 freq |
znv (0) - 1 freq znn (2) - 1 freq tnv (2) - 1 freq nv (2) - 5 freq zn (2) - 1 freq zv (2) - 3 freq qnv (2) - 1 freq env (2) - 1 freq zns (2) - 1 freq zen (3) - 8 freq zine (3) - 2 freq izna (3) - 3 freq tenv (3) - 1 freq zone (3) - 22 freq zinc (3) - 5 freq zing (3) - 3 freq nav (3) - 3 freq envy (3) - 25 freq zino (3) - 1 freq yzbv (3) - 1 freq uzn (3) - 1 freq nva (3) - 2 freq inov (3) - 1 freq zntu (3) - 1 freq gnev (3) - 1 freq |
SoundEx code - Z510 zombie - 12 freq zomb - 1 freq zumba - 2 freq zmpw - 1 freq zjmp - 1 freq znv - 1 freq zmf - 1 freq znaif - 1 freq |
MetaPhone code - SNF sniff - 28 freq snuff - 9 freq sneef - 1 freq singh - 6 freq sïnfu - 5 freq sinfu - 3 freq snoove - 4 freq sunfaa - 1 freq sneeff - 1 freq snuve - 2 freq snuffy - 14 freq €œsnuffy - 1 freq sign-aff - 1 freq singhia - 1 freq znv - 1 freq xnvah - 1 freq znaif - 1 freq 'snuff' - 1 freq |
ZNV |
| Time to execute Levenshtein function - 0.243324 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.348623 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.027816 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.036638 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.000865 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. |