Weighted and Probabilistic Context-Free Grammars Are Equally Expressive

@article{Smith2007WeightedAP,
  title={Weighted and Probabilistic Context-Free Grammars Are Equally Expressive},
  author={Noah A. Smith and Mark Johnson},
  journal={Computational Linguistics},
  year={2007},
  volume={33},
  pages={477-491}
}
This article studies the relationship between weighted context-free grammars (WCFGs), where each production is associated with a positive real-valued weight, and probabilistic context-free grammars (PCFGs), where the weights of the productions associated with a nonterminal are constrained to sum to one. Because the class of WCFGs properly includes the PCFGs, one might expect that WCFGs can describe distributions that PCFGs cannot. However, Z. Chi (1999, Computational Linguistics, 25(1):131160… Expand
Properties of prefix lexicalized synchronous grammars
Consistent Unsupervised Estimators for Anchored PCFGs
Weighted DAG Automata for Semantic Graphs
Sampling Markov Models under Constraints: Complexity Results for Binary Equalities and Grammar Membership
Treebank Parsing and Knowledge of Language
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 27 REFERENCES
Statistical Properties of Probabilistic Context-Free Grammars
  • Zhiyi Chi
  • Mathematics, Computer Science
  • Comput. Linguistics
  • 1999
Parsing Inside-Out
Probabilistic Languages: A Review and Some Open Questions
Probabilistic parsing strategies
Applying Probability Measures to Abstract Languages
Estimators for Stochastic "Unification-Based" Grammars
MAXIMUM ENTROPY
...
1
2
3
...