CLLS(ID:5773/cll001)for Constraint Language for Lambda Structures First-order language for semantic underspecification that conservatively extends dominance constraints. References: in Proceedings of the 17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association for Computational Linguistics Montreal, Canada view details (CLLS), a first-order language for semantic underspecification that conservatively extends dominance constraints. It is interpreted over lambda structures, tree-like structures that encode l-terms. Based on CLLS, we present an underspecified, uniform analysis of scope, ellipsis, anaphora, and their interactions. CLLS solves a variable capturing problem that is omnipresent in scope underspecification and can be processed efficiently. Extract: Underspecification is a recent approach to the issue of combinatorial explosion caused by ambiguity. Its key idea is to derive a single, compact description of all readings instead of the (exponential number of) readings themselves. For as long as possible, later processing steps operate on these descriptions; readings are only enumerated by need. in Proceedings of the 17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association for Computational Linguistics Montreal, Canada view details in Proceedings of the 11th International Conference on Rewriting Techniques and Applications, LNCS 1833 view details in Proc. 18th COLING, Saarbrucken. view details in Journal of Logic, Language, and Information view details |