抄録
This paper presents a work of function labeling for unparsed Chinese text. Unlike other attempts that utilize the full parse trees, we propose an effective way to recognize function labels directly based on lexical information, which is easily scalable for languages that lack sufficient parsing resources. Furthermore, we investigate a general method to iteratively simplify a sentence, thus transferring complicated sentence into structurally simple pieces. By means of a sequence learning model with hidden Markov support vector machine, we achieve the best F-measure of 87.40 on the text from Penn Chinese Treebank resources - a statistically significant improvement over the existing Chinese function labeling systems.
