Please use this identifier to cite or link to this item: doi:10.22028/D291-25761
Title: Processing underspecified semantic representations in the constraint language for lambda structures
Author(s): Erk, Katrin
Koller, Alexander
Niehren, Joachim
Language: English
Year of Publication: 2002
OPUS Source: Research on Language and Computation, Vol.1 (1-2), 2003, pp.127-169
SWD key words: Lambda-Algebra ; Strukturbaum
Free key words: Lambda Structures
DDC notations: 004 Computer science, internet
Publikation type: Journal Article
Abstract: The constraint language for lambda structures (CLLS) is an expressive language of tree descriptions which combines dominance constraints with powerful parallelism and binding constraints. CLLS was introduced as a uniform framework for defining underspecified semantics representations of natural language sentences, covering scope, ellipsis, and anaphora. This article presents saturation-based algorithms for processing the complete language of CLLS. It also gives an overview of previous results on questions of processing and complexity.
Liegt nicht vor.
Link to this record: urn:nbn:de:bsz:291-scidok-2823
Date of registration: 1-Jun-2004
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
processing00.pdf329,14 kBAdobe PDFView/Open

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