Given a committee of K base segmenters, we can get K segmentations for sentence We use a mark m k i ∈ {0, 1} to indicate whether word w i is correctly segmented by the k-th segmenter.
the number of words c k correctly identified by the k-th segmenter is we can calculate the degree of difficulty of each word w i .