An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimal Probabilistic Evaluation Functions for Search Controlled by Stochastic Context-Free Grammars
IEEE Transactions on Pattern Analysis and Machine Intelligence
An efficient probabilistic context-free parsing algorithm that computes prefix probabilities
Computational Linguistics
Recognition of Visual Activities and Interactions by Stochastic Parsing
IEEE Transactions on Pattern Analysis and Machine Intelligence
Defense of the ansatz for dynamical hierarchies
Artificial Life
Extending Bidirectional Chart Parsing with a Stochastic Model
TDS '00 Proceedings of the Third International Workshop on Text, Speech and Dialogue
Probabilistic top-down parsing and language modeling
Computational Linguistics
New figures of merit for best-first probabilistic chart parsing
Computational Linguistics
Computational Linguistics
Review of "Generalized LR parsing" by Masaru Tomita. Kluwer Academic Publishers 1991.
Computational Linguistics - Special issue on inheritance: II
Prefix probabilities from stochastic Tree Adjoining Grammars
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Precise n-gram probabilities from stochastic context-free grammars
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Combination of n-grams and Stochastic Context-Free Grammars for language modeling
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Weakly restricted stochastic grammars
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
A hybrid language model based on a combination of N-grams and stochastic context-free grammars
ACM Transactions on Asian Language Information Processing (TALIP)
A probabilistic earley parser as a psycholinguistic model
NAACL '01 Proceedings of the second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies
A structured language model based on context-sensitive probabilistic left-corner parsing
NAACL '01 Proceedings of the second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies
Probabilistic parsing strategies
Journal of the ACM (JACM)
Discriminative syntactic language modeling for speech recognition
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Probabilistic Context-Free Grammars Estimated from Infinite Distributions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Discoverer: automatic protocol reverse engineering from network traces
SS'07 Proceedings of 16th USENIX Security Symposium on USENIX Security Symposium
Computation of distances for regular and context-free probabilistic languages
Theoretical Computer Science
Natural Language Processing as a Foundation of the Semantic Web
Foundations and Trends in Web Science
Finding structure via compression
NeMLaP3/CoNLL '98 Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning
Estimation of stochastic context-free grammars and their use as language models
Computer Speech and Language
EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 1 - Volume 1
Computation of upper-bounds for stochastic context-free languages
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Prefix probability for probabilistic synchronous context-free grammars
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Time reduction of stochastic parsing with stochastic context-free grammars
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Performance of a SCFG-based language model with training data sets of increasing size
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Computation of infix probabilities for probabilistic context-free grammars
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Prefix probabilities for linear context-free rewriting systems
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Stochastic context-free grammars, regular languages, and newton's method
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.01 |
Speech recognition language models are based on probabilities P(Wk+1 = v | w1w2,...,wk) that the next word Wk+1 will be any particular word v of the vocabulary, given that the word sequence w1,w2,...,wk is hypothesized to have been uttered in the past. If probabilistic context-free grammars are to be used as the basis of the language model, it will be necessary to compute the probability that successive application of the grammar rewrite rules (beginning with the sentence start symbol s) produces a word string whose initial substring is an arbitrary sequence w1,w2,...,wk+1. In this paper we describe a new algorithm that achieves the required computation in at most a constant times k3-steps.