Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-17T22:49:15.863Z Has data issue: false hasContentIssue false
  • English
  • Français

CHR grammars

Published online by Cambridge University Press:  01 July 2005

HENNING CHRISTIANSEN
HENNING CHRISTIANSEN
Affiliation:
Computer Science Department, Roskilde University, P.O. Box 260, DK-4000 Roskilde, Denmark (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Keywords

constraint logic programmingconstraint handling ruleslogic grammars
Type
Regular Papers
Information
Theory and Practice of Logic Programming , Volume 5 , Issue 4-5 , July 2005 , pp. 467 - 501
Copyright
© 2005 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)