| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zhat (0) - 1 freq zha (1) - 1 freq hat (1) - 176 freq that (1) - 26604 freq 'hat (1) - 1 freq what (1) - 1718 freq chat (1) - 71 freq zat (1) - 11 freq shat (1) - 25 freq hah (2) - 4 freq zuaz (2) - 1 freq has (2) - 1352 freq dha (2) - 1 freq whats (2) - 18 freq whut (2) - 530 freq whae (2) - 450 freq boat (2) - 350 freq beat (2) - 207 freq chit (2) - 4 freq flat (2) - 263 freq chaw (2) - 24 freq zhuan (2) - 1 freq haq (2) - 1 freq sha (2) - 2 freq thot (2) - 21 freq |
zhat (0) - 1 freq zat (2) - 11 freq shat (2) - 25 freq what (2) - 1718 freq chat (2) - 71 freq 'hat (2) - 1 freq zha (2) - 1 freq hat (2) - 176 freq that (2) - 26604 freq chait (3) - 1 freq whit (3) - 6995 freq shoat (3) - 4 freq hot (3) - 203 freq iht (3) - 1 freq shit (3) - 109 freq whyt (3) - 12 freq shet (3) - 1 freq whot (3) - 1 freq ht (3) - 8 freq phut (3) - 7 freq hut (3) - 85 freq theat (3) - 1 freq rht (3) - 1 freq zt (3) - 2 freq thet (3) - 9 freq |
SoundEx code - Z300 zat - 11 freq zhat - 1 freq zoot - 2 freq zed - 1 freq zweite - 1 freq zit - 2 freq zt - 2 freq zat - 1 freq zct - 1 freq zowt - 1 freq zto - 1 freq zzhd - 1 freq zeta - 1 freq zxst - 1 freq zgd - 1 freq zscutu - 1 freq zxd - 1 freq zd - 1 freq zdd - 1 freq |
MetaPhone code - SHT wyceheid - 1 freq zhat - 1 freq wyseheid - 1 freq |
ZHAT |
| Time to execute Levenshtein function - 0.240980 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.473389 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.058696 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.069582 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.001044 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. |