Shift-reduce CCG parsing with a dependency model

52nd Annual Meeting of the Association for Computational Linguistics, ACL 2014 - Proceedings of the Conference

Volumn 1, Issue , 2014, Pages 218-227

  Xu, Wenduan ^a   Clark, Stephen ^a   Zhang, Yue ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b SINGAPORE UNIVERSITY OF TECHNOLOGY AND DESIGN   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

BEAM SEARCH; DEPENDENCY MODEL; F-SCORE; KEEP TRACK OF; PARSE FOREST; TEST TIME; TRAINING TECHNIQUES;

COMPUTATIONAL LINGUISTICS;

EID: 84906932829     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/v1/p14-1021     Document Type: Conference Paper

References (29)

1. Michael Auli and Adam Lopez. 2011. A comparison of loopy belief propagation and dual decomposition for integrated CCG supertagging and parsing. In Proc. ACL 2011, pages 470-480, Portland, OR.
2. Ted Briscoe and John Carroll. 2006. Evaluating the accuracy of an unlexicalized statistical parser on the PARC DepBank. In Proc. of COLING/ACL, pages 41-48, Sydney, Australia.
3. Stephen Clark and James R. Curran. 2006. Partial training for a lexicalized-grammar parser. In Proc. NAACL-06, pages 144-151, New York, USA.
4. Stephen Clark and James R. Curran. 2007. Widecoverage efficient statistical parsing with CCG and log-linear models. Computational Linguistics, 33(4):493-552.
5. Stephen Clark and Julia Hockenmaier. 2002. Evaluating a wide-coverage CCG parser. In Proc. of the LREC 2002 Beyond Parseval Workshop, pages 60-66, Las Palmas, Spain.
6. Stephen Clark, Julia Hockenmaier, and Mark Steedman. 2002. Building deep dependency structures with a wide-coverage CCG parser. In Proc. ACL, pages 327-334, Philadelphia, PA.
7. Michael Collins and Brian Roark. 2004. Incremental parsing with the perceptron algorithm. In Proc. of ACL, pages 111-118, Barcelona, Spain.
8. Michael Collins. 2002. Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms. In Proc. of EMNLP, pages 1-8, Philadelphia, USA.
9. Jason Eisner. 1996. Efficient normal-form parsing for Combinatory Categorial Grammar. In Proc. ACL, pages 79-86, Santa Cruz, CA.
10. Timothy AD Fowler and Gerald Penn. 2010. Accurate context-free parsing with Combinatory Categorial Grammar. In Proc. ACL, pages 335-344, Uppsala, Sweden.
11. Giorgio Gallo, Giustino Longo, Stefano Pallottino, and Sang Nguyen. 1993. Directed hypergraphs and applications. Discrete applied mathematics, 42(2):177-201.
12. Yoav Goldberg and Joakim Nivre. 2012. A dynamic oracle for arc-eager dependency parsing. In Proc. COLING, Mumbai, India.
13. Yoav Goldberg, Kai Zhao, and Liang Huang. 2013. Efficient implementation for beam search incremental parsers. In Proceedings of the Short Papers of ACL, Sofia, Bulgaria.
14. Julia Hockenmaier and Mark Steedman. 2007. CCGbank: A corpus of CCG derivations and dependency structures extracted from the Penn Treebank. Computational Linguistics, 33(3):355-396.
15. Julia Hockenmaier. 2003. Data and Models for Statistical Parsing with Combinatory Categorial Grammar. Ph.D. thesis, University of Edinburgh.
16. Liang Huang and David Chiang. 2005. Better kbest parsing. In Proceedings of the Ninth International Workshop on Parsing Technology, pages 53-64, Vancouver, Canada.
17. Liang Huang and Kenji Sagae. 2010. Dynamic programming for linear-time incremental parsing. In Proc. ACL, pages 1077-1086, Uppsala, Sweden.
18. Liang Huang, Suphan Fayong, and Yang Guo. 2012. Structured perceptron with inexact search. In Proc. NAACL, pages 142-151, Montreal, Canada.
19. Yusuke Miyao and Jun'ichi Tsujii. 2002. Maximum entropy estimation for feature forests. In Proceedings of the Human Language Technology Conference, San Diego, CA.
20. Joakim Nivre and Ryan McDonald. 2008. Integrating graph-based and transition-based dependency parsers. In Proc. of ACL/HLT, pages 950-958, Columbus, Ohio.
21. J. Nivre and M Scholz. 2004. Deterministic dependency parsing of English text. In Proceedings of COLING 2004, pages 64-70, Geneva, Switzerland.
22. Joakim Nivre, Laura Rimell, Ryan McDonald, and Carlos Gomez-Rodriguez. 2010. Evaluation of dependency parsers on unbounded dependencies. In Proc. of COLING, Beijing, China.
23. Laura Rimell, Stephen Clark, and Mark Steedman. 2009. Unbounded dependency recovery for parser evaluation. In Proc. EMNLP, pages 813-821, Edinburgh, UK.
24. Nathan Schneider, Brendan O'Connor, Naomi Saphra, David Bamman, Manaal Faruqui, Noah A. Smith, Chris Dyer, and Jason Baldridge. 2013. A framework for (under)specifying dependency syntax without overloading annotators. In Proc. of the 7th Linguistic Annotation Workshop and Interoperability with Discourse, Sofia, Bulgaria.
25. Mark Steedman. 2000. The Syntactic Process. The MIT Press, Cambridge, Mass.
26. H Yamada and Y Matsumoto. 2003. Statistical dependency analysis using support vector machines. In Proc. of IWPT, Nancy, France.
27. Heng Yu, Liang Huang, Haitao Mi, and Kai Zhao. 2013. Max-violation perceptron and forced decoding for scalable mt training. In Proc. EMNLP, Seattle, Washington, USA.
28. Yue Zhang and Stephen Clark. 2008. A tale of two parsers: investigating and combining graphbased and transition-based dependency parsing using beam-search. In Proc. of EMNLP, Hawaii, USA.
29. Yue Zhang and Stephen Clark. 2011. Shift-reduce CCG parsing. In Proc. ACL 2011, pages 683-692, Portland, OR.