Please use this identifier to cite or link to this item: doi:10.22028/D291-23463
Title: Well-nested parallelism constraints for ellipsis resolution
Author(s): Erk, Katrin
Niehren, Joachim
Language: English
Year of Publication: 2003
OPUS Source: 11th Conference of the European Chapter of the Association of Computational Linguistics, Budapest, Hungary, 12-17 April 2003, pp. 115-122
Free key words: Ellipsis Resolution
DDC notations: 004 Computer science, internet
Publikation type: Conference Paper
Abstract: The Constraint Language for Lambda Structures (CLLS) is an expressive tree description language. It provides a uniform framework for underspecified semantics, covering scope,ipsis, 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.
Link to this record: urn:nbn:de:bsz:291-scidok-2754
Date of registration: 25-Jun-2004
Faculty: P - Philosophische Fakultät
Department: P - Sprachwissenschaft und Sprachtechnologie
Former Department: bis SS 2016: Fachrichtung 4.7 - Allgemeine Linguistik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
wellnested.pdf126,51 kBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.