Verb phrase ellipsis: form, meaning, and processing
Verb phrase ellipsis: form, meaning, and processing
Interpreting cohesive forms in the context of discourse inference
Interpreting cohesive forms in the context of discourse inference
The Constraint Language for Lambda Structures
Journal of Logic, Language and Information
Completion of Rewrite Systems with Membership Constraints
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Dominance Constraints: Algorithms and Complexity
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
D-theory: talking about talking about trees
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
An efficient graph algorithm for dominance constraints
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
A generalized reconstruction algorithm for ellipsis resolution
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Well-nested context unification
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Describing lambda terms in context unification
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
| Hi-index | 0.00 |
The Constraint Language for Lambda Structures (CLLS) is an expressive tree description language. It provides a uniform framework for underspecified semantics, covering scope, ellipsis, and anaphora. Efficient algorithms exist for the sublanguage that models scope. But so far no terminating algorithm exists for sublanguages that model ellipsis. We introduce well-nested parallelism constraints and show that they solve this problem.