Natural language parsing as statistical pattern recognition
Natural language parsing as statistical pattern recognition
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Head-driven statistical models for natural language parsing
Head-driven statistical models for natural language parsing
Generalized probabilistic LR parsing of natural language (Corpora) with unification-based grammars
Computational Linguistics - Special issue on using large corpora: I
Exploiting syntactic structure for language modeling
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Towards history-based grammars: using richer models for probabilistic parsing
HLT '91 Proceedings of the workshop on Speech and Natural Language
Statistical parsing with a context-free grammar and word statistics
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Compact non-left-recursive grammars using the selective left-corner transform and factoring
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Joint and conditional estimation of tagging and parsing models
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Fast LR parsing using rich (Tree Adjoining) Grammars
EMNLP '02 Proceedings of the ACL-02 conference on Empirical methods in natural language processing - Volume 10
Probabilistic parsing strategies
Journal of the ACM (JACM)
Alternative approaches for generating bodies of grammar rules
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Probabilistic parsing strategies
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Partially distribution-free learning of regular languages from positive samples
COLING '04 Proceedings of the 20th international conference on 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
Computation of distances for regular and context-free probabilistic languages
Theoretical Computer Science
Automata, Probability, and Recursion
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Journal of the ACM (JACM)
An Inductive Logic Programming Approach to Statistical Relational Learning
Proceedings of the 2005 conference on An Inductive Logic Programming Approach to Statistical Relational Learning
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Journal of Artificial Intelligence Research
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
PAC-learning unambiguous k, l-NTS≤languages
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Probabilistic XML via Markov Chains
Proceedings of the VLDB Endowment
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
Sequences of part of speech tags vs. sequences of phrase labels: how do they help in parsing?
CICLing'06 Proceedings of the 7th international conference on Computational Linguistics and Intelligent Text Processing
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
Stochastic analysis of lexical and semantic enhanced structural language model
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Prefix probabilities for linear context-free rewriting systems
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
Both probabilistic context-free grammars (PCFGs) and shift-reduce probabilistic pushdown automata (PPDAs) have been used for language modeling and maximum likelihood parsing. We investigate the precise relationship between these two formalisms, showing that, while they define the same classes of probabilistic languages, they appear to impose different inductive biases.