Article ID Journal Published Year Pages File Type
421919 Electronic Notes in Theoretical Computer Science 2009 12 Pages PDF
Abstract

Semantic Dependency Analysis (SDA) has extensive applications in Natural Language Processing (NLP). In this paper, an integration of multiple classifiers is presented for SDA of Chinese. A Naive Bayesian Classifier, a Decision Tree and a Maximum Entropy classifier are used in a majority wins voting scheme. A portion of the Penn Chinese Treebank was manually annotated with semantic dependency structure. Then each of the three classifiers was trained on the same training data. All three of the classifiers were used to produce candidate relations for test data and the candidate relation that had the majority vote was chosen. The proposed approach achieved an accuracy of 86% in experimentation, which shows that the proposed approach is a promising one for semantic dependency analysis of Chinese.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics