The generative power of probabilistic and weighted context-free grammars
From MaRDI portal
Publication:3172827
Recommendations
Cites work
- scientific article; zbMATH DE number 3731374 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- A helpful result for proving inherent ambiguity
- A note on the expressive power of probabilistic context free grammars
- Applying Probability Measures to Abstract Languages
- Context-free recognition with weighted automata
- Dependency structures and lexicalized grammars. An algebraic approach
- Head-driven statistical models for natural language parsing
- Hierarchical phrase-based translation
- Probabilistic automata
- Pumping lemmas for the control language hierarchy
- Weighted and probabilistic context-free grammars are equally expressive
- Wide-coverage efficient statistical parsing with CCG and log-linear models
Cited in
(12)- Probabilistic parsing strategies
- Negation Elimination for Finite PCFGs
- Probabilistic parsing
- Weighted and probabilistic context-free grammars are equally expressive
- Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy
- scientific article; zbMATH DE number 1759522 (Why is no real title available?)
- A note on the expressive power of probabilistic context free grammars
- Probabilistic feature grammars
- Prefix probabilities for linear context-free rewriting systems
- scientific article; zbMATH DE number 1952668 (Why is no real title available?)
- Random Generation of Combinatorial Structures using Context-Fee Grammars
- scientific article; zbMATH DE number 39880 (Why is no real title available?)
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)