The Generative Power of Probabilistic and Weighted Context-Free Grammars

DOI10.1007/978-3-642-23211-4_4zbMath1348.68082OpenAlexW202532017MaRDI QIDQ3172827

Timothy A. D. Fowler

Publication date: 7 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23211-4_4

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Natural language processing (68T50)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on the expressive power of probabilistic context free grammars
• Dependency structures and lexicalized grammars. An algebraic approach
• Head-Driven Statistical Models for Natural Language Parsing
• Hierarchical Phrase-Based Translation
• Weighted and Probabilistic Context-Free Grammars Are Equally Expressive
• Wide-Coverage Efficient Statistical Parsing with CCG and Log-Linear Models
• Pumping lemmas for the control language hierarchy
• A helpful result for proving inherent ambiguity
• Probabilistic automata
• Applying Probability Measures to Abstract Languages
• Context-free recognition with weighted automata

This page was built for publication: The Generative Power of Probabilistic and Weighted Context-Free Grammars