Experiments in tagger combination: arbitrating, guessing, correcting, suggesting
作者： Giuseppe Attardi , Maria Simi , E. M. Vecchi , A. Fuschetto , F. Tamberi
DOI:
关键词:
摘要: The paper reports experiments with several strategies of tagger combination, using two well known taggers, TreeTagger and Hunpos. most successful experiment,which achieved the best score in Evalita 2009 Open Task, is a hybrid solution combining an easiest first iterative strategy hand-written arbitration rules quality lexicon. system used Closed Task uses similar combination variants Hunpos, together correction/guessing rules.
evalita.it 
researchgate.net 参考文章(6)
Yoshimasa Tsuruoka, Jun'ichi Tsujii, Bidirectional inference with the easiest-first strategy for tagging sequence data Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing - HLT '05. pp. 467- 474 ,(2005) , 10.3115/1220575.1220634
Péter Halácsy, András Kornai, Csaba Oravecz, HunPos: an open source trigram tagger meeting of the association for computational linguistics. pp. 209- 212 ,(2007) , 10.3115/1557769.1557830
Giuseppe Attardi, Felice Dell'Orletta, Reverse Revision and Linear Tree Combination for Dependency Parsing north american chapter of the association for computational linguistics. pp. 261- 264 ,(2009) , 10.3115/1620853.1620925
Tullio De Mauro, Il dizionario della lingua italiana Paravia. ,(2000)
Andr'as Kornai, P'eter Hal'acsy, Csaba Oravecz, Poster paper: HunPos -- an open source trigram tagger meeting of the association for computational linguistics. pp. 209- 212 ,(2007)
Thorsten Brants, TnT - A Statistical Part-of-Speech Tagger arXiv: Computation and Language. ,(2000)