This paper proposes an approach to reduce the stochastic parsing time with stochastic context-free grammars. The basic idea consists of storing a set of precomputed problems. These precomputed problems are obtained off line from a training corpus or they are computed on line from a test corpus. In this work, experiments with the UPenn Treebank are reported in order to show the performance of both alternatives. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Sánchez, J. A., & Benedí, J. M. (2005). Time reduction of stochastic parsing with stochastic context-free grammars. In Lecture Notes in Computer Science (Vol. 3523, pp. 163–171). Springer Verlag. https://doi.org/10.1007/11492542_21
Mendeley helps you to discover research relevant for your work.