[1] S. Clark, J. Hockenmaier, and M. Steedman. Building deep dependency structures with a wide-coverage CCG parser. In Proceedings of the 40th Meeting of the ACL, pages 327-334, 2002. [ bib | .pdf ]
[2] P. De Groote. Towards abstract categorial grammars. In ACL, volume 39, pages 148-155. Association for Computational Linguistics, 2001. [ bib | .pdf ]
[3] P. de Groote. Tree-adjoining grammars as abstract categorial grammars. In TAG+ 6, Proceedings of the sixth International Workshop on Tree Adjoining Grammars and Related Frameworks, pages 145-150, 2002. [ bib | .pdf ]
[4] J. Hockenmaier. Creating a CCGbank and a wide-coverage CCG lexicon for German. In ACL, volume 44, pages 505-512, 2006. [ bib | .pdf ]
[5] J. Hockenmaier and P. Young. Non-local scrambling: the equivalence of TAG and CCG revisited. In Proceedings of TAG+ 8, volume 9, 2008. [ bib | .pdf ]
[6] A.K. Joshi, T. Becker, and O. Rambow. Complexity of scrambling: A new twist to the competence-performance distinction. In TAG+ 3. Citeseer, 1994. [ bib ]
[7] A. Koller and M. Kuhlmann. Dependency trees and the strong generative capacity of CCG. In Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics, pages 460-468. Association for Computational Linguistics, 2009. [ bib | http ]
[8] M. Kuhlmann and M. Möhl. Mildly context-sensitive dependency languages. In ACL, volume 45, page 160, 2007. [ bib | .pdf ]
[9] M. Kuhlmann and M. Möhl. The string-generative capacity of regular dependency languages. In Twelfth Conference on Formal Grammar, 2007. [ bib | .pdf ]
[10] O. Rambow and A.K. Joshi. A processing model for free word order languages, chapter Perspectives on sentence processing. 1995. [ bib ]
[11] S.M. Shieber and Y. Schabes. Synchronous tree-adjoining grammars. In Proceedings of the 13th conference on Computational linguistics-Volume 3, pages 253-258. Association for Computational Linguistics Morristown, NJ, USA, 1990. [ bib | http ]

This file was generated by bibtex2html 1.92.