Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
qyac (0) - 1 freq lyan (2) - 29 freq yav (2) - 1 freq cac (2) - 1 freq 'yae (2) - 2 freq gyah (2) - 1 freq tac (2) - 22 freq quack (2) - 7 freq gya (2) - 1 freq qyms (2) - 1 freq yaq (2) - 1 freq ayar (2) - 1 freq tyan (2) - 2 freq yec (2) - 1 freq qyvf (2) - 1 freq qa (2) - 2 freq qc (2) - 2 freq gyan (2) - 104 freq yan (2) - 1 freq sync (2) - 6 freq rya (2) - 1 freq yc (2) - 4 freq quat (2) - 31 freq yqc (2) - 1 freq gyat (2) - 1 freq |
qyac (0) - 1 freq qc (2) - 2 freq yqc (2) - 1 freq qlc (3) - 1 freq qfc (3) - 1 freq ync (3) - 1 freq dac (3) - 1 freq zac (3) - 4 freq nac (3) - 4 freq vac (3) - 1 freq qwa (3) - 1 freq bac (3) - 11 freq qpic (3) - 1 freq byc (3) - 1 freq quaj (3) - 1 freq sac (3) - 14 freq qua (3) - 2 freq dyc (3) - 1 freq iquc (3) - 1 freq azac (3) - 1 freq nyc (3) - 1 freq quay (3) - 19 freq mac (3) - 48 freq qaz (3) - 1 freq qyr (3) - 1 freq |
SoundEx code - Q200 quick - 374 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 quash - 1 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 - KYK kayak - 1 freq qyac - 1 freq |
QYAC |
Time to execute Levenshtein function - 0.224640 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.368532 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.031842 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.042340 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.001286 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. |