Time reduction of stochastic parsing with stochastic context-free grammars

Authors:
Joan Andreu Sánchez;José Miguel Benedí
Affiliations:
Depto. Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Valencia, Spain;Depto. Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Valencia, Spain
Venue:
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Year:
2005

Citing 7
Cited 0

Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
An efficient probabilistic context-free parsing algorithm that computes prefix probabilities

Computational Linguistics
Computation of the probability of initial substring generation by stochastic context-free grammars

Computational Linguistics
Building a large annotated corpus of English: the penn treebank

Computational Linguistics - Special issue on using large corpora: II
Inside-outside reestimation from partially bracketed corpora

ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Estimation of stochastic context-free grammars and their use as language models

Computer Speech and Language
General context-free recognition in less than cubic time

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.