Structured perceptron with inexact search

NAACL HLT 2012 - 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Proceedings of the Conference

Volumn , Issue , 2012, Pages 142-151

  Huang, Liang ^a   Fayong, Suphan ^b   Guo, Yang ^c  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b University of Southern California   (United States)

^c Bloomberg LP   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE INFERENCE; BEAM SEARCH; CONDITION; EXACT INFERENCE; INEXACT SEARCHES; ON STATE; PRACTICAL PROBLEMS; STRUCTURED PREDICTION; THEORETICAL GUARANTEES; TRAINING TIME;

COMPUTATIONAL LINGUISTICS;

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

References (21)

1. Collins, Michael. 2002. Discriminative training methods for hidden markov models: Theory and experiments with perceptron algorithms. In Proceedings of EMNLP.
2. Collins, Michael and Brian Roark. 2004. Incremental parsing with the perceptron algorithm. In Proceedings of ACL.
3. Crammer, Koby and Yoram Singer. 2003. Ultraconservative online algorithms for multiclass problems. Journal of Machine Learning Research (JMLR), 3:951-991.
4. Daumé, Hal, John Langford, and Daniel Marcu. 2009. Search-based structured prediction.
5. Daumé, Hal and DanielMarcu. 2005. Learning as search optimization: Approximate large margin methods for structured prediction. In Proceedings of ICML.
6. Finley, Thomas and Thorsten Joachims. 2008. Training structural SVMs when exact inference is intractable. In Proceedings of ICML.
7. Huang, Liang. 2008. Forest reranking: Discriminative parsing with non-local features. In Proceedings of the ACL: HLT, Columbus, OH, June.
8. Huang, Liang and Kenji Sagae. 2010. Dynamic programming for linear-time incremental parsing. In Proceedings of ACL 2010.
9. Joachims, T., T. Finley, and Chun-Nam Yu. 2009. Cutting-plane training of structural svms. Machine Learning, 77(1):27-59.
10. Kulesza, Alex and Fernando Pereira. 2007. Structured learning with approximate inference. In NIPS.
11. Lafferty, John, Andrew McCallum, and Fernando Pereira. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of ICML.
12. Liang, Percy, Alexandre Bouchard-Côté, Dan Klein, and Ben Taskar. 2006. An end-to-end discriminative approach to machine translation. In Proceedings of COLING-ACL, Sydney, Australia, July.
13. Marcus, Mitchell P., Beatrice Santorini, and Mary Ann Marcinkiewicz. 1993. Building a large annotated corpus of English: the Penn Treebank. Computational Linguistics, 19:313-330.
14. McDonald, Ryan and Fernando Pereira. 2006. Online learning of approximate dependency parsing algorithms. In Proceedings of EACL.
15. Ratliff, Nathan, J. Andrew Bagnell, and Martin Zinkevich. 2007. (online) subgradient methods for structured prediction. In Proceedings of AIStats.
16. Ratnaparkhi, Adwait. 1996. A maximum entropy model for part-of-speech tagging. In Proceedings of EMNLP.
17. Shen, Libin, Giorgio Satta, and Aravind Joshi. 2007. Guided learning for bidirectional sequence classification. In Proceedings of ACL.
18. Taskar, Ben, Carlos Guestrin, and Daphne Koller. 2003. Max-margin markov networks. In Proceedings of NIPS. MIT Press.
19. Tsochantaridis, I., T. Joachims, T. Hofmann, and Y. Altun. 2005. Large margin methods for structured and interdependent output variables. Journal of Machine Learning Research, 6:1453-1484.
20. Xu, Yuehua, Alan Fern, and Sungwook Yoon. 2009. Learning linear ranking functions for beamsearch with application to planning. Journal of Machine Learning Research (JMLR), 10:1349-1388.
21. Zhang, Yue and Stephen Clark. 2008. A tale of two parsers: investigating and combining graph-based and transition-based dependency parsing using beamsearch. In Proceedings of EMNLP.