The generative power of probabilistic and weighted context-free grammars
From MaRDI portal
Publication:3172827
DOI10.1007/978-3-642-23211-4_4zbMATH Open1348.68082OpenAlexW202532017MaRDI QIDQ3172827FDOQ3172827
Authors: 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
Recommendations
Cites Work
- Probabilistic automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Applying Probability Measures to Abstract Languages
- A note on the expressive power of probabilistic context free grammars
- Wide-Coverage Efficient Statistical Parsing with CCG and Log-Linear Models
- A helpful result for proving inherent ambiguity
- Head-Driven Statistical Models for Natural Language Parsing
- Context-free recognition with weighted automata
- Pumping lemmas for the control language hierarchy
- Dependency structures and lexicalized grammars. An algebraic approach
- Weighted and Probabilistic Context-Free Grammars Are Equally Expressive
- Hierarchical Phrase-Based Translation
Cited In (9)
- Title not available (Why is that?)
- A note on the expressive power of probabilistic context free grammars
- Title not available (Why is that?)
- Random Generation of Combinatorial Structures using Context-Fee Grammars
- Negation Elimination for Finite PCFGs
- Title not available (Why is that?)
- Probabilistic parsing
- Probabilistic parsing strategies
- Probabilistic feature grammars
This page was built for publication: The generative power of probabilistic and weighted context-free grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172827)
