Numerical recipes in C: the art of scientific computing
Numerical recipes in C: the art of scientific computing
Computation of Probabilities for an Island-Driven Parser
IEEE Transactions on Pattern Analysis and Machine Intelligence
Class-based n-gram models of natural language
Computational Linguistics
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient context-free parsing algorithm
Communications of the ACM
Computation of the probability of initial substring generation by stochastic context-free grammars
Computational Linguistics
Generalized probabilistic LR parsing of natural language (Corpora) with unification-based grammars
Computational Linguistics - Special issue on using large corpora: I
Pearl: a probabilistic chart parser
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
An efficient probabilistic context-free parsing algorithm that computes prefix probabilities
Computational Linguistics
Recognizing multitasked activities from video using stochastic context-free grammar
Eighteenth national conference on Artificial intelligence
Practical experiments with regular approximation of context-free languages
Computational Linguistics - Special issue on finite-state methods in NLP
Probabilistic top-down parsing and language modeling
Computational Linguistics
Immediate-head parsing for language models
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
A General Technique to Train Language Models on Language Models
Computational Linguistics
Building a robust dialogue system with limited data
ANLP/NAACL-ConvSyst '00 Proceedings of the 2000 ANLP/NAACL Workshop on Conversational systems - Volume 3
Discriminative syntactic language modeling for speech recognition
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Building a robust dialogue system with limited data
ConversationalSys '00 Proceedings of the ANLP-NAACL 2000 Workshop on Conversational Systems
Consistency of stochastic context-free grammars
Mathematical and Computer Modelling: An International Journal
A general technique to train language models on language models
Computational Linguistics
| Hi-index | 0.00 |
We present an algorithm for computing n-gram probabilities from stochastic context-free grammars, a procedure that can alleviate some of the standard problems associated with n-grams (estimation from sparse data, lack of linguistic structure, among others). The method operates via the computation of substring expectations, which in turn is accomplished by solving systems of linear equations derived from the grammar. The procedure is fully implemented and has proved viable and useful in practice.