A maximum entropy approach to natural language processing
Computational Linguistics
A maximum entropy-based word sense disambiguation system
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Case-Sensitivity of Classifiers for WSD: Complex Systems Disambiguate Tough Words Better
CICLing '07 Proceedings of the 8th International Conference on Computational Linguistics and Intelligent Text Processing
Defining classifier regions for WSD ensembles using word space features
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
Building an optimal WSD ensemble using per-word selection of best system
CIARP'06 Proceedings of the 11th Iberoamerican conference on Progress in Pattern Recognition, Image Analysis and Applications
Hi-index | 0.00 |
The Stanford-CS224N system is an ensemble of simple classifiers. The first-tier systems are heterogeneous, consisting primarily of naive-Bayes variants, but also including vector space, memory-based, and other classifier types. These simple classifiers are combined by a second-tier classifier, which variously uses majority voting, weighted voting, or a maximum entropy model. Results from Senseval-2 lexical sample tasks indicate that, while the individual classifiers perform at a level comparable to middle-scoring team's systems, the combination achieves high performance. In this paper, we discuss both our system and lessons learned from its behavior.