%
% GENERATED FROM https://www.coli.uni-saarland.de
%    by   : anonymous
%    IP   : coli2006.lst.uni-saarland.de
%    at   : Mon, 05 Feb 2024 15:42:54 +0100 GMT
%    
% Selection : Reference #511
%




@Article{Erk_et_al:2003,
      AUTHOR = {Erk, Katrin and Koller, Alexander and Niehren, Joachim},
      TITLE = {Processing Underspecified Semantic Descriptions in the Constraint Language for Lambda Structures},
      YEAR = {2003},
      JOURNAL = {Research on Language and Computation},
      VOLUME = {1},
      PAGES = {127--169},
      URL = {https://www.coli.uni-saarland.de/~koller/papers/cllsproc.ps.gz},
      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 and gives an overview of previous results on questions of processing and complexity.},
      ANNOTE = {COLIURL : Erk:2002:PUS.pdfErk:2002:PUS.ps}
}