| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zha (0) - 1 freq tha (1) - 6295 freq cha (1) - 19 freq ha (1) - 181 freq dha (1) - 1 freq zhat (1) - 1 freq 'ha (1) - 8 freq sha (1) - 2 freq wha (1) - 1886 freq zma (1) - 1 freq uha (1) - 2 freq za (1) - 3 freq lha (1) - 1 freq zh (1) - 1 freq aha (1) - 8 freq raa (2) - 38 freq thn (2) - 1 freq thj (2) - 1 freq vaa (2) - 1 freq oda (2) - 5 freq hs (2) - 5 freq thay (2) - 706 freq chan (2) - 2 freq fja (2) - 1 freq -a (2) - 2 freq |
zha (0) - 1 freq zh (1) - 1 freq za (2) - 3 freq uha (2) - 2 freq lha (2) - 1 freq cha (2) - 19 freq uzh (2) - 2 freq tha (2) - 6295 freq zma (2) - 1 freq aha (2) - 8 freq zhat (2) - 1 freq dha (2) - 1 freq wha (2) - 1886 freq ha (2) - 181 freq 'ha (2) - 8 freq sha (2) - 2 freq wh (3) - 10 freq hh (3) - 3 freq whe (3) - 1 freq haha (3) - 66 freq nh (3) - 4 freq ah (3) - 17377 freq shaa (3) - 51 freq hae (3) - 8068 freq sho (3) - 20 freq |
SoundEx code - Z000 zoo - 49 freq zha - 1 freq z - 119 freq zoe - 4 freq zz - 1 freq 'z' - 1 freq z - 3 freq zi - 3 freq zu - 4 freq z - 30 freq zc - 3 freq zcxz - 1 freq zw - 2 freq zs - 5 freq ze - 4 freq zy - 4 freq zg - 6 freq za - 3 freq zk - 3 freq zq - 6 freq zh - 1 freq zio - 1 freq zkjg - 1 freq zzzs - 1 freq zz - 6 freq zzg - 1 freq zo - 5 freq zzz's - 1 freq zzzzzzzz's - 1 freq zzzzzz - 1 freq zsk - 1 freq zzzzzzzz - 1 freq zx - 1 freq ziw - 1 freq zgz - 1 freq zqco - 1 freq zyo - 1 freq zje - 1 freq zj - 1 freq zss - 1 freq zse - 1 freq zkqx - 1 freq zqe - 1 freq |
MetaPhone code - SH zha - 1 freq seihow - 1 freq see-hoo - 1 freq see-how - 1 freq syha - 2 freq |
ZHA |
| Time to execute Levenshtein function - 0.435147 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 - 1.111201 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.084401 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.094256 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.000929 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. |