Chart Parsing as Constraint Programming

Frank Morawietz

Chart Parsing as Constraint Programming

Extended Abstract 2pp., DVI (78kb); Postscript (65kb)1-up; Postscript gzip-komprimiert (29kb) 1-up.

Abstract

In this paper, parsing as deduction and constraint programming are brought together to outline a procedure for the specification of constraint-based chart parsers. Extending the proposal in Sheiber at al. (1993) which provides a meta interpreter for several deduction systems, we show how to directly realize the inference rules for chart parsers as Constraint Handling Rules (Frühwirth 1998) by viewing the items of a conventional chart parser as constraints and the constraint base as a chart. This allows the direct use of the constraint resolution process to parse sentences.

Appears in the Proceedings of the International Workshop on Parsing Technologies (IWPT) 2000. 2 page poster.

A longer draft ist also available here.

In case of problems or for comments, please contact: frank@sfs.uni-tuebingen.de
Last updated: 13-Mar-2000