Accurate Context-Free Parsing with Combinatory Categorial Grammar
暂无分享,去创建一个
[1] David J. Weir,et al. The equivalence of four extensions of context-free grammars , 1994, Mathematical systems theory.
[2] Mark Steedman,et al. Building Deep Dependency Structures using a Wide-Coverage CCG Parser , 2002, ACL.
[3] James R. Curran,et al. Wide-Coverage Efficient Statistical Parsing with CCG and Log-Linear Models , 2007, Computational Linguistics.
[4] Martin Kay,et al. Syntactic Process , 1979, ACL.
[5] Dan Klein,et al. Improved Inference for Unlexicalized Parsing , 2007, NAACL.
[6] Wojciech Zielonka. Axiomatizability of Ajdukiewicz-Lambek Calculus by Means of Cancellation Schemes , 1981, Math. Log. Q..
[7] Jason Baldridge,et al. A Logical Basis for the D Combinator and Normal Form in CCG , 2008, ACL.
[8] Jason Baldridge,et al. Lexically specified derivational control in combinatory categorial grammar , 2002 .
[9] Mark Steedman,et al. Wide-Coverage Semantic Representations from a CCG Parser , 2004, COLING.
[10] J. Lambek. The Mathematics of Sentence Structure , 1958 .
[11] Mark Steedman,et al. CCGbank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank , 2007, CL.