Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
xb (0) - 3 freq ob (1) - 2 freq pb (1) - 2 freq xy (1) - 1 freq b (1) - 745 freq eb (1) - 6 freq xt (1) - 1 freq hb (1) - 9 freq xq (1) - 2 freq xh (1) - 6 freq zb (1) - 3 freq jb (1) - 2 freq nxb (1) - 1 freq xu (1) - 3 freq wb (1) - 4 freq xo (1) - 10 freq ub (1) - 3 freq xs (1) - 2 freq x (1) - 544 freq yb (1) - 3 freq xz (1) - 4 freq x' (1) - 1 freq xi (1) - 13 freq rb (1) - 8 freq xk (1) - 1 freq |
xb (0) - 3 freq xbo (1) - 1 freq xeb (1) - 1 freq xcb (2) - 1 freq xn (2) - 3 freq kb (2) - 4 freq xm (2) - 1 freq xa (2) - 3 freq xr (2) - 3 freq vb (2) - 1 freq bb (2) - 9 freq cb (2) - 3 freq xw (2) - 4 freq xf (2) - 6 freq xl (2) - 3 freq tb (2) - 14 freq xc (2) - 2 freq nb (2) - 4 freq mb (2) - 5 freq sb (2) - 4 freq bxb (2) - 1 freq xe (2) - 4 freq xx (2) - 79 freq xv (2) - 6 freq lb (2) - 4 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 - SB sib - 105 freq sob - 7 freq syboe - 1 freq sub - 9 freq sab - 9 freq sibb - 2 freq sssba - 1 freq sibh - 1 freq zhbh - 1 freq xhb - 1 freq zbu - 1 freq sb - 4 freq xb - 3 freq zob - 1 freq zb - 3 freq xbo - 1 freq xeb - 1 freq |
XB |
Time to execute Levenshtein function - 0.237338 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.455736 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.030628 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.037639 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.000784 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. |