OLD resolution with tabulation
Proceedings on Third international conference on logic programming
Recursive query processing: the power of logic
Theoretical Computer Science
Communications of the ACM
The logic of typed feature structures
The logic of typed feature structures
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Constraint-based Categorial Grammar
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
A delayed syntactic-encoding-based LFG parsing strategy for an Indian language: Bangla
Computational Linguistics
An efficient implementation of the head-corner parser
Computational Linguistics
Lexical rules in constraint-based grammars
Computational Linguistics
Robust grammatical analysis for spoken dialogue systems
Natural Language Engineering
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
| Hi-index | 0.00 |
Some linguistic constraints cannot be effectively resolved during parsing at the location in which they are most naturally introduced. This paper shows how constraints can be propagated in a memoizing parser (such as a chart parser) in much the same way that variable bindings are, providing a general treatment of constraint coroutining in memoization. Prolog code for a simple application of our technique to Bouma and van Noord's (1994) categorial grammar analysis of Dutch is provided.