Solution reuse in dynamic constraint satisfaction problems
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Eliminative parsing with graded constraints
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Structural disambiguation with constraint propagation
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Robust parsing with weighted constraints
Natural Language Engineering
From shallow to deep parsing using constraint satisfaction
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Property grammars: a fully constraint-based theory
CSLP'04 Proceedings of the First international conference on Constraint Solving and Language Processing
| Hi-index | 0.00 |
The constraint-oriented approaches to language processing step back from the generative theory and make it possible, in theory, to deal with all types of linguistic relationships (e.g. dependency, linear precedence or immediate dominance) with the same importance when parsing an input utterance. Yet in practice, all implemented constraint-oriented parsing strategies still need to discriminate between "important" and "not-so-important" types of relations during the parsing process. In this paper we introduce a new constraint-oriented parsing strategy based on Property Grammars, which overcomes this drawback and grants the same importance to all types of relations.