An algorithm for generating quantifier scopings
Computational Linguistics
Computational Linguistics
Using descriptions of trees in a tree adjoining grammar
Computational Linguistics
Interpreting cohesive forms in the context of discourse inference
Interpreting cohesive forms in the context of discourse inference
On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
A discourse copying algorithm for ellipsis and anaphora resolution
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Ellipsis and quantification: a substitutional approach
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
A theory of parallelism and the case of VP ellipsis
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
A uniform approach to underspecification and parallelism
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
D-theory: talking about talking about trees
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
An efficient algorithm for the configuration problem of dominance graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Journal of Logic, Language and Information
The Constraint Language for Lambda Structures
Journal of Logic, Language and Information
Dominance constraints with Boolean connectives: a model-eliminative treatment
Theoretical Computer Science - Algebraic methods in language processing
Dominance Constraints in Context Unification
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Context Unification and Traversal Equations
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Dominance Constraints with Set Operators
CL '00 Proceedings of the First International Conference on Computational Logic
Dominance Constraints: Algorithms and Complexity
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
An efficient graph algorithm for dominance constraints
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
On underspecified processing of dynamic semantics
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Two accounts of scope availability and semantic underspecification
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Distributing representation for robust interpretation of dialogue utterances
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
A polynomial-time fragment of dominance constraints
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Towards a computational treatment of binding theory
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
| Hi-index | 0.00 |
We introduce a first-order language for semantic underspecification that we call Constraint Language for Lambda-Structures (CLLS). A λ-structure can be considered as a λ-term up to consistent renaming of bound variables (λ-equality); a constraint of CLLS is an underspecified description of a λ-structure. CLLS solves a capturing problem omnipresent in underspecified scope representations. CLLS features constraints for dominance, lambda binding, parallelism, and anaphoric links. Based on CLLS we present a simple, integrated, and underspecified treatment of scope, parallelism, and anaphora.