| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| qcwql (0) - 1 freq qcqd (2) - 1 freq qwqa (2) - 1 freq lwqx (3) - 1 freq qnq (3) - 1 freq powl (3) - 6 freq qcvqhn (3) - 1 freq sowel (3) - 87 freq qcck (3) - 1 freq quail (3) - 5 freq lcwey (3) - 1 freq wqj (3) - 1 freq cbqc (3) - 1 freq twal (3) - 120 freq cwilk (3) - 2 freq qheqq (3) - 1 freq towl (3) - 2 freq schdl (3) - 1 freq qzw (3) - 1 freq ackwal (3) - 3 freq quell (3) - 5 freq cpyl (3) - 1 freq qcy (3) - 1 freq icgml (3) - 1 freq qq (3) - 4 freq |
qcwql (0) - 1 freq qwqa (4) - 1 freq qcqd (4) - 1 freq cweel (5) - 3 freq scowl (5) - 10 freq qwyml (5) - 1 freq qweel (5) - 1 freq cowl (5) - 8 freq zwqil (5) - 1 freq scweel (5) - 6 freq cmq (6) - 1 freq qwz (6) - 1 freq scqf (6) - 1 freq bwqe (6) - 1 freq qwmi (6) - 1 freq scaal (6) - 1 freq qbal (6) - 1 freq owl (6) - 61 freq qcby (6) - 1 freq caul (6) - 79 freq iwq (6) - 1 freq cel (6) - 1 freq qmqe (6) - 1 freq wqn (6) - 1 freq clpl (6) - 9 freq |
SoundEx code - Q240 quickly - 191 freq queekly - 6 freq qwickly - 1 freq quicklie - 2 freq queeklee - 1 freq qcwql - 1 freq |
MetaPhone code - KKKL coca-cola - 1 freq qcwql - 1 freq |
QCWQL |
| Time to execute Levenshtein function - 0.429946 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.786047 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.075637 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.037892 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.000958 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. |