| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| qheqq (0) - 1 freq heiq (2) - 1 freq theyd (3) - 10 freq mhvq (3) - 1 freq quene (3) - 12 freq cheap (3) - 51 freq where (3) - 706 freq cheyp (3) - 1 freq shei (3) - 34 freq tyqq (3) - 1 freq heir (3) - 44 freq aheed (3) - 5 freq whein (3) - 50 freq hel (3) - 15 freq thev (3) - 3 freq helm (3) - 15 freq hqt (3) - 1 freq hen' (3) - 2 freq cheir (3) - 9 freq heiqj (3) - 1 freq hege (3) - 2 freq cheke (3) - 5 freq he'l (3) - 13 freq the'r (3) - 275 freq ahein (3) - 1 freq |
qheqq (0) - 1 freq heiq (4) - 1 freq qht (5) - 38 freq qnq (5) - 1 freq chpq (5) - 1 freq hdq (5) - 1 freq cheque (5) - 20 freq yqq (5) - 1 freq hhqs (5) - 1 freq qho (5) - 1 freq whyqx (5) - 1 freq qhi (5) - 1 freq hzqe (5) - 1 freq quhen (5) - 4 freq qpvuq (5) - 1 freq hsq (5) - 1 freq thopqq (5) - 1 freq hqv (5) - 1 freq hq (5) - 7 freq rcqq (5) - 1 freq nqq (5) - 1 freq woqq (5) - 4 freq qlijq (5) - 1 freq qhv (5) - 1 freq qh (5) - 4 freq |
SoundEx code - Q200 quick - 371 freq queues - 9 freq quiz - 19 freq 'quiz - 1 freq quaich - 25 freq 'quick - 5 freq qwak - 1 freq quasi - 1 freq queue's - 1 freq queys - 1 freq qweek - 1 freq quoys - 24 freq queek - 22 freq qwik - 4 freq qwick - 4 freq qu'she - 2 freq quacks - 1 freq quickie - 1 freq quake - 7 freq quack - 7 freq quiche - 3 freq quïck - 6 freq quik - 5 freq queasy - 2 freq queeck - 1 freq quahog - 1 freq quaak - 3 freq €œquick - 3 freq queazy - 1 freq quyk - 1 freq €˜quick - 1 freq quhase - 1 freq quäck - 1 freq quhais - 1 freq qwqa - 1 freq qois - 1 freq qheqq - 1 freq qikz - 1 freq qsihiz - 1 freq qwaez - 1 freq qwz - 1 freq qkwskq - 1 freq quaj - 1 freq qyac - 1 freq qaz - 1 freq qis - 1 freq qejg - 1 freq qiyx - 1 freq qex - 1 freq qxyk - 1 freq qwkqs - 1 freq qiki - 1 freq |
MetaPhone code - KHK khaki - 5 freq quahog - 1 freq qheqq - 1 freq |
QHEQQ |
| Time to execute Levenshtein function - 0.228855 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.398071 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.035297 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.048749 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.001004 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. |