%
% GENERATED FROM https://www.coli.uni-saarland.de
%    by   : anonymous
%    IP   : coli2006.lst.uni-saarland.de
%    at   : Mon, 05 Feb 2024 15:41:12 +0100 GMT
%    
% Selection : Year = 1998
%




@TechReport{Alexandersson_et_al:1998,
      AUTHOR = {Alexandersson, Jan and Buschbeck-Wolf, Bianka and Fujinami, Tsutomu and Kipp, Michael and Koch, Stephan and Maier, Elisabeth and Reithinger, Norbert and Schmitz, Birte and Siegel, Melanie},
      TITLE = {Dialogue Acts in VERBMOBIL-2 - Second Edition},
      YEAR = {1998},
      NUMBER = {226},
      ADDRESS = {Saarbrücken},
      TYPE = {Verbmobil Report},
      INSTITUTION = {German Research Center for Artificial Intelligence (DFKI)},
      URL = {http://www.dfki.de/cgi-bin/verbmobil/htbin/decode.cgi/share/VM-depot/FTP-SERVER/vm-reports/report-226-98.ps.gz},
      ABSTRACT = {This report describes the dialogue phases and the second edition of dialogue acts which are used in the second phase of VERBMOBIL. While in the first p roject phase the scenario was restricted to appointment scheduling dialogues, it has been extended to travel planning in the second phase with appointment scheduling being only a part of the new scenario. We updated and improved the set of dialogue acts used to describe the dialoguesin the travel planning scenario. The set differs from the first edition mainly in its overall structure and in some additions. Most of the actual dialogue acts are exactly as defined in in the first edition of this report (VM-Report 204,June 1997).},
      ANNOTE = {COLIURL : Alexandersson:1998:DAV.pdf Alexandersson:1998:DAV.ps}
}

@InCollection{Avgustinova:1998,
      AUTHOR = {Avgustinova, Tania},
      TITLE = {Determinedness and Replication Potential of Nominal Material in Bulgarian},
      YEAR = {1998},
      BOOKTITLE = {Balkanistica},
      VOLUME = {11},
      PAGES = {1-17},
      EDITOR = {Dyer, D.L.},
      ADDRESS = {Wilkes-Barre},
      PUBLISHER = {Design Systems Printing}
}

@InCollection{Avgustinova:1998_1,
      AUTHOR = {Avgustinova, Tania},
      TITLE = {On Word Order Types in Bulgarian},
      YEAR = {1998},
      BOOKTITLE = {Beiträge der Europäischen Slavistischen Linguistik (POLYSLAV 1)},
      VOLUME = {1},
      PAGES = {19-25},
      EDITOR = {Giger, M. and Wiemer, B.},
      SERIES = {Die Welt der Slaven, 2. Sammelband},
      ADDRESS = {München},
      PUBLISHER = {Verlag Otto Sagner}
}

@Misc{Avgustinova:1998_2,
      AUTHOR = {Avgustinova, Tania},
      TITLE = {Review of: Cook, Walter A.: Case Grammar Applied. A Publication of The Summer Institute of Linguistics and The University of Texas at Arlington. 1998},
      YEAR = {1998},
      URL = {http://linguistlist.org/issues/9/9-1813.html},
      ANNOTE = {COLIURL : Avgustinova:1998:RCW.pdf}
}

@InProceedings{Avgustinova_Andreeva:1998,
      AUTHOR = {Avgustinova, Tania and Andreeva, Bistra},
      TITLE = {Intonational Properties of Bulgarian Replicated Nominal Material. A Study Based on Map Task Dialogues},
      YEAR = {1998},
      BOOKTITLE = {1st Conference on Linguistic Theory in Eastern Europaen Languages (CLITE-1), April 19-21},
      ADDRESS = {Szeged, Hungary}
}

@InCollection{Barry:1998,
      AUTHOR = {Barry, William J.},
      TITLE = {Zur Analyse prosodischer Abweichungen in der Fremdsprache. Rhythmische Probleme koreanischer Deutschlerner},
      YEAR = {1998},
      BOOKTITLE = {Festschrift Georg Heike},
      EDITOR = {Kröger, B. and Riek, C. and Sachse, G.},
      ADDRESS = {Frankfurt a.M.},
      PUBLISHER = {311-322}
}

@InCollection{Barry:1998_1,
      AUTHOR = {Barry, William J.},
      TITLE = {Mikrophonetik, Makrophonetik und Sprechwissenschaft},
      YEAR = {1998},
      BOOKTITLE = {Theorie und Empirie der Sprechwissenschaft},
      PAGES = {22-29},
      EDITOR = {Biege, A. and Bose, I.},
      ADDRESS = {Hanau, Halle},
      PUBLISHER = {Verlag Werner Dausien}
}

@InProceedings{Barry:1998_2,
      AUTHOR = {Barry, William J.},
      TITLE = {Time as a Factor in the Acoustic Variation of schwa},
      YEAR = {1998},
      BOOKTITLE = {The 5th International Conference on Spoken Language Processsing (ICSLP '98), November 30 -December 4},
      VOLUME = {5},
      ADDRESS = {Sydney, Australia}
}

@InProceedings{Becker:1998,
      AUTHOR = {Becker, Markus},
      TITLE = {Unsupervised Part of Speech Tagging with Extended Templates},
      YEAR = {1998},
      BOOKTITLE = {10th European Summer School in Logic, Language and Information (ESSLLI'98), Student Session, August 17-28},
      PAGES = {43-50},
      EDITOR = {Kruijff, Geert-Jan M. and Korbayova, Ivana},
      ADDRESS = {Saarbrücken},
      URL = {http://www.dfki.de/~mbecker/unsup.ps},
      ABSTRACT = {In this paper we describe an extension of the unsupervised learning algorithm for automatically training a rule-based part of speech tagger, originally proposed by [Brill,1995]. We claim that the employment of templates with wider contexts will yield both linguistically more satisfying results and also higher precision rates.},
      ANNOTE = {COLIURL : Becker:1998:UPS.pdf Becker:1998:UPS.ps}
}

@InProceedings{Benzmüller_Grice:1998,
      AUTHOR = {Benzmüller, Ralf and Grice, Martine},
      TITLE = {The Nuclear Accentual Fall in the Intonation of Standard German},
      YEAR = {1998},
      BOOKTITLE = {Papers on the Conference The Word as a Phonetic Unit},
      PAGES = {79-89},
      EDITOR = {ZAS, Zentrum für allgemeine Sprachw},
      ADDRESS = {Berlin, Germany}
}

@TechReport{Blackburn:1998,
      AUTHOR = {Blackburn, Patrick},
      TITLE = {Internalizing Labeled Deduction},
      YEAR = {1998},
      MONTH = {November},
      NUMBER = {102},
      PAGES = {39},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus102.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus102.dvi},
      ABSTRACT = {This paper shows how to internalize the Kripke satisfaction definition using labeled modal languages and explores the proof theoretic consequences of this. As we shall see, using labeled modal languages enables us to transfer classic Gabbay-style labeled deduction from the metalanguage to the object language, and to handle the required labeling discipline purely logically. Moreover, internalized labeled deduction links neatly with the Gabbay-style rules now widely used in modal Hilbert-systems, completeness results for a wide range of first-order definable frame classes can be obtained automatically, and the method extends straightforwardly to richer languages. The paper discusses related work by Jerry Seligman and Miroslava Tzakova and concludes with some reflections on the status of labeling in modal logic.},
      ANNOTE = {COLIURL : Blackburn:1998:ILD.pdf Blackburn:1998:ILD.ps Blackburn:1998:ILD.dvi}
}

@TechReport{Blackburn_et_al:1998,
      AUTHOR = {Blackburn, Patrick and Bos, Johan and Kohlhase, Michael and de Nivelle, Hans},
      TITLE = {Inference and Computational Semantics},
      YEAR = {1998},
      MONTH = {November},
      NUMBER = {106},
      PAGES = {15},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus106.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus106.dvi},
      ABSTRACT = {This paper discusses inference in computational semantics. We argue that state-of-the-art methods in first-order it theorem proving/ and it model building/ are of direct relevance to inference for natural language processing. We support our claim by discussing our implementation of van der Sandt's presupposition projection algorithm in Discourse Representation Theory, an algorithm which demands sustained use of powerful inference mechanisms.},
      ANNOTE = {COLIURL : Blackburn:1998:ICS.pdf Blackburn:1998:ICS.ps Blackburn:1998:ICS.dvi}
}

@InProceedings{Blackburn_Gardent:1998,
      AUTHOR = {Blackburn, Patrick and Gardent, Claire},
      TITLE = {A Description Language for Discourse Semantics},
      YEAR = {1998},
      BOOKTITLE = {Logical Aspects of Computational Linguistics (LACL '98), December 14-16},
      ADDRESS = {Grenoble, France}
}

@TechReport{Blackburn_Tzakova:1998,
      AUTHOR = {Blackburn, Patrick and Tzakova, Miroslava},
      TITLE = {Hybrid Completeness},
      YEAR = {1998},
      MONTH = {June},
      NUMBER = {95},
      PAGES = {27},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus95.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus95.dvi},
      ABSTRACT = {In this paper we discuss two hybrid languages, and provide them with complete axiomatizations. Both languages combine features of modal and classical logic. Like modal languages, they contain modal operators and have a Kripke semantics. Unlike modal languages, in these systems it is possible to 'label' states by using binders to bind special state variables. This paper explores the consequences of hybridization for completeness. As we shall show, the challenge is to blend the modal idea of canonical models with the classical idea of witnessed maximal consistent sets. The languages discussed provide us with two extreme examples of the issues involved. In the one case we can combine these ideas relatively straightforwardly with the aid of analogs of the Barcan axioms coupled with a modal theory of labeling. In the other case, although we can still formulate a theory of labeling, the Barcan analogs are not valid. We show how to overcome this difficulty by using COV, an infinite collection of additional rules of proof which has been used in a number of investigations of extended modal logic.},
      ANNOTE = {COLIURL : Blackburn:1998:HC.pdf Blackburn:1998:HC.ps Blackburn:1998:HC.dvi}
}

@TechReport{Blackburn_Tzakova:1998_1,
      AUTHOR = {Blackburn, Patrick and Tzakova, Miroslava},
      TITLE = {Hybrid Languages and Temporal Logic (Full Version)},
      YEAR = {1998},
      MONTH = {July},
      NUMBER = {96},
      PAGES = {50},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus96.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus96.dvi},
      ABSTRACT = {Hybridization is a method invented by Arthur Prior for extending the expressive power of modal languages. Although developed in interesting ways by Robert Bull, and the Sofia school (notably, George Gargov, Valentin Goranko, Solomon Passy and Tinko Tinchev), the method remains little known. In our view this has deprived temporal logic of a valuable tool. The aim of the paper is to explain why hybridization is useful in temporal logic. We make two major points, the first technical, the second conceptual. Technically, we show that hybridization gives rise to well-behaved logics that exhibit an interesting synergy between modal and classical ideas. This synergy, obvious for hybrid languages with full first-order expressive strength, is demonstrated for three weaker local languages, all of which are capable of defining the Until operator; we provide simple minimal axiomatizations for all three systems, and show that in a wide range of temporally interesting cases, extended completeness results can be obtained automatically. Conceptually, we argue that the idea of sorted atomic symbols which underpins the hybrid enterprise can be developed much further. To illustrate this, we discuss the advantages and disadvantages of a simple hybrid language which can quantify over paths. This is the original version of a paper which was accepted for publication in a special issue of the Journal of the IGPL on temporal logic. Unfortunately, the length of the article meant that it had to be drastically cut, and only a shorter version will appear. While the short version covers one of the most elegant results (@-driven completeness results) and is slightly more up to date in certain respects, the long version is probably the most detailed discussion of the completeness theory of local hybrid languages around. The long version also contains many lengthy footnotes. These outline the history of hybrid languages in considerable detail, and contain many remarks on philosophical, methodological, and technical issues.},
      ANNOTE = {COLIURL : Blackburn:1998:HLTa.pdf Blackburn:1998:HLTa.ps Blackburn:1998:HLTa.dvi}
}

@TechReport{Blackburn_Tzakova:1998_2,
      AUTHOR = {Blackburn, Patrick and Tzakova, Miroslava},
      TITLE = {Hybridizing Concept Languages},
      YEAR = {1998},
      MONTH = {October},
      NUMBER = {97},
      PAGES = {26},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus97.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus97.dvi},
      ABSTRACT = {This paper shows how to increase the expressivity of concept languages using a strategy called hybridization. Building on the well-known correspondences between modal and description logics, two hybrid languages are defined. These languages are called 'hybrid' because, as well as the familiar propositional variables and modal operators, they also contain variables across individuals and a binder that binds these variables. As is shown, combining aspects of modal and first-order logic in this manner allows the expressivity of concept languages to be boosted in a natural way, making it possible to define number restrictions, collections of individuals, irreflexivity of roles, and TBox- and ABox-statements. Subsequent addition of the universal modality allows the notion of subsumption to internalized, and enables the representation of queries to arbitrary first-order knowledge bases. The paper notes themes shared by the hybrid and concept language literatures, and draws attention to a little-known body of work by the late Arthur Prior.},
      ANNOTE = {COLIURL : Blackburn:1998:HCL.pdf Blackburn:1998:HCL.ps Blackburn:1998:HCL.dvi}
}

@TechReport{Blackburn_Tzakova:1998_3,
      AUTHOR = {Blackburn, Patrick and Tzakova, Miroslava},
      TITLE = {Hybrid Languages and Temporal Logic},
      YEAR = {1998},
      MONTH = {November},
      NUMBER = {107},
      PAGES = {30},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus107.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus107.dvi},
      ABSTRACT = {Hybridization is a method invented by Arthur Prior for extending the expressive power of modal languages. Although developed in interesting ways by Robert Bull, and by the Sofia school (notably, George Gargov, Valentin Goranko, Solomon Passy and Tinko Tinchev), the method remains little known. In our view this has deprived temporal logic of a valuable tool. The aim of the paper is to explain why hybridization is useful in temporal logic. We make two major points, the first technical, the second conceptual. First, we show that hybridization gives rise to well-behaved logics that exhibit an interesting synergy between modal and classical ideas. This synergy, obvious for hybrid languages with full first-order expressive strength, is demonstrated for a weaker local language capable of defining the Until operator; we provide a minimal axiomatization, and show that in a wide range of temporally interesting cases extended completeness results can be obtained automatically. Second, we argue that the idea of sorted atomic symbols which underpins the hybrid enterprise can be developed further. To illustrate this, we discuss the advantages and disadvantages of a simple hybrid language which can quantify over paths.},
      ANNOTE = {COLIURL : Blackburn:1998:HLTb.pdf Blackburn:1998:HLTb.ps}
}

@InProceedings{Bos_et_al:1998,
      AUTHOR = {Bos, Johan and Buschbeck-Wolf, Bianka and Dorna, Michael and Rupp, Christopher J.},
      TITLE = {Managing Information at Linguistic Interfaces},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the 17th International Conference on Computational Linguistics (COLING'98), August 10-14},
      EDITOR = {ACL},
      ADDRESS = {Montréal, Québec, Canada}
}

@TechReport{Brants:1998,
      AUTHOR = {Brants, Thorsten},
      TITLE = {The NeGra Export Format for Annotated Corpora},
      YEAR = {1998},
      MONTH = {April},
      NUMBER = {98},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus98.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus98.dvi},
      ABSTRACT = {This paper describes the export format version 3 of corpora used in the NeGra project. We use a line-oriented and ASCII-based format that is both easy to read by humans and easy to parse by machines. It is intended for data exchange and for efficient processing with standard Unix tools and C programs.},
      ANNOTE = {COLIURL : Brants:1998:NEF.pdf Brants:1998:NEF.ps Brants:1998:NEF.dvi}
}

@InCollection{Brants:1998_1,
      AUTHOR = {Brants, Thorsten},
      TITLE = {Estimating Hidden Markov Model Topologies},
      YEAR = {1998},
      BOOKTITLE = {The Tbilisi Symposium on Logic, Language and Computation: Selected Papers. Studies in Logic, Language and Information},
      PAGES = {163-176},
      EDITOR = {Ginzburg, J. and Khasidashvili, Z. and Vogel, C. and Lévy, J.-J. and Vallduví, E.},
      ADDRESS = {Stanford},
      PUBLISHER = {CSLI Publications},
      URL = {https://www.coli.uni-saarland.de/~thorsten/publications/Brants-Tbilisi98.ps.gz},
      ANNOTE = {COLIURL : Brants:1998:EHM.pdf Brants:1998:EHM.ps}
}

@InProceedings{Brants_Skut:1998,
      AUTHOR = {Brants, Thorsten and Skut, Wojciech},
      TITLE = {Automation of Treebank Annotation},
      YEAR = {1998},
      BOOKTITLE = {3rd International Conference on New Methods in Language Processing (NeMLaP'98), January 11-24},
      ADDRESS = {Sydney, Australia},
      URL = {https://www.coli.uni-saarland.de/~thorsten/nemlap98/},
      ABSTRACT = {This paper describes applications of stochastic and symbolic NLP methods to treebank annotation. In particular we focus on (1) the automation of treebank annotation, (2) the comparison of conflicting annotations for the same sentence and (3) the automatic detection of inconsistencies. These techniques are currently employed for building a German treebank.},
      ANNOTE = {COLIURL : Brants:1998:ATA.pdf}
}

@InProceedings{Buitelaar:1998,
      AUTHOR = {Buitelaar, Paul},
      TITLE = {The Acquisition of Defaults in Lexical Semantic Representations},
      YEAR = {1998},
      BOOKTITLE = {Workshop on Lexical Semantic Systems (WLSS '98), April 6-7},
      ADDRESS = {Pisa, Italy},
      URL = {http://dfki.de/~paulb/wlss98.ps.gz},
      ABSTRACT = {The paper defends the notion that semantic tagging should be viewed as more than disambiguation between senses. Instead, semantic tagging should be a first step in the interpretation process by assigning each lexical item a representation of all of its systematically related senses, from which further semantic processing steps can derive discourse dependent interpretations. This leads to a new type of semantic lexicon (CoreLex ) that supports underspecified semantic tagging through a design based on systematic polysemous classes and a class-based acquisition of lexical knowledge for specific domains.},
      ANNOTE = {COLIURL : Buitelaar:1998:ADL.pdf Buitelaar:1998:ADL.ps}
}

@InProceedings{Buitelaar:1998_1,
      AUTHOR = {Buitelaar, Paul},
      TITLE = {Specification and Underspecification in Lexical Semantic Processing for Information Extraction},
      YEAR = {1998},
      BOOKTITLE = {Bad Teinach Workshop on Underspecification, May},
      ADDRESS = {Bad Teinach, Germany},
      URL = {http://dfki.de/~paulb/teinach.ps.gz},
      ABSTRACT = {The work reported here is part of a research effort to extend an existing information extraction system (SMES) with more sophisticated lexical semantic capabilities, including the use of underspecified representations, in order to make the important step of domain modelling, in porting the system to different application areas, more systematic and generally to increase the accuracy of the system. In general, information extraction (IE) is a rather scaled down version of natural language understanding, in which there is little room for the processing of deep (i.e. lexical semantic) knowledge. However, in obvious ways, underspecified lexical semantic representations can be seen as shallow lexical meanings that have a similar status as chunks in syntactic processing. Therefore, the use of such representations in IE seems an attractive option to extend the semantic capabilities of these systems, although it is not entirely clear where underspecification will be useful and where not. It is the topic of this paper to investigate this into some respect.},
      ANNOTE = {COLIURL : Buitelaar:1998:SUL.pdf Buitelaar:1998:SUL.ps}
}

@InProceedings{Buitelaar:1998_2,
      AUTHOR = {Buitelaar, Paul},
      TITLE = {CoreLex: An Ontology of Systematic Polysemous Classes},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the 1st International Conference on Formal Ontology in Information Systems (FOIS'98), June 6-8},
      VOLUME = {46},
      PAGES = {221-235},
      EDITOR = {Guarino, Nicola},
      SERIES = {Frontiers in Artificial Intelligence and Applications},
      ADDRESS = {Trento, Italy},
      PUBLISHER = {IOS Press},
      URL = {http://dfki.de/~paulb/fois98.ps.gz},
      ABSTRACT = {This paper is concerned with a unified approach to the systematic polysemy and underspecification of nouns. Systematic polysemy -- senses that are systematically related and therefore predictable over classes of lexical items -- is fundamentally different from homonymy -- senses that are unrelated, non-systematic and therefore not predictable. At the same time, studies in discourse analysis show that lexical items are often left underspecified for a number of related senses. Clearly, there is a correspondence between these phenomena, the investigation of which is the topic of this paper. Acknowledging the systematic nature of polysemy and its relation to underspecified representations, allows one to structure ontologies for lexical semantic processing more efficiently, generating more appropriate interpretations within context. In order to achieve this, one needs a thorough analysis of systematic polysemy and underspecification on a large and useful scale. The paper establishes an ontology and semantic database (CoreLex) of 126 semantic types, covering around 40,000 nouns and defining a large number of systematic polysemous classes that are derived by a careful analysis of sense distributions in WordNet. The semantic types are underspecified representations based on generative lexicon theory.},
      ANNOTE = {COLIURL : Buitelaar:1998:COS.pdf Buitelaar:1998:COS.ps}
}

@InProceedings{Buitelaar_et_al:1998,
      AUTHOR = {Buitelaar, Paul and Netter, Klaus and Xu, Feiyu},
      TITLE = {Integrating Different Strategies in Cross-Language Information Retrieval in the MIETTA Project},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the 14th Twente Workshop on Language Technology (TWLT 14). Language Technology in Multimedia Information Retrieval, December 7-8},
      PAGES = {9-17},
      EDITOR = {Hiemstra, Djoerd and de Jong, Franciska and Netter, Klaus},
      ADDRESS = {Enschede, The Netherlands},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kn-twlt14-98.pdf},
      ABSTRACT = {In this paper we describe an integrated approach to cross-language retrieval within the MIETTA project, whose objective is to build a special purpose search engine in the tourism domain that covers information from a number of geographical regions. MIETTA is designed to enable users to search and retrievegeographical regions. MIETTA is designed to enable users to search and retrieve information on the regions covered in their own language preferably. In order to facilitate the user with such functionality, the system includes document translation, cross-language query translation, multilingual generation from information extraction templates and document classification. In addition, query expansion is offered to identify proper query translation and enable template matching for information extraction purposes.},
      ANNOTE = {COLIURL : Buitelaar:1998:IDS.pdf}
}

@InProceedings{Busemann:1998,
      AUTHOR = {Busemann, Stephan},
      TITLE = {Language Technology for Transnational Web Services},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of Advancing the Information Society - European Telematics Conference '98, February 4-6},
      PAGES = {101--105},
      ADDRESS = {Barcelona, Spain},
      PUBLISHER = {European Commission DG XIII},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/busemann98.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/busemann98.entry},
      ABSTRACT = {The growing flood of information on the internet is mostly encoded in language. The increasing need to augment existing technology for searching, extracting, and summarizing information encoded in multiple languages can be met by employing advanced language technology. This paper concentrates on results achieved within the TEMSIS and ongoing MULINEX projects in meeting these needs, and presents key concepts for the exploitation of the web.},
      ANNOTE = {COLIURL : Busemann:1998:LTT.pdf Busemann:1998:LTT.ps}
}

@InProceedings{Busemann:1998_1,
      AUTHOR = {Busemann, Stephan},
      TITLE = {A Shallow Formalism for Defining Personalized Text},
      YEAR = {1998},
      BOOKTITLE = {Workshop Professionelle Erstellung von Papier- und Online-Dokumenten: Perspektiven für die automatische Textgenerierung. 22nd Annual German Conference on Artificial Intelligence (KI '98), 15.-17. September},
      ADDRESS = {Bremen, Germany},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/busemann98b.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/busemann98b.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/busemann98b.dvi.gz},
      ABSTRACT = {In this workshop note, we sketch techniques suited to generate personalized text within the shallow verbalization system TG/2. In a grammar-engineering phase, alternative formulations of messages corresponding to different user types are encoded into the generation grammar. A set of parameters denoting properties of verbalization alternatives is associated with the respective grammar rules. The user provides to the system the parameter values she desires. During generation, the rules matching the criteria best are preferred, leading to personalized text.},
      ANNOTE = {COLIURL : Busemann:1998:SFD.pdf Busemann:1998:SFD.ps}
}

@InProceedings{Busemann_et_al:1998,
      AUTHOR = {Busemann, Stephan and Harbusch, Karin and Wermter, Stefan},
      TITLE = {Hybride konnektionistische, statistische und regelbasierte Ansätze zur Verarbeitung natürlicher Sprache},
      YEAR = {1998},
      BOOKTITLE = {Workshop auf der 21. Deutschen Jahrestagung für Künstliche Intelligenz, Freiburg, 9.-10. September 1997},
      NUMBER = {D-98-03},
      EDITOR = {Busemann, Stephan and Harbusch, Karin and Wermter, Stefan},
      SERIES = {DFKI Document},
      ADDRESS = {Saarbrücken, Germany},
      PUBLISHER = {DFKI}
}

@Proceedings{Stephan_et_al:1998,
      TITLE = {Workshop auf der 21. Deutschen Jahrestagung für Künstliche Intelligenz, Freiburg, 9.-10. September 1997},
      YEAR = {1998},
      NUMBER = {D-98-03},
      EDITOR = {Busemann, Stephan and Harbusch, Karin and Wermter, Stefan},
      SERIES = {DFKI Document},
      ADDRESS = {Saarbrücken, Germany},
      PUBLISHER = {DFKI},
      URL = {ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1998/RR-98-03.ps.gz},
      ABSTRACT = {The present document includes the proceedings of a workshop on hybrid connectionist, statistical, and rule-based approaches to natural language processing. The workshop was held during the 21st Annual Conference for Artificial Intelligence, Freiburg, Germany, 1997. See http://www.dfki.uni-kl.de/dfkidok/publications/D/98/03/abstract.html.},
      ANNOTE = {COLIURL : Busemann:1998:WDJ.pdf Busemann:1998:WDJ.ps}
}

@InProceedings{Busemann_Horacek:1998,
      AUTHOR = {Busemann, Stephan and Horacek, Helmut},
      TITLE = {A Flexible Shallow Approach to Text Generation},
      YEAR = {1998},
      BOOKTITLE = {9th International Natural Language Generation Workshop (INLG '98), August 5-7},
      PAGES = {238-247},
      EDITOR = {Hovy, Eduard},
      ADDRESS = {Niagara-on-the-Lake, Ontario, Canada},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/busemann-horacek98.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/busemann-horhacek98.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/busemann-horacek98.dvi.gz. http://arXiv.org/abs/cs.CL/9812018},
      ABSTRACT = {In order to support the efficient development of NL generation systems, two orthogonal methods are currently pursued with emphasis: (1) reusable, general, and linguistically motivated surface realization components, and (2) simple, task-oriented template-based techniques. In this paper we argue that, from an application-oriented perspective, the benefits of both are still limited. In order to improve this situation, we suggest and evaluate shallow generation methods associated with increased flexibility. We advise a close connection between domain-motivated and linguistic ontologies that supports the quick adaptation to new tasks and domains, rather than the reuse of general resources. Our method is especially designed for generating reports with limited linguistic variations.},
      ANNOTE = {COLIURL : Busemann:1998:FSA.pdf Busemann:1998:FSA.ps Busemann:1998:FSA.dvi}
}

@InProceedings{Capstick_et_al:1998,
      AUTHOR = {Capstick, Joanne and Diagne, Abdel Kader and Erbach, Gregor and Uszkoreit, Hans},
      TITLE = {MULINEX: Multilingual Web Search and Navigation},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the 14th Twente Workshop on Language Technology (TWLT 14). Language Technology in Multimedia Information Retrieval, December 7-8},
      ADDRESS = {University of Twente, Enschede, The Netherlands},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mulinex-nlpia98.ps.gz},
      ABSTRACT = {MULINEX is a multilingual search engine for the WWW. During the phase of document gathering, the system extracts information about documents by making use of language identification, thematic classification and automatic summarisation. In the search phase, the users' query terms are translated in order to enable search in different languages. Search results are presented with a summary and information about the language and thematic categories to which the document belongs. Summaries and documents are translated on demand by making use of the LOGOS machine translation system. The system is to be deployed in the online services of Bertelsmann Telemedia and Grolier Interactive Europe, and supports French, German and English. The current MULINEX prototype is the first system for translingual information access integrating retrieval, summarisation and translation.},
      ANNOTE = {COLIURL : Capstick:1998:MMWa.pdf Capstick:1998:MMWa.ps}
}

@InProceedings{Capstick_et_al:1998_1,
      AUTHOR = {Capstick, Joanne and Diagne, Abdel Kader and Erbach, Gregor and Uszkoreit, Hans and Cagno, Francesco and Gadaleta, Giovanni and Hernandez, Juan A. and Korte, René and Leisenberg, Anne and Leisenberg, Manfred and Christ, Oliver},
      TITLE = {MULINEX :Multilingual Web Search and Navigation},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the International Conference on Natural Language Processing and Industrial Applications (NLP+IA'98), August 18-21},
      ADDRESS = {Moncton, New-Brunswick, Canada},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mulinex-nlpia98.ps.gz},
      ABSTRACT = {MULINEX is a multilingual search engine for the WWW. During the phase of document gathering, the system extracts information about documents by making use of language identification, thematic classification and automatic summarisation. In the search phase, the users' query terms are translated in order to enable search in different languages. Search results are presented with a summary and information about the language and thematic categories to which the document belongs. Summaries and documents are translated on demand by making use of the LOGOS machine translation system. The system is to be deployed in the online services of Bertelsmann Telemedia and Grolier Interactive Europe, and supports French, German and English. The current MULINEX prototype is the first system for translingual information access integrating retrieval, summarisation and translation.},
      ANNOTE = {COLIURL : Capstick:1998:MMWd.pdf Capstick:1998:MMWd.ps}
}

@InProceedings{Capstick_et_al:1998_2,
      AUTHOR = {Capstick, Joanne and Erbach, Gregor and Uszkoreit, Hans},
      TITLE = {Design and Evaluation of a Psychological Experiment on the Effectivness of Document Summarisation for the Retrieval of Multilingual WWW Documents},
      YEAR = {1998},
      BOOKTITLE = {AAAI Spring Symposium Intelligent Text Summarization},
      PAGES = {134-136},
      EDITOR = {Hovy, Eduard and Radev, Dragomir R.},
      ADDRESS = {Palo Alto},
      PUBLISHER = {The AAAI Press},
      URL = {https://www.coli.uni-saarland.de/~erbach/pub/aaai98/mulinex-aaai98.pdf},
      ABSTRACT = {Since for the foreseeable future, retrieval will be an interactive task of the user looking through lists of potentially relevant documents, adequate support through various types of information is very important. A psychological experiment was conducted to examine the extent to which different types of automatically generated summaries aid retrieval and systematically evaluate user needs and behaviour in the area of cross-language retrieval for the WWW.},
      ANNOTE = {COLIURL : Capstick:1998:DEP.pdf}
}

@InProceedings{Crysmann:1998,
      AUTHOR = {Crysmann, Berthold},
      TITLE = {Morphosyntactic Paradoxa in Fox: An Account in Linearization-Based Morphology},
      YEAR = {1998},
      BOOKTITLE = {Joint Conference on Formal Grammar, Head-Driven Phrase Structure Grammar and Categorial Grammar},
      PAGES = {253-255},
      EDITOR = {Bouma, Gosse and Kruijff, Geert-Jan M. and Oehrle, Richard T.},
      ADDRESS = {Saarbrücken},
      URL = {https://www.coli.uni-saarland.de/~crysmann/papers/ESSLLI-98.ps https://www.coli.uni-saarland.de/~crysmann/papers/ESSLLI-98.pdf},
      ABSTRACT = {Paper presented at the Joint Conference on Formal, Head-driven and Categorial Grammar (FHCG '98) August 14-16, Saarbrücken in: Gosse Bouma, Richard Oehrle and Geert-Jan Kruijff, Proceedings of the Joint Conference on Formal Grammars, Head-driven Phrase Structure Grammar and Categorial Grammar (FHCG '98), in Proceedings of the Tenth European Summer School in Logic, Language and Information (ESSLLI 10). A later version of this paper has been published in: Gosse Bouma, Erhard Hinrichs, Geert-Jan Kruijff, and Richard Oehrle (eds.) (1999) ``Constraints and Resources in Natural Language Syntax and Semantics'', Studies in Constraint-Based Lexicalism, CSLI Publications, Stanford. In this paper, I shall discuss an apparent paradox in the morphology and syntax of Fox (Mesquakie) complex verbs. In Fox, verbs can be modified by one or more of a variety of preverbs including modals, aspectuals, manner adverbials, numerals, quantifiers, as well as preverbs which increase the valence of the main verb (Dahlstrom, 1997a). While preverb and verb can be separated by words, phrases, or even embedded sentences, suggesting a status as syntactically independent words, in ection (cf. Dahlstrom, 1997a) and derivation (cf. Ackerman and LeSourd, 1994) appear to treat preverb-verb complexes as a single morphological unit. Following the basic assumptions of lexicalist syntax, I claim that Fox preverb-verb combinations are indeed morphologically derived and that inflectional affixes are attached to complex morphological objects in the word-formation component already. In order to account for the syntactic effects, I propose an analysis in Linearisation HPSG (Reape, 1994, Kathol, 1995), which builds on the assumption that Fox preverb-verb complexes introduce more than one domain object into syntax (cf. Kathol, 1996 for German, Crysmann, 1997 for European Portuguese). Further morphological material will then be distributed across preverb and verb by imposing partial morphological (order) constraints on PHON-values.},
      ANNOTE = {COLIURL : Crysmann:1998:MPF.pdf Crysmann:1998:MPF.ps}
}

@InProceedings{Dalsgaard_et_al:1998,
      AUTHOR = {Dalsgaard, Paul and Andersen, Ove and Barry, William J.},
      TITLE = {Cross-Language Merged Speech Units and Their Descriptive Phonetic Correlates},
      YEAR = {1998},
      BOOKTITLE = {5th International Conference on Spoken Language Processsing (ICSLP '98), November 30 - December 4},
      PAGES = {Paper 482},
      ADDRESS = {Sydney, Australia}
}

@InProceedings{de Jong_Netter:1998,
      AUTHOR = {de Jong, Franciska and Netter, Klaus},
      TITLE = {OLIVE: Speech-Based Video Retrieval},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the 14th Twente Workshop on Language Technology (TWLT 14). Language Technology in Multimedia Information Retrieval, December 7-8},
      PAGES = {187-188},
      EDITOR = {Hiemstra, Djoerd and de Jong, Franciska and Netter, Klaus},
      ADDRESS = {University of Twente, Enschede, The Netherlands},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kn-fj-twlt14.ps},
      ABSTRACT = {This paper describes the Olive project which aims to support automated indexing of video material by use of human language technologies. Olive is making use of speech recognition to automatically derive transcriptions of the sound tracks, generating time-coded linguistic elements which serve as the basis for text-based retrieval functionality. The retrieval demonstrator builds on and extends the architecture from the Pop-Eye project, a system applying human language technology on subtitles for the disclosure of video fragments.},
      ANNOTE = {COLIURL : Jong:1998:OSB.pdf Jong:1998:OSB.ps}
}

@InProceedings{De Kuthy:1998,
      AUTHOR = {De Kuthy, Kordula},
      TITLE = {Splitting PP Arguments from NPs - An Argument Raising Approach and its Interaction with Lexical Semantics},
      YEAR = {1998},
      BOOKTITLE = {Workshop of the 10th European Summer School in Logic, Language and Information (ESSLLI '98): Current Topics in Constraint-Based Germanic Syntax, August 17-28},
      PAGES = {49-64},
      EDITOR = {Kiss, Tibor and Meurers, Detmar},
      ADDRESS = {Saarbrücken, Germany},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/De_Kuthy98c.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/De_Kuthy98c.entry},
      ANNOTE = {COLIURL : Kuthy:1998:SPA.pdf Kuthy:1998:SPA.ps}
}

@InCollection{De Kuthy:1998_1,
      AUTHOR = {De Kuthy, Kordula},
      TITLE = {Linearization versus Movement: Evidence from German Pied-Piped Infinitives},
      YEAR = {1998},
      BOOKTITLE = {Lexical and Constructional Aspects of Linguistic Explanation},
      EDITOR = {Webelhuth, Gert and Koenig, Jean-Pierre and Kathol, Andreas},
      ADDRESS = {Stanford},
      PUBLISHER = {CSLI Publications},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/De_Kuthy98a.ps.gz},
      ABSTRACT = {The paper starts out with the question whether the pied-piping of infinitives in German relative clauses should be analyzed in a linearization-based account or as an unbounded dependency construction. It is then shown that there is clear empirical evidence for a UDC approach. Two different theories for the pied-piping construction are provided: one based on the relative clause analysis of Pollard and Sag (1994, chapter 5), the other on the new proposal for relative clauses by Sag (1997).},
      ANNOTE = {COLIURL : Kuthy:1998:LVM.pdf Kuthy:1998:LVM.ps}
}

@InProceedings{De Kuthy_Meurers:1998,
      AUTHOR = {De Kuthy, Kordula and Meurers, Detmar},
      TITLE = {Towards a General Theory of a Partial Constituent Fronting in German},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the 10th European Summer School in Logic, Language and Information (ESSLLI'98). Joint Conference on Formal Grammar, Head-Driven Phrase Structure Grammar, and Categorial Grammar (FHCG '98), August 17-28},
      PAGES = {113-124},
      EDITOR = {Bouma, Gosse and Kruijff, Geert-Jan M. and Oehrle, Richard T.},
      ADDRESS = {Saarbrücken, Germany},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/De_Kuthy98b.ps.gz},
      ABSTRACT = {In this paper, we discuss and compare the partial constituents of three different categories (partial APs, NPs, and VPs) and develop an HPSG theory which accounts for the observable similarities and differences in the three sets of data. We show that a generalized argument raising account makes the correct predictions, in particular regarding the observable word order and the interaction in complex fronting phenomena involving topicalized (P)VPs with partial complements. With respect to the theoretical consequences of the partial fronting data, we believe that the reanalysis-like theory we propose provides a concrete basis for a reevaluation of the choice between remnant movement and reanalysis.},
      ANNOTE = {COLIURL : Kuthy:1998:TGT.pdf Kuthy:1998:TGT.ps}
}

@InProceedings{Declerck_et_al:1998,
      AUTHOR = {Declerck, Thierry and Klein, Judith and Neumann, Günter},
      TITLE = {Evaluation of the NLP Components of an Information Extraction System for German},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the 1st International Conference on Language Resources and Evaluation (LREC'98), May 28-30},
      VOLUME = {1},
      PAGES = {293-297},
      EDITOR = {Rubio, Antonio and Gallardo, Natividad and Castro, Rosa and Tejada, Antonio},
      ADDRESS = {Granada, Spain},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/lrec-conf98.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/lrec-conf98.entry},
      ANNOTE = {COLIURL : Declerck:1998:ENC.pdf Declerck:1998:ENC.ps}
}

@TechReport{Duchier_Gardent:1998,
      AUTHOR = {Duchier, Denys and Gardent, Claire},
      TITLE = {A constraint-based treatment of descriptions},
      YEAR = {1998},
      MONTH = {November},
      NUMBER = {105},
      PAGES = {15},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/people/claire/constraints.ps},
      ABSTRACT = {Both in computational linguistics and in formal semantics, descriptions have been used which are stated in terms of dominance . Yet the issue of how such descriptions are processed has been little explored. In this paper, we present a constraint-based treatment of descriptions and apply it to the description-based treatment of discourse advocated in Gardent and Webber 1998.},
      ANNOTE = {COLIURL : Duchier:1998:CBT.pdf Duchier:1998:CBT.ps}
}

@TechReport{Duchier_et_al:1998,
      AUTHOR = {Duchier, Denys and Kornstaedt, Leif and Schulte, Christian and Smolka, Gert},
      TITLE = {A Higher-Order Module Discipline with Separate Compilation, Dynamic Linking, and Pickling},
      YEAR = {1998},
      ADDRESS = {Saarbrücken},
      TYPE = {Technical Report},
      INSTITUTION = {Programming Systems Lab, DFKI and Universität des Saarlandes},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/modules-98.ps.gz},
      ABSTRACT = {We present a higher-order module discipline with separate compilation and concurrent dynamic linking. Based on first-order modules one can program security policies for systems that link modules from untrusted locations (e.g., Java). We introduce a pickling operation that writes persistent clones of volatile, possibly higher-order data structures on the file system. Our pickling operation respects lexical binding. Our module discipline is based on functors, which are annotated functions that are applied to modules and return modules. Pickled computed functors can be used interchangeably with compiled functors. In contrast to compiled functors, pickled computed functors can carry computed data structures with them, which has significant practical applications.},
      ANNOTE = {COLIURL : Duchier:1998:HOM.pdf Duchier:1998:HOM.ps}
}

@InProceedings{Dünges:1998,
      AUTHOR = {Dünges, Petra},
      TITLE = {Eventualities in Time},
      YEAR = {1998},
      BOOKTITLE = {23rd International Symposium on Mathematical Foundations of Computer Science (MFCS '98). Workshop on Mathematical Linguistics, August 24-28},
      PAGES = {51-60},
      EDITOR = {Kudlek, M.},
      ADDRESS = {Brno, Czech Republic},
      ABSTRACT = {This paper addresses the general question of how eventualities should be localized in time. The answer given here is mainly inspired by the model theory of Discourse Representation Theory (DRT) as presented in From Discourse to Logic by Kamp and Reyle. We show that there is a mathematical problem concerning the localization function used in that book. And we propose a remedy for this problem. The general picture that emerges should be interesting not only for DRT but for other theories using an eventuality-based semantics as well.}
}

@TechReport{Dünges:1998_1,
      AUTHOR = {Dünges, Petra},
      TITLE = {Eventualities in Time},
      YEAR = {1998},
      MONTH = {November},
      NUMBER = {104},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/claus/claus104.ps ftp://ftp.coli.uni-sb.de/pub/claus/claus104.dvi},
      ABSTRACT = {This paper addresses the general question of how eventualities should be localized in time. The more specific question about the localization of states and events is discussed, too. For these questions the theory of tense and aspect in Discourse Representation Theory (DRT) is closely investigated, as far as relevant for single-sentence-discourses. The answers given here are mainly inspired by DRT as presented in From Discourse to Logic by Kamp and Reyle. We show that the way eventualities are localized in time in that book contains some inconsistencies. In particular there is a mathematical problem concerning the localization function and a linguistic problem concerning the basic aspectual schema with culmination point. We propose a remedy for these problems. As main results we propose a change in the theory of aspect and a new definition of an eventuality structure. The general picture that emerges should be interesting not only for DRT but for other theories using an eventuality-based semantics as well.},
      ANNOTE = {COLIURL : Dunges:1998:ETB.pdf Dunges:1998:ETB.ps Dunges:1998:ETB.dvi}
}

@Article{Egg:1998,
      AUTHOR = {Egg, Markus},
      TITLE = {Wh-Questions in Underspecified Minimal Recursion Semantics},
      YEAR = {1998},
      JOURNAL = {Journal of Semantics},
      VOLUME = {15},
      PAGES = {37-82},
      ABSTRACT = {In this paper, I present Underspecified Minimal Recursion Semantics (UMRS), a representation language that represents structural ambiguities in terms of underspecification. It is argued that this kind of approach allows for transparent semantic representations and a straightforward syntax-semantics interface. UMRS is a semantic metalanguage, whose expressions describe expressions of an object language and (possibly underspecified) dependences between them. The potential of UMRS will be illustrated by employing it as the semantic component of an HPSG description of wh-questions.}
}

@Article{Egg_et_al:1998,
      AUTHOR = {Egg, Markus and Gardent, Claire and Kohlhase, Michael},
      TITLE = {Steuerung der Inferenz in der Diskursverarbeitung},
      YEAR = {1998},
      JOURNAL = {Kognitionswissenschaft},
      VOLUME = {7},
      PAGES = {106-110},
      ABSTRACT = {Semantic interpretation is an essential component of natural language understanding which draws on extremely efficient language-based inference techniques. Such techniques are still lacking in computational systems for natural language processing. We have investigated specialized representation formalisms and suitable inference techniques that meet some of these desiderata. We have developed higher-order inference procedures to accurately represent linguistic ambiguities in terms of underspecification, and show how these procedures can be guided by information from other linguistic strata.}
}

@TechReport{Egg_et_al:1998_1,
      AUTHOR = {Egg, Markus and Koller, Alexander and Niehren, Joachim and Ruhrberg, Peter},
      TITLE = {Constraints over Lambda Structures, Antecedent Contained Deletion, and Quantifier Identities},
      YEAR = {1998},
      ADDRESS = {Saarbrücken},
      TYPE = {Technical Report},
      INSTITUTION = {Computational Linguistics and Programming Systems Lab, University of the Saarland},
      ABSTRACT = {The constraint language for lambda-structures (CLLS) allows for a simple, integrated, and underspecified treatment of scope, ellipses, anaphora, and their interaction. CLLS features constraints for dominance, lambda binding, parallelism, and anaphoric links. In the case of antecedent contained deletion (ACD), the definition of parallelism in the original version of CLLS is slightly too restrictive due to an overly weak notion of quantifier identity. We show how to extend CLLS with an appropriate notion of quantifier identity such that ACD can be naturally analysed. This sheds some light on conflicting requirements on quantifier representations as needed for ACD and Hirschbühler sentences.}
}

@InProceedings{Egg_et_al:1998_2,
      AUTHOR = {Egg, Markus and Niehren, Joachim and Ruhrberg, Peter and Xu, Feiyu},
      TITLE = {Constraints over Lambda-Structures in Semantic Underspecification},
      YEAR = {1998},
      BOOKTITLE = {17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association for Computational Linguistics (COLING-ACL'98), August 10-14},
      VOLUME = {1},
      PAGES = {353-359},
      EDITOR = {ACL},
      ADDRESS = {Montréal, Québec, Canada},
      PUBLISHER = {Morgan Kaufmann Publishers},
      URL = {http://www.dfki.de/~feiyu/CLLS-98.pdf ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/COLING-feiyu-98.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/COLING-feiyu-98.entry},
      ABSTRACT = {We introduce a first-order language for semantic underspecification that we call Constraint Language for Lambda-Structures (CLLS). A lambda-structure can be considered as a lambda-term up to consistent renaming of bound variables (alpha-equality); a constraint of CLLS is an underspecified description of a $lambda$-structure. CLLS solves a capturing problem omnipresent in underspecified scope representations. CLLS features constraints for dominance, lambda binding, parallelism, and anaphoric links. Based on CLLS we present a simple, integrated, and underspecified treatment of scope, parallelism, and anaphora.},
      ANNOTE = {COLIURL : Egg:1998:CLSb.pdf Egg:1998:CLSb.ps}
}

@TechReport{Gardent_et_al:1998,
      AUTHOR = {Gardent, Claire and Kohlhase, Michael and Konrad, Karsten},
      TITLE = {Higher-Order Coloured Unification: a linguistic application},
      YEAR = {1998},
      MONTH = {November},
      NUMBER = {101},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/people/claire/tsi.ps.gz},
      ABSTRACT = {During the last decade, Higher-Order unification (HOU) has become a popular tool for constructing the semantic representation of natural language expressions. But there is a well-known problem with this approach: it over-generates that is, it produces solutions which although they are mathematically valid, are linguistically incorrect because they do not represent possible meanings of the expression being analysed. In this paper, we argue that Higher-Order Colored Unification (HOCU) can help prevent over-generation and we describe the linguistic, logical and computational aspects of an HOCU--based approach to semantic construction.},
      ANNOTE = {COLIURL : Gardent:1998:HOC.pdf Gardent:1998:HOC.ps}
}

@InProceedings{Gardent_Webber:1998,
      AUTHOR = {Gardent, Claire and Webber, Bonnie},
      TITLE = {Describing Discourse Semantics},
      YEAR = {1998},
      BOOKTITLE = {4th International Workshop on Tree-Adjoining Grammars and Related Frameworks (TAG+), August 1-3},
      ADDRESS = {Philadelphia, USA}
}

@InProceedings{Hajicová_et_al:1998,
      AUTHOR = {Hajicová, Eva and Korbayova, Ivana and Kruijff, Geert-Jan M.},
      TITLE = {Salience in Dialogues},
      YEAR = {1998},
      BOOKTITLE = {5th International Congress of the International Association of Dialogue Analysis, April 17-20},
      VOLUME = {1},
      PAGES = {381-393},
      EDITOR = {Cmejrková, S. and Hoffmannová, J. and Müllerová, O. and Svetlá, J.},
      ADDRESS = {Prague, Czech Republic},
      PUBLISHER = {Max Niemeyer Verlag},
      URL = {https://www.coli.uni-saarland.de/~korbay/Publications/dialog.ps.gz}
}

@Article{Haridi_et_al:1998,
      AUTHOR = {Haridi, Seif and Van Roy, Peter and Brand, Per and Schulte, Christian},
      TITLE = {Programming Languages for Distributed Applications},
      YEAR = {1998},
      JOURNAL = {New Generation Computing},
      VOLUME = {16},
      NUMBER = {3},
      PAGES = {223-261},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/ngc98.ps.gz},
      ABSTRACT = {Much progress has been made in distributed computing in the areas of distribution structure, open computing, fault tolerance, and security. Yet, writing distributed applications remains difficult because the programmer has to manage models of these areas explicitly. A major challenge is to integrate the four models into a coherent development platform. Such a platform should make it possible to cleanly separate an application's functionality from the other four concerns. Concurrent constraint programming, an evolution of concurrent logic programming, has both the expressiveness and the formal foundation needed to attempt this integration. As a first step, we have designed and built a platform that separates an application's functionality from its distribution structure. We have prototyped several collaborative tools with this platform, including a shared graphic editor whose design is presented in detail. The platform efficiently implements Distributed Oz, which extends the Oz language with constructs to express the distribution structure and with basic primitives for open computing, failure detection and handling, and resource control. Oz appears to the programmer as a concurrent object-oriented language with dataflow synchronization. Oz is based on a higher-order, state-aware, concurrent constraint computation model.},
      ANNOTE = {COLIURL : Haridi:1998:PLD.pdf Haridi:1998:PLD.ps}
}

@InProceedings{Heine:1998,
      AUTHOR = {Heine, Julia},
      TITLE = {Definiteness Predictions for Japanese Noun Phrases},
      YEAR = {1998},
      BOOKTITLE = {17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association for Computational Linguistics (COLING-ACL '98), August 10-14},
      EDITOR = {ACL},
      ADDRESS = {Montreal, Canada},
      PUBLISHER = {Morgan Kaufmann Publishers},
      URL = {http://acl.ldc.upenn.edu/P/P98/P98-1085.pdf},
      ANNOTE = {COLIURL : Heine:1998:DPJ.pdf}
}

@InCollection{Hemforth_et_al:1998,
      AUTHOR = {Hemforth, Barbara and Konieczny, Lars and Scheepers, Christoph and Strube, Gerhard},
      TITLE = {Syntactic Ambiguity Resolution in German},
      YEAR = {1998},
      BOOKTITLE = {Syntax and Semantics: A Cross-Linguistic Perspective},
      EDITOR = {Hillert, D.},
      ADDRESS = {San Diego},
      PUBLISHER = {Academic Press}
}

@Misc{Henz:1998,
      AUTHOR = {Henz, Martin},
      TITLE = {Scheduling a Major College Basketball Conference - Revisited},
      YEAR = {1998},
      ABSTRACT = {Nemhauser and Trick presented the problem of finding a timetable for the 1997/98 Atlantic Coast Conference (ACC) in basketball. Their solution, found with a combination of integer programming and exhaustive enumeration, was accepted by the ACC. Finite-domain constraint programming is another programming technique that can be used for solving combinatorial search problems such as sport timetabling. This paper presents a solution of round robin tournament planning based on finite-domain constraint programming. The approach yields a dramatic performance improvement, which makes an integrated interactive software solution feasible.}
}

@Proceedings{Djoerd_et_al:1998,
      TITLE = {Language Technology in Multimedia Information Retrieval. Proceedings of the 14th Twente Workshop on Language Technology (TWLT-14), December 7-8},
      YEAR = {1998},
      EDITOR = {Hiemstra, Djoerd and de Jong, Franciska and Netter, Klaus},
      ADDRESS = {Enschede, The Netherlands}
}

@InProceedings{Horacek_Busemann:1998,
      AUTHOR = {Horacek, Helmut and Busemann, Stephan},
      TITLE = {Towards a Methodology for Developing Application-Oriented Report Generation},
      YEAR = {1998},
      BOOKTITLE = {KI-98: Advances in Artificial Intelligence. 22nd Annual German Conference on Artificial Intelligence, September 15-17},
      NUMBER = {1504},
      PAGES = {189-200},
      EDITOR = {Herzog, Otthein and Günther, Andreas},
      SERIES = {Lecture Notes in Artificial Intelligence},
      ADDRESS = {Bremen},
      PUBLISHER = {Springer},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/horacek-busemann98.ps.gz},
      ABSTRACT = {Although research in natural language generation has led to the development of numerous methods and reusable software tools, we feel that building comparably simple application systems still involves more hand-crafted skills than systematic methodology. In our view, this is due to the fact that most available tools are oriented towards contributing to a general purpose generation system rather than supporting the economic development of dedicated applications. In order to improve this situation, we present a methodology for developing application-oriented report generation with limited effort, emphasizing domain- and user-specific preferences over general-purpose communicative principles. Key parts in our approach comprise building an ontologically minimal initial representation on the basis of user parameters and associated domain data, the successive refinement of this initial representation by making implicit information explicit enough for fleshing out selected text and sentence patterns, and the opportunistic combination of linguistically motivated methods with template-based generation. This methodology should enable system developers to build application-oriented report generators more systematically and with reduced effort.},
      ANNOTE = {COLIURL : Horacek:1998:TMD.pdf Horacek:1998:TMD.ps}
}

@InProceedings{Klein_Declerck:1998,
      AUTHOR = {Klein, Judith and Declerck, Thierry},
      TITLE = {Annotating German Language Data for Shallow Processing},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the 10th European Summer School in Logic, Language and Information (ESSLLI '98), August 17-28},
      ADDRESS = {Saarbrücken, Germany},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/esslli98_klein.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/esslli98_klein.entry},
      ANNOTE = {COLIURL : Klein:1998:AGL.pdf Klein:1998:AGL.ps}
}

@InProceedings{Klein_et_al:1998,
      AUTHOR = {Klein, Judith and Declerck, Thierry and Neumann, Günter},
      TITLE = {Evaluation of the Syntactic Analysis Component of an Information Extraction System for German},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the 1st International Conference on Language Resources and Evaluation (LREC '98). Workshop on Evaluation of Parsing Systems, May 28-30},
      ADDRESS = {Granada, Spain},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/lrec-ws98.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/lrec-ws98.entry},
      ANNOTE = {COLIURL : Klein:1998:ESA.pdf Klein:1998:ESA.ps}
}

@InProceedings{Klein_et_al:1998_1,
      AUTHOR = {Klein, Judith and Lehmann, Sabine and Netter, Klaus and Wegst, Tillmann},
      TITLE = {DiET in the Context of MT Evaluation},
      YEAR = {1998},
      BOOKTITLE = {Evaluation of the Linguistic Performance of Machine Translation Systems. Proceedings of the KONVENS '98 Workshop in Bonn, October 5-7},
      PAGES = {107-126},
      EDITOR = {Nübel, R. and Seewald-Heeg, U.},
      ADDRESS = {Universität Bonn},
      PUBLISHER = {Gardez!-Verlag},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/diet-konvens98.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/diet-konvens98.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/diet-konvens98.pdf},
      ANNOTE = {COLIURL : Klein:1998:DCM.pdf Klein:1998:DCM.ps}
}

@InProceedings{Koller:1998,
      AUTHOR = {Koller, Alexander},
      TITLE = {Evaluating Context Unification for Semantic Underspecification},
      YEAR = {1998},
      BOOKTITLE = {3rd ESSLLI Student Session (ESSLLI '98), August 17-28},
      PAGES = {188-199},
      EDITOR = {Korbayova, Ivana},
      ADDRESS = {Saarbrücken, Germany},
      ABSTRACT = {Context unification has been proposed as a powerful formalism for the uniform and underspecified treatment of scope ambiguities and parallelism. We develop an algorithm for context unification that alleviates the enormous computational and overgeneration problems of earlier algorithms. It is incomplete for full context unification, but finds all linguistically relevant solutions. We apply an implementation of the new algorithm to evaluate context unification as a tool for semantic analysis.},
      ANNOTE = {COLIURL : Koller:1998:ECU.pdf}
}

@InProceedings{Koller_et_al:1998,
      AUTHOR = {Koller, Alexander and Niehren, Joachim and Treinen, Ralf},
      TITLE = {Dominance Constraints: Algorithms and Complexity},
      YEAR = {1998},
      BOOKTITLE = {3rd International Conference on Logical Aspects of Computational Linguistics (LACL '98), December 14-16},
      ADDRESS = {Grenoble, France},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/DominanceNP98.ps.gz},
      ABSTRACT = {Dominance constraints for finite tree structures are widely used in several areas of computational linguistics including syntax, semantics, and discourse. In this paper, we investigate algorithmic and complexity questions for dominance constraints and their first-order theory. We present two NP algorithms for solving dominance constraints, which have been implemented in the concurrent constraint programming language Oz. The main result of this paper is that the satisfiability problem of dominance constraints is NP-complete. Despite this intractability result, the more sophisticated of our algorithms performs well in an application to scope underspecification. We also show that the existential fragment of the first-order theory of dominance constraints is NP-complete and that the full first-order theory has non-elementary complexity.},
      ANNOTE = {COLIURL : Koller:1998:DCA.pdf Koller:1998:DCA.ps}
}

@InProceedings{Koreman_et_al:1998,
      AUTHOR = {Koreman, Jacques and Andreeva, Bistra and Barry, William J.},
      TITLE = {Die Abbildung Akustischer Parameter auf phonetische Merkmale in der automatischen Spracherkennung},
      YEAR = {1998},
      BOOKTITLE = {Computer, Linguistik und Phonetik zwischen Sprache und Sprechen : Tagungsband der 4. Konferenz zur Verarbeitung natürlicher Sprache (KONVENS 98), 5. - 7. Oktober},
      VOLUME = {1},
      PAGES = {153-158},
      EDITOR = {Schröder, Bernhard and Lenders, Winfried and Hess, Wolfgang and Portele, Thomas},
      SERIES = {Sprache, Sprechen und Computer},
      ADDRESS = {Universität Bonn, Germany},
      PUBLISHER = {Lang, Peter}
}

@InProceedings{Koreman_et_al:1998_1,
      AUTHOR = {Koreman, Jacques and Andreeva, Bistra and Barry, William J.},
      TITLE = {Do Phonetic Features Help to Improve Consonant Identification in ASR?},
      YEAR = {1998},
      BOOKTITLE = {5th International Conference on Spoken Language Processing (ICSLP '98), November 30 - December 4},
      PAGES = {paper 549},
      ADDRESS = {Sydney, Australia}
}

@InProceedings{Koreman_et_al:1998_2,
      AUTHOR = {Koreman, Jacques and Andreeva, Bistra and Barry, William J.},
      TITLE = {Exploiting Transitions and Focussing on Linguistic Properties for ASR},
      YEAR = {1998},
      BOOKTITLE = {5th International Conference on Spoken Language Processing (ICSLP '98), November 30 - December 4},
      PAGES = {paper 548},
      ADDRESS = {Sydney, Australia}
}

@InProceedings{Krenn:1998,
      AUTHOR = {Krenn, Brigitte},
      TITLE = {A Representation Scheme and Database for German Support-Verb Constructions},
      YEAR = {1998},
      BOOKTITLE = {4. Konferenz Verarbeitung natürlicher Sprache (KONVENS '98), 5.-7. Oktober},
      PAGES = {33-42},
      EDITOR = {Schröder, Bernhard and Lenders, Winfried and Hess, Wolfgang and Portele, Thomas},
      ADDRESS = {Bonn, Germany},
      PUBLISHER = {Peter Lang}
}

@InProceedings{Krenn:1998_1,
      AUTHOR = {Krenn, Brigitte},
      TITLE = {Acquisition of Phraseological Units from Linguistically Interpreted Corpora. A Case Study on German PP-Verb Collocations},
      YEAR = {1998},
      BOOKTITLE = {Industrielle Software Produktion (ISP '98), 12.-13. November},
      ADDRESS = {Stuttgart, Germany}
}

@InProceedings{Krenn_et_al:1998,
      AUTHOR = {Krenn, Brigitte and Brants, Thorsten and Skut, Wojciech and Uszkoreit, Hans},
      TITLE = {Recent Advances in Corpus Annotation},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the 10th European Summer School in Logic, Language and Information (ESSLLI'98). Workshop on Automated Acquisition of Syntax and Parsing, August 17-28},
      ADDRESS = {Saarbrücken, Germany},
      URL = {http://www.dfki.de/dfkibib/publications/docs/Krenn_1998_RACA.pdf},
      ANNOTE = {COLIURL : Krenn:1998:RAC.pdf}
}

@InProceedings{Krieger:1998,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {Typed Feature Structures, Definite Equivalences, Greatest Model Semantics, and Nonmonotonicity},
      YEAR = {1998},
      BOOKTITLE = {23rd International Symposium on Mathematical Foundations of Computer Science (MFCS '98). Workshop on Mathematical Linguistics, August 24-28},
      PAGES = {85-95},
      ADDRESS = {Brno, Czech Republic},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/130.entry}
}

@InProceedings{Kruijff-Korbayová:1998,
      AUTHOR = {Korbayova, Ivana},
      TITLE = {Generation of Instructions in a Multilingual Environment},
      YEAR = {1998},
      BOOKTITLE = {1st Workshop on TEXT, SPEECH and DIALOGUE (TSD'98), September 23-26},
      PAGES = {67-72},
      ADDRESS = {Brno, Czech Republic},
      PUBLISHER = {Masaryk University Press},
      ANNOTE = {COLIURL : Kruijff-Korbayova:1998:GIM.pdf Kruijff-Korbayova:1998:GIM.ps}
}

@PhdThesis{Kruijff-Korbayová:1998_1,
      AUTHOR = {Korbayova, Ivana},
      TITLE = {The Dynamic Potential of Topic and Focus: A Praguian Discourse Representation Theory},
      YEAR = {1998},
      ADDRESS = {Prague},
      SCHOOL = {Charles University, Faculty of Mathematics and Physics},
      NOTE = {unpublished}
}

@TechReport{Kuschert:1998,
      AUTHOR = {Kuschert, Susanna},
      TITLE = {Dynamic Deduction for Accomodation in Anaphora Resolution},
      YEAR = {1998},
      MONTH = {October},
      NUMBER = {100},
      PAGES = {16},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus100.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus100.dvi},
      ANNOTE = {COLIURL : Kuschert:1998:DDA.pdf Kuschert:1998:DDA.ps Kuschert:1998:DDA.dvi}
}

@TechReport{Mehl_et_al:1998,
      AUTHOR = {Mehl, Michael and Schulte, Christian and Smolka, Gert},
      TITLE = {Futures and By-need Synchronization},
      YEAR = {1998},
      MONTH = {May},
      ADDRESS = {Saarbrücken},
      TYPE = {Draft},
      INSTITUTION = {DFKI and Universität des Saarlandes},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/oz-futures.ps.gz},
      ABSTRACT = {We propose a conservative extension of Oz that adds futures and by-need synchronization. Futures are read-only views of logic variables that make it possible to statically limit the scope in which a variable can be constrained. For instance, one can express with futures safe streams that cannot be assigned by their readers. By-need synchronization makes it possible to synchronize a thread on the event that a thread blocks on a future. It is used to express dynamic linking and lazy functions.}
}

@InProceedings{Meyer_et_al:1998,
      AUTHOR = {Meyer, Georg and Barry, William J. and Koreman, Jacques},
      TITLE = {Vowel Pre-Nasalization as a Cue for Auditory Scene Analysis},
      YEAR = {1998},
      BOOKTITLE = {NATO Advanced Study Institute on Computational Hearing, July 1 - July 12},
      PAGES = {233-238},
      ADDRESS = {Il Ciocco, Italy}
}

@PhdThesis{Müller:1998,
      AUTHOR = {Müller, Martin},
      TITLE = {Set-Based Failure Diagnosis for Concurrent Constraint Programming},
      YEAR = {1998},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes, Fachbereich Informatik},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Diss-Mueller.ps.gz},
      ABSTRACT = {Oz is a recent high-level programming language, based on an extension of the concurrent constraint model by higher-order procedures and state. Oz is a dynamically typed language like Prolog, Scheme, or Smalltalk. We investigate two approaches of making static type analysis available for Oz: Set-based failure diagnosis and strong typing. We define a new system of set constraints over feature trees that is appropriate for the analysis of record structures, and we investigate its satisfiability, emptiness, and entailment problem. We present a set-based diagnosis for constraint logic programming and concurrent constraint programming as first-order fragments of Oz, and we prove that it correctly detects inevitable run-time errors. We also propose an analysis for a larger sublanguage of Oz. Complementarily, we define an Oz-style language called Plain that allows an expressive strong type system. We present such a type system and prove its soundness.},
      ANNOTE = {COLIURL : Muller:1998:SBF.pdf Muller:1998:SBF.ps}
}

@InProceedings{Müller_Niehren:1998,
      AUTHOR = {Müller, Martin and Niehren, Joachim},
      TITLE = {Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic},
      YEAR = {1998},
      BOOKTITLE = {9th International Conference on Rewriting Techniques and Applications (RTA '98), March 30 - April 1},
      NUMBER = {1379},
      PAGES = {196-210},
      EDITOR = {Nipkow, T.},
      SERIES = {Lecture Notes in Computer Science},
      ADDRESS = {Tsukuba, Japan},
      PUBLISHER = {Springer-Verlag},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/SWS97.ps.gz},
      ABSTRACT = {The system FT$_lt$ of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. We investigate decidability and complexity questions for fragments of the first-order theory of FT$_lt$. It is well-known that the first-order theory of FT$_lt$ is decidable and that several of its fragments can be decided in quasi-linear time, including the satisfiability problem of FT$_lt$ and its entailment problem with existential quantification $$phimodels E x1 ... E xn ( phi' )$$ Much less is known on the first-order theory of FT$_lt$. The satisfiability problem of FT$_lt$ can be decided in cubic time, as well as its entailment problem without existential quantification. Our main result is that the entailment problem of FT$_lt$ with existential quantifiers is decidable but PSPACE-hard. Our decidability proof is based on a new technique where feature constraints are expressed in second-order monadic logic with countably many successors SwS. We thereby reduce the entailment problem of FT$_lt$ with existential quantification to Rabin's famous theorem on tree automata.},
      ANNOTE = {COLIURL : Muller:1998:OCF.pdf Muller:1998:OCF.ps}
}

@InProceedings{Müller_et_al:1998,
      AUTHOR = {Müller, Martin and Niehren, Joachim and Treinen, Ralf},
      TITLE = {The First-Order Theory of Ordering Constraints over Feature Trees},
      YEAR = {1998},
      BOOKTITLE = {13th Annual IEEE Symposium on Logic in Computer Sience (LICS '98), June 21 - 24},
      PAGES = {432-443},
      ADDRESS = {Indianapolis, Indiana, USA},
      PUBLISHER = {IEEE Press},
      URL = {http://www.ps.uni-sb.de/Papers/abstracts/FTSubTheory-Long:99.html ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/FTSubTheory-Long:99.ps.gz},
      ABSTRACT = {The system FT$_leq$ of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. We investigate the first-order theory of FT$_leq$ and its fragments in detail, both over finite trees and over possibly infinite trees. We prove that the first-order theory of FT$_leq$ is undecidable, in contrast to the first-order theory of FT which is well-known to be decidable. We show that the entailment problem of FT$_leq$ with existential quantification is PSPACE-complete. So far, this problem has been shown decidable, coNP-hard in case of finite trees, PSPACE-hard in case of arbitrary trees, and cubic time when restricted to quantifier-free entailment judgments. To show PSPACE-completeness, we show that the entailment problem of FT$_leq$ with existential quantification is equivalent to the inclusion problem of non-deterministic finite automata.},
      ANNOTE = {COLIURL : Muller:1998:FOT.pdf Muller:1998:FOT.ps}
}

@InProceedings{Müller_Nishimura:1998,
      AUTHOR = {Müller, Martin and Nishimura, Susumu},
      TITLE = {Type Inference for First-Class Messages with Feature Constraints},
      YEAR = {1998},
      BOOKTITLE = {Asian Computer Science Conference (ASIAN '98), December 8-10},
      NUMBER = {1538},
      PAGES = {169-187},
      EDITOR = {Hsiang, J. and Ohori, A.},
      SERIES = {Lecture Notes in Computer Science},
      ADDRESS = {Manila, The Philippines},
      PUBLISHER = {Springer},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/FirstClass98.ps.gz},
      ABSTRACT = {We present a constraint system OF of feature trees that is appropriate to specify and implement type inference for first-class messages. OF extends traditional systems of feature constraints by a selection constraint by first-class feature tree $x langle y 
angle z$, in contrast to the standard selection constraint $x[f]y$ by fixed feature $f$. We investigate the satisfiability problem of OF and show that it can be solved in polynomial time, and even in quadratic time in an important special case. We compare OF with Treinen's constraint system EF of feature constraints with first-class features, which has an NP-complete satisfiability problem. This comparison yields that the satisfiability problem for OF with negation is NP-hard. Based on OF we give a simple account of type inference for first-class messages in the spirit of Nishimura's recent proposal, and show that it has polynomial time complexity: We also highlight an immediate extension that is desirable but makes type inference NP-hard.},
      ANNOTE = {COLIURL : Muller:1998:TIF.pdf Muller:1998:TIF.ps}
}

@TechReport{Müller:1998_1,
      AUTHOR = {Müller, Stefan},
      TITLE = {An HPSG-Analysis for Free Relative Clauses in German},
      YEAR = {1998},
      NUMBER = {224},
      ADDRESS = {Saarbrücken},
      TYPE = {Verbmobil Report},
      INSTITUTION = {DFKI},
      URL = {http://www.dfki.de/~stefan/PS/freeRel.ps},
      ANNOTE = {COLIURL : Muller:1998:HAF.pdf Muller:1998:HAF.ps}
}

@InProceedings{Müller:1998_2,
      AUTHOR = {Müller, Stefan},
      TITLE = {Case in German - An HPSG-Analysis},
      YEAR = {1998},
      BOOKTITLE = {ESSLLI '98 Workshop on Current Topics in Constraint-Based Theories of Germanic Syntax, August 17-21},
      PAGES = {113-132},
      ADDRESS = {Saarbrücken, Germany},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/esslli98.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/esslli98.entry http://www.dfki.de/~stefan/PS/esslli98-pic.ps},
      ANNOTE = {COLIURL : Muller:1998:CGH.pdf Muller:1998:CGH.ps}
}

@InProceedings{Nederhof:1998,
      AUTHOR = {Nederhof, Mark-Jan},
      TITLE = {An Alternative LR Algorithm for TAGs},
      YEAR = {1998},
      BOOKTITLE = {17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association for Computational Linguistics (COLING-ACL '98), August 10-14},
      VOLUME = {2},
      PAGES = {946-952},
      EDITOR = {ACL},
      ADDRESS = {Montréal, Québec, Canada},
      PUBLISHER = {Morgan Kaufmann Publishers},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98b.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98b.entry},
      ANNOTE = {COLIURL : Nederhof:1998:ALA.pdf Nederhof:1998:ALA.ps}
}

@InProceedings{Nederhof:1998_1,
      AUTHOR = {Nederhof, Mark-Jan},
      TITLE = {Linear Indexed Automata and Tabulation of TAG Parsing},
      YEAR = {1998},
      BOOKTITLE = {Premières Journées sur la Tabulation en Analyse Syntaxique et Déduction/ 1st Workshop on Tabulation in Parsing and Deduction (TAPD '98), April 2-3},
      PAGES = {1-9},
      ADDRESS = {Paris, France},
      URL = {http://www.dfki.de/dfkibib/publications/docs/nederhof98e.ps.gz},
      ANNOTE = {COLIURL : Nederhof:1998:LIA.pdf Nederhof:1998:LIA.ps}
}

@InProceedings{Nederhof:1998_2,
      AUTHOR = {Nederhof, Mark-Jan},
      TITLE = {Context-Free Parsing Through Regular Approximation},
      YEAR = {1998},
      BOOKTITLE = {1st International Workshop on Finite State Methods in Natural Language Processing (FSMNLP '98), June 29 - July 1},
      PAGES = {13-24},
      ADDRESS = {Bilkent University, Ankara, Turkey},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98a.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98a.entry},
      ANNOTE = {COLIURL : Nederhof:1998:CFP.pdf Nederhof:1998:CFP.ps}
}

@InProceedings{Nederhof_et_al:1998,
      AUTHOR = {Nederhof, Mark-Jan and Sarkar, Anoop and Satta, Giorgio},
      TITLE = {Prefix Probabilities for Linear Indexed Grammars},
      YEAR = {1998},
      BOOKTITLE = {4th International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4), August 1-3},
      NUMBER = {98-12},
      PAGES = {116-119},
      SERIES = {IRCS Report},
      ADDRESS = {University of Pennsylvania, Philadelphia, USA},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98d.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98d.entry},
      ANNOTE = {COLIURL : Nederhof:1998:PPL.pdf Nederhof:1998:PPL.ps}
}

@InProceedings{Nederhof_et_al:1998_1,
      AUTHOR = {Nederhof, Mark-Jan and Sarkar, Anoop and Satta, Giorgio},
      TITLE = {Prefix Probabilities from Stochastic Tree Adjoining Grammar},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the 17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association on Computational Linguistics (COLING-ACL '98), August 10-14},
      VOLUME = {2},
      PAGES = {953-959},
      EDITOR = {ACL},
      ADDRESS = {Montréal, Québec, Canada},
      PUBLISHER = {Morgan Kaufmann Publishers},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98c.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98c.entry},
      ANNOTE = {COLIURL : Nederhof:1998:PPS.pdf Nederhof:1998:PPS.ps}
}

@InProceedings{Nederhof_et_al:1998_2,
      AUTHOR = {Nederhof, Mark-Jan and Sarkar, Anoop and Satta, Giorgio},
      TITLE = {Prefix Probabilities for Linear Indexed Grammars},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the 4th International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4), August 1-3},
      NUMBER = {98-12},
      PAGES = {116-119},
      SERIES = {IRCS Report},
      ADDRESS = {University of Pennsylvania, Philadelphia, USA},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98d.ps.gz},
      ABSTRACT = {We show how prefix probabilities can be computed for stochastic linear indexed grammars (SLIGs). Our results apply as well to stochastic tree-adjoining grammars (STAGs), due to their equivalence to SLIGs.},
      ANNOTE = {COLIURL : Nederhof:1998:PPLb.pdf Nederhof:1998:PPLb.ps}
}

@InProceedings{Netter:1998,
      AUTHOR = {Netter, Klaus},
      TITLE = {POP-EYE and OLIVE - Human Language as the Medium for Cross-Lingual Multimedia Information Retrieval},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the 2nd International Conference on Quality and Standards in Audiovisual Language Transfer. Languages and the Media},
      ADDRESS = {Berlin, Germany},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/langmed-98.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/langmed-98.entry},
      ABSTRACT = {Also published in: The ELRA Newsletter. Vol. 3, 1998.},
      ANNOTE = {COLIURL : Netter:1998:PEO.pdf Netter:1998:PEO.ps}
}

@InProceedings{Netter_et_al:1998,
      AUTHOR = {Netter, Klaus and Armstrong, Susan and Kiss, Tibor and Klein, Judith and Lehmann, Sabine and Milward, David and Regnier-Prost, Sylvie and Schäler, Reinhard and Wegst, Tillmann},
      TITLE = {DiET - Diagnostic and Evaluation Tools for Natural Language Application},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the 1st International Conference on Language Resources and Evaluation, May 28-30},
      PAGES = {573-579},
      ADDRESS = {Granada, Spain},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/granada-diet.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/granada-diet.entry},
      ANNOTE = {COLIURL : Netter:1998:DDE.pdf Netter:1998:DDE.ps}
}

@Proceedings{Klaus_et_al:1998,
      TITLE = {Language Technology in Multimedia Information Retrieval. Proceedings of the 14th Twente Workshop on Language Technology (TWLT 14), December 7-8},
      YEAR = {1998},
      EDITOR = {Netter, Klaus and Hiemstra, Djoerd and de Jong, Franciska},
      ADDRESS = {University of Twente, Enschede, The Netherlands},
      URL = {http://parlevink.cs.utwente.nl/Conferences/TWLT14/abstracts.html}
}

@InProceedings{Neumann:1998,
      AUTHOR = {Neumann, Günter},
      TITLE = {Automatic Extraction of Stochastic Lexicalized Tree Grammars from Treebanks},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the 4th Workshop on Tree-Adjoining Grammars and Related Frameworks (TAG+4), August 1-3},
      ADDRESS = {Philadelphia, USA},
      URL = {http://www.dfki.de/~neumann/publications/new-ps/tag+.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/gn-tag.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/gn-tag.entry},
      ANNOTE = {COLIURL : Neumann:1998:AES.pdf Neumann:1998:AES.ps}
}

@Article{Neumann:1998_1,
      AUTHOR = {Neumann, Günter},
      TITLE = {Interleaving Natural Language Parsing and Generation Through Uniform Processing},
      YEAR = {1998},
      JOURNAL = {Artificial Intelligence},
      VOLUME = {99},
      PAGES = {121-163},
      URL = {http://www.dfki.de/~neumann/publications/new-ps/ai-uta.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/uta.entry},
      ANNOTE = {COLIURL : Neumann:1998:INL.pdf Neumann:1998:INL.ps}
}

@InProceedings{Niehren_Koller:1998,
      AUTHOR = {Niehren, Joachim and Koller, Alexander},
      TITLE = {Dominance Constraints in Context Unification},
      YEAR = {1998},
      BOOKTITLE = {3rd International Conference on Logical Aspects of Computational Linguistics (LACL '98), December 14-16},
      NUMBER = {2014},
      PAGES = {199-218},
      EDITOR = {Moortgat, M.},
      SERIES = {Lecture Notes in Artificial Intelligence},
      ADDRESS = {Grenoble, France},
      PUBLISHER = {Springer},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Dominance-98.ps.gz},
      ABSTRACT = {Tree descriptions based on dominance constraints are popular in several areas of computational linguistics including syntax, semantics, and discourse. Tree descriptions in the language of context unification have attracted some interest in unification and rewriting theory. Recently, dominance constraints and context unification have both been used in different underspecified approaches to the semantics of scope, parallelism, and their interaction. This raises the question whether both description languages are related. In this paper, we show for a first time that dominance constraints can be expressed in context unification. We also prove that dominance constraints extended with parallelism constraints are equal in expressive power to context unification.},
      ANNOTE = {COLIURL : Niehren:1998:DCC.pdf Niehren:1998:DCC.ps}
}

@TechReport{Niehren_et_al:1998,
      AUTHOR = {Niehren, Joachim and Müller, Martin and Talbot, Jean-Marc},
      TITLE = {Entailment of Atomic Set Constraints is PSPACE-Complete},
      YEAR = {1998},
      ADDRESS = {Saarbrücken},
      TYPE = {Technical Report},
      INSTITUTION = {Universität des Saarlandes, Programming Systems Lab},
      URL = {www.ps.uni-sb.de/Papers/abstracts/atomic-lics-99.html ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/atomic:98.ps.gz},
      ABSTRACT = {The complexity of set constraints has been extensively studied over the last years and was often found quite high. At the lower end of expressiveness, there are atomic set constraints which are conjunctions of inclusions $t_1subseteq t_2$ between first-order terms without set operators. It is well-known that satisfiability of atomic set constraints can be tested in cubic time. Also, entailment of atomic set constraints has been claimed decidable in polynomial time. We refute this claim. We show that entailment between atomic set constraints can express quantified boolean formulas and is thus PSPACE hard. For infinite signatures, we also present a PSPACE-algorithm for solving atomic set constraints with negation. This proves that entailment of atomic set constraints is PSPACE-complete for infinite signatures. In case of finite signatures, the problem is even DEXPTIME-hard.},
      ANNOTE = {COLIURL : Niehren:1998:EAS.pdf Niehren:1998:EAS.ps}
}

@Article{Oepen_Flickinger:1998,
      AUTHOR = {Oepen, Stefan and Flickinger, Dan},
      TITLE = {Towards Systematic Grammar Profiling. Test Suite Technology Ten Years After},
      YEAR = {1998},
      JOURNAL = {Journal of Computer Speech and Language},
      VOLUME = {12},
      NUMBER = {4},
      PAGES = {411-436},
      ANNOTE = {COLIURL : Oepen:1998:TSG.pdf}
}

@InCollection{Oepen_et_al:1998,
      AUTHOR = {Oepen, Stefan and Netter, Klaus and Klein, Judith},
      TITLE = {TSNLP - Test Suites for Natural Language Processing},
      YEAR = {1998},
      BOOKTITLE = {Linguistic Databases},
      VOLUME = {77},
      PAGES = {13-36},
      EDITOR = {Nerbonne, John},
      SERIES = {CSLI Lecture Notes},
      ADDRESS = {Stanford},
      PUBLISHER = {CSLI Publications},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ling-db98.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ling-db98.entry},
      ANNOTE = {COLIURL : Oepen:1998:TTS.pdf Oepen:1998:TTS.ps}
}

@InCollection{Oliva_Petkevic:1998,
      AUTHOR = {Oliva, Karel and Petkevic, Vladimir},
      TITLE = {Phenomena-Based Description of Dependency-Syntax: A Survey of Ideas and Formalization},
      YEAR = {1998},
      BOOKTITLE = {Issues of Valency and Meaning - Studies in Honour of Jarmila Panevová},
      EDITOR = {Hajicová, Eva and Hladká, B.},
      ADDRESS = {Praha},
      PUBLISHER = {Charles University Press}
}

@MastersThesis{Oliver:1998,
      AUTHOR = {Oliver, Dominika},
      TITLE = {Polish Text to Speech Synthesis},
      YEAR = {1998},
      SCHOOL = {University of Edinburgh}
}

@Book{Manfred:1998,
      TITLE = {CHORUS: Semantische Verarbeitung mit beschränkter Information},
      YEAR = {1998},
      EDITOR = {Pinkal, Manfred},
      SERIES = {Technical Report},
      ADDRESS = {Saarbrücken},
      PUBLISHER = {Universität des Saarlandes}
}

@TechReport{Pinkal:1998,
      AUTHOR = {Pinkal, Manfred},
      TITLE = {Wie die Semantik arbeitet},
      YEAR = {1998},
      MONTH = {March},
      NUMBER = {103},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes}
}

@Article{Pützer_Barry:1998,
      AUTHOR = {Pützer, Manfred and Barry, William J.},
      TITLE = {Geographische und generationsbezogene Verbreitung saarländischer Dialekt-phänomene im germanophonen Lothringen (Frankreich)},
      YEAR = {1998},
      JOURNAL = {Zeitschrift für Dialektologie und Linguistik},
      VOLUME = {65},
      NUMBER = {2},
      PAGES = {152-178}
}

@InProceedings{Ramírez Bustamante_et_al:1998,
      AUTHOR = {Ramírez Bustamante, Flora and Sánchez León, Fernando and Declerck, Thierry},
      TITLE = {CON-TEXT. Un corrector grammatical de bajo nivel},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the Processamiento del Lenguaje Natural},
      VOLUME = {23},
      PAGES = {165-170},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/sepln1998_dec.ps.gz},
      ABSTRACT = {In this paper we present the results of the CON-TEXT project which was concerned with the development of a grammar checker for Spanish texts. The grammar checking procedures are here exclusively based on the use of low level processing tools, such as segmentation and morphological analysis. We describe the tools under usage and the double architecture on the top of which the checker has been implemented. (The paper is written in Spanish).},
      ANNOTE = {COLIURL : Bustamante:1998:CTC.pdf Bustamante:1998:CTC.ps}
}

@InProceedings{Ruland_et_al:1998,
      AUTHOR = {Ruland, Tobias and Rupp, Christopher J. and Spilker, Jörg and Weber, Hans and Worm, Karsten L.},
      TITLE = {Making the Most of Multiplicity: A Multi-Parser Multi-Strategy Architecture for the Robust Processing of Spoken Language},
      YEAR = {1998},
      BOOKTITLE = {Prceedings of the 5th International Conference on Spoken Language Processing (ICSLP'98), November 30 - December 4},
      EDITOR = {Mannell, Robert H. and Robert-Ribes, Jordi},
      ADDRESS = {Sydney, Australia},
      PUBLISHER = {ASSTA}
}

@TechReport{Scheepers:1998,
      AUTHOR = {Scheepers, Christoph},
      TITLE = {Menschliche Satzverarbeitung: Syntaktische und thematische Aspekte der Wortstellung im Deutschen},
      YEAR = {1998},
      NUMBER = {1/98},
      ADDRESS = {Freiburg},
      TYPE = {IIG-Berichte},
      INSTITUTION = {Institut für Informatik und Gesellschaft},
      NOTE = {edited by Müller, G., Schinzel, B., Strube, G.}
}

@PhdThesis{Scheidhauer:1998,
      AUTHOR = {Scheidhauer, Ralf},
      TITLE = {Design, Implementierung und Evaluierung einer virtuellen Maschine für Oz},
      YEAR = {1998},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes, Fachbereich Informatik},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/scheidhauer-thesis.ps.gz},
      ABSTRACT = {This thesis presents the design, implementation and evaluation of a virtual machine for the core language of Oz, which we call L. We present L for didactic reasons as an extension of a sublanguage of SML. The most important differences between L and SML are: logic variables, threads, synchronization and dynamic typing. Starting from an informal description of the dynamic semantics in terms of a graph model, we develop step by step on various levels of abstraction a virtual machine for L. We begin with a simple basic model. We then propose several optimizations of this model. Afterwards we keep refining our approach by addressing specific aspects of the implementation of the model. Finally we evaluate the effectiveness of the techniques using a set of larger real world applications. Further we show, that the implementation of the language is competitive with the fastest emulators for statically typed functional languages.},
      ANNOTE = {COLIURL : Scheidhauer:1998:DIE.pdf Scheidhauer:1998:DIE.ps}
}

@InProceedings{Schild_Würtz:1998,
      AUTHOR = {Schild, Klaus and Würtz, Jörg},
      TITLE = {Off-Line Scheduling of a Real-Time System},
      YEAR = {1998},
      BOOKTITLE = {1998 ACM Symposium on Applied Computing (SAC '98), February 27 - March 1},
      PAGES = {29-38},
      EDITOR = {George, K. M.},
      ADDRESS = {Marriott Marquis, Atlanta, Georgia, USA},
      PUBLISHER = {ACM Press},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/sac98.ps.gz},
      ABSTRACT = {The paper shows how a recently introduced class of applications can be solved by constraint programming. This new type of application is due to the emergence of special real-time systems, enjoying increasing popularity in such diverse areas as automotive electronics and aerospace industry. These real-time systems are time triggered in the sense that their overall behavior is globally controlled by a recurring clock tick. For this off-line scheduling problem a potentially indefinite, periodic processing has to be mapped onto a single time window of a fixed length. We make this new class of applications amenable to constraint programming. We describe which traditional scheduling and real-time computing techniques led to success and which failed when confronted with a large-scale application of this type. Global constraints were used to reduce memory consumption and to speed up computation. An elaborate heuristic, borrowed from Operations Research, was employed to solve the problem. Furthermore, we show that mere serialization is sufficient to find a valid schedule. The actual implementation was done in the concurrent constraint programming language Oz.},
      ANNOTE = {COLIURL : Schild:1998:LSR.pdf Schild:1998:LSR.ps}
}

@InProceedings{Schmidt_et_al:1998,
      AUTHOR = {Schmidt, Paul and Groenendijk, M. and Phelan, P. and Schulz, H. and Rieder, Sibylle and Theofilidis, Axel and Declerck, Thierry and Bredenkamp, Andrew},
      TITLE = {Natural Language Access to Software Applications},
      YEAR = {1998},
      BOOKTITLE = {36th Annual Meeting of the Association for Computational Linguistics and the 17th International Conference on Computational Linguitics (COLING-ACL '98), August 10-14},
      VOLUME = {2},
      PAGES = {1193-1197},
      ADDRESS = {Montréal, Québec, Canada},
      PUBLISHER = {Morgan Kaufmann Publishers},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/melissa98_col.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/melissa98_col.entry},
      ANNOTE = {COLIURL : Schmidt:1998:NLA.pdf Schmidt:1998:NLA.ps}
}

@MastersThesis{Schröder:1998,
      AUTHOR = {Schröder, Marc},
      TITLE = {L'expression audiovisuelle de l'amusement - premières expériences audiovisuelles},
      YEAR = {1998},
      ADDRESS = {Grenoble},
      SCHOOL = {Université Stendhal, Sciences du Langage},
      TYPE = {Mémoire de Maîtrise},
      URL = {http://www.dfki.de/~schroed/articles/schroeder1998.pdf},
      ANNOTE = {COLIURL : Schroder:1998:LAA.pdf}
}

@InProceedings{Schröder_et_al:1998,
      AUTHOR = {Schröder, Marc and Aubergé, Véronique and Cathiard, Marie-Agnès},
      TITLE = {Can we hear Smiles?},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the 5th International Conference of Spoken Language Processing (ICSLP'98)},
      ADDRESS = {Sydney, Australia},
      URL = {http://www.dfki.de/~schroed/articles/schroederetal1998.pdf},
      ABSTRACT = {The amusement expression is both visual and audible in speech. After recording comparable spontaneous, acted, mechanical, reiterated and seduction stimuli, five perceptual experiments were held, mainly based on the hypothesis of prosodically controlled effects of amusement on speech. Results show that audio is partially independant from video, which is as performant as audio-video. Spontaneous speech(unvolontary controlled) can be identified in front of acted speech (volontary controlled). Amusement speech can be distinguished from seduction speech.},
      ANNOTE = {COLIURL : Schroder:1998:CWH.pdf}
}

@TechReport{Siegel:1998,
      AUTHOR = {Siegel, Melanie},
      TITLE = {Japanese Particles in an HPSG Grammar},
      YEAR = {1998},
      NUMBER = {220},
      ADDRESS = {Saarbrücken},
      TYPE = {Verbmobil Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {http://www.dfki.de/~siegel/report-220-98.ps.gz},
      ANNOTE = {COLIURL : Siegel:1998:JPH.pdf Siegel:1998:JPH.ps}
}

@InProceedings{Skut_Brants:1998,
      AUTHOR = {Skut, Wojciech and Brants, Thorsten},
      TITLE = {A Maximum-Entropy Partial Parser for Unrestricted Text},
      YEAR = {1998},
      BOOKTITLE = {6th Workshop on Very Large Corpora, August 15-16},
      PAGES = {143-151},
      ADDRESS = {Montreal, Canada},
      URL = {https://www.coli.uni-saarland.de/~thorsten/wvlc98/},
      ABSTRACT = {This paper describes a partial parser that assigns syntactic structures to sequences of part-of-speech tags. The program uses the maximum entropy parameter estimation method, which allows a flexible combination of different knowledge sources: the hierarchical structure, parts of speech and phrasal categories. In effect, the parser goes beyond simple bracketing and recognises even fairly complex structures. We give accuracy figures for different applications of the parser.},
      ANNOTE = {COLIURL : Skut:1998:MEP.pdf}
}

@InProceedings{Skut_Brants:1998_1,
      AUTHOR = {Skut, Wojciech and Brants, Thorsten},
      TITLE = {Chunk Tagger - Statistical Recognition of Noun Phrases},
      YEAR = {1998},
      BOOKTITLE = {ESSLLI Workshop on Automated Acquisition of Syntax and Parsing, August 17-28},
      ADDRESS = {Saarbrücken, Germany},
      URL = {https://www.coli.uni-saarland.de/~thorsten/esslli98-parsing/},
      ABSTRACT = {We describe a stochastic approach to partial parsing, i.e., the recognition of syntactic structures of limited depth. The technique utilises Markov Models, but goes beyond usual bracketing approaches, since it is capable of recognising not only the boundaries, but also the internal structure and syntactic category of simple as well as complex NP's, PP's, AP's and adverbials. We compare tagging accuracy for different applications and encoding schemes.},
      ANNOTE = {COLIURL : Skut:1998:CTS.pdf}
}

@InProceedings{Skut_et_al:1998,
      AUTHOR = {Skut, Wojciech and Brants, Thorsten and Krenn, Brigitte and Uszkoreit, Hans},
      TITLE = {A Linguistically Interpreted Corpus of German Newspaper Text},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the 10th European Summer School in Logic, Language and Information (ESSLLI'98). Workshop on Recent Advances in Corpus Annotation, August 17-28},
      EDITOR = {Krenn, Brigitte and Brants, Thorsten and Skut, Wojciech and Uszkoreit, Hans},
      ADDRESS = {Saarbrücken, Germany},
      URL = {https://www.coli.uni-saarland.de/~thorsten/publications/Skut-ea-ESSLLI-Corpus98.pdf https://www.coli.uni-saarland.de/~thorsten/publications/Skut-ea-ESSLLI-Corpus98.ps.gz http://www.dfki.de/dfkibib/publications/docs/Krenn_1998_RACA},
      ABSTRACT = {In this paper, we report on the development of an annotation scheme an annotation tools for unrestricted German text. Our representation format is based on argument structure, but also permits the extraction of other kinds of representations. We discuss several methodological issues and the analysis of some phenomena. Additional focus is on the tools developed in our project and their applications.},
      ANNOTE = {COLIURL : Skut:1998:LIC.pdf Skut:1998:LIC.ps}
}

@InCollection{Smolka:1998,
      AUTHOR = {Smolka, Gert},
      TITLE = {Concurrent Constraint Programming Based on Functional Programming},
      YEAR = {1998},
      BOOKTITLE = {Programming Languages and Systems},
      VOLUME = {1381},
      PAGES = {1-11},
      EDITOR = {Hankin, Chris},
      SERIES = {Lecture Notes in Computer Science},
      ADDRESS = {Lisbon},
      PUBLISHER = {Springer},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Smolka-Oz-SML-98.ps.gz},
      ABSTRACT = {We show how the operational features of logic programming can be added as conservative extensions to a functional base language with call by value semantics. We will address both concurrent and constraint logic programming. As base language we will use a dynamically typed language that is obtained from SML by eliminating type declarations and static type checking. Our approach can be extended to cover all features of Oz. The experience with the development of Oz tells us that the outlined approach is the right base for the practical development of concurrent constraint programming languages. It avoids unnecessary duplication of concepts by reusing functional programming as core technology. Of course, it does not unify the partly incompatible theories behind functional and logic programming. They both contribute at a higher level of abstraction to the understanding of different aspects of the class of programming languages proposed here.},
      ANNOTE = {COLIURL : Smolka:1998:CCP.pdf Smolka:1998:CCP.ps}
}

@Article{ter Stal_et_al:1998,
      AUTHOR = {ter Stal, W. G. and Beijert, J.-H. and de Bruin, G. and van Gent, J. and de Jong, Franciska and Kraaij, W. and Netter, Klaus and Smart, G.},
      TITLE = {Twenty-One: Cross-Language Disclosure and Retrieval of Multimedia Documents on Sustainable Development},
      YEAR = {1998},
      JOURNAL = {Computer Networks and ISDN Systems},
      VOLUME = {30},
      NUMBER = {13},
      PAGES = {1237-1248},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/twentyone97.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/twentyone97.entry},
      ANNOTE = {COLIURL : Stal:1998:TOC.pdf Stal:1998:TOC.ps}
}

@InProceedings{Trouvain_et_al:1998,
      AUTHOR = {Trouvain, Jürgen and Barry, William J. and Nielsen, Claus and Andersen, Ove},
      TITLE = {Implications of Energy Declinations for Speech Synthesis},
      YEAR = {1998},
      BOOKTITLE = {3rd ESCA/ COCOSDA Workshop on Speech Synthesis, November},
      PAGES = {47-52},
      ADDRESS = {Jenolan Caves, Australia},
      ABSTRACT = {This paper examines whether observed phenomena in energy declination can be used to improve the naturalness of synthetic speech. In two production experiments different aspects of intensity fall-off within utterances are analysed including degree of stress, phrase length, phrase boundaries. Energy manipulation was carried out using diphone synthesis as a basis for generating stimuli for perception tests in English and Danish. The results of the listening experiments, in which different versions of a paragraph were ranked for naturalness indicate that amplitude differences can contribute to greater naturalness. However, it is apparent that fine-tuning of amplitude requires good quality synthesis at the more basic prosodic levels.},
      ANNOTE = {COLIURL : Trouvain:1998:IED.pdf Trouvain:1998:IED.ps}
}

@InProceedings{Uszkoreit:1998,
      AUTHOR = {Uszkoreit, Hans},
      TITLE = {Cross-Lingual Information Retrieval: From Naive Concepts to Realistic Applications},
      YEAR = {1998},
      BOOKTITLE = {14th Twente Workshop on Language Technology (TWLT 14). Language Technology in Multimedia Information Retrieval, December 7-8},
      PAGES = {1-7},
      ADDRESS = {University of Twente, Enschede, The Netherlands}
}

@InProceedings{Uszkoreit:1998_1,
      AUTHOR = {Uszkoreit, Hans},
      TITLE = {Cross-Language Information Retrieval: From Naive Concepts to Realistic Applications},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the 14th Twente Workshop on Language Technology (TWLT 14). Language Technology in Multimedia Information Retrieval, December 7-8},
      PAGES = {1-7},
      ADDRESS = {University of Twente, Enschede, The Netherlands},
      ABSTRACT = {In this paper I combine an overview of the goals and major approaches in cross-language information retrieval with some observations of current trends and with a report on a CLIR project that differs in many respects from most research activities in the fast growing area. In the overview, I will start from a generic model of an information retrieval system. Then the necessary extensions will be introduced that are needed for allowing queries in a language different from the document language. Several options for adding translation technology will be contrasted. I will then report on the research strategy followed in the EU-funded international project Mulinex. In this project a complete modular CLIR system was developed and integrated as the core software for a number of applications and as a plattform for research and technology development.}
}

@Article{Uszkoreit_et_al:1998,
      AUTHOR = {Uszkoreit, Hans and Brants, Thorsten and Duchier, Denys and Krenn, Brigitte and Konieczny, Lars and Oepen, Stefan and Skut, Wojciech},
      TITLE = {Studien zur performanzorientierten Linguistik: Aspekte der Relativsatzextraposition im Deutschen},
      YEAR = {1998},
      JOURNAL = {Kognitionswissenschaft},
      VOLUME = {7},
      NUMBER = {3},
      PAGES = {129-133},
      ABSTRACT = {Am Beispiel der Relativsatzextraposition im Deutschen zeigt das Papier wie Verfahren der sprachwissenschaftlichen Modellbildung, korpuslinguistischen Untersuchung und des psycholinguistischen Experiments in einem integrativen Forschungsansatz zusammenwirken, der auf ein verbessertes Verständnis und die linguistisch wie kognitiv adäquate Modellierung sprachlicher Performanzprobleme zielt. Ausgehend von der von Hawkins (1994) formulierten Theorie zur Wortstellung werden Hypothesen über die positionelle Verteilung von Relativsätzen formuliert und in Bezug auf Korpusdaten und Akzeptabilitätsmessungen überprüft. Alle beschriebenen empirischen Untersuchungen bestätigen den erwarteten Einfluss von Längenfaktoren auf die Relativsatzdistribution, zeigen gleichzeitig aber eine interessante Asymmetrie zwischen Produktions- und Rezeptionsdaten.}
}

@TechReport{Uszkoreit_et_al:1998_1,
      AUTHOR = {Uszkoreit, Hans and Brants, Thorsten and Duchier, Denys and Krenn, Brigitte and Konieczny, Lars and Oepen, Stephan and Skut, Wojciech},
      TITLE = {Studien zur performanzorientierten Linguistik. Aspekte der Relativsatzextraposition im Deutschen},
      YEAR = {1998},
      MONTH = {April},
      NUMBER = {99},
      ADDRESS = {Saarbrücken.},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {https://www.coli.uni-saarland.de/~thorsten/publications/Uszkoreit-ea-CLAUS99.pdf ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus99.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus99.dvi},
      ABSTRACT = {Am Beispiel der Relativsatzextraposition im Deutschen zeigt das Papier wie Verfahren der sprachwissenschaftlichen Modellbildung, korpuslinguistischen Untersuchung und des psycholinguistischen Experiments in einem integrativen Forschungsansatz zusammenwirken, der auf ein verbessertes Verständnis und die linguistisch wie kognitiv adäquate Modellierung sprachlicher Performanzprobleme zielt. Ausgehend von der von Hawkins (1994) formulierten Theorie zur Wortstellung werden Hypothesen über die positionelle Verteilung von Relativsätzen formuliert und in Bezug auf Korpusdaten und Akzeptabilitätsmessungen überprüft. Alle beschriebenen empirischen Untersuchungen bestätigen den erwarteten Einfluß von Längenfaktoren auf die Relativsatzdistribution, zeigen gleichzeitig aber eine interessante Asymmetrie zwischen Produktions- und Rezeptionsdaten. Ein gekürzte Fassung erscheint in Kognitionswissenschaft, Themenheft SFB 378, 1998.},
      ANNOTE = {COLIURL : Uszkoreit:1998:SPLb.pdf Uszkoreit:1998:SPLb.ps}
}

@InProceedings{Vasishth:1998,
      AUTHOR = {Vasishth, Shravan},
      TITLE = {Monotonicity Constraints on Negative Polarity in Hindi},
      YEAR = {1998},
      BOOKTITLE = {Working Papers in Linguistics},
      VOLUME = {51},
      PAGES = {201-220},
      EDITOR = {Bradshaw, Mary and Odden, David and Wyckoff, Derek},
      PUBLISHER = {Ohio State University},
      URL = {ftp://ftp.ling.ohio-state.edu/pub/Students/Vasishth/Published/OSUWPLVol51-1998/osuwpl51.ps},
      ANNOTE = {COLIURL : Vasishth:1998:MCN.pdf Vasishth:1998:MCN.ps}
}

@InProceedings{Vasishth:1998_1,
      AUTHOR = {Vasishth, Shravan},
      TITLE = {Word Order, Negation, and Negative Polarity in Hindi},
      YEAR = {1998},
      BOOKTITLE = {Working Papers in Linguistics},
      VOLUME = {53},
      PAGES = {108-131},
      EDITOR = {Miller-Ockhuizen, Amanda and Levine, Robert and Gonsalves, Anthony J.},
      PUBLISHER = {Ohio State University},
      URL = {ftp://ftp.ling.ohio-state.edu/pub/Students/Vasishth/Published/OSUWPLVol53-2000/osuwpl53.ps},
      ANNOTE = {COLIURL : Vasishth:1998:WON.pdf Vasishth:1998:WON.ps}
}

@InProceedings{Worm_Rupp:1998,
      AUTHOR = {Worm, Karsten L. and Rupp, Christopher J.},
      TITLE = {Towards Robust Understanding of Speech by Combination of Partial Analyses},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the 13th biennial European Conference on Artificial Intelligence (ECAI'98), August 23-28},
      PAGES = {190-194},
      ADDRESS = {Brighton, UK}
}

@PhdThesis{Würtz:1998,
      AUTHOR = {Würtz, Jörg},
      TITLE = {Lösen kombinatorischer Probleme mit Constraintprogrammierung in Oz},
      YEAR = {1998},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes, FB Informatik},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/WuertzDiss-98.ps.gz},
      ABSTRACT = {In dieser Dissertation beschäftigen wir uns mit der Lösung kombinatorischer Probleme durch Constraintprogrammierung. Wir zeigen, dass verschiedene kombinatorische Probleme in der nebenläufigen Constraintsprache Oz effizient gelöst werden können. Wir führen ein formales Modell von constraintbasiertem Lösen kombinatorischer Probleme ein, das unabhängig von einer konkreten Programmiersprache ist, und wir zeigen, wie einige der derzeit besten Schedulingtechniken (Techniken für Ablaufplanung) aus dem Operations Research für Constraintpropagierung und Distribuierung in dieses Modell integriert werden können. Wir zeigen, wie dieses Modell in die nebenläufige Constraintsprache Oz eingebettet werden kann und belegen mit einer Reihe von Fallstudien für große und schwierige Probleme aus dem Gebiet des Scheduling die Leistungsfähigkeit des entwickelten Systems.},
      ANNOTE = {COLIURL : Wurtz:1998:LKP.ps}
}

@MastersThesis{Xu:1998,
      AUTHOR = {Xu, Feiyu},
      TITLE = {Underspecified Representation and Resolution of Ellipsis},
      YEAR = {1998},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes, Department of Computational Linguistics},
      URL = {https://www.coli.uni-saarland.de/~feiyu/thesis.ps.gz},
      ABSTRACT = {This thesis deals with the underspecified semantic representation and resolution of ellipsis. We focus on the interaction of Verb Phrase Ellipsis (henceforth VPE) and anaphora. In particular, we address the distribution of strict and sloppy readings in these phenomena and present an analysis to explain it. This analysis is integrated into a framework that concerns a uniform treatment of semantically underspecified information and parallelism phenomena in discourse. The analysis put forward in this thesis gives correct predictions about the strict and sloppy readings of a series of problematic cases in the literature. It does not suffer from undergeneration or overgeneration problems. We use linking relations between anaphoric pronouns and their antecedents and claim that the interaction between linking relations and the parallelism requirement in VPE results in strict and sloppy readings. The basic idea underlying the analysis presented in this thesis agrees with the proposal made by (Kehler 93; Kehler 95). Although recently a lot of approaches to semantic underspecification as well as ellipsis resolution have emerged in computational linguistics, few of them are designed to treat both problems uniformly. The framework proposed in this thesis shows how to integrate the treatment of ellipsis resolution with semantic underspecification in a uniform and elegant way.},
      ANNOTE = {COLIURL : Xu:1998:URR.pdf Xu:1998:URR.ps}
}

@InProceedings{Xu:1998_1,
      AUTHOR = {Xu, Feiyu},
      TITLE = {Underspecified Treatment of Verb Phrase Ellipsis},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the ESSLLI '98 Student Session, August 17-28},
      ADDRESS = {Saarbrücken, Germany},
      URL = {http://www.dfki.uni-sb.de/~feiyu/esslli.pdf ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ESSLLI-feiyu-98.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ESSLLI-feiyu-98.entry},
      ABSTRACT = {This paper deals with the underspecified semantic representation of ellipsis and its resolution. We present an analysis to explain the distribution of stict and sloppy readings in the interaction of verb phrase ellipsis and anaphora. The analysis is integrated into a framwork that enables a unified and underspecified treatment of scope, anaphora, and VPE.},
      ANNOTE = {COLIURL : Xu:1998:UTV.pdf Xu:1998:UTV.ps}
}

@InCollection{Zaenen_Uszkoreit:1998,
      AUTHOR = {Zaenen, Annie and Uszkoreit, Hans},
      TITLE = {Overview},
      YEAR = {1998},
      BOOKTITLE = {Survey of the State of the Art in Human Language Technology},
      PAGES = {95},
      EDITOR = {Varile, Giovanni and Zampolli, Antonio},
      SERIES = {Studies in Natural Language Processing},
      ADDRESS = {Cambridge},
      PUBLISHER = {Cambridge University Press},
      ANNOTE = {COLIURL : Zaenen:1998:O.pdf}
}

@InProceedings{Weber:1998,
      AUTHOR = {Weber, Andrea},
      TITLE = {Listening to non-native language which violates native assimilation rules.},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the European Scientific Communication Association workshop: Sound patterns of Spontaneous Speech},
      PAGES = {101-104},
      EDITOR = {Duez, D.},
      ADDRESS = {Aix-en-Provence, France: La Baume-les -Aix}
}