| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| qb (0) - 2 freq qg (1) - 1 freq ab (1) - 25 freq cb (1) - 3 freq mb (1) - 5 freq zb (1) - 3 freq qby (1) - 1 freq hb (1) - 9 freq qc (1) - 2 freq lb (1) - 4 freq kb (1) - 4 freq qub (1) - 4 freq qu (1) - 2 freq vb (1) - 1 freq pb (1) - 2 freq qi (1) - 1 freq qs (1) - 2 freq qa (1) - 2 freq qh (1) - 4 freq rb (1) - 8 freq 'b (1) - 1 freq qw (1) - 4 freq q (1) - 95 freq wb (1) - 4 freq gb (1) - 2 freq |
qb (0) - 2 freq qby (1) - 1 freq qub (1) - 4 freq qj (2) - 3 freq dqb (2) - 1 freq fb (2) - 27 freq db (2) - 2 freq ub (2) - 3 freq jb (2) - 2 freq ob (2) - 2 freq tb (2) - 14 freq qq (2) - 4 freq qbt (2) - 1 freq b (2) - 745 freq qm (2) - 1 freq qf (2) - 3 freq qd (2) - 1 freq qo (2) - 28 freq qz (2) - 1 freq qp (2) - 7 freq ib (2) - 1 freq sb (2) - 4 freq qx (2) - 1 freq qt (2) - 5 freq nb (2) - 4 freq |
SoundEx code - Q100 quip - 2 freq qub - 4 freq qvha - 1 freq qhv - 1 freq qb - 2 freq qzaf - 1 freq qyvf - 1 freq qf - 3 freq qcf - 1 freq qvi - 1 freq qzv - 1 freq quhv - 1 freq qfw - 1 freq qcby - 1 freq qp - 7 freq qby - 1 freq qkf - 1 freq qv - 3 freq qzp - 1 freq qjjuby - 1 freq qpo - 1 freq qevh - 1 freq qkjph - 1 freq qph - 1 freq qjvv - 1 freq qffbf - 1 freq qkkf - 1 freq |
MetaPhone code - KB gab - 32 freq cowboy - 16 freq gob - 14 freq cb - 3 freq gub - 30 freq cube - 4 freq gub' - 2 freq gabbie - 1 freq cub - 3 freq cubbie - 2 freq gbh - 3 freq cowboay' - 1 freq cab - 15 freq qub - 4 freq go-by - 2 freq wgbh - 1 freq gaub - 1 freq gabe - 1 freq cabbie - 3 freq kb - 4 freq keb - 2 freq kubby - 1 freq cubby - 1 freq qb - 2 freq hkhb - 1 freq gooby - 2 freq qby - 1 freq cbb - 4 freq gb - 2 freq gbbo - 1 freq cuby - 1 freq coyb - 1 freq kabb - 1 freq cbh - 1 freq gabby - 1 freq ckb - 1 freq |
QB |
| Time to execute Levenshtein function - 0.199359 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.440464 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.030119 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.039853 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.000941 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. |