Computer Science – Computation and Language
Scientific paper
2004-08-12
Computer Science
Computation and Language
36 pp. To appear in TPLP, 2005
Scientific paper
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. To appear in Theory and Practice of Logic Programming (TPLP), 2005
No associations
LandOfFree
CHR Grammars does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with CHR Grammars, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and CHR Grammars will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-574854