In order to get exact inference, most sequence-labeling systems address this problem with a Viterbi search, which takes the advantage of their hypothesis that the tag interactions only exist within adjacent characters (Markov assumption).
since our model is intended to capture complete history of segmentation decisions, such dynamic programming algorithms can not be adopted in this situation.