Let String [C] denote the associated Chinese string of C, cc l denote the l-th Chinese character within that string, and L denote the total number of Chinese characters within C. Then we will have a range of bigram probabilities for candidates with different lengths.
it is systematically biased 6 (in probability value) towards candidates with shorter lengths.