| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ctdqb (0) - 1 freq cdb (2) - 1 freq dqb (2) - 1 freq czdq (2) - 1 freq ctdg (2) - 1 freq td's (3) - 3 freq coyb (3) - 1 freq stab (3) - 12 freq cedk (3) - 1 freq cods (3) - 2 freq cnd (3) - 8 freq crumb (3) - 7 freq tub (3) - 22 freq coda (3) - 3 freq trb (3) - 1 freq gtfdfb (3) - 1 freq tq (3) - 2 freq xyqb (3) - 1 freq cbqc (3) - 1 freq cod (3) - 20 freq tab (3) - 7 freq chpq (3) - 1 freq cudna (3) - 165 freq cqd (3) - 1 freq ttdku (3) - 1 freq |
ctdqb (0) - 1 freq ctdg (4) - 1 freq czdq (4) - 1 freq cdb (4) - 1 freq dqb (4) - 1 freq ctodd (5) - 1 freq coq (6) - 1 freq cdgm (6) - 1 freq stfdb (6) - 1 freq comb (6) - 19 freq ctau (6) - 1 freq utq (6) - 2 freq dub (6) - 27 freq curb (6) - 1 freq cmq (6) - 1 freq utb (6) - 1 freq jhdqd (6) - 2 freq crib (6) - 7 freq cbb (6) - 4 freq csd (6) - 11 freq wemqb (6) - 1 freq cjb (6) - 5 freq ttkq (6) - 1 freq csmb (6) - 1 freq std (6) - 1 freq |
SoundEx code - C321 code-shift - 1 freq catch-up - 2 freq cityscape - 1 freq catchphrase - 2 freq catchup - 1 freq ctdqb - 1 freq chatsabit - 1 freq |
MetaPhone code - KTTKB ctdqb - 1 freq |
CTDQB |
| Time to execute Levenshtein function - 0.208225 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.353187 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.027760 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.037451 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.000879 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. |