background of conditional random fields. We formulate morphological analysis of an
unsegmented language as the sequential supervised learning problem. Given a sequence
of characters, all possibilities of word/tag segmentation are generated, and then the optimal
path is selected with some criterion. We examine two different techniques, including the
Viterbi score and the confidence estimation. Preliminary results are given to show the …