Publication details

Saarland University Computer Science

Well-Nested Parallelism Constraints for Ellipsis Resolution

Katrin E. Erk, Joachim Niehren

11th Conference of the European Chapter of the Association of Computational Linguistics, pp. 115--122, April 2003

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.

Download PDF        Show BibTeX               

Login to edit

Legal notice, Privacy policy