An efficient probabilistic context-free parsing algorithm that computes prefix probabilities
Computational Linguistics
IEEE Transactions on Pattern Analysis and Machine Intelligence
Probabilistic Languages: A Review and Some Open Questions
ACM Computing Surveys (CSUR)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Probabilistic top-down parsing and language modeling
Computational Linguistics
PCFG models of linguistic tree representations
Computational Linguistics
Statistical properties of probabilistic context-free grammars
Computational Linguistics
Parsing with Probabilistic Strictly Locally Testable Tree Languages
IEEE Transactions on Pattern Analysis and Machine Intelligence
Immediate-head parsing for language models
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Supervised and unsupervised PCFG adaptation to novel domains
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
Probabilistic parsing strategies
Journal of the ACM (JACM)
Probabilistic parsing strategies
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
An alternative method of training probabilistic LR parsers
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
An all-subtrees approach to unsupervised parsing
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Cross-entropy and estimation of probabilistic context-free grammars
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Estimation of consistent probabilistic context-free grammars
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Probabilistic Context-Free Grammars Estimated from Infinite Distributions
IEEE Transactions on Pattern Analysis and Machine Intelligence
A stochastic grammar of images
Foundations and Trends® in Computer Graphics and Vision
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Journal of the ACM (JACM)
Parameter learning of logic programs for symbolic-statistical modeling
Journal of Artificial Intelligence Research
Maximum likelihood analysis of algorithms and data structures
Theoretical Computer Science
Structural hidden Markov models based on stochastic context-free grammars
Control and Intelligent Systems
A Hierarchical and Contextual Model for Aerial Image Parsing
International Journal of Computer Vision
Object category recognition using generative template boosting
EMMCVPR'07 Proceedings of the 6th international conference on Energy minimization methods in computer vision and pattern recognition
New advances in logic-based probabilistic modeling by PRISM
Probabilistic inductive logic programming
Learning context free grammars with the syntactic concept lattice
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Analysis of the Free Energy in a Stochastic RNA Secondary Structure Model
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A $${\mathcal{O}(|G|n^6)}$$ time extension of inversion transduction grammars
Machine Translation
Recursive markov chains, stochastic grammars, and monotone systems of nonlinear equations
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Computation of infix probabilities for probabilistic context-free grammars
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Extending stochastic context-free grammars for an application in bioinformatics
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
A new general grammar formalism for parsing
MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
Object categorization with sketch representation and generalized samples
Pattern Recognition
Finding optimal probabilistic generators for XML collections
Proceedings of the 15th International Conference on Database Theory
An information-theoretic measure to evaluate parsing difficulty across treebanks
ACM Transactions on Speech and Language Processing (TSLP)
| Hi-index | 0.00 |
The assignment of probabilities to the productions of a context-free grammar may generate an improper distribution: the probability of all finite parse trees is less than one. The condition for proper assignment is rather subtle. Production probabilities can be estimated from parsed or unparsed sentences, and the question arises as to whether or not an estimated system is automatically proper. We show here that estimated production probabilities always yield proper distributions.