Publication details

Programming Systems

Gert Smolka

Publications

Teaching

Software

Formalizations

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               

@INPROCEEDINGS{wellnested,
  title = {Well-Nested Parallelism Constraints for Ellipsis Resolution},
  author = {Katrin E. Erk and Joachim Niehren},
  year = {2003},
  month = {apr},
  booktitle = {11th  Conference  of  the  European Chapter  of  the  Association  of  Computational  Linguistics},
  pages = {{115--122}},
  organization = {{Association for Compuational Linguistics}},
}

Login to edit