Principles and Implementation of Deductive Parsing

We present a system for generating parsers based directly on the metaphor of parsing as deduction. Parsing algorithms can be represented directly as deduction systems, and a single deduction engine can interpret such deduction systems so as to implement the corresponding parser. The method generalizes easily to parsers for augmented phrase structure formalisms, such as definite-clause grammars and other logic grammar formalisms, and has been used for rapid prototyping of parsing algorithms for a variety of formalisms including variants of tree-adjoining grammars, categorial grammars, and lexicalized context-free grammars.

[1]  Divesh Srivastava,et al.  CORAL - Control, Relations and Logic , 1992, VLDB.

[2]  Stuart M. Shieber,et al.  An Alternative Conception of Tree-Adjoining Derivation , 1992, ACL.

[3]  Jeffrey F. Naughton,et al.  Bottom-Up Evaluation of Logic Programs , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[4]  Ehud Shapiro,et al.  Third International Conference on Logic Programming , 1986 .

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

[6]  M. Baltin,et al.  The Mental representation of grammatical relations , 1985 .

[7]  Aravind K. Joshi,et al.  A study of tree adjoining grammars , 1987 .

[8]  Daniel H. Younger,et al.  Recognition and Parsing of Context-Free Languages in Time n^3 , 1967, Inf. Control..

[9]  Stuart M. Shieber,et al.  Using Restriction to Extend Parsing Algorithms for Complex-Feature-Based Formalisms , 1985, ACL.

[10]  William C. Rounds,et al.  A Logical Version of Functional Grammar , 1987, ACL.

[11]  Jean-Louis Lassez,et al.  Computational logic: essays in honor of Alan Robinson , 1991 .

[12]  Aravind K. Joshi,et al.  Tree Adjunct Grammars , 1975, J. Comput. Syst. Sci..

[13]  David H. D. Warren,et al.  Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks , 1980, Artif. Intell..

[14]  H. Alshawi,et al.  The Core Language Engine , 1994 .

[15]  Anthony S. Kroch,et al.  The Linguistic Relevance of Tree Adjoining Grammar , 1985 .

[16]  Jack Minker.  Foundations of deductive databases and logic programming , 1988 .

[17]  Tadao Kasami,et al.  An Efficient Recognition and Syntax-Analysis Algorithm for Context-Free Languages , 1965 .

[18]  M. Moortgat.  Categorial Investigations: Logical and Linguistic Aspects of the Lambek Calculus , 1988 .

[19]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[20]  Patrick Paroubek,et al.  XTAG - A Graphical Workbench for Developing Tree-Adjoining Grammars , 1992, ANLP.

[21]  Stuart M. Shieber,et al.  Criteria for designing computer facilities for linguistic analysis , 1985 .

[22]  Hisao Tamaki,et al.  Enumeration of Success Patterns in Logic Programs , 1983, Theor. Comput. Sci..

[23]  David J. Weir,et al.  Parsing Some Constrained Grammar Formalisms , 1993, Comput. Linguistics.

[24]  David H. D. Warren,et al.  Parsing as Deduction , 1983, ACL.

[25]  Michael J. Maher,et al.  Unification Revisited , 1988, Foundations of Deductive Databases and Logic Programming..

[26]  Bernard Lang,et al.  The Structure of Shared Forests in Ambiguous Parsing , 1989, ACL.

[27]  Mati Pentus,et al.  Lambek grammars are context free , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[28]  Alain Colmerauer,et al.  Metamorphosis Grammars , 1978, Natural Language Communication with Computers.

[29]  Raghu Ramakrishnan,et al.  Magic Templates: A Spellbinding Approach To Logic Programs , 1991, J. Log. Program..

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

[31]  Richard C. Waters,et al.  Lexicalized Context-Free Grammars , 1993, ACL.

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

[33]  Michael Stonebraker,et al.  Readings in Database Systems , 1988 .

[34]  Martin Kay,et al.  Algorithm schemata and data structures in syntactic processing , 1986 .

[35]  Bob Carpenter,et al.  The logic of typed feature structures , 1992 .

[36]  Mark Steedman,et al.  On the order of words , 1982 .

[37]  Stuart M. Shieber,et al.  Constraint-based grammar formalisms , 1992 .

[38]  Leonard Bolc,et al.  Natural Language Communication with Computers , 1978, Lecture Notes in Computer Science.

[39]  Yves Schabes,et al.  LEFT TO RIGHT PARSING OF LEXICALIZED TREE‐ADJOINING GRAMMARS 1 , 1994, Comput. Intell..