Bayesian synchronous tree-substitution grammar induction and its application to sentence compression

ACL 2010 - 48th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference

Volumn , Issue , 2010, Pages 937-947

  Yamangil, Elif ^a   Shieber, Stuart M ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXPECTATION MAXIMIZATION; GIBBS SAMPLING; GRAMMAR INDUCTION; NON-PARAMETRIC BAYESIAN; NONPARAMETRIC INFERENCE; PARAMETRIC INFERENCE; PARSE TREES; SENTENCE COMPRESSION; TRAINING ALGORITHMS; VARIATIONAL BAYES; WORD ALIGNMENT;

ALGORITHMS; ALIGNMENT; COMPUTATIONAL LINGUISTICS; INFERENCE ENGINES;

FORESTRY;

ALGORITHMS; COMPUTATION; OPTIMIZATION; PARAMETRIC EQUATIONS;

EID: 79960613531     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. James Clarke and Mirella Lapata. 2006a. Constraintbased sentence compression: An integer programming approach. In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, pages 144-151, Sydney, Australia, July. Association for Computational Linguistics.
2. James Clarke and Mirella Lapata. 2006b. Models for sentence compression: A comparison across domains, training requirements and evaluation measures. In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, pages 377-384, Sydney, Australia, July. Association for Computational Linguistics.
3. Trevor Cohn and Phil Blunsom. 2009. A Bayesian model of syntax-directed tree to string grammar induction. In EMNLP '09: Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing, pages 352-361, Morristown, NJ, USA. Association for Computational Linguistics.
4. Trevor Cohn and Mirella Lapata. 2007. Large margin synchronous generation and its application to sentence compression. In Proceedings of the Conference on Empirical Methods in Natural Language Processing and on Computational Natural Language Learning, pages 73-82, Prague. Association for Computational Linguistics.
5. Trevor Cohn and Mirella Lapata. 2008. Sentence compression beyond word deletion. In COLING '08: Proceedings of the 22nd International Conference on Computational Linguistics, pages 137-144, Manchester, United Kingdom. Association for Computational Linguistics.
6. Trevor Cohn, Sharon Goldwater, and Phil Blunsom. 2009. Inducing compact but accurate treesubstitution grammars. In NAACL '09: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, pages 548-556, Morristown, NJ, USA. Association for Computational Linguistics.
7. A. Dempster, N. Laird, and D. Rubin. 1977. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, 39 (Series B):1-38.
8. John DeNero, Dan Gillick, James Zhang, and Dan Klein. 2006. Why generative phrase models underperform surface heuristics. In StatMT '06: Proceedings of the Workshop on Statistical Machine Translation, pages 31-38, Morristown, NJ, USA. Association for Computational Linguistics.
9. John DeNero, Alexandre Bouchard-Côté, and Dan Klein. 2008. Sampling alignment structure under a Bayesian translation model. In EMNLP '08: Proceedings of the Conference on Empirical Methods in Natural Language Processing, pages 314-323, Morristown, NJ, USA. Association for Computational Linguistics.
10. Jason Eisner. 2003. Learning non-isomorphic tree mappings for machine translation. In ACL '03: Proceedings of the 41st Annual Meeting on Association for Computational Linguistics, pages 205-208, Morristown, NJ, USA. Association for Computational Linguistics.
11. Michel Galley and Kathleen McKeown. 2007. Lexicalized Markov grammars for sentence compression. In Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Proceedings of the Main Conference, pages 180-187, Rochester, New York, April. Association for Computational Linguistics.
12. Michel Galley, Mark Hopkins, Kevin Knight, and Daniel Marcu. 2004. What's in a translation rule? In Daniel Marcu Susan Dumais and Salim Roukos, editors, HLT-NAACL 2004: Main Proceedings, pages 273-280, Boston, Massachusetts, USA, May 2 - May 7. Association for Computational Linguistics.
13. S. Geman and D. Geman. 1984. Stochastic Relaxation, Gibbs Distributions and the Bayesian Restoration of Images. pages 6:721-741.
14. Sharon Goldwater, Thomas L. Griffiths, and Mark Johnson. 2006. Contextual dependencies in unsupervised word segmentation. In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, pages 673-680, Sydney, Australia, July. Association for Computational Linguistics.
15. Hongyan Jing. 2000. Sentence reduction for automatic text summarization. In Proceedings of the sixth conference on Applied natural language processing, pages 310-315, Morristown, NJ, USA. Association for Computational Linguistics.
16. Dan Klein and Christopher D. Manning. 2003. Fast exact inference with a factored model for natural language parsing. In Advances in Neural Information Processing Systems 15 (NIPS, pages 3-10. MIT Press.
17. Kevin Knight and Daniel Marcu. 2002. Summarization beyond sentence extraction: a probabilistic approach to sentence compression. Artif. Intell., 139(1):91-107.
18. K. Lari and S. J. Young. 1990. The estimation of stochastic context-free grammars using the Inside- Outside algorithm. Computer Speech and Language, 4:35-56.
19. Ding Liu and Daniel Gildea. 2009. Bayesian learning of phrasal tree-to-string templates. In Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing, pages 1308-1317, Singapore, August. Association for Computational Linguistics.
20. David J.C. MacKay. 1997. Ensemble learning for hidden markov models. Technical report, Cavendish Laboratory, Cambridge, UK.
21. Franz Josef Och and Hermann Ney. 2004. The alignment template approach to statistical machine translation. Comput. Linguist., 30(4):417-449.
22. Matt Post and Daniel Gildea. 2009. Bayesian learning of a tree substitution grammar. In Proceedings of the ACL-IJCNLP 2009 Conference Short Papers, pages 45-48, Suntec, Singapore, August. Association for Computational Linguistics.
23. Stefan Riezler, Tracy H. King, Richard Crouch, and Annie Zaenen. 2003. Statistical sentence condensation using ambiguity packing and stochastic disambiguation methods for lexical-functional grammar. In NAACL '03: Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology, pages 118-125, Morristown, NJ, USA. Association for Computational Linguistics.
24. Jenine Turner and Eugene Charniak. 2005. Supervised and unsupervised learning for sentence compression. In ACL '05: Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics, pages 290-297, Morristown, NJ, USA. Association for Computational Linguistics.
25. Elif Yamangil and Rani Nelken. 2008. Mining wikipedia revision histories for improving sentence compression. In Proceedings of ACL-08: HLT, Short Papers, pages 137-140, Columbus, Ohio, June. Association for Computational Linguistics.