Frank Morawietz
Seminar für Sprachwissenschaft
Theoretische Computerlinguistik
 
Neuphilologische Fakultät
Universität Tübingen

Frank Morawietz

Chart Parsing and Constraint Propagation


7pp. PS (74kb), a longer Technical Report: 21pp., PS (126kb).

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 Shieber et 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ühwirt 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.



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