Dynamic feature selection for dependency parsing

EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference

Volumn , Issue , 2013, Pages 1455-1464

  He, He ^a   Daumé, Hal ^a   Eisner, Jason ^b  

^a Department of Computer Science University of Maryland ^*  (United States)

^b Johns Hopkins University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; DECISION MAKING; GRAPHIC METHODS; NATURAL LANGUAGE PROCESSING SYSTEMS; SYNTACTICS;

DEPENDENCY PARSING; DYNAMIC FEATURE SELECTIONS; DYNAMIC PARSERS; FEATURE COMPUTATION; FEATURE TEMPLATE; GRAPH-BASED; IMITATION LEARNING; SEQUENTIAL DECISION MAKING;

FEATURE EXTRACTION;

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

References (35)

1. P. Abbeel and A. Y. Ng. 2004. Apprenticeship learning via inverse reinforcement learning. In Proceedings of ICML.
2. D. Benbouzid, R. Busa-Fekete, and B. Kégl. 2012. Fast classification using space decision DAGs. In Proceedings of ICML.
3. S. Bergsma and C. Cherry. 2010. Fast and accurate arc filtering for dependency parsing. In Proceedings of COLING.
4. S. Buchholz and E. Marsi. 2006. CoNLL-X shared task on multilingual dependency parsing. In CoNLL.
5. Xavier Carreras. 2007. Experiments with a higher-order projective dependency parser. In Proceedings of the CoNLL Shared Task Session of EMNLP-CoNLL.
6. Eugene Charniak, Mark Johnson, Micha Elsner, Joseph Austerweil, David Ellis, Isaac Haxton, Catherine Hill, R. Shrivaths, Jeremy Moore, Michael Pozar, and Theresa Vu. 2006. Multilevel coarse-to-fine PCFG parsing. In Proceedings of ACL.
7. Y. J. Chu and T. H. Liu. 1965. On the shortest arborescence of a directed graph. Science Sinica, 14.
8. Koby Crammer and Yoram Singer. 2003. Ultraconservative online algorithms for multiclass problems. Journal of Machine Learning Research, 3:951-991.
9. Koby Crammer, Ofer Dekel, Joseph Keshet, Shai Shalev-Shwartz, and Yoram Singer. 2006. Online passive-aggressive algorithms. Journal of Machine Learning Research, 7:551-585.
10. Hal Daumé III, John Langford, and Daniel Marcu. 2009. Search-based structured prediction. Machine Learning Journal (MLJ).
11. J. Edmonds. 1967. Optimum branchings. Journal of Research of the National Bureau of Standards, (71B):233-240.
12. Jason Eisner. 1996. Three new probabilistic models for dependency parsing: an exploration. In Proceedings of COLING.
13. Rong-En Fan, Kai-Wei Chang, Cho-Jui Hsieh, Xiang-Rui Wang, and Chih-Jen Lin. 2008. LIBLINEAR: A library for large linear classification. Journal of Machine Learning Research, 9:1871-1874.
14. Tianshi Gao and Daphne Koller. 2010. Active classification based on value of classifier. In Proceedings of NIPS.
15. Alexander Grubb and J. Andrew Bagnell. 2012. SpeedBoost: Anytime prediction with uniform nearoptimality. In AISTATS.
16. He He, Hal Daumé III, and Jason Eisner. 2012. Costsensitive dynamic feature selection. In ICML Inferning Workshop.
17. Matti Kääriäinen. 2006. Lower bounds for reductions. Talk at the Atomic Learning Workshop (TTI-C), March.
18. Terry Koo and Michael Collins. 2010. Efficient third-order dependency parsers. In Proceedings of ACL.
19. Mitchell P. Marcus, Beatrice Santorini, and Mary Ann Marcinkiewicz. 1993. Building a large annotated corpus of English: The Penn Treebank. Computational Linguistics, 19(2):313-330.
20. André F. T. Martins, Dipanjan Das, Noah A. Smith, and Eric P. Xing. 2008. Stacking dependency parsers. In Proceedings of EMNLP.
21. Ryan McDonald and Fernando Pereira. 2006. Online learning of approximate dependency parsing algorithms. In Proceedings of EACL, pages 81-88.
22. Ryan McDonald, K. Crammer, and Fernando Pereira. 2005a. Online large-margin training of dependency parsers. In Proceedings of ACL.
23. Ryan McDonald, Fernando Pereira, Kiril Ribarov, and Jan Hajič. 2005b. Non-projective dependency parsing using spanning tree algorithms. In Proc. of EMNLP.
24. N. Ratliff, D. Bradley, J. A. Bagnell, and J. Chestnutt. 2004. Boosting structured prediction for imitation learning. In Proceedings of ICML.
25. B. Roark and K. Hollingshead. 2008. Classifying chart cells for quadratic complexity context-free inference. In Proceedings of COLING.
26. Stéphane. Ross, Geoffrey J. Gordon, and J. Andrew Bagnell. 2011. A reduction of imitation learning and structured prediction to no-regret online learning. In Proceedings of AISTATS.
27. Alexander Rush and Slav Petrov. 2012. Vine pruning for efficient multi-pass dependency parsing. In Proceedings of NAACL.
28. David A. Smith and Jason Eisner. 2008. Dependency parsing by belief propagation. In EMNLP.
29. Richard S. Sutton and Andrew G. Barto. 1998. Reinforcement Learning: An Introduction. MIT Press.
30. R. E. Tarjan. 1977. Finding optimum branchings. Networks, 7(1):25-35.
31. Kristina Toutanova, Dan Klein, Christopher Manning, and Yoram Singer. 2003. Feature-rich part-of-speech tagging with a cyclic dependency network. In NAACL.
32. Paul Viola and Michael Jones. 2004. Robust feal-time face detection. International Journal of Computer Vision, 57:137-154.
33. Qin Iris Wang, Dekang Lin, and Dale Schuurmans. 2007. Simple training of dependency parsers via structured boosting. In Proceedings of IJCAI.
34. David Weiss and Ben Taskar. 2010. Structured prediction cascades. In Proceedings of AISTATS.
35. H. Yamada and Y. Matsumoto. 2003. Statistical dependency analysis with Support Vector Machines. In Proceedings of IWPT.