A Linear Logic Treatment of Phrase Structure Grammars for Unbounded Dependencies

A number of researchers have proposed applications of Girard's Linear Logic [7] to computational linguistics. Most have focused primarily on the connection between linear logic and categorial grammars. In this work we show how linear logic can be used to provide an attractive encoding of phrase structure grammars for parsing structures involving unbounded dependencies. The resulting grammars are closely related to Generalized Phrase Structure Grammars [4, 5]. As part of the presentation we show how a variety of issues, such as island and coordination constraints can be dealt with in this model.

[1]  M. Nivat.  Fiftieth volume of theoretical computer science , 1988 .

[2]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[3]  J. Lambek,et al.  Introduction to higher order categorical logic , 1986 .

[4]  Aravind K. Joshi,et al.  Natural language parsing: Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions? , 1985 .

[5]  Mary Dalrymple,et al.  Quantifiers, Anaphora, and Intensionality , 1995, J. Log. Lang. Inf..

[6]  Mark Hepple,et al.  Hybrid Categorial Logics , 1995, Log. J. IGPL.

[7]  Aravind K. Joshi,et al.  An Introduction to Tree Adjoining Grammar , 1987 .

[8]  Gerald Gazdar,et al.  Unbounded Dependencies and Coordinate Structure , 1981 .

[9]  John Robert Ross,et al.  Constraints on variables in syntax , 1967 .

[10]  J. S. Hodas.  Logic programming in intuitionistic linear logic: theory, design, and implementation , 1995 .

[11]  Dirk Roorda,et al.  Resource Logics : Proof-Theoretical Investigations , 1991 .

[12]  Stuart M. Shieber,et al.  Prolog and Natural-Language Analysis , 1987 .

[13]  Mark Steedman,et al.  Combinators and Grammars , 1988 .

[14]  C. Pollard,et al.  Center for the Study of Language and Information , 2022 .

[15]  Geoffrey K. Pullum,et al.  Generalized Phrase Structure Grammar , 1985 .

[16]  Patrick Saint-Dizier,et al.  Review of Prolog and natural-language analysis: CSLI lecture notes 10 by Fernando C. N. Pereira and Stuart M. Shieber. Center for the Study of Language and Information 1987. , 1988 .

[17]  Geoffrey K. Pullum,et al.  The nature of syntactic representation , 1982 .

[18]  Joshua S. Hodas,et al.  Specifying Filler-Gap Dependency Parsers in a Linear-Logic Programming Language , 1992, JICSLP.

[19]  Mary Dalrymple,et al.  A Deductive Account of Quantification in LFG , 1994, ArXiv.

[20]  Remo Pareschi,et al.  Type-driven natural language analysis , 1988 .

[21]  Gerald Gazdar,et al.  Phrase Structure Grammar , 1982 .

[22]  Glyn Morrill,et al.  Clausal proof nets and discontinuity , 1994 .

[23]  Dale A. Miller,et al.  AN OVERVIEW OF PROLOG , 1988 .

[24]  Dale Miller,et al.  Logic programming in a fragment of intuitionistic linear logic , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[25]  Mary Dalrymple,et al.  Linear Logic for Meaning Assembly , 1995, ArXiv.

[26]  Richard T. Oehrle,et al.  Term-labeled categorial type systems , 1994 .

[27]  Dale Miller,et al.  Extending Definite Clause Grammars with Scoping Constructs , 1990, ICLP.

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