Two ways of formalizing grammars

A grammar is a formal device which both identifies a certain set of utter ances as well-formed, and which also defines a transduction relation be tween these utterances and their linguistic representations. This paper focuses on two widely-used "formal" or "logical" representations of gram mars in computational linguistics, Definite Clause Grammars and Feature Structure Grammars, and describes the way in which they express the recognition problem (the problem of determining if an utterance is in the language generated by a grammar) and the parsing problem (the problem of finding the analyses assigned by a grammar to an utterance). Although both approaches are 'constraint-based', one of them is based on logical consequence relation, and the other is based on satisfiability. The main goal of this paper is to point out the different conceptual basis of these two ways of formalizing grammars, and discuss some of their properties.

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

[2]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[3]  Mark Johnson.  Logic and Feature Structures , 1991, IJCAI.

[4]  Mark Johnson,et al.  Computing with Features as Formulae , 1994, Comput. Linguistics.

[5]  Fernando Pereira,et al.  The Semantics of Grammar Formalisms Seen as Computer Languages , 1984, ACL.

[6]  Fernando Carlos Neves Pereira,et al.  Logic for natural language analysis , 1982 .

[7]  William C. Rounds,et al.  The logic of unification in grammar , 1990 .

[8]  Mark Johnson,et al.  Attribute-value logic and the theory of grammar , 1988 .

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

[10]  Mark Johnson,et al.  Features and Formulae , 1991, CL.

[11]  Greg Nelson,et al.  Fast Decision Procedures Based on Congruence Closure , 1980, JACM.

[12]  Gert Smolka,et al.  Feature-Constraint Logics for Unification Grammars , 1989, J. Log. Program..

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

[14]  William C. Rounds,et al.  LFP A Logic for Linguistic Descriptions and an Analysis of its Complexity , 1988, Comput. Linguistics.

[15]  Ivan A. Sag,et al.  Book Reviews: Head-driven Phrase Structure Grammar and German in Head-driven Phrase-structure Grammar , 1996, CL.

[16]  Edward P. Stabler.  The logical approach to syntax : foundations, specifications, and implementations of theories of government and binding , 1992 .

[17]  Bernard J. Baars.  The logic of unification. , 1985 .

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

[19]  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 .

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

[21]  Noam Chomsky.  Some notes on economy of derivation and representation , 2013 .

[22]  Mark Johnson.  Expressing Disjunctive and Negative Feature Constraints with Classical First-Order Logic , 1990, ACL.

[23]  Paolo Mancarella,et al.  Abductive Logic Programming , 1992, LPNMR.

[24]  Ronald Fagin,et al.  Finite-Model Theory - A Personal Perspective , 1990, Theor. Comput. Sci..

[25]  Mark Johnson,et al.  Features, frames and quantifier-free formulae , 1990 .

[26]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.