论文信息 - Parsing CCGbank with the Lambek Calculus

Parsing CCGbank with the Lambek Calculus

This paper will analyze CCGbank, a corpus of CCG derivations, for use with the Lambek calculus. We also present a Java implementation of the parsing algorithm for the Lambek calculus presented in Fowler (2009) and the results of experiments using that algorithm to parse the categories in CCGbank. We conclude that the Lambek calculus is computationally tractable for this task and provide insight into a full conversion of CCGbank to a bank of Lambek derivations.

Timothy A. D. Fowler

[1] Mati Pentus. Product-Free Lambek Calculus and Context-Free Grammars , 1997, J. Symb. Log..

[2] Jason Baldridge,et al. A Logical Basis for the D Combinator and Normal Form in CCG , 2008, ACL.

[3] Wojciech Zielonka. Axiomatizability of Ajdukiewicz-Lambek Calculus by Means of Cancellation Schemes , 1981, Math. Log. Q..

[4] Lawrence S. Moss,et al. Deductive systems and grammars: proofs as grammatical structures , 1999 .

[5] J. Lambek. The Mathematics of Sentence Structure , 1958 .

[6] Julia Hockenmaier,et al. Data and models for statistical parsing with combinatory categorial grammar , 2003 .

[7] Timothy A. D. Fowler. A Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus , 2009, MOL.

[8] Mark Steedman,et al. CCGbank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank , 2007, CL.

[9] Yury Savateev,et al. Product-free Lambek calculus is NP-complete , 2009, Ann. Pure Appl. Log..

[10] Martin Kay,et al. Syntactic Process , 1979, ACL.

[11] James R. Curran,et al. Parsing the WSJ Using CCG and Log-Linear Models , 2004, ACL.