Logical Grammars Based on Constraint Handling Rules

CHR Grammars (CHRGs) are a grammar formalism that provides a constraint-solving approach to language analysis, built on top of Constraint Handling Rules in the same way as Definite Clause Grammars (DCGs) on Prolog. CHRGs work bottom-up and add the following features when compared with DCGs: An inherent treatment of ambiguity without backtracking. Robust parsing; do not give up in case of errors but return the recognized phrases. Flexibility to produce and consume arbitrary hypotheses making it straightforward to deal with abduction, integrity constraints, operators a la assumption grammars, and to incorporate other constraint solvers. References to left and right syntactic context; apply for disambiguation of simple and otherwise ambiguous grammars, coordination in natural language, and tagger-like grammar rules.

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

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

[3]  Michael J. Maher,et al.  MultiCPL ’ 02 : Workshop on Multiparadigm Constraint Programming Languages and RCoRP ’ 02 : Fourth Workshop on Rule-Based Constraint Reasoning and Programming , 2002 .

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[18]  Verónica Dahl.  On Gapping Grammars , 1984, ICLP.

[19]  James F. Allen.  Natural language understanding , 1987, Bejnamin/Cummings series in computer science.

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