Efficient CCG parsing: A* versus adaptive supertagging

ACL-HLT 2011 - Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies

Volumn 1, Issue , 2011, Pages 1577-1585

  Auli, Michael ^a   Lopez, Adam ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BEST MODEL; COMBINATORY CATEGORIAL GRAMMAR; CPU TIME; GRAMMAR FORMALISMS; SEARCH SPACES; SEARCH TECHNIQUE;

COMPUTATIONAL LINGUISTICS; INFORMATION ANALYSIS;

FORMAL LANGUAGES;

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

References (21)

1. S. Bangalore and A. K. Joshi. 1999. Supertagging: An Approach to Almost Parsing. Computational Linguistics, 25(2):238-265, June.
2. G. S. Brodal. 1996. Worst-case efficient priority queues. In Proc. of SODA, pages 52-58.
3. S. Clark and J. R. Curran. 2004. The importance of supertagging for wide-coverage CCG parsing. In Proc. of COLING.
4. S. Clark and J. R. Curran. 2007. Wide-coverage efficient statistical parsing with CCG and log-linear models. Computational Linguistics, 33(4):493-552.
5. S. Clark and J. Hockenmaier. 2002. Evaluating a widecoverage CCG parser. In Proc. of LREC Beyond Parseval Workshop, pages 60-66.
6. S. Clark. 2002. Supertagging for Combinatory Categorial Grammar. In Proc. of TAG+6, pages 19-24.
7. B. Djordjevic, J. R. Curran, and S. Clark. 2007. Improving the efficiency of a wide-coverage CCG parser. In Proc. of IWPT.
8. P. F. Felzenszwalb and D. McAllester. 2007. The Generalized A* Architecture. In Journal of Artificial Intelligence Research, volume 29, pages 153-190.
9. T. A. D. Fowler and G. Penn. 2010. Accurate contextfree parsing with combinatory categorial grammar. In Proc. of ACL.
10. P. Hart, N. Nilsson, and B. Raphael. 1968. A formal basis for the heuristic determination of minimum cost paths. Transactions on Systems Science and Cybernetics, 4, Jul.
11. J. Hockenmaier and M. Steedman. 2002. Generative models for statistical parsing with Combinatory Categorial Grammar. In Proc. of ACL, pages 335-342. Association for Computational Linguistics.
12. J. Hockenmaier and M. Steedman. 2007. CCGbank: A corpus of CCG derivations and dependency structures extracted from the Penn Treebank. Computational Linguistics, 33(3):355-396.
13. D. Klein and C. D. Manning. 2001. Parsing and hypergraphs. In Proc. of IWPT.
14. D. Klein and C. D. Manning. 2003. A* parsing: Fast exact Viterbi parse selection. In Proc. of HLT-NAACL, pages 119-126, May.
15. D. E. Knuth. 1977. A generalization of Dijkstra's algorithm. Information Processing Letters, 6:1-5.
16. J. K. Kummerfeld, J. Roesner, T. Dawborn, J. Haggerty, J. R. Curran, and S. Clark. 2010. Faster parsing by supertagger adaptation. In Proc. of ACL.
17. A. Pauls and D. Klein. 2009a. Hierarchical search for parsing. In Proc. of HLT-NAACL, pages 557-565, June.
18. A. Pauls and D. Klein. 2009b. k-best A* Parsing. In Proc. of ACL-IJCNLP, ACL-IJCNLP '09, pages 958-966.
19. B. Roark and K. Hollingshead. 2009. Linear complexity context-free parsing pipelines via chart constraints. In Proc. of HLT-NAACL.
20. M. Steedman. 2000. The syntactic process. MIT Press, Cambridge, MA.
21. Y. Zhang, B.-G. Ahn, S. Clark, C. V. Wyk, J. R. Curran, and L. Rimell. 2010. Chart pruning for fast lexicalised-grammar parsing. In Proc. of COLING.