Constraints over Lambda Structures, Antecedent
Contained Deletion, and Quantifier Identities
Author: Egg,Markus and Koller, Alexander and Niehren,
Joachim and Ruhrberg, Peter
Editor:
The constraint language for lambda-structures (CLLS)
allows for a simple, integrated, and underspecified
treatment of scope, ellipses, anaphora, and their
interaction. CLLS features constraints for
dominance, lambda binding, parallelism, and
anaphoric links. In the case of antecedent
contained deletion (ACD), the definition of
parallelism in the original version of CLLS is
slightly too restrictive due to an overly weak
notion of quantifier identity. We show how to
extend CLLS with an appropriate notion of
quantifier identity such that ACD can be naturally
analysed. This sheds some light on conflicting
requirements on quantifier representations as
needed for ACD and Hirschbühler sentences.
|