%
% GENERATED FROM https://www.coli.uni-saarland.de
%    by   : anonymous
%    IP   : coli2006.lst.uni-saarland.de
%    at   : Mon, 05 Feb 2024 15:43:40 +0100 GMT
%    
% Selection : Author: Joke_Dorrepaal
%




@InProceedings{Gardent_Dorrepaal:1994,
      AUTHOR = {Gardent, Claire and Dorrepaal, Joke},
      TITLE = {Reversible Discourse Processing},
      YEAR = {1994},
      BOOKTITLE = {International Workshop on Computational Semantics (IWCS-1), December 19-21},
      ADDRESS = {Tilburg, The Netherlands}
}

@TechReport{Gardent_Dorrepaal:1995,
      AUTHOR = {Gardent, Claire and Dorrepaal, Joke},
      TITLE = {Reversible Discourse Processing},
      YEAR = {1995},
      MONTH = {May},
      NUMBER = {59},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus59.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus59.dvi},
      ABSTRACT = {In this paper we describe a reversible framework for discourse processing, a framework in which contextual constraints can be specified independently of the processing algorithm. We take as a starting point Scha and Polanyi's discourse grammar ([Scha/Polanyi 1988]) which is in essence a unification based grammar extended with arbitrary relations. Although such a framework can be shown to have many non properties (e.g. non monotonicity and non declarativity), we argue that it is inherently finitely reversible in the sense of [Dymetman 1991] - that is, there is a parsing/generation program for this grammar such that for any string/semantics, the program enumerates all associated semantics/strings and terminates. We show by means of examples that one and the same specification can be used both for analysis and for generation.},
      ANNOTE = {COLIURL : Gardent:1995:RDP.pdf Gardent:1995:RDP.ps Gardent:1995:RDP.dvi}
}