Weighted and probabilistic context-free grammars are equally expressive

Computational Linguistics

Volumn 33, Issue 4, 2007, Pages 477-491

  Smith, Noah A ^a   Johnson, Mark ^b  

^a Carnegie Mellon University   (United States)

^b BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HIDDEN MARKOV MODELS; LINGUISTICS; MARKOV CHAINS;

CONDITIONAL DISTRIBUTION; CONDITIONAL RANDOM FIELDS(CRFS); ESTIMATION PROCEDURES; HIDDEN MARKOV MODELS (HMMS); JOINT ESTIMATION; LABELING ACCURACIES; PARTITION FUNCTIONS; PROBABILISTIC CONTEXT FREE GRAMMARS;

CONTEXT FREE GRAMMARS;

EID: 37249024089     PISSN: 08912017     EISSN: 15309312     Source Type: Journal    
DOI: 10.1162/coli.2007.33.4.477     Document Type: Article

References (21)

1. Abney, Steven P., David A. McAllester, and Fernando Pereira. 1999. Relating probabilistic grammars and automata. In Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics, pages 542-549, College Park, MD.
2. Booth, Taylor L. and Richard A. Thompson. 1973. Applying probability measures to abstract languages. IEEE Transactions on Computers, 22(5):442-450.
3. Chelba, Ciprian and Frederick Jelinek. 1998. Exploiting syntactic structure for language modeling. In Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, pages 325-331, Montreal, Canada.
4. Chi, Zhiyi. 1999. Statistical properties of probabilistic context-free grammars. Computational Linguistics, 25(1):131-160.
5. Goodman, Joshua T. 1998. Parsing Inside-Out. Ph.D. thesis, Harvard University, Cambridge, MA.
6. Graham, Ronald L., Donald E. Knuth, and Oren Patashnik. 1994. Concrete Mathematics. Addison-Wesley, Reading, MA.
7. Johnson, Mark. 2001. Joint and conditional estimation of tagging and parsing models. In Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics, pages 314-321, Toulouse, France.
8. Johnson, Mark, Stuart Geman, Stephen Canon, Zhiyi Chi, and Stefan Riezler. 1999. Estimators for stochastic "unification-based" grammars. In Proceedings of the 37th Annual Conference of the Association for Computational Linguistics, pages 535-541, College Park, MD.
9. Klein, Dan and Christopher D. Manning. 2002. Conditional structure versus conditional estimation in NLP models. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, pages 9-16, Philadelphia, PA.
10. Lafferty, John, Andrew McCallum, and Fernando Pereira. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of the 18th International Conference on Machine Learning, pages 282-289, Williamstown, MA.
11. MacKay, David J. C. 1996. Equivalence of linear Boltzmann chains and hidden Markov models. Neural Computation, 8(1):178-181.
12. McCallum, Andrew, Dayne Freitag, and Fernando Pereira. 2000. Maximum entropy Markov models for information extraction and segmentation. In Proceedings of the 17th International Conference on Machine Learning, pages 591-598, Palo Alto, CA.
13. Mealy, G. H. 1955. A method for synthesizing sequential circuits. Bell System Technology Journal, 34:1045-1079.
14. Moore, Edward F. 1956. Gedankenexperiments on sequential machines. In Automata Studies, number 34 in Annals of Mathematics Studies. Princeton University Press, Princeton, NJ, pages 129-153.
15. Nederhof, Mark-Jan and Giorgio Satta. 2004. Probabilistic parsing strategies. In Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics, pages 543-550, Barcelona, Spain.
16. Ratnaparkhi, Adwait, Salim Roukos, and R. Todd Ward. 1994. A maximum entropy model for parsing. In Proceedings of the International Conference on Spoken Language Processing, pages 803-806, Yokohama, Japan.
17. Smith, Noah A. and Jason Eisner. 2005. Contrastive estimation: Training log-linear models on unlabeled data. In Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics, pages 354-362, Ann Arbor, MI.
18. Stolcke, Andreas. 1995. An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computational Linguistics, 21(2):165-201.
19. Taskar, Ben, Dan Klein, Michael Collins, Daphne Koller, and Christopher Manning. 2004. Max-margin parsing. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, pages 1-8, Barcelona, Spain.
20. Vardi, Ilan. 1991. Computational Recreations in Mathematica. Addison-Wesley, Redwood City, CA.
21. Wetherell, C. S. 1980. Probabilistic languages: A review and some open questions. Computing Surveys, 12:361-379.