Boolean Feature Discovery in Empirical Learning
Machine Learning
C4.5: programs for machine learning
C4.5: programs for machine learning
Machine Learning - Special issue on learning with probabilistic representations
Lazy Learning of Bayesian Rules
Machine Learning
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
A maximum-entropy-inspired parser
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Not So Naive Bayes: Aggregating One-Dependence Estimators
Machine Learning
Revision learning and its application to part-of-speech tagging
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
RoughTree A Classifier with Naive-Bayes and Rough Sets Hybrid in Decision Tree Representation
GRC '07 Proceedings of the 2007 IEEE International Conference on Granular Computing
Dependency parsing as a classification problem
CoNLL-X '06 Proceedings of the Tenth Conference on Computational Natural Language Learning
Hi-index | 0.00 |
A rough set-based semi-naive Bayesian classification method is applied to dependency parsing, which is an important task in syntactic structure analysis of natural language processing. Many parsing algorithms have emerged combined with statistical machine learning techniques. The rough set-based classifier is embedded with Nivre's deterministic parsing algorithm to conduct dependency parsing task on a Chinese corpus. Experimental results show that the method has a good performance on dependency parsing task. Moreover, the experiments have justified the effectiveness of the classification influence.