| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| xqp (0) - 1 freq xqu (1) - 2 freq rqp (1) - 1 freq qp (1) - 7 freq aqp (1) - 1 freq xp (1) - 3 freq xq (1) - 2 freq msp (2) - 53 freq kip (2) - 38 freq xy (2) - 1 freq qu (2) - 2 freq isp (2) - 3 freq dq (2) - 7 freq jap (2) - 2 freq rp (2) - 8 freq rmp (2) - 1 freq rqh (2) - 1 freq zq (2) - 6 freq nip (2) - 119 freq lup (2) - 1 freq yep (2) - 23 freq 'up (2) - 18 freq qd (2) - 1 freq xr (2) - 3 freq dip (2) - 22 freq |
xqp (0) - 1 freq xq (2) - 2 freq aqp (2) - 1 freq xp (2) - 3 freq xqu (2) - 2 freq qp (2) - 7 freq rqp (2) - 1 freq qpo (3) - 1 freq xiq (3) - 1 freq exp (3) - 1 freq ixqv (3) - 1 freq xwpa (3) - 1 freq xyqb (3) - 1 freq dqi (4) - 1 freq cfp (4) - 2 freq qn (4) - 5 freq xs (4) - 2 freq xvo (4) - 1 freq np (4) - 5 freq rop (4) - 6 freq xxg (4) - 1 freq map (4) - 91 freq dfp (4) - 9 freq fp (4) - 4 freq mqo (4) - 1 freq |
SoundEx code - X100 xiv - 4 freq xv - 6 freq xvi - 3 freq xvii - 1 freq xviii - 1 freq xxiv - 1 freq xxv - 2 freq xxvi - 1 freq xxxv - 1 freq xcf - 1 freq xjb - 1 freq xp - 3 freq xvo - 1 freq xfbv - 2 freq xf - 6 freq xwpa - 1 freq xhb - 1 freq xb - 3 freq xqp - 1 freq xzv - 1 freq xavi - 1 freq xbo - 1 freq xfu - 1 freq xauipy - 1 freq xcb - 1 freq xfaaa - 1 freq xeb - 1 freq xgqbp - 1 freq |
MetaPhone code - SKP scoop - 16 freq skip - 25 freq skep - 2 freq scaup - 5 freq scope - 12 freq scap - 2 freq scapa - 10 freq skype - 5 freq scowp - 6 freq skippy - 2 freq skepp - 2 freq xqp - 1 freq secoypp - 1 freq cikup - 1 freq scape - 1 freq |
XQP |
| Time to execute Levenshtein function - 0.350440 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.668837 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.029867 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.071486 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.000953 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. |