Parsing algorithms and metrics

作者: Joshua Goodman

DOI: 10.3115/981863.981887

关键词:

摘要: Many different metrics exist for evaluating parsing results, including Viterbi, Crossing Brackets Rate, Zero and several others. However, most algorithms, the Viterbi algorithm, attempt to optimize same metric, namely probability of getting correct labelled tree. By choosing a algorithm appropriate evaluation better performance can be achieved. We present two new algorithms: "Labelled Recall Algorithm," which maximizes expected Labelled "Bracketed Bracketed Rate. Experimental results are given, showing that algorithms have improved over on many criteria, especially ones they optimize.

参考文章(9)
Eric David Brill, A corpus-based approach to language learning University of Pennsylvania. ,(1993)
Joshua Goodman, Efficient Algorithms for Parsing the DOP Model empirical methods in natural language processing. ,(1996)
David Mitchell Magerman, Natural language parsing as statistical pattern recognition arXiv: Computation and Language. ,(1994)
Rens Bod, Using an annotated corpus as a stochastic grammar conference of the european chapter of the association for computational linguistics. pp. 37- 44 ,(1993) , 10.3115/976744.976750
K. Lari, S.J. Young, Applications of stochastic context-free grammars using the Inside-Outside algorithm Computer Speech & Language. ,vol. 5, pp. 237- 257 ,(1991) , 10.1016/0885-2308(91)90009-F
J. K. Baker, Trainable grammars for speech recognition The Journal of the Acoustical Society of America. ,vol. 65, pp. S132- S132 ,(1979) , 10.1121/1.2017061
David M. Magerman, Carl Weir, Efficiency, robustness and accuracy in Picky chart parsing Proceedings of the 30th annual meeting on Association for Computational Linguistics -. pp. 40- 47 ,(1992) , 10.3115/981967.981973
Fernando Pereira, Yves Schabes, Inside-outside reestimation from partially bracketed corpora Proceedings of the 30th annual meeting on Association for Computational Linguistics -. pp. 128- 135 ,(1992) , 10.3115/981967.981984