Abstract
This article describes a probabilistic context free grammar approximation method for unification grammars. In order to produce good results, the method is combined with an N best parsing extension to chart parsing. The first part of the paper introduces the grammar approximation method, while the second part describes details of an efficient N-best packing and unpacking scheme for chart parsing.
Cite
CITATION STYLE
Weber, H., Spilker, J., & Görz, G. (1997). Parsing n best trees from a word lattice. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1303, pp. 279–288). Springer Verlag. https://doi.org/10.1007/3540634932_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
