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




@InProceedings{Busemann:1996_1,
      AUTHOR = {Busemann, Stephan},
      TITLE = {Best-First Surface Realization},
      YEAR = {1996},
      BOOKTITLE = {Proceedings of the 8th International Natural Language Generation Workshop (INLG'96), June},
      PAGES = {101-110},
      EDITOR = {Scott, Donia},
      ADDRESS = {Sussex, UK},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/tg2.ps.Z http://arxiv.org/PS_cache/cmp-lg/pdf/9605/9605010.pdf},
      ABSTRACT = {Current work in surface realization concentrates on the use of general, abstract algorithms that interpret large, reversible grammars. Only little attention has been paid so far to the many small and simple applications that require coverage of a small sublanguage at different degrees of sophistication. The system TG/2 described in this paper can be smoothly integrated with deep generation processes, it integrates canned text, templates, and context-free rules into a single formalism, it allows for both textual and tabular output, and it can be parameterized according to linguistic preferences. These features are based on suitably restricted production system techniques and on a generic backtracking regime.},
      ANNOTE = {COLIURL : Busemann:1996:BFSb.pdf Busemann:1996:BFSb.ps}
}

@InProceedings{Busemann:1999,
      AUTHOR = {Busemann, Stephan},
      TITLE = {Constraint-Based Techniques for Interfacing Software Modules},
      YEAR = {1999},
      BOOKTITLE = {Proceedings of the AISB'99 Workshop on Reference Architectures and Data Standards for NLP, April 6-9},
      PAGES = {48-54},
      EDITOR = {Mellish, Chris and Scott, Donia},
      ADDRESS = {Edinburgh, Scotland},
      PUBLISHER = {The Society for the Study of Artificial Intelligence and Simulation of Behaviour},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/busemann99.ps.gz},
      ABSTRACT = {The reuse of standardized software is among the primary goals of application builders. The vision of a building block scenario of pieces of software that can be configured to form a new application is becoming real. However, this vision places strong requirements on the interfaces. Practice dictates that it must be easy to combine building blocks. Hence the interfaces should be flexible and, ideally, adaptable to new tasks or domains. This paper presents a simple method to structurally relate interface languages and to check the syntactic correctness of expressions.},
      ANNOTE = {COLIURL : Busemann:1999:CBT.pdf Busemann:1999:CBT.ps}
}