Using active constraints to parse GPSGs

Authors:
Philippe Blache
Affiliations:
Université de Neuchâtel (Suisse)
Venue:
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Year:
1992

Citing 8
Cited 0

Constraint satisfaction in logic programming

Constraint satisfaction in logic programming
An introduction to Prolog III

Communications of the ACM
Parsing as logical constraint satisfaction

Logic and logic grammars for language processing
Features, frames and quantifier-free formulae

Logic and logic grammars for language processing
Processing language with logical types and active constraints

EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
The formal and processing models of CLG

EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Parsing as deduction

ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Bottom-Up Filtering: a parsing strategy for GPSG

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

Active constraints of the constraint logic programming paradigm allow (1) the reduction of the search space of programs and (2) a very concise representation of the problems. These two properties are particularly interesting for parsing problems: they can help us to reduce non-determinism and to use large coverage grammars. In this paper, we describe how to use such constraints for parsing ID/LP grammars and propose an implementation in Prolog III.