Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEJ Transactions on Electronics, Information and Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
