CHR grammars

@article{Christiansen2005CHRG,
  title={CHR grammars},
  author={Henning Christiansen},
  journal={Theory and Practice of Logic Programming},
  year={2005},
  volume={5},
  pages={467 - 501}
}
  • Henning Christiansen
  • Published 12 August 2004
  • Computer Science
  • Theory and Practice of Logic Programming
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… 
CHR Grammars with multiple constraint stores
CHR Grammars (CHRG) are a recent constraint-based grammar formalism added on top of CHR analogously to the way Definite Clause Grammars are defined and implemented over Prolog. A CHRG executes as an
Abductive Logic Grammars
TLDR
It is shown that rich and accurate knowledge extraction from text can be achieved through the use of this new formalism, and the usual left-to-right derivations that are traditional in logic grammars but also arbitrary (i.e., order-independent) derivations are considered.
Grammar Induction as Automated Transformation between Constraint Solving Models of Language
We specialize an efficient while linguistically savvy constraint solving model of grammar inductionWomb Grammars (WG) -, into an interesting specific application: that of inferring the grammar of an
Parsing with Partially Known Grammar
TLDR
It is argued that unspecified information can be detected with appropriate ontologies together with the adaptation of a recently introduced constraint-based methodology for acquiring linguistic information on a given language from that of another.
Completing Mixed Language Grammars Through Womb Grammars Plus Ontologies
TLDR
This position paper proposes to detect unspecified information with appropriate ontologies and exploits the descriptive power of constraints both for defining sentence acceptability and for inferring lexical knowledge from a word’s sentential context, even when foreign.
From use cases to UML class diagrams using logic grammars and constraints
We investigate the possibilities for automated transition from Use Cases in a restricted natural language syntax into UML class diagrams, by trying to capture the semantics of the natural language
Womb Grammars : Constraint Solving for Grammar Induction
We present Womb Grammars, a novel constraint-based framework implemented in CHRG and particularly useful for inducing, from known linguistic constraints that describe phrases in a language called the
Extracting Selected Phrases through Constraint Satisfaction
TLDR
This approach constitutes a flexible parsing technology in which the notions of derivation and hierarchy give way to the more flexible notion of constraint satisfaction between categories, making it possible to describe the syntactic characteristics of a category in terms of satisfied and violated constraints.
Meaning in Context
TLDR
A model for context-dependent natural language semantics is proposed and formalized in terms of possible worlds, and it is shown that the mentioned constraint solvers serve as effective and efficient abductive engines for the purpose.
HYPROLOG: A New Logic Programming Language with Assumptions and Abduction
TLDR
HYPROLOG, a novel integration of Prolog with assumptions and abduction which is implemented in and partly borrows syntax from Constraint Handling Rules (CHR) for integrity constraints, shows a novel flexibility in the interaction between the different paradigms.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 70 REFERENCES
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
A constraint-based bottom-up counterpart to DCG
A new grammar formalism, CHR Grammars (CHRG), is proposed that provides a constraintsolving approach to language analysis, built on top of the programming language of Constraint Handling Rules in the
CHR as grammar formalism. A first report
Grammars written as Constraint Handling Rules (CHR) can be executed as efficient and robust bottom-up parsers that provide a straightforward, non-backtracking treatment of ambiguity. Abduction with
Logic grammars for diagnosis and repair
  • Henning Christiansen, V. Dahl
  • Computer Science
    14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.
  • 2002
We propose an abductive model based on Constraint Handling Rule Grammars (CHRGs) for detecting and correcting errors in problem domains that can be described in terms of strings of words accepted by
Principles and Implementation of Deductive Parsing
TLDR
This work presents a system for generating parsers based directly on the metaphor of parsing as deduction, which generalizes easily to parsers for augmented phrase structure formalisms, such as definite-clause grammars and other logic grammar formalisms.
Applying Constraint Handling Rules to HPSG
TLDR
Constraint Handling Rules can be used not only to extend the constraint language of feature structure descriptions to include relations in a declarative way, but also to provide support for constraints with complex antecedents and constraints on the co-occurrence of feature values that are necessary to interpret the type system of HPSG properly.
Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks
TLDR
It is argued that DCGs can be at least as efficient as ATNs, whilst the DCG formalism is clearer, more concise and in practice more powerful.
CHRv: A Flexible Query Language
We show how the language Constraint Handling Rules (CHR), a high-level logic language for the implementation of constraint solvers, can be slightly extended to become a general-purpose logic
Compiling Constraint Handling Rules into Prolog with Attributed Variables
We introduce the most recent and advanced implementation of constraint handling rules (CHR) in a logic programming language, which improves both on previous implementations (in terms of completeness,
Theory and Practice of Constraint Handling Rules
TLDR
This survey describes implementations of the CHR language, defines syntax and semantics for CHR, introduces an important decidable property, confluence, of CHR programs and defines a tight integration of CHR with constraint logic programming languages.
...
1
2
3
4
5
...