Up to A k , we get a list of candidates T : T 1 , T 2 , ..., T L , ranked by probabilities P k (T |S) in descending order.
the probability P k (t l |S)(l = 1, 2, ..., L) is accumulated probability of P (t l |S) over A 1 , A 2 , ..., A k , calculated by: If we continue performing the CRF conversion to cover all N (N ≥ k) segmentations, eventually we will get: If Equation 3 holds, then for ∀i = 1, P (t 1 |S) > P (t i |S)(i = 1), and t 1 maximizes the probability P (t |S).