Head-driven transition-based parsing with top-down prediction

50th Annual Meeting of the Association for Computational Linguistics, ACL 2012 - Proceedings of the Conference

Volumn 1, Issue , 2012, Pages 657-665

  Hayashi, Katsuhiko ^a   Watanabe, Taro ^b   Asahara, Masayuki ^c   Matsumoto, Yuji ^a  

^a NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b NATIONAL INSTITUTE OF INFORMATION AND COMMUNICATIONS TECHNOLOGY   (Japan)

^c NATIONAL INSTITUTE FOR JAPANESE LANGUAGE AND LINGUISTICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DEPENDENCY ANALYSIS; DEPENDENCY PARSING; GLOBAL STRUCTURE; HEAD-DRIVEN; PARSING ALGORITHM; TOPDOWN; TREEBANKS;

ALGORITHMS; COMPUTATIONAL LINGUISTICS;

DIGITAL STORAGE;

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

References (30)

1. A. V. Aho and J. D. Ullman. 1972. The Theory of Parsing, Translation and Compiling, volume 1: Parsing. Prentice-Hall.
2. H. Alshawi. 1996. Head automata for speech translation. In Proc. the ICSLP.
3. G. Attardi. 2006. Experiments with a multilanguage non-projective dependency parser. In Proc. the 10th CoNLL, pages 166-170.
4. M. Collins and B. Roark. 2004. Incremental parsing with the perceptron algorithm. In Proc. the 42nd ACL.
5. J. Earley. 1970. An efficient context-free parsing algorithm. Communications of the Association for Computing Machinery, 13(2):94-102.
6. J. M. Eisner and G. Satta. 1999. Efficient parsing for bilexical context-free grammars and head automaton grammars. In Proc. the 37th ACL, pages 457-464.
7. Y. Goldberg and M. Elhadad. 2010. An efficient algorithm for easy-first non-directional dependency parsing. In Proc. the HLT-NAACL, pages 742-750.
8. K. Hayashi, T. Watanabe, M. Asahara, and Y. Matsumoto. 2011. The third-order variational reranking on packed-shared dependency forests. In Proc. EMNLP, pages 1479-1488.
9. L. Huang and K. Sagae. 2010. Dynamic programming for linear-time incremental parsing. In Proc. the 48th ACL, pages 1077-1086.
10. H. Isozaki, H. Kazawa, and T. Hirao. 2004. A deterministic word dependency analyzer enhanced with preference learning. In Proc. the 21st COLING, pages 275- 281.
11. R. Johansson and P. Nugues. 2007. Extended constituent-to-dependency conversion for english. In Proc. NODALIDA.
12. M. Johnson. 2007. Transforming projective bilexical dependency grammars into efficiently-parsable CFGs with unfold-fold. In Proc. the 45th ACL, pages 168- 175.
13. M. Kay. 1989. Head driven parsing. In Proc. the IWPT.
14. K. Kitagawa and K. Tanaka-Ishii. 2010. Tree-based deterministic dependency parsing - an application to nivre's method -. In Proc. the 48th ACL 2010 Short Papers, pages 189-193, July.
15. T. Koo and M. Collins. 2010. Efficient third-order dependency parsers. In Proc. the 48th ACL, pages 1-11.
16. T. Koo, A. M. Rush, M. Collins, T. Jaakkola, and D. Sontag. 2010. Dual decomposition for parsing with nonprojective head automata. In Proc. EMNLP, pages 1288-1298.
17. D. McAllester. 1999. A reformulation of eisner and satta's cubic time parser for split head automata grammars. http://ttic.uchicago.edu/dmcallester/.
18. R. McDonald and F. Pereira. 2006. Online learning of approximate dependency parsing algorithms. In Proc. EACL, pages 81-88.
19. R. McDonald, F. Pereira, K. Ribarov, and J. Hajic. 2005. Non-projective dependency parsing using spanning tree algorithms. In Proc. HLT-EMNLP, pages 523- 530.
20. R. McDonald. 2012. Minimum spanning tree parser. http://www.seas.upenn. edu/strctlrn/MSTParser.
21. M.-J. Nederhof. 2003. Weighted deductive parsing and knuth's algorithm. Computational Linguistics, 29:135-143.
22. J. Nivre. 2003. An efficient algorithm for projective dependency parsing. In Proc. the IWPT, pages 149-160.
23. J. Nivre. 2004. Incrementality in deterministic dependency parsing. In Proc. the ACL Workshop Incremental Parsing: Bringing Engineering and Cognition Together, pages 50-57.
24. J. Nivre. 2006. Inductive Dependency Parsing. Springer.
25. J. Nivre. 2008a. Algorithms for deterministic incremental dependency parsing. Computational Linguistics, 34:513-553.
26. J. Nivre. 2008b. Sorting out dependency parsing. In Proc. the CoTAL, pages 16-27.
27. A. Stolcke. 1995. An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computational Linguistics, 21(2):165-201.
28. H. Yamada and Y. Matsumoto. 2003. Statistical dependency analysis with support vector machines. In Proc. the IWPT, pages 195-206.
29. Y. Zhang and S. Clark. 2008. A tale of two parsers: Investigating and combining graph-based and transitionbased dependency parsing using beam-search. In Proc. EMNLP, pages 562-571.
30. Y. Zhang and J. Nivre. 2011. Transition-based dependency parsing with rich non-local features. In Proc. the 49th ACL, pages 188-193.