CHR grammars

A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena. The formalism extends previous logic programming based grammars with a form of context-sensitive rules and the possibility to include extra-grammatical hypotheses in both head and body of grammar rules. Among the applications are straightforward implementations of Assumption Grammars and abduction under integrity constraints for language analysis. CHR grammars appear as a powerful tool for specification and implementation of language processors and may be proposed as a new standard for bottom-up grammars in logic programming.

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

[2]  Francesco Parisi-Presicce,et al.  Deductive Parsing of Visual Languages , 2001, LACL.

[3]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[4]  Drew McDermott,et al.  Introduction to artificial intelligence , 1986, Addison-Wesley series in computer science.

[5]  Gerald Gazdar,et al.  Natural Language Processing in PROLOG: An Introduction to Computational Linguistics , 1989 .

[6]  Henning Christiansen,et al.  Logical Grammars Based on Constraint Handling Rules , 2002, ICLP.

[7]  Bernd Meyer,et al.  A constraint-based framework for diagrammatic reasoning , 2000, Appl. Artif. Intell..

[8]  Stefan Thater,et al.  Parsing with Tree Descriptions: a constraint-based approach , 1999 .

[9]  Jerry R. Hobbs,et al.  Interpretation as Abduction , 1993, Artif. Intell..

[10]  Verónica Dahl,et al.  Datalog Grammars , 1994, GULP-PRODE.

[11]  Henning Christiansen.  Open Theories and Abduction for Context and Accommodation , 1999, CONTEXT.

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

[13]  Denys Duchier.  Constraint Programming for Natural Language Processing , 2000 .

[14]  Dov M. Gabbay,et al.  Labelled abduction and relevance reasoning , 1994 .

[15]  Robert Stalnaker,et al.  On the Representation of Context , 1996, J. Log. Lang. Inf..

[16]  Philippe Blache,et al.  Constraints, Linguistic Theories and Natural Language Processing , 2000, Natural Language Processing.

[17]  David A. McAllester.  Meta-complexity Theorems: Talk Abstract , 2000, CP.

[18]  Rina Dechter,et al.  Principles and Practice of Constraint Programming – CP 2000 , 2001, Lecture Notes in Computer Science.

[19]  Harald Ganzinger,et al.  A New Meta-complexity Theorem for Bottom-Up Logic Programs , 2001, IJCAR.

[20]  Henning Christiansen,et al.  CHR as grammar formalism. A first report , 2001, ArXiv.

[21]  Thom W. Frühwirth,et al.  Compiling Constraint Handling Rules into Prolog with Attributed Variables , 1999, PPDP.

[22]  Antonis C. Kakas,et al.  ACLP: Flexible Solutions to Complex Problems , 1997, LPNMR.

[23]  Slim Abdennadher,et al.  Chr _ : a Flexible Query Language , 2022 .

[24]  James F. Allen.  Natural language understanding (2nd ed.) , 1995 .

[25]  Gerald Penn.  Applying Constraint Handling Rules to HPSG , 2000, ArXiv.

[26]  Slim Abdennadher,et al.  An Experimental CLP Platform for Integrity Constraints and Abduction , 2000, FQAS.

[27]  Verónica Dahl,et al.  Logic grammars for diagnosis and repair , 2002, 14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings..

[28]  Henning Christiansen,et al.  Assumptions and Abduction in Prolog , 2004, WLPE.

[29]  Henning Christiansen,et al.  A constraint-based bottom-up counterpart to DCG , 2003 .

[30]  Chris Mellish,et al.  Natural Language Processing in Pop-11: An Introduction to Computational Linguistics , 1989 .

[31]  Hiroshi Maruyama,et al.  Structural Disambiguation with Constraint Propagation , 1990, ACL.

[32]  Henning Christiansen,et al.  Abductive language interpretation as bottom-up deduction , 2002 .

[33]  Seth D. Bergmann,et al.  Compilers , 1973, CSC '73.

[34]  Kim Marriott.  Constraint multiset grammars , 1994, Proceedings of 1994 IEEE Symposium on Visual Languages.

[35]  Thom W. Frühwirth,et al.  Theory and Practice of Constraint Handling Rules , 1998, J. Log. Program..

[36]  Eric Brill,et al.  Transformation-Based Error-Driven Learning and Natural Language Processing: A Case Study in Part-of-Speech Tagging , 1995, CL.

[37]  Frank Morawietz.  Chart Parsing and Constraint Programming , 2000, COLING.

[38]  Harald Ganzinger,et al.  Logical Algorithms , 2002, ICLP.

[39]  Verónica Dahl,et al.  Assumption Grammars for Processing Natural Language , 1997, ICLP.

[40]  Verónica Dahl.  More on Gapping Grammars , 1984, FGCS.

[41]  Stuart M. Shieber,et al.  Principles and Implementation of Deductive Parsing , 1994, J. Log. Program..