Elements of information theory
Elements of information theory
A maximum entropy approach to natural language processing
Computational Linguistics
Inducing Features of Random Fields
IEEE Transactions on Pattern Analysis and Machine Intelligence
Minimax entropy principle and its application to texture modeling
Neural Computation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Estimation of probabilistic context-free grammars
Computational Linguistics
PCFG models of linguistic tree representations
Computational Linguistics
Stochastic attribute-value grammars
Computational Linguistics
Parameter estimation for constrained context-free language models
HLT '91 Proceedings of the workshop on Speech and Natural Language
A Theory of Stochastic Grammars
NLP '00 Proceedings of the Second International Conference on Natural Language Processing
ICML '05 Proceedings of the 22nd international conference on Machine learning
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
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
Computation of distances for regular and context-free probabilistic languages
Theoretical Computer Science
The information-processing difficulty of incremental parsing
IncrementParsing '04 Proceedings of the Workshop on Incremental Parsing: Bringing Engineering and Cognition Together
A noisy-channel model of rational human sentence comprehension under uncertain input
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Learning and inference for hierarchically split PCFGs
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Estimation of stochastic context-free grammars and their use as language models
Computer Speech and Language
Towards network security policy generation for configuration analysis and testing
Proceedings of the 2nd ACM workshop on Assurable and usable security configuration
Parsing algorithms based on tree automata
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Querying parse trees of stochastic context-free grammars
Proceedings of the 13th International Conference on Database Theory
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
The generative power of probabilistic and weighted context-free grammars
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
A $${\mathcal{O}(|G|n^6)}$$ time extension of inversion transduction grammars
Machine Translation
Computation of infix probabilities for probabilistic context-free grammars
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Consistency of stochastic context-free grammars
Mathematical and Computer Modelling: An International Journal
Knowledge extraction and joint inference using tractable Markov logic
AKBC-WEKEX '12 Proceedings of the Joint Workshop on Automatic Knowledge Base Construction and Web-scale Knowledge Extraction
Search and result presentation in scientific workflow repositories
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
| Hi-index | 0.00 |
We prove a number of useful results about probabilistic context-free grammars (PCFGs) and their Gibbs representations. We present a method, called the relative weighted frequency method, to assign production probabilities that impose proper PCFG distributions on finite parses. We demonstrate that these distributions have finite entropies. In addition, under the distributions, sizes of parses have finite moment of any order. We show that Gibbs distributions on CFG parses, which generalize PCFG distributions and are more powerful, become PCFG distributions if their features only include frequencies of production rules in parses. Under these circumstances, we prove the equivalence of the maximum-likelihood (ML) estimation procedures for these two types of probability distributions on parses. We introduce the renormalization of improper PCFGs to proper ones. We also study PCFGs from the perspective of stochastic branching processes. We prove that with their production probabilities assigned by the relative weighted frequency method, PCFGs are subcritical, i.e., their branching rates are less than one. We also show that by renormalization, connected supercritical PCFGs become subcritical ones. Finally, some minor issues, including identifiability and approximation of production probabilities of PCFGs, are discussed.