% % GENERATED FROM https://www.coli.uni-saarland.de % by : anonymous % IP : coli2006.lst.uni-saarland.de % at : Mon, 05 Feb 2024 15:41:31 +0100 GMT % % Selection : Entry type = TechReport % @TechReport{Alexandersson_et_al:1997, AUTHOR = {Alexandersson, Jan and Becker, Tilman and Finkler, Wolfgang and Kasper, Walter and Kilger, Anne and Karger, Reinhard and Krieger, Hans-Ulrich and Maier, Elisabeth and Reithinger, Norbert and Siegel, Melanie and Uszkoreit, Hans and Wahlster, Wolfgang}, TITLE = {Abschlussbericht Verbmobil TP 6, 7, 8, 9, 10, 11, 15; TP 9 - Spontansprachliche inkrementelle Generierung; TP 10 - Übersetzungsorientierte Dialogverarbeitung; TP 6, 7, 8, 11, 15 - Syntax, Semantik, Architektur}, YEAR = {1997}, NUMBER = {R:S 97-226}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report}, INSTITUTION = {German Research Center for Artificial Intelligence (DFKI)}, URL = {ftp://ftp.dfki.uni-kl.de/pub/Publications/FinalReports/1997/vm6-15.ps.gz}, ABSTRACT = {In this document we present the results of the Verbmobil activities at the DFKI related with generation (sub-project 9), dialogue (sub-project 10), linguistic analysis and innovative architectures (sub-projects 6-15). The projects contributed successfully to the implemented Forschungsprototyp 1.0 and the INTARC-prototype of an incremental architecture, delivering robust, efficient and flexible software modules. The implementations are based on theoretical results gained during the first phase of Verbmobil. The theoretical and practical results were reported in numerous publications and talks at major international conferences.}, ANNOTE = {COLIURL : Alexandersson:1997:AVT.pdf Alexandersson:1997:AVT.ps} } @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} } @TechReport{Alshawi_et_al:1991_1, AUTHOR = {Alshawi, Hiyan and Brown, Charles G. and Carter, David M. and Gambäck, Björn and Pulman, Stephen G. and Rayner, Manny}, TITLE = {Bilingual Conversation Interpreter: A Prototype Message Translator}, YEAR = {1991}, NUMBER = {R91011 and CRC-018}, ADDRESS = {Stockholm, Sweden and Cambridge, England}, TYPE = {Final report. Joint Research Report}, INSTITUTION = {SICS and SRI}, URL = {www.sics.se/humle/papers/R91011.ps}, ABSTRACT = {This document is the final report for a research project aimed at producing a prototype system for on-line translation of typed dialogues between speakers of different natural languages. The work was carried out jointly by SICS and SRI Cambridge. The resulting prototype system (called Bilingual Conversation Interpreter, or BCI) translates between English and Swedish in both directions. The major components of the BCI are two copies of the SRI Core Language Engine, equipped with English and Swedish grammars respectively. These are linked by the transfer and disambiguation components. Translation takes place by analyzing the source-language sentence into Quasi Logical Form (QLF), a linguistically motivated logical representation, transferring this into a target-language QLF, and generating a targetlanguage sentence. When ambiguities occur that cannot be resolved automatically, they are clarified by querying the appropriate user. The clarification dialogue presupposes no knowledge of either linguistics or the other language. The prototype system has a broad grammatical coverage, a initial vocabulary of about 1000 words together with vocabulary expansion tools, and a set of English-Swedish transfer rules. The formalisms developed for coding this linguistic information make it relatively easy to extend the system. We believe that the project was successful in demonstrating the feasibility of using these techniques for interactive translation applications, and provides a sound basis for development of a large scale message translator system with potential for commercial exploitation.}, ANNOTE = {COLIURL : Alshawi:1991:BCI.pdf} } @TechReport{Alshawi_et_al:1991_2, AUTHOR = {Alshawi, Hiyan and Carter, David M. and Gambäck, Björn and Pulman, Stephen G. and Rayner, Manny}, TITLE = {Transfer through Quasi Logical Form: A New Approach to Machine Translation}, YEAR = {1991}, NUMBER = {T91020}, ADDRESS = {Stockholm, Sweden}, TYPE = {Technical Report}, INSTITUTION = {SICS}, URL = {www.sics.se/humle/papers/T91020.ps}, ABSTRACT = {This document is an introduction to a research project aimed at produc- ing a prototype system for on-line translation of typed dialogues between speakers of different natural languages. The work was carried out jointly by SICS and SRI Cambridge. The resulting prototype system (called Bilingual Conversation Interpreter, or BCI) translates between English and Swedish in both directions.}, ANNOTE = {COLIURL : Alshawi:1991:TTQ.pdf Alshawi:1991:TTQ.ps} } @TechReport{Alshawi_et_al:1991_3, AUTHOR = {Alshawi, Hiyan and Carter, David M. and Gambäck, Björn and Rayner, Manny}, TITLE = {Translation by Quasi Logical Form Transfer}, YEAR = {1991}, NUMBER = {CRC-021}, ADDRESS = {Cambridge, England}, TYPE = {SRI International Technical Report}, URL = {http://acl.ldc.upenn.edu/P/P91/P91-1021.pdf}, ABSTRACT = {The paper describes work on applying a general purpose natural language processing system to transfer-based interactive translation. Transfer takes place at the level of Quasi Logical Form (QLF), a contextually sensitive logical form representation which is deep enough for dealing with cross-linguistic differences. Theoretical arguments and experimental results are presented to support the claim that this framework has good properties in terms of modularity, compositionality, reversibility and monotonicity. QLFs were selected as the appropriate level for transfer because they are far enough removed from surface linguistic form to provide the flexibility required by cross-linguistic differences. On the other hand, the linguistic, unification-based processing involved in creating them can be carried out efficiently and without the need to reason about the domain or context; the QLF language has constructs for explicit representation of contextually sensitive aspects of interpretation.}, ANNOTE = {COLIURL : Alshawi:1991:TQLa.pdf} } @TechReport{Areces_et_al:1999, AUTHOR = {Areces, Carlos and Blackburn, Patrick and Marx, Maarten}, TITLE = {Hybrid Logics: Characterization, Interpolation and Complexity}, YEAR = {1999}, MONTH = {February}, NUMBER = {108}, PAGES = {35}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus108.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus108.dvi}, ABSTRACT = {Hybrid languages are extended modal languages which can refer to (or even quantify over) worlds. The use of strong hybrid languages dates back to at least 1967 (in the work of Arthur Prior), but recent work has focussed on more constrained systems. The purpose of the present paper is to examine one such system in detail. We begin by studying its expressivity, and provide both model theoretic characterizations (via a restricted notion of Ehrenfeucht-Fraisse game, and an enriched notion of bisimulation) and a syntactic characterization (in terms of bounded formulas). The key result to emerge is that the system corresponds precisely to the first-order fragment which is invariant for generated submodels. We further establish that it has (strong) interpolation, and provide failure results in the finite variable fragments. We also show that weak interpolation holds for an important sublanguage and provide complexity results for this sublanguage and other fragments and variants (the full logic being undecidable).}, ANNOTE = {COLIURL : Areces:1999:HLC.pdf Areces:1999:HLC.ps Areces:1999:HLC.dvi} } @TechReport{Avgustinova:1993_1, AUTHOR = {Avgustinova, Tania}, TITLE = {On Bulgarian Verb Clitics}, YEAR = {1993}, MONTH = {August}, NUMBER = {33}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Avgustinova:1994_1, AUTHOR = {Avgustinova, Tania}, TITLE = {Morphosyntactic Phrase - Evidence from Bulgarian}, YEAR = {1994}, ADDRESS = {Saarbrücken}, TYPE = {Internal Report, Projekt LATESLAV}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Avgustinova:1996, AUTHOR = {Avgustinova, Tania}, TITLE = {An HPSG-Style Grammar of Bulgarian (for the Purposes of a Grammar-Checker Implementation)}, YEAR = {1996}, ADDRESS = {Saarbrücken}, TYPE = {Final Deliverable Report, Project LATESLAV}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Avgustinova:1996_1, AUTHOR = {Avgustinova, Tania}, TITLE = {Relative Clause Constructions in Bulgarian HPSG}, YEAR = {1996}, MONTH = {January}, NUMBER = {71}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {An analysis of Bulgarian relative clause constructions is proposed, taking into consideration the standard HPSG theory of unbounded dependency constructions as well as the related recent research aiming at avoiding phonologically empty categories in the language description.} } @TechReport{Avgustinova:1996_2, AUTHOR = {Avgustinova, Tania}, TITLE = {Between Lexicon and Syntax Proper}, YEAR = {1996}, MONTH = {September}, NUMBER = {80}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {Bulgarian exhibits the free word order properties that are typical for all Slavic languages although it has a very impoverished system of nominal inflection. The fairly rich verbal conjugation system with complex analytic verb forms, and the well-developed mechanism of clitic replication (also referred to in the literature as pronominal reprise, clitic doubling, etc.) are specific properties of this language. This paper concentrates on structural distinguishing of two word order domains in the Bulgarian clause - the morphosyntactic one of the verb complex and the syntactic one of the verb and its modifiers within the clause. Special attention is paid to the morphosyntactic dimension.} } @TechReport{Avgustinova:1997_3, AUTHOR = {Avgustinova, Tania}, TITLE = {Determinedness Constraints on Clitic Replication}, YEAR = {1997}, MONTH = {March}, NUMBER = {87}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {The proposed typology of Bulgarian articled and non-articled noun phrases provides criteria for determining which nominal material can be replicated by a clitic pronoun under the appropriate verb-lexeme specific, syntactic and communicative conditions. The main claim is that only nominal material used as identifying specific description of a given object is replicable in Bulgarian. Non-articled noun phrases that are categorising or non-specific descriptions as well as articled noun phrases that are generic or non-specific descriptions completely lack replication potential.} } @TechReport{Avgustinova:1999_1, AUTHOR = {Avgustinova, Tania}, TITLE = {Shared Grammatical Resources for Slavic Languages (Selected Topics in Multilingual Grammar Design)}, YEAR = {1999}, ADDRESS = {Saarbrücken}, TYPE = {DFG-Abschlußbericht}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Avgustinova_et_al:1999, AUTHOR = {Avgustinova, Tania and Gardent, Claire and Oliva, Karel}, TITLE = {Binding of Reciprocals with Particular Respect to Czech}, YEAR = {1999}, MONTH = {February}, NUMBER = {109}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus109.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus109.dvi}, ABSTRACT = {Drawing on data from Czech and English, we first argue against a uniform syntactic treatment of reciprocals and reflexives. We then define a binding theory for Czech which differs from HPSG binding theory in two main points. First, it is based on an ordering (the D-ordering) which is more general than HPSG's obliqueness ordering -- this permits a natural treatment of adjuncts. Second, it distinguishes between reflexives and reciprocals and submits them to different binding constraints. Finally, we provide a semantics for reciprocals with summated antecedents.}, ANNOTE = {COLIURL : Avgustinova:1999:BRP.pdf Avgustinova:1999:BRP.ps Avgustinova:1999:BRP.dvi} } @TechReport{Avgustinova_Oliva:1991, AUTHOR = {Avgustinova, Tania and Oliva, Karel}, TITLE = {The Structure of Bulgarian Verb Complex}, YEAR = {1991}, MONTH = {February}, NUMBER = {4}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {In this article we wish to concentrate on a non-transformational description of the structure of complex verb forms in Modern Bulgarian, Slavonic language performing some Balkanic features in its morphology and syntax, which makes it differ considerably from other languages of the Slavonic group. Almost no such attempts have been made before, although some of the syntactic problems that arise have been mentioned and treated from different viewpoints in studies concerned with complex tenses, with voice and mood, with the status of pronouns, of negative and interrogative particles etc. The partially free word order of Bulgarian has been mentioned in very few works based on the transformational approach. For the sake of description of the Bulgarian verb complex, we felt we had to refrain from some of the standards of the linguistic background of many current non-transformational (as well as other) approaches. The changes we introduced concern the constituent structures used and they consist inriching the established approach with ideas stemming from the works of the Prague Linguistic School, namely with the notion of communicative dynamism. The shape of the structures is briefly sketched in the first part of the work, while the linguistic facts and their description are the main content of its second part; in the closing paragraphs, some phenomena are mentioned which were not examined in detail in the central sections of the work and their incorporation into the description as presented before is considered.} } @TechReport{Avgustinova_Oliva:1995_1, AUTHOR = {Avgustinova, Tania and Oliva, Karel}, TITLE = {The Position of Sentential Clitics in the Czech Clause}, YEAR = {1995}, MONTH = {December}, NUMBER = {68}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {Our main goal is to propose a unified analysis of the second position and Wackernagel phenomena, which would adequately accommodate also certain non-trivial data that seem to be problematic for the currently available approaches: 1. Correct sentences with multiple syntactic constituents preceding the sentential clitics in Czech, and respectively, multiple syntactic constituency in the German Vorfeld: a. Czech clitics (respectively, the tensed verb in German main clauses) preceded by two or more adverbials describing together a spatial or temporal interval; b. Czech clitics (respectively, the tensed verb in German main clauses) preceded by two or more adverbials of the same type, which can be viewed as a repetition of the respective modification; c. Czech clitics (respectively, the tensed verb in German main clauses) preceded by a combination of a temporal and a local adverbial; d. Czech clitics (respectively, the tensed verb in German main clauses) preceded by more than one contrasted syntactic constituents 2. Sentences with a single constituent preceding the sentential clitics (respectively, single constituent in the Vorfeld) but judged to be highly unacceptable . We reconsider the Prague School treatment of the communicative structure of the sentence, and assume that, for each particular utterance, it can be determined which of the contained elements are informationally essential (significant) - i.e. informationally indispensable from a communicative perspective - and which of them are informationally unessential (insignificant) - i.e. without actual communicative contribution - and occur in the utterance for other, e.g., structural, pleonastic etc., reasons only. On such a basis we (re)introduce the notion of communicative importance. We further assume that not all elements of an utterance can be assigned a degree of communicative dynamism - i.e. that there are items for which the feature communicative importance is inappropriate. Another assumption is that in an utterance there might exist two or more syntactically distinguishable constituents which are of equal communicative importance. After these modifications, we introduce a structuring of an utterance into communicative units which we tentatively call communicative segments. A substantial communicative segment is defined as a contiguous sequence of adjacent syntactic units (i.e. words or phrases) of equal communicative importance, while an auxiliary communicative segment is a contiguous sequence of informationally insignificant items for which communicative importance is inappropriate as a feature. From such a perspective the Wackernagel's clitic cluster in Czech is regarded as an instance of an auxiliary communicative segment. We further define the second / Wackernagel position as the position delimiting the first (leftmost) substantial communicative segment in an utterance, and thus propose an alternative treatment also of the German Vorfeld. Inasmuch as there are language-specific constraints on what can form a substantial communicative segment, our analysis allows for a natural explanation also of, e.g., the constituent-second / word-second position of Serbo-Croatian clitics.} } @TechReport{Avgustinova_Oliva:1996_1, AUTHOR = {Avgustinova, Tania and Oliva, Karel}, TITLE = {Unbounded Dependencies in HPSG Without Traces or Lexical Rules}, YEAR = {1996}, MONTH = {January}, NUMBER = {70}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {In the course of work on large-coverage HPSG grammars destinated for application in commercial grammar checkers for Bulgarian and Czech, two languages typologically different from English with respect to the word order freedom, we have developed and practically tested an alternative, efficient-implementation oriented treatment of unbounded dependencies dispensing both with gaps and with lexical rules. In this paper we shall explain the theoretical basis of the approach as well as try to prove that it is not only practically, but also theoretically superior to the current standard treatment.} } @TechReport{Backofen:1993_2, AUTHOR = {Backofen, Rolf}, TITLE = {Regular Path Expressions in Feature Logic}, YEAR = {1993}, NUMBER = {RR-93-17}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RegularPathExprJSC94.ps.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RegularPathExprJSC94.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RegularPathExprJSC94.dvi.Z}, ANNOTE = {COLIURL : Backofen:1993:RPEb.pdf Backofen:1993:RPEb.ps Backofen:1993:RPEb.dvi} } @TechReport{Backofen_et_al:1994, AUTHOR = {Backofen, Rolf and Busemann, Stephan and Diagne, Abdel Kader and Hinkelman, Elizabeth and Kasper, Walter and Kiefer, Bernd and Krieger, Hans-Ulrich and Netter, Klaus and Neumann, Günter and Oepen, Stephan and Spackman, Stephen P. and Uszkoreit, Hans}, TITLE = {Abschlussbericht: DISCO - Dialogsystem für autonome kooperierende Agenten}, YEAR = {1994}, NUMBER = {R:S95-060}, ADDRESS = {Saarbrücken}, TYPE = {Report}, INSTITUTION = {DFKI}, URL = {http://www.dfki.de/dfkibib/publications/docs/Backofen_1994_DDFAKA.pdf}, ABSTRACT = {In der Entwicklung der Informationstechnologie wird die natürliche Sprache zu einem unentbehrlichen Medium für die Kommunikation zwischen Menschen und ihren autonomen maschinellen Partnern (Agenten). Im Projekt DISCO wurde ein Dialogsystem entwickelt, das maschinelle Dialogpartner in die Lage versetzt, mit ihren menschlichen Partnern in natürlicher Sprache zu kommunizieren. Während existierende Dialogsysteme zur Kommunikation zwischen der Maschine und einem einzigen menschlichen Benutzer gedacht sind, nimmt das DISCO-System an Dialogen zwischen mehr als zwei Teilnehmern teil. Die autonomen kooperierenden Agenten, für die das DISCO-System geschaffen wurde, sind KISoftwaresysteme auf vernetzten Computern. DlSCO führte Forschung sowohl in Computerlinguistik als auch in anderen Gebieten der KI durch. Frühere Arbeiten an natürlichsprachlichen Dialogsystemen konzentrierten sich entweder auf moderne Methoden für die linguistische Spezifikation und die Sprachverarbeitung oder auf fortgeschrittene Dialogverarbeitung. Im Unterschied dazu konnte DISCO erfolgreich Resultate aus beiden Gebieten integrieren. Als Ergebnis erhielt das DFKI ein auf modernsten Technologien aufbauendes, umfangreiches, flexibles, erweiterbares natürlichsprachliches Kernsystem, das für eine Vielzahl von Anwendungsentwicklungen eingesetzt werden kann und bereits in mehreren anderen Projekten eingesetzt wird.}, ANNOTE = {COLIURL : Backofen:1994:ADD.pdf} } @TechReport{Backofen_et_al:1991_1, AUTHOR = {Backofen, Rolf and Euler, Lutz and Görz, Günther}, TITLE = {Towards the Integration of Functions, Relations and Types in an AI Programming Language}, YEAR = {1991}, NUMBER = {RR-91-032}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI} } @TechReport{Backofen_Krieger:1993, AUTHOR = {Backofen, Rolf and Krieger, Hans-Ulrich}, TITLE = {The TDL/ UDiNe System}, YEAR = {1993}, NUMBER = {D-93-27}, PAGES = {67-74}, ADDRESS = {Saarbrücken}, TYPE = {DFKI Document}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/tdl-udine.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/tdl-udine.entry}, ABSTRACT = {TDL is a typed feature-based language specifically designed to support highly lexicalized grammar theories like HPSG, FUG, or CUG. TDL offers the possibility to define (possibly recursive) types, consisting of type constraints and feature constraints over the standard connectives AND, OR, and NOT, where the types are arranged in a subsumption hierarchy. TDL distinguishes between AVM types (open-world reasoning) and SORT types (closed-world reasoning) and allows the declaration of partitions and incompatible types. Working with partially as well as with fully expanded types is possible, both at definition and at run time. TDL is incremental, i.e., it allows the redefinition of types and the use of undefined types.}, ANNOTE = {COLIURL : Backofen:1993:TUS.pdf Backofen:1993:TUS.ps} } @TechReport{Backofen_et_al:1993, AUTHOR = {Backofen, Rolf and Krieger, Hans-Ulrich and Spackman, Stephen P. and Uszkoreit, Hans}, TITLE = {Report of the EAGLES Workshop on Implemented Formalisms at DFKI}, YEAR = {1993}, NUMBER = {D-93-27}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report}, INSTITUTION = {DFKI}, URL = {http://www.tcs.informatik.uni-muenchen.de/ftp/backofen/publ/EAGLES-WS-Implemented93.ps.gz}, ABSTRACT = {From the 1st through the 3rd of March 1993, the Working Group on Linguistic Formalisms of the EAGLES initiative held a workshop in Saarbrücken on implemented grammar formalisms. Starting with some notes on the Working Group, we will describe objectives, organization, and results of the workshop. We also summarize some relevant general findings as they emerged from the final discussion. The system demonstrated are described in a detailed synopsis. In order to facilitate comparison, a standardized questionnaire was used for the individual descriptions. The questionnaires were filled out by the developers. Since there might always be relevant pieces of information that do not fit well in such a questionnaire, the developers could also provide a short prose description. Most developers took advantage of this opportunity and attached a brief summary of their system.}, ANNOTE = {COLIURL : Backofen:1993:REW.pdf Backofen:1993:REW.ps} } @TechReport{Backofen_et_al:1993_1, AUTHOR = {Backofen, Rolf and Krieger, Hans-Ulrich and Spackmann, Stephen and Uszkoreit, Hans}, TITLE = {EAGLES Workshop on Implemented Formalisms at DFKI}, YEAR = {1993}, NUMBER = {D-93-27}, ADDRESS = {Saarbrücken}, TYPE = {DFKI Document}, INSTITUTION = {DFKI}, URL = {http://www.tcs.informatik.uni-muenchen.de/ftp/backofen/publ/EAGLES-WS-Implemented93.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/D-93-27.entry}, ANNOTE = {COLIURL : Backofen:1993:EWI.pdf Backofen:1993:EWI.ps} } @TechReport{Backofen_Smolka:1992, AUTHOR = {Backofen, Rolf and Smolka, Gert}, TITLE = {A Complete and Recursive Feature Theory}, YEAR = {1992}, NUMBER = {RR-92-30}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.ps.Z}, ANNOTE = {COLIURL : Backofen:1992:CRF.pdf Backofen:1992:CRF.ps Backofen:1992:CRF.dvi} } @TechReport{Backofen_et_al:1991_2, AUTHOR = {Backofen, Rolf and Trost, Harald and Uszkoreit, Hans}, TITLE = {Linking Typed Feature Formalisms and Terminological Knowledge Representation Languages in Natural Language Front-Ends}, YEAR = {1991}, NUMBER = {RR-91-28}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {Deutsches Forschungszentrum für Künstliche Intelligenz}, URL = {ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1991/RR-91-28.ps.gz}, ABSTRACT = {In this Paper wie describe an interface between typed formalisms and terminological languages like KL-ONE. The definition of such an iterface is motivated by the needs of natural language front-ends to AI-systems where information must be transmittes from the front-end to the back-end system and vice versa. We show some minor extensions to the feature formalism allow for a syntactic description of individual concepts in terms of typed feature structures. Namely, we propose to include intervals and a special kind of sets. Partial consistency checks can be made on these concepts descriptions during the unification of feature terms. Type checking on these special involves calling the classifier of the terminological language. The final consistency check is performed only when transferring these concept description into structures of the A-Box of the terminological language.}, ANNOTE = {COLIURL : Backofen:1991:LTFa.pdf Backofen:1991:LTFa.ps} } @TechReport{Balari:1991, AUTHOR = {Balari, Sergio}, TITLE = {Why German is not a Null-Subject Language}, YEAR = {1991}, MONTH = {September}, NUMBER = {12}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Balari:1992, AUTHOR = {Balari, Sergio}, TITLE = {Agreement and Theta-Roles: Towards an Account of Null Subjects in HPSG}, YEAR = {1992}, MONTH = {July}, NUMBER = {25}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes} } @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_Bos:1997, AUTHOR = {Blackburn, Patrick and Bos, Johan}, TITLE = {Representation and Inference for Natural language. A First Course in Computational Semantics}, YEAR = {1997}, MONTH = {August}, NUMBER = {90}, PAGES = {50}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS Report}, INSTITUTION = {Universität des Saarlandes}, URL = {http://www.iccs.informatics.ed.ac.uk/~jbos/comsem/download/volume1.ps.gz}, ABSTRACT = {These are the course notes for Representation and Inference for Natural Language: A First Course in Computational Semantics, which will be given in the second week of ESSLLI97, Aix-en-Provence, by Patrick Blackburn and Johan Bos. The course is an introduction to computational semantics in Prolog. It introduces some fundamental techniques for computing semantic representations for natural language, and working with the result. Both the underlying theory, and their implementation in Prolog, are discussed. We believe that the reader who masters these techniques will be in a good position to appreciate (and critically assess) ongoing developments in computational semantics.}, ANNOTE = {COLIURL : Blackburn:1997:RIN.pdf Blackburn:1997:RIN.ps} } @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} } @TechReport{Blackburn_de Rijke:1994, AUTHOR = {Blackburn, Patrick and de Rijke, Maarten}, TITLE = {Zooming In, Zooming Out}, YEAR = {1994}, MONTH = {November}, NUMBER = {48}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/claus/claus48.dvi ftp://ftp.coli.uni-sb.de/pub/claus/claus48.ps}, ABSTRACT = {This is an exploratory paper about combining logics, combining theories and combining structures. Typically when one applies logic to such areas as computer science, artificial intelligence or linguistics, one encounters hybrid ontologies. The aim of this paper is to identify plausible strategies for coping with ontological richness.}, ANNOTE = {COLIURL : Blackburn:1994:ZZ.pdf Blackburn:1994:ZZ.ps Blackburn:1994:ZZ.dvi} } @TechReport{Blackburn_de Rijke:1995, AUTHOR = {Blackburn, Patrick and de Rijke, Maarten}, TITLE = {Why Combine Logics?}, YEAR = {1995}, MONTH = {April}, NUMBER = {57}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus57.ps}, ABSTRACT = {Combining logics has become a rapidly expanding enterprise that is inspired mainly by concerns about modularity and the wish to join together tailored made logical tools into more powerful but still manageable ones. A natural question is whether it offers anything new over and above existing standard languages. By analysing a number of applications where combined logics arise, we argue that combined logics are a potentially valuable tool in applied logic, and that endorsements of standard languages often miss the point. Using the history of quantified modal logic as our main example, we also show that the use of combined structures and logics is a recurring theme in the analysis of existing logical systems.}, ANNOTE = {COLIURL : Blackburn:1995:WCL.pdf Blackburn:1995:WCL.ps} } @TechReport{Blackburn_et_al:1994, AUTHOR = {Blackburn, Patrick and de Rijke, Maarten and Vennema, Ide}, TITLE = {The Algebra of Modal Logic}, YEAR = {1994}, MONTH = {November}, NUMBER = {47}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/claus/claus47.dvi}, ABSTRACT = {Our main aim is to review the frame semantics and axiomatics of modal logic from the perspective of the duality between (Kripke) frames and boolean algebras with operators as defined by Jónsson and Tarski. To this end, we introduce modal languages and their interpretation in models and frames in Part II. We define and discuss the notion of a modal formula characterizing a class of frames or models, and give the Sahlqvist algorithm which yields, given a suitable modal formula as input, the corresponding first-order condition on the class of frames characterized by the formula. We define the concept of a normal modal logic and explain the canonical frame method for proving completeness of a logic with respect to classes of frames. In Part III we develop the algebraic perspective on modal logic. We introduce boolean algebras with operators and show how they arise naturally in both the semantic and the axiomatic approach towards algebraizing modal logic. We discuss in detail how the category of boolean algebras with operators and homomorphisms links up with the category of frames with so-called bounded morphisms. Finally, we apply this duality to give easy proofs for some important and well-known results from modal logic.}, ANNOTE = {COLIURL : Blackburn:1994:AML.ps Blackburn:1994:AML.dvi} } @TechReport{Blackburn_et_al:1995, AUTHOR = {Blackburn, Patrick and de Rijke, Maarten and Vennema, Ide}, TITLE = {Relational Methods in Logic, Language and Information}, YEAR = {1995}, MONTH = {September}, NUMBER = {65}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus65.ps}, ABSTRACT = {This paper discusses the use of relational methods in the interdisciplinary field of Logic, Language and Information. We first sketch the developments that lead to the current focus on dynamics in the area. After that we give examples of logics of transitions that naturally arise in this setting, and we identify more general themes such as bisimulations, relativisations and dynamic modes of inference. We conclude with a discussion of newly emerging themes, and the limitations of the relational perspective.}, ANNOTE = {COLIURL : Blackburn:1995:RML.pdf Blackburn:1995:RML.ps} } @TechReport{Blackburn_Gardent:1995_1, AUTHOR = {Blackburn, Patrick and Gardent, Claire}, TITLE = {A Specification Language for Lexical Functional Grammars}, YEAR = {1995}, MONTH = {February}, NUMBER = {51}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus51.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus51.dvi}, ABSTRACT = {This paper defines a language L for specifying LFG grammars. This enables constraints on LFG's composite ontology (c-structures synchronised with f-structures) to be stated directly; no appeal to the LFG construction algorithm is needed. We use L to specify schemata annotated rules and the LFG uniqueness, completeness and coherence principles. Broader issues raised by this work are noted and discussed.}, ANNOTE = {COLIURL : Blackburn:1995:SLLb.pdf Blackburn:1995:SLLb.ps Blackburn:1995:SLLb.dvi} } @TechReport{Blackburn_et_al:1996, AUTHOR = {Blackburn, Patrick and Jaspars, Jan and de Rijke, Maarten}, TITLE = {Reasoning about Changing Information}, YEAR = {1996}, MONTH = {September}, NUMBER = {81}, PAGES = {25}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus81.ps}, ABSTRACT = {The purpose of these notes is two-fold: (i) to give a reasonably self-contained introduction to a particular approach to theory change, known as the Alchourron-Gardenfors-Makinson (AGM) approach, and to discuss some of the alternatives and extensions that have been proposed to it over the past few years; (ii) to relate the AGM approach to other 'information-oriented' branches of logic, including intuitionistic logic, non-monotonic reasoning, verisimilitude, and modal and dynamic logic.}, ANNOTE = {COLIURL : Blackburn:1996:RAC.pdf Blackburn:1996:RAC.ps} } @TechReport{Blackburn_et_al:1995_1, AUTHOR = {Blackburn, Patrick and Meyer-Viol, Wilfried and de Rijke, Maarten}, TITLE = {A Proof System for Finite Trees}, YEAR = {1995}, MONTH = {October}, NUMBER = {67}, PAGES = {19}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus67.ps}, ABSTRACT = {In this paper we introduce a description language for finite trees. Although we briefly note some of its intended applications, the main goal of the paper is to provide it with a sound and complete proof system. We do so using standard axioms from modal provability logic and modal logics of programs, and prove completeness by extending techniques due to Van Benthem and Meyer-Viol and Blackburn and Meyer-Viol. We conclude with a proof of the EXPTIME-completeness of the satisfiability problem, and a discussion of issues related to complexity and theorem proving.}, ANNOTE = {COLIURL : Blackburn:1995:PSFb.pdf} } @TechReport{Blackburn_Seligman:1995, AUTHOR = {Blackburn, Patrick and Seligman, Jerry}, TITLE = {Hybrid Languages}, YEAR = {1995}, MONTH = {October}, NUMBER = {66}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus66.ps}, ABSTRACT = {Hybrid languages have both modal and first-order characteristics: a Kripke semantics, and explicit variable binding apparatus. This paper motivates the development of hybrid languages, sketches their history, and examines the expressive power of three hybrid binders. We show that all three binders give rise to languages strictly weaker than the corresponding first-order language, that full first-order expressivity can be gained by adding the universal modality, and that all three binders can force the existence of infinite models and have undecidable satisfiability problems.}, ANNOTE = {COLIURL : Blackburn:1995:HLA.pdf Blackburn:1995:HLA.ps} } @TechReport{Blackburn_Seligman:1996, AUTHOR = {Blackburn, Patrick and Seligman, Jerry}, TITLE = {What are Hybrid Languages?}, YEAR = {1996}, MONTH = {November}, NUMBER = {83}, PAGES = {19}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {http://turing.wins.uva.nl/~carlos/hybrid/Papers/what.pdf}, ABSTRACT = {Hybrid languages exhibit two kinds of hybridisation. First, they combine the distinguishing features of modal logic and classical logic: although they have a Kripke semantics, they also make use of explicit variables and quantifiers that bind them. Second, they don't draw a syntactic distinction between terms and formulas: terms are part of the formula algebra, thus enabling the free combination of two different types of information. The goals of this paper are to introduce a number of hybrid languages, to discuss some of their fundamental logical properties (expressivity, decidability, and undecidability), and then, brie to indicate why such systems deserve further attention. Although hybrid languages have a long and varied history, it is quite likely that most readers will know little, if anything, about them. This dictates the structure of this paper: before we can explain why we're interested in hybrid languages, we're going to have to explain what they are and give some insight into their capabilities, for only then will a discussion of broader motivational issues make much sense.}, ANNOTE = {COLIURL : Blackburn:1996:WHL.pdf} } @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} } @TechReport{Bos:1994_2, AUTHOR = {Bos, Johan}, TITLE = {Presupposition and VP-Ellipsis}, YEAR = {1994}, MONTH = {April}, NUMBER = {37}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/claus/claus37.ps}, ABSTRACT = {We discuss a treatment of VP-ellipsis resolution in DRT in general, and particularly cases where the source clause of the elliptical VP contains presupposition triggers. We propose to restrain VP-ellipsis resolution by presupposition neutralization. We view presupposition as a kind of anaphora, with the ability to accommodate an antecedent if not provided by discourse.}, ANNOTE = {COLIURL : Bos:1994:PVEb.pdf Bos:1994:PVEb.ps} } @TechReport{Bos_et_al:1994_1, AUTHOR = {Bos, Johan and Mastenbroek, Elsbeth and McGlashan, Scott and Millies, Sebastian and Pinkal, Manfred}, TITLE = {Verbmobil Semantikkonstruktion}, YEAR = {1994}, NUMBER = {6}, ADDRESS = {Saarbrücken}, TYPE = {Verbmobil-Report}, INSTITUTION = {Universität des Saarlandes}, ANNOTE = {COLIURL : Bos:1994:VS.pdf} } @TechReport{Bos_et_al:1995_2, AUTHOR = {Bos, Johan and Mineur, Anne-Marie and Buitelaar, Paul}, TITLE = {Bridging as Coercive Accomodation}, YEAR = {1995}, MONTH = {March}, NUMBER = {52}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus52.ps}, ABSTRACT = {This paper combines insights from Pustejovsky's GL theory with Van der Sandt's anaphora resolution algorithm. The phenomenon of bridging is accounted for in terms of linking anaphoric expressions to information that can be inferred from the lexical semantic knowledge that is stored in lexical entries. In doing so, we can distinguish between the normal linking cases as in (1), the special cases of coercive accommodation as in (2) and the bottom cases of accommodation as in (3). (1) When I call a barkeeper, the barkeeper never comes. (2) When I go to a bar, the barkeeper always throws me out. (3) When I came in, the barkeeper said hello.}, ANNOTE = {COLIURL : Bos:1995:BCAc.pdf Bos:1995:BCAc.ps} } @TechReport{Brants:1995_2, AUTHOR = {Brants, Thorsten}, TITLE = {Some Experiments with the CRATER Corpus}, YEAR = {1995}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Brants:1996_2, AUTHOR = {Brants, Thorsten}, TITLE = {TnT - A Statistical Part-of-Speech Tagger}, YEAR = {1996}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report}, INSTITUTION = {Universität des Saarlandes}, ANNOTE = {COLIURL : Brants:1996:TSP.pdf} } @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} } @TechReport{Brants_et_al:1997, AUTHOR = {Brants, Thorsten and Hendriks, Roland and Kramp, Sabine and Krenn, Brigitte and Preis, Cordula and Skut, Wojciech and Uszkoreit, Hans}, TITLE = {Das NEGRA-Annotationsschema}, YEAR = {1997}, ADDRESS = {Saarbrücken}, TYPE = {Negra Project Report}, INSTITUTION = {Universität des Saarlandes}, URL = {https://www.coli.uni-saarland.de/sfb378/negra-corpus/negra-corpus.html}, ABSTRACT = {Das vorliegende Annotierschema entstand während des Aufbaus des NEGRA-Korpus. Nach drei Jahren Arbeit (wobei der Aufbau des Korpus nur ein Teilaspekt des Projektes war) liegen 20,000 annotierte Sätze (ca. 350,000 Tokens) sowie diese mehrfach überarbeitete Version des Schemas vor.} } @TechReport{Brants_Samuelsson:1995_1, AUTHOR = {Brants, Thorsten and Samuelsson, Christer}, TITLE = {Tagging the Teleman Corpus}, YEAR = {1995}, MONTH = {April}, NUMBER = {54}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus54.ps}, ABSTRACT = {Experiments were carried out comparing the Swedish Teleman and the English Susanne corpora using an HMM-based and a novel reductionistic statistical part-of-speech tagger. They indicate that tagging the Teleman corpus is the more difficult task, and that the performance of the two different taggers is comparable.}, ANNOTE = {COLIURL : Brants:1995:TTCb.pdf Brants:1995:TTCb.ps} } @TechReport{Burheim:1995, AUTHOR = {Burheim, Tore}, TITLE = {A Grammar Formalism and Cross-Serial Dependencies}, YEAR = {1995}, MONTH = {March}, NUMBER = {53}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus53.ps}, ABSTRACT = {First we define a unification grammar formalism called the Tree HomomorphicFeature Structure Grammar. It is based on Lexical Functional Grammar (LFG), but has a strong restriction on the syntax of the equations. We then show that this grammar formalism defines a full abstract family of languages, and that it is capable of describing crossserial dependencies of the type found in Swiss German.}, ANNOTE = {COLIURL : Burheim:1995:GFC.pdf Burheim:1995:GFC.ps} } @TechReport{Burheim:1995_1, AUTHOR = {Burheim, Tore}, TITLE = {Indexed Languages and Unification Grammars}, YEAR = {1995}, MONTH = {May}, NUMBER = {63}, PAGES = {16}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Unversität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus63.ps}, ABSTRACT = {Indexed languages are interesting in computational linguistics because they are the least class of languages in the Chomsky hierarchy that has not been shown not to be adequate to describe the string set of natural language sentences. We here define a class of unification grammars that exactly describe the class of indexed languages.}, ANNOTE = {COLIURL : Burheim:1995:ILU.pdf Burheim:1995:ILU.ps} } @TechReport{Busemann:1990_2, AUTHOR = {Busemann, Stephan}, TITLE = {Generalisierte Phrasenstruktur-Grammatiken und ihre Verwendung zur maschinellen Sprachverarbeitung}, YEAR = {1990}, NUMBER = {RR-90-17}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {http://www.dfki.de/dfkibib/publications/docs/Busemann_1990_GPGVMS.pdf}, ABSTRACT = {Der vorliegende Artikel ist eine geringfügig überarbeitete Version des dritten und des vierten Kapitels der Dissertation des Autors [Busemann 1990]. Die zugrundeliegende Forschung wurde im Rahmen des vom Bundesminister für Forschung und Technologie unter dem Kennzeichen 1013211 geförderten Projekts KIT-FAST an der Technischen Universität Berlin durchgeführt. Die Arbeit wurde am DFKI im Projekt DISCO, das vom BMFT unter dem Kennzeichen ITW 9002 gefördert wird, fertiggestellt.}, ANNOTE = {COLIURL : Busemann:1990:GPG.pdf} } @TechReport{Busemann:1991_1, AUTHOR = {Busemann, Stephan}, TITLE = {Using Pattern-Action Rules for the Generation of GPSG Structure from Separate Semantic Representations}, YEAR = {1991}, NUMBER = {RR-91-16}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {http://www.dfki.de/dfkibib/publications/docs/Busemann_1991_UPARFTGOG_RR.pdf}, ABSTRACT = {In many tactical NL generators the semantic input structure is taken for granted. In this paper, a new approach to multilingual, tactical generation is presented that keeps the syntax separate from the semantics. This allows for the system to be directly adapted to application-dependent representations. In the case at hand, the semantics is specifically designed for sentence-semantic transfer in a machine translation system. The syntax formalism used is Generalized Phrase Structure Grammar (GPSG). The mapping from semantic onto syntactic structures is performed by a set of pattern-action rules. Each rule matches a piece of the input structure and guides the GPSG structure-building process by telling it which syntax rule(s) to apply. The scope of each pattern-action rule is strictly local, the actions are primitive, and rules can not call each other. These restrictions render the production rule approach both highly modular and transparent.}, ANNOTE = {COLIURL : Busemann:1991:UPAa.pdf} } @TechReport{Busemann:1996, AUTHOR = {Busemann, Stephan}, TITLE = {Best-First Surface Realization}, YEAR = {1996}, NUMBER = {RR-96-05}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {http://arxiv.org/PS_cache/cmp-lg/pdf/9605/9605010.pdf}, ABSTRACT = {Current work in surface realization concentrates on the use of general, abstract algorithms that interpret large, reversible grammars. Only little attention has been paid so far to the many small and simple applications that require coverage of a small sublanguage at different degrees of sophistication. The system TG/2 described in this paper can be smoothly integrated with deep generation processes, it integrates canned text, templates, and context-free rules into a single formalism, it allows for both textual and tabular output, and it can be parameterized according to linguistic preferences. These features are based on suitably restricted production system techniques and on a generic backtracking regime.}, ANNOTE = {COLIURL : Busemann:1996:BFSa.pdf} } @TechReport{Busemann_et_al:1997_1, AUTHOR = {Busemann, Stephan and Declerck, Thierry and Diagne, Abdel Kader and Dini, Luca and Klein, Judith and Schmeier, Sven}, TITLE = {Natural Language Dialogue Service for Appointment Scheduling Agents}, YEAR = {1997}, NUMBER = {RR-97-02}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1997/RR-97-02.ps.gz}, ABSTRACT = {Appointment scheduling is a problem faced daily by many people and organizations. Cooperating agent systems have been developed to automate this task partially. In order to extend the circle of participants as far as possible we advocate for the use of natural language transmitted by email. We describe Cosma, a fully implemented German language server for existing appointment scheduling agent systems. Cosma can cope with multiple dialogues in parallel, and accounts for differences in dialogue behaviour between human and machine agents. NL coverage of the sublanguage is achieved through both corpus-based grammar development and the use of message extraction techniques.}, ANNOTE = {COLIURL : Busemann:1997:NLDb.pdf Busemann:1997:NLDb.ps} } @TechReport{Busemann_et_al:1997_2, AUTHOR = {Busemann, Stephan and Declerck, Thierry and Diagne, Abdel Kader and Hinkelman, Elizabeth and Uszkoreit, Hans}, TITLE = {Cooperative Schedule Management Agent. Abschlussbericht COSMA}, YEAR = {1997}, NUMBER = {R:S97-216}, ADDRESS = {Saarbrücken}, TYPE = {DFKI-Report}, INSTITUTION = {DFKI}, URL = {http://www.dfki.de/dfkibib/publications/docs/cosma-abschluss.pdf}, ANNOTE = {COLIURL : Busemann:1997:CSM.pdf} } @TechReport{Busemann_Merget:1995, AUTHOR = {Busemann, Stephan and Merget, Iris}, TITLE = {Eine Untersuchung kommerzieller Terminverwaltungs-Software im Hinblick auf die Kopplung mit natürlichsprachlichen Systemen}, YEAR = {1995}, NUMBER = {D-95-11}, ADDRESS = {Saarbrücken}, TYPE = {DFKI Document}, INSTITUTION = {DFKI}, URL = {ftp://ftp.dfki.uni-kl.de/pub/Publications/Documents/1995/D-95-11.ps.gz}, ANNOTE = {COLIURL : Busemann:1995:UKT.pdf Busemann:1995:UKT.ps} } @TechReport{Busemann_Novak:1992, AUTHOR = {Busemann, Stephan and Novak, Hans-Joachim}, TITLE = {Generierung natürlicher Sprache}, YEAR = {1992}, NUMBER = {RR-92-50}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {http://www.dfki.de/dfkibib/publications/docs/Busemann_1992_GNS.pdf}, ANNOTE = {COLIURL : Busemann:1992:GNSb.pdf} } @TechReport{Busemann_et_al:1994, AUTHOR = {Busemann, Stephan and Oepen, Stefan and Hinkelman, Elizabeth and Neumann, Günter and Uszkoreit, Hans}, TITLE = {COSMA - Multi-Participant NL Interaction for Appointment Scheduling}, YEAR = {1994}, NUMBER = {RR-94-34}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-34.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-34.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-34.ps.Z http://www.dfki.uni-kl.de/~dfkidok/publications/RR/94/34/abstract.html}, ANNOTE = {COLIURL : Busemann:1994:CMP.pdf Busemann:1994:CMP.ps Busemann:1994:CMP.dvi} } @TechReport{Butz:1995, AUTHOR = {Butz, Andreas}, TITLE = {BETTY: Ein System zur Planung und Generierung informativer Animationssequenzen}, YEAR = {1995}, NUMBER = {D-95-02}, ADDRESS = {Saarbrücken}, TYPE = {DFKI Document}, INSTITUTION = {DFKI} } @TechReport{Crouch_et_al:1995, AUTHOR = {Crouch, Richard and Gaizauskas, Robert and Netter, Klaus}, TITLE = {Report of the Study Group on Assessment and Evaluation}, YEAR = {1995}, ADDRESS = {Saarbrücken}, TYPE = {Interim Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knass95.dvi.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knass95.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knass95.ps.gz}, ANNOTE = {COLIURL : Crouch:1995:RSG.pdf Crouch:1995:RSG.ps Crouch:1995:RSG.dvi} } @TechReport{Diagne_et_al:1995, AUTHOR = {Diagne, Abdel Kader and Kasper, Walter and Krieger, Hans-Ulrich}, TITLE = {Distributed Parsing with HPSG Grammars}, YEAR = {1995}, NUMBER = {RR-95-19}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI} } @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} } @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} } @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.} } @TechReport{Eineborg_Gambäck:1994, AUTHOR = {Eineborg, Martin and Gambäck, Björn}, TITLE = {Neural Networks for Wordform Recognition}, YEAR = {1994}, MONTH = {February}, NUMBER = {R94:05}, ADDRESS = {Stockholm}, TYPE = {Research Report}, INSTITUTION = {SICS}, URL = {www.sics.se/libabstracts.html#R94-05}, ANNOTE = {COLIURL : Eineborg:1994:NNW.pdf} } @TechReport{Engelkamp_et_al:1992, AUTHOR = {Engelkamp, Judith and Erbach, Gregor and Uszkoreit, Hans}, TITLE = {Handling Linear Precedence Constraints by Unification}, YEAR = {1992}, MONTH = {January}, NUMBER = {19}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {https://www.coli.uni-saarland.de/~erbach/pub/acl92/eeu-ACL92.pdf}, ABSTRACT = {Linear precedence (LP) rules are widely used for stating word order principles. They have been adopted as constraints by HPSG but no encoding in the formalism has been provided. Since they only order siblings, they are not quite adequate, at least not for German. We propose a notion of LP constraints that applies to linguistically motivated branching domains such as head domains. We show a type-based encoding in an HPSG-style formalism that supports processing. The encoding can be achieved by a compilation step.}, ANNOTE = {COLIURL : Engelkamp:1992:HLPa.pdf} } @TechReport{Erbach:1990, AUTHOR = {Erbach, Gregor}, TITLE = {Syntactic Processing of Unknown Words}, YEAR = {1990}, NUMBER = {131}, ADDRESS = {Stuttgart}, TYPE = {IWBS Report}, INSTITUTION = {IBM} } @TechReport{Erbach:1990_2, AUTHOR = {Erbach, Gregor}, TITLE = {Natural Language Understanding in LILOG: An Intermediate Overview}, YEAR = {1990}, NUMBER = {137}, PAGES = {43-47}, ADDRESS = {Stuttgart}, TYPE = {IWBS Report}, INSTITUTION = {IBM Deutschland GmbH} } @TechReport{Erbach:1990_3, AUTHOR = {Erbach, Gregor}, TITLE = {Parsing}, YEAR = {1990}, NUMBER = {IWBS Report 137}, ADDRESS = {Stuttgart}, INSTITUTION = {IBM Deutschland GmbH} } @TechReport{Erbach:1990_4, AUTHOR = {Erbach, Gregor}, TITLE = {Syntactic Processing of Unknown Words}, YEAR = {1990}, MONTH = {September}, NUMBER = {3}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {A method for processing sentences which contain unknown words, i. e. words for which no lexical entry exists, is presented. There are three different stages of processing: The sentence with the unknown word is parsed. There are no special requirements for the parsing algorithm, but the lexical lookup procedure needs to be modified. Based on the syntactic structure of the parse, information about the unknown word can be extracted. The information obtained in step 2 may be too fully specified for a lexical entry. Therefore a filter is applied to it to create a new lexical entry. An application of the method is illustrated with examples from Categorial Unification Grammar. The problem of using the extracted information for lexical knowledge acquisition is discussed.} } @TechReport{Erbach:1991, AUTHOR = {Erbach, Gregor}, TITLE = {A Flexible Parser for a Linguistic Development Environment}, YEAR = {1991}, MONTH = {May}, NUMBER = {9}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {We describe the parser of LEU/2, the Linguistic Experimentation Environment of the LILOG project. The parser is designed to support and encourage experimentation with different grammars, different styles of writing grammar, and with different parsing strategies. Unlike the parser of the first LILOG prototype, which was designed specifically for Categorial Unification Grammars, the present parser places hardly any restrictions on the format of the grammar, and also supports rules in ID/LP-format under two interpretations of LP statements. Empty categories can be processed. The parser includes a mechanism for processing unknown words, and for determining sentence boundaries in continuous text. The parser is a bottom-up chart parser for grammars encoded in STUF. Although the emphasis of the parser is on experimentation with different grammars rather than efficient analysis of texts, we have tried to make the parser as efficient as possible to make it a powerful experimentation tool for the grammar designer. In order to implement parsing strategies, the parsing process is decomposed into individual parsing tasks, which are placed onto an agenda according to their priority. This paper consists of two parts. In the first part, we discuss various choices in parser design, and motivate our design decisions by the use of the parser in a linguistic development environment. In the second part, the parser is described in more detail. Some familiarity with chart parsing is assumed.}, ANNOTE = {COLIURL : Erbach:1991:FPLa.pdf} } @TechReport{Erbach:1991_1, AUTHOR = {Erbach, Gregor}, TITLE = {An Environment for Experimenting with Parsing Strategies}, YEAR = {1991}, NUMBER = {167}, ADDRESS = {Stuttgart}, TYPE = {IWBS Report}, INSTITUTION = {IBM Deutschland GmbH} } @TechReport{Erbach:1991_4, AUTHOR = {Erbach, Gregor}, TITLE = {Lexical Representation of Idioms}, YEAR = {1991}, NUMBER = {169}, ADDRESS = {Stuttgart}, TYPE = {IWBS-Report}, INSTITUTION = {IBM Deutschland GmbH} } @TechReport{Erbach:1991_5, AUTHOR = {Erbach, Gregor}, TITLE = {A Bottom-Up Algorithm for Parsing and Generation}, YEAR = {1991}, MONTH = {February}, NUMBER = {5}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {https://www.coli.uni-saarland.de/~erbach/pub/claus5/erbach-claus5-92.pdf}, ABSTRACT = {We present a bottom-up algorithm for parsing and for the generation of language samples. A language sample is a subset of the language generated by a grammar which is restricted to avoid uninteresting variation. We discuss the use of the generation of language samples for grammar development, where inspection of a language sample can help to detect overgeneration in a grammar. The algorithm is a bottom-up chart parser, whose lexical lookup phase has been modified for generation of language samples. An analysis of the algorithm offers interesting insights into the relationship between parsing and generation, summarized by the statement that parsing is a constrained form of generation.}, ANNOTE = {COLIURL : Erbach:1991:BAP.pdf} } @TechReport{Erbach:1991_6, AUTHOR = {Erbach, Gregor}, TITLE = {An Environment for Experimenting with Parsing Strategies}, YEAR = {1991}, MONTH = {April}, NUMBER = {8}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {An environment for the experimentation with parsing strategies is presented which consists of a parser which can process arbitrary parsing strategies, a functional language for the definition of strategies, and a statistical component which helps the user assess the effects of the different strategies.} } @TechReport{Erbach:1992_4, AUTHOR = {Erbach, Gregor}, TITLE = {Ambiguity and Linguistic Preferences}, YEAR = {1992}, MONTH = {June}, NUMBER = {23}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {https://www.coli.uni-saarland.de/~erbach/pub/ecai92/erbach-ecai92.pdf ftp://ftp.coli.uni-sb.de/pub/coli/papers/preference_values.ps ftp://ftp.coli.uni-sb.de/pub/coli/papers/preference_values.dvi}, ABSTRACT = {Attempting to treat ambiguities in typed feature formalisms presents a dilemma. The exploitation of linguistic knowledge for adding additional constraints (e.g. word order, selectional restrictions) to the grammar may indeed help disambiguation, but it also rules out some perfectly grammatical non-ambiguous strings. Ways out of this dilemma are discussed in this paper. They include - reliance on processin g strategies without addition of additional knowledge - processing guided by statistical probability - leaving desambiguation to external knowledge sources - using additional constraints only if they are needed for disambiguation. We propose the addition of preference values to typed ferature structures. Using preference values has the effect that violation of the additional constraints needed for disambiguation only decreases the preference value, but does not make the sentence unacceptable. Disambiguation is achieved by selecting the reading with the highest preference value. We think that it is possible to define a processing strategy (preference-driven linguistic deduction) that finds the preferred reading first.}, NOTE = {URL is a revised version}, ANNOTE = {COLIURL : Erbach:1992:ALPb.pdf Erbach:1992:ALPb.ps Erbach:1992:ALPb.dvi} } @TechReport{Erbach:1992_5, AUTHOR = {Erbach, Gregor}, TITLE = {Head-Driven Lexical Representation of Idioms in HPSG}, YEAR = {1992}, MONTH = {May}, NUMBER = {22}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {This paper is concerned with the lexical representation of idioms. We distinguish idioms from other kinds of multiple-word expressions like collocations, support-verb constructions, and lexicalized metaphors. A lexical representation for idioms in Head-driven Phrease Structure Grammar (HPSG) is proposed, which can account for the syntactic variability found in idiomatic constructions, and for the non-compositional semantics of idioms. Since all idioms, which are not completely fixed, consist of a lexical head and frozen complements, the information about an idiomatic expression can be encoded in the subcategorization list of the idiom's lexical head. Since idioms in volve selection for particular lexemes, a feature is added to HPSG signs to encode this lexemic information. It will be argued that the Locality Principle of HPSG is too strong because it prohibits the representation of idioms proposed in this paper, and that the Semantics Principle must be modified. We explain the fact that some idioms do not passivize by the fact that no thematic role is assigned to accusative objects like the bucket in kick the bucket.} } @TechReport{Erbach:1993_2, AUTHOR = {Erbach, Gregor}, TITLE = {Towards a Theory of Degrees of Grammaticality}, YEAR = {1993}, MONTH = {November}, NUMBER = {34}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {This paper is concerned with ill-formed language. We distinguish two types of ill-formed language: string errors which can be explained by modifications to the string generated by the grammar, and grammar errors which can be explained by a modification of the grammar which generates the string. A chart-based method for dealing with string errors is presented. We discuss the adequacy of different grammatical formalisms for dealing with grammar errors, and show that context-free grammars are not expressive enough, but that constraint-based grammars are more suitable, if absolute and non-absolute constraints are distinguished. We augment non-absolute constraints in these grammars with probabilities. The relationship between the grammaticality of a string and its probability is discussed.} } @TechReport{Erbach:1994_3, AUTHOR = {Erbach, Gregor}, TITLE = {ProFit - Prolog with Features, Inheritance, and Templates}, YEAR = {1994}, MONTH = {July}, NUMBER = {42}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/claus/claus42.ps ftp://ftp.coli.uni-sb.de/pub/claus/claus42.dvi https://www.coli.uni-saarland.de/~erbach/pub/claus42.pdf}, ABSTRACT = {ProFIT is an extension of Standard Prolog with Features, Inheritance and Templates. ProFIT allows the programmer or grammar developer to declare an inheritance hierarchy, features and templates. Typed feature terms can be used in ProFIT programs together with Prolog terms to provide a clearer description language for linguistic structures. ProFIT compiles all typed feature terms into a Prolog term representation, so that the built-in Prolog term unification can be used for the unification of typed feature structures, and no special unification algorithm is needed. ProFIT programs are compiled into Prolog programs, so that no meta-interpreter is needed for their execution. ProFIT thus provides a direct step from grammars developed with typed feature terms to Prolog programs usable for applications.}, ANNOTE = {COLIURL : Erbach:1994:PPF.pdf Erbach:1994:PPF.ps Erbach:1994:PPF.dvi} } @TechReport{Erbach:1994_4, AUTHOR = {Erbach, Gregor}, TITLE = {Bottom-Up Earley Deduction}, YEAR = {1994}, MONTH = {April}, NUMBER = {39}, PAGES = {7}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/claus/claus39.ps ftp://ftp.coli.uni-sb.de/pub/claus/claus39.dvi}, ABSTRACT = {We propose a bottom-up variant of Earley deduction. Bottom-up deduction is preferable to top-down deduction because it allows incremental processing (even for head-driven grammars), it is data-driven, no subsumption check is needed, and preference values attached to lexical items can be used to guide best-first search. We discuss the scanning step for bottom-up Earley deduction and indexing schemes that help avoid useless deduction steps.}, ANNOTE = {COLIURL : Erbach:1994:BEDb.pdf Erbach:1994:BEDb.ps Erbach:1994:BEDb.dvi} } @TechReport{Erbach:1994_5, AUTHOR = {Erbach, Gregor}, TITLE = {Multi-Dimensional Inheritance}, YEAR = {1994}, MONTH = {December}, NUMBER = {40}, PAGES = {10}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/claus/claus40.ps}, ABSTRACT = {In this paper, we present an alternative approach to multiple inheritance for typed feature structures. In our approach, a feature structure can be associated with several types coming from different hierarchies (dimensions). In case of multiple inheritance, a type has supertypes from different hierarchies. We contrast this approach with approaches based on a single type hierarchy where a feature structure has only one unique most general type, and multiple inheritance involves computation of greatest lower bounds in the hierarchy. The proposed approach supports current linguistic analyses in constraint-based formalisms like HPSG, inheritance in the lexicon, and knowledge representation for NLP systems. Finally, we show that multi-dimensional inheritance hierarchies can be compiled into a Prolog term representation, which allows to compute the conjunction of two types efficiently by Prolog term unification.}, ANNOTE = {COLIURL : Erbach:1994:MDIb.pdf Erbach:1994:MDIb.ps} } @TechReport{Erbach_Krenn:1993, AUTHOR = {Erbach, Gregor and Krenn, Brigitte}, TITLE = {Idioms and Support Verb Constructions in HPSG}, YEAR = {1993}, MONTH = {February}, NUMBER = {28}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/claus/claus28.ps ftp://ftp.coli.uni-sb.de/pub/claus/claus28.dvi https://www.coli.uni-saarland.de/~erbach/pub/claus28.pdf}, ABSTRACT = {The paper presents a description and analysis of two kinds of collocational phenomena of German: idioms and support verb constructions (Funktionsverbgefüge). Collocational phenomena in general are characterized by restricted lexical selection of the collocation partners. First a characterization of idioms and support verb constructions is given, and idioms and support verb constructions are differentiated from compositional collocations''. Compositional collocations differ from idioms and support verb constructions as the meaning of a compositional collocation is derived by the usual compositional semantic functions from the meanings of its constituents, and their syntactic properties are similar to non collocational constructions. Further syntactic and semantic properties of idioms and support verb constructions are described. Unanalyzable and metaphorical idioms are distinguished. While unanalyzable idioms are diachronical often derived from metaphors, a metaphorical interpretation is no longer possible, and their meaning must be listed in the lexicon. In case of metaphorical idioms, where each part must be assigned a (metaphorical) meaning, the meaning of the parts either must be assigned in the lexicon or metaphorization rules must be stated in the grammar. Support verb constructions, which consist of a verb (the support verb) and a noun phrase including the nominal collocation partner (the predicative noun) of the verb, function as predicates and differ from idioms in the ability to express different phases of a process via Aktionsart, and the ability to express causative as well as non causative variation. Both idioms and support verb constructions allow for different degrees of syntactic variation and internal modification. There are some idioms and support verb constructions which are completely fixed. The majority, however, allows for considerably more flexibility such as passivisation, or flexibility in word order, heads and complements need not be adjacent. Due to this simmilarity, we have made an attempt to treat idioms and support verb constructions in a simmilar way. HPSG, as it stands, is not well equipped to handle lexical selection. We have argued that in case of totally fixed idioms a representation of multi-word lexemes with the specification of the PHON feature is appropriate. For idioms which consist of a head and a frozen complement and support verb constructions we proposed to handle the relationship between the head and the frozen complement or predicative noun, respectively, by subcategorization. Depending on how fixed the frozen complement or predicative noun is, either the PHON feature, the DAUGHTERS feature or the newly introduced INDEX feature LEXEME is specified. As a consequence, we subcategorize for feature structures of type SIGN instead of SYNSEM. We have specified the semantics of idioms in the syntactic head of the construction. The semantics of the frozen complement is ignored, and the Quantifier Inheritance Principle is modified so that quantification over the frozen complement is avoided. The semantic core of the support verb construction is inherited from the predicative noun; in general the support verb adds the Aktionsart and possibly information about the causative relation. The support verb fills one of its argument positions with the predicative noun, and its other argument positions with arguments of the predicative noun. Any remaining arguments of the predicative noun are appended to the SUBCAT list of the support verb. In case of causative support verb constructions, one argument position of the support verb is filled by the cause(r).}, ANNOTE = {COLIURL : Erbach:1993:ISV.pdf Erbach:1993:ISV.ps Erbach:1993:ISV.dvi} } @TechReport{Erbach_et_al:1994_1, AUTHOR = {Erbach, Gregor and Moshier, M. Andrew and Manandhar, Suresh and Ruessink, Herbert and van der Kraan, Mark and Thiersch, Craig}, TITLE = {The Reusability of Grammatical Resources}, YEAR = {1994}, NUMBER = {3(2)}, PAGES = {5-7}, ADDRESS = {Brighton, Sussex}, TYPE = {ELSNews}, INSTITUTION = {European Network in Language and Speech} } @TechReport{Erbach_et_al:1994_2, AUTHOR = {Erbach, Gregor and Moshier, M. Andrew and Uszkoreit, Hans}, TITLE = {Multiple Inheritance for ALEP. ET 9.2 deliverable}, YEAR = {1994} } @TechReport{Erbach_et_al:1994_3, AUTHOR = {Erbach, Gregor and Skut, Wojciech and Uszkoreit, Hans}, TITLE = {Linear Precedence Constraints in Lean Formalisms (Part II). ET 9.2 deliverable}, YEAR = {1994}, URL = {http://www.dfki.de/dfkibib/publications/docs/Uszkoreit_1994_LPCLFP2.pdf}, ABSTRACT = {In this report, we demonstrate the practical application of the methods outlined in Part I by the implementation of a grammar that covers the ordering of adjuncts and complements in the German Mittelfeld.}, ANNOTE = {COLIURL : Erbach:1994:LPCa.pdf} } @TechReport{Erbach_et_al:1995, AUTHOR = {Erbach, Gregor and Skut, Wojciech and Uszkoreit, Hans}, TITLE = {Linear Precedence Constraints in Lean Formalisms (I und II)}, YEAR = {1995}, NUMBER = {55}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {http://www.dfki.de/dfkibib/publications/docs/Uszkoreit_1994_LPCLFP1.pdf http://www.dfki.de/dfkibib/publications/docs/Uszkoreit_1994_LPCLFP2.pdf}, ABSTRACT = {1. In this report a method for encoding LP constraints is presented that lends itself for a an easy integration into ALEP grammars since it does not require any changes to the formalism and to the implementation of the current ALEP development platform 2. In this report, we demonstrate the practical application of the methods outlined in Part I by the implementation of a grammar that covers the ordering of adjuncts and complements in the German Mittelfeld}, ANNOTE = {COLIURL : Erbach:1995:LPC1.pdf Erbach:1995:LPC2.pdf Erbach:1995:LPC.zip} } @TechReport{Erbach_Uszkoreit:1990, AUTHOR = {Erbach, Gregor and Uszkoreit, Hans}, TITLE = {Grammar Engineering: Problems and Prospects - Report of the Saarbrücken Workshop on Grammar Engineering}, YEAR = {1990}, MONTH = {July}, NUMBER = {1}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {https://www.coli.uni-saarland.de/~erbach/pub/claus1/ge-claus1.pdf}, ABSTRACT = {TheSaarbrücken Workshop on Grammar Engineeringtook place from June 21st to 23rd, 1990. The aim of the workshop was to bring together for 3 days of intensive discussion a number of people with practical experience in the development of large-coverage grammars and researchers who have investigated concepts and tools for grammar development. The workshop focused on the methodology of grammar engineering, testing and evaluation of grammars, the problem of distributed development, the formalisms and tools needed, and grammar maintenance and reusability. A variety of approaches to grammar writing were presented. Prerequisites for effective grammar engineering were identified.}, ANNOTE = {COLIURL : Erbach:1990:GEP.pdf} } @TechReport{Erbach_Uszkoreit:1994, AUTHOR = {Erbach, Gregor and Uszkoreit, Hans}, TITLE = {Linear Precedence Constraints in Lean Formalisms (Part I). ET 9.2 deliverable}, YEAR = {1994}, URL = {http://www.dfki.de/dfkibib/publications/docs/Uszkoreit_1994_LPCLFP1.pdf}, ABSTRACT = {In this report a method for encoding LP constraints is presented that lends itself for a an easy integration into ALEP grammars since it does not require any changes to the formalism and to the implementation of the current ALEP development platform.}, ANNOTE = {COLIURL : Erbach:1994:LPCb.pdf} } @TechReport{Erbach_et_al:1995_2, AUTHOR = {Erbach, Gregor and van der Kraan, Mark and Manandhar, Suresh and Ruessink, Herbert and Thiersch, Craig and Skut, Wojciech}, TITLE = {Extending Unification Formalisms}, YEAR = {1995}, MONTH = {May}, NUMBER = {62}, PAGES = {8}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {https://www.coli.uni-saarland.de/claus/claus62.ps}, ABSTRACT = {This paper describes some of the results of the project LRE-61-061: The Reusability of Grammatical Resources. The aim of the project is to extend unification formalisms with notational devices and constraint solvers in order to facilitate the development of reusable grammars. Work covers both the theoretical description of the extensions as well as the practical implementation. The project took the Advanced Linguistic Engineering Platform (ALEP) as its starting point. ALEP was designed to allow for two levels of extension: additional syntactic expressions syntactic sugar and external specialised constraint solvers. The syntactic additions to ALEP comprise LFG coherence and completeness and an extended notation for phrase-structure rules. The project has developed solvers for set constraints and set operations, linear precedence constraints and for implicational or guarded constraints.}, ANNOTE = {COLIURL : Erbach:1995:EUFb.pdf Erbach:1995:EUFb.ps} } @TechReport{Ericsson_et_al:2000, AUTHOR = {Ericsson, Stinaand and Lewin, Ian and Rupp, Christopher J. and Cooper, Robin}, TITLE = {Dialogue Moves in Negotiative Dialogues}, YEAR = {2000}, MONTH = {September}, NUMBER = {1.2}, ADDRESS = {Göteborg}, TYPE = {Siridus Report}, INSTITUTION = {Göteborg University, Department of Linguistics}, URL = {http://www.ling.gu.se/projekt/siridus/Publications/deliv1-2.ps.gz}, ANNOTE = {COLIURL : Ericsson:2000:DMN.pdf Ericsson:2000:DMN.ps} } @TechReport{Flickinger_Nerbonne:1991, AUTHOR = {Flickinger, Dan and Nerbonne, John}, TITLE = {Inheritance and Complementation: A Case Study of Easy Adjectives and Related Nouns}, YEAR = {1991}, NUMBER = {RR-91-30}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-91-30.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-91-30.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-91-30.ps.Z}, ANNOTE = {COLIURL : Flickinger:1991:ICC.pdf Flickinger:1991:ICC.ps Flickinger:1991:ICC.dvi} } @TechReport{Gambäck:1992_1, AUTHOR = {Gambäck, Björn}, TITLE = {Lexical Acquisition: the Swedish VEX System}, YEAR = {1992}, NUMBER = {R92012}, ADDRESS = {Stockholm}, TYPE = {SICS Research Report}, INSTITUTION = {Swedish Institute of Computer Science} } @TechReport{Gambäck_Rayner:1990_1, AUTHOR = {Gambäck, Björn and Rayner, Manny}, TITLE = {Contract Bridge as a Micro-World for Reasoning about Communicating Agents}, YEAR = {1990}, MONTH = {November}, NUMBER = {R90011}, ADDRESS = {Stockholm}, TYPE = {Research Report}, INSTITUTION = {Swedish Institute for Computer Science}, URL = {ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--90-11--SE.ps.Z} } @TechReport{Gambäck_et_al:1993, AUTHOR = {Gambäck, Björn and Rayner, Manny and Pell, Barney}, TITLE = {Pragmatic Reasoning in Bridge}, YEAR = {1993}, MONTH = {April}, NUMBER = {299}, ADDRESS = {Cambridge}, TYPE = {Technical Report}, INSTITUTION = {University of Cambridge, Computer Laboratory}, URL = {http://www.sics.se/~gamback/publications/pragma.ps}, ANNOTE = {COLIURL : Gamback:1993:PRBa.pdf Gamback:1993:PRBa.ps} } @TechReport{Gambäck_et_al:1993_1, AUTHOR = {Gambäck, Björn and Rayner, Manny and Pell, Barney}, TITLE = {Pragmatic Reasoning in Bridge}, YEAR = {1993}, NUMBER = {CRC-030}, ADDRESS = {Cambridge}, TYPE = {SRI International Technical Report} } @TechReport{Gardent:1994, AUTHOR = {Gardent, Claire}, TITLE = {Discourse Multiple Dependencies}, YEAR = {1994}, MONTH = {October}, NUMBER = {45}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus45.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus45.dvi}, ABSTRACT = {It is sometimes claimed (cf. [Mann/Thompson 1988, Scha/Polanyi 1988, Webber 1991, Gardent 1991, Pruest 1992]) that discourse has a tree structure which reflects the semantic structure of discourse. In this paper, I argue that this claim is problematic in cases of discourse multiple dependencies i.e. cases where one discourse segment is semantically related to two discourse segments. I develop a discourse framework which is based on [Scha/Polanyi 1988] but integrates ideas from Feature-based Tree Adjoining Grammars (FTAGs). I then show that this new framework adequately captures multiple dependencies whilst retaining the precise linguistic predictions made by the discourse grammar. In particular, I show how it permits a simple modelling of discourse semantics, discourse coherence and discourse based constraints on anaphora resolution.}, ANNOTE = {COLIURL : Gardent:1994:DMD.pdf Gardent:1994:DMD.ps Gardent:1994:DMD.dvi} } @TechReport{Gardent:1995, AUTHOR = {Gardent, Claire}, TITLE = {Generating with Discourse Grammar}, YEAR = {1995}, MONTH = {May}, NUMBER = {58}, PAGES = {21}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus58.ps}, ABSTRACT = {In this paper, we show how typed unification based formalisms extended with arbitrary relations can be used to generate discourse. We start by presenting the specific framework being used (discourse grammar), and we argue that it provides a natural setting for a computational analysis of intersentential phenomena such as ellipsis, anaphora and focus. We then show that it is possible for a discourse grammar to be neither monotonic nor declarative and further, that a discourse grammar is not guaranteed to terminate even when the set of solutions to be found is finite. Finally, we argue that despite these non properties, a generator can be developed which both preserves the intended meaning of the grammar and terminates.}, ANNOTE = {COLIURL : Gardent:1995:GDG.pdf Gardent:1995:GDG.ps} } @TechReport{Gardent:1997_1, AUTHOR = {Gardent, Claire}, TITLE = {Parallelism, HOU and Deaccenting}, YEAR = {1997}, MONTH = {January}, NUMBER = {85}, PAGES = {29}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus85.ps}, ABSTRACT = {We generalise (Dalrymple, Shieber and Pereira 1991)'s treatment of ellipsis to deaccenting and show that the resulting account has three main advantages. First, it predicts the interpretive similarities between ellipsis and deaccenting. Second, it captures the interaction of deaccenting and anaphora. Third, it yields a uniform treatment of sloppy identity and of its interaction with both ellipsis and deaccenting.}, ANNOTE = {COLIURL : Gardent:1997:PHD.pdf Gardent:1997:PHD.ps} } @TechReport{Gardent:1997_2, AUTHOR = {Gardent, Claire}, TITLE = {Sloppy Identity}, YEAR = {1997}, MONTH = {March}, NUMBER = {88}, PAGES = {20}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus88.ps}, ABSTRACT = {Although sloppy interpretation is usually accounted for by theories of ellipsis, it often arises in non-elliptical contexts. In this paper, a theory of sloppy interpretation is provided which captures this fact. The underlying idea is that sloppy interpretation results from a semantic constraint on parallel structures and the theory is shown to predict sloppy readings for deaccented and paycheck sentences as well as relational-, event-, and one-anaphora. It is further shown to capture the interaction of sloppy/strict ambiguity with quantification and binding. Finally, it is compared with other approaches to sloppy identity, in particular (Dalrymple, Shieber and Pereira 1991, Hardt 1996) and (Fiengo and May 1994).}, ANNOTE = {COLIURL : Gardent:1997:SIB.pdf Gardent:1997:SIB.ps} } @TechReport{Gardent:1997_3, AUTHOR = {Gardent, Claire}, TITLE = {Discourse Tree Adjoining Grammar}, YEAR = {1997}, MONTH = {April}, NUMBER = {89}, PAGES = {23}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus89.ps}, ABSTRACT = {It is generally agreed that discourse has a recursive structure and that this structure affects the semantic interpretation of discourse. Despite this consensus however, relatively few proposals give a precise specification of how the syntax of discourse relates to its semantics. In this paper, we use a variant of Feature-Based Tree Adjoining Grammars to construct discourse structure. We then show that it provides a natural account of the relation between discourse syntax and discourse semantics, and in particular that it captures some interesting cases of semantic ambiguity in discourse.}, ANNOTE = {COLIURL : Gardent:1997:DTA.pdf Gardent:1997:DTA.ps} } @TechReport{Gardent:1999, AUTHOR = {Gardent, Claire}, TITLE = {Deaccenting and Higher-Order Unification}, YEAR = {1999}, MONTH = {October}, NUMBER = {112}, PAGES = {26}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus112.ps}, ABSTRACT = {The HOU based analysis of ellipsis presented in (Dalrymple, Shieber and Pereira 1991) was shown to correctly capture the complex interaction of VP-ellipsis, scope and anaphora and claimed to extend to further related phenomena. When applied to deaccenting, the analysis makes a strong prediction, namely that all anaphors occurring in the deaccented part of a deaccented utterance are parallel anaphors that is, anaphors that resolve to their parallel counterpart in the source. I argue that this prediction is supported by the data and show that it correctly captures the interaction of deaccenting with anaphora, (in)definiteness and focus.}, ANNOTE = {COLIURL : Gardent:1999:DHO.pdf Gardent:1999:DHO.ps} } @TechReport{Gardent_Dorrepaal:1995, AUTHOR = {Gardent, Claire and Dorrepaal, Joke}, TITLE = {Reversible Discourse Processing}, YEAR = {1995}, MONTH = {May}, NUMBER = {59}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus59.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus59.dvi}, ABSTRACT = {In this paper we describe a reversible framework for discourse processing, a framework in which contextual constraints can be specified independently of the processing algorithm. We take as a starting point Scha and Polanyi's discourse grammar ([Scha/Polanyi 1988]) which is in essence a unification based grammar extended with arbitrary relations. Although such a framework can be shown to have many non properties (e.g. non monotonicity and non declarativity), we argue that it is inherently finitely reversible in the sense of [Dymetman 1991] - that is, there is a parsing/generation program for this grammar such that for any string/semantics, the program enumerates all associated semantics/strings and terminates. We show by means of examples that one and the same specification can be used both for analysis and for generation.}, ANNOTE = {COLIURL : Gardent:1995:RDP.pdf Gardent:1995:RDP.ps Gardent:1995:RDP.dvi} } @TechReport{Gardent_Kohlhase:1996_2, AUTHOR = {Gardent, Claire and Kohlhase, Michael}, TITLE = {Focus and Higher-Order Unification}, YEAR = {1996}, MONTH = {April}, NUMBER = {75}, PAGES = {6}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus75.ps}, ABSTRACT = {Pulman has shown that Higher-Order Unification (HOU) can be used to model the interpretation of focus. In this paper, we extend the unification-based approach to cases which are often seen as a test-bed for focus theory: utterances with multiple focus operators and second occurrence expressions. We then show that the resulting analysis favourably compares with two prominent theories of focus (namely, Rooth's Alternative Semantics and Krifka's Structured Meanings theory) in that it correctly generates interpretations which these alternative theories cannot yield. Finally, we discuss the formal properties of the approach and argue that even though HOU need not terminate, for the class of unification-problems dealt with in this paper, HOU avoids this shortcoming and is in fact computationally tractable.}, ANNOTE = {COLIURL : Gardent:1996:FHOb.pdf Gardent:1996:FHOb.ps} } @TechReport{Gardent_Kohlhase:1996_3, AUTHOR = {Gardent, Claire and Kohlhase, Michael}, TITLE = {Higher-Order Coloured Unification and Natural Language Semantics}, YEAR = {1996}, MONTH = {April}, NUMBER = {76}, PAGES = {9}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus76.ps}, ABSTRACT = {In this paper, we show that Higher--Order Coloured Unification -- a form of unification developed for automated theorem proving -- provides a general theory for modeling the interface between the interpretation process and other sources of linguistic, non semantic information. In particular, it provides the general theory for the Primary Occurrence Restriction which (Dalrymple et al. 1991)'s analysis called for.}, ANNOTE = {COLIURL : Gardent:1996:HOCb.pdf Gardent:1996:HOCb.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} } @TechReport{Gardent_et_al:1996_1, AUTHOR = {Gardent, Claire and Kohlhase, Michael and van Leusen, Noor}, TITLE = {Corrections and Higher-Order Unification}, YEAR = {1996}, MONTH = {May}, NUMBER = {77}, PAGES = {12}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus77.ps}, ABSTRACT = {We propose an analysis of corrections which models some of the requirements corrections place on context. We then show that this analysis naturally extends to the interaction of corrections with pronominal anaphora on the one hand, and (in)definiteness on the other. The analysis builds on previous unification--based approaches to NL semantics and relies on Higher--Order Unification with Equivalences, a form of unification which takes into account not only syntactic beta-eta-identity but also denotational equivalence. Wir schlagen eine Analyse vor, die einige der Anforderungen von Korrekturen an den Kontext modelliert und sich natuerlich auf die Interaktion von Korrekturen mit Pronominalanaphern und Undefiniertheit erweitern laesst. Die Analyse basiert auf bekannten unifikationsbasierten Ansaetzen fuer die Semantik natuerlicher Sprache und benutzt eine Erweiterung der Unifikation hoeherer Stufe. Diese beruecksichtigt nicht nur strukturelle beta-eta-Gleichheit, sondern auch logische Aequivalenz.}, ANNOTE = {COLIURL : Gardent:1996:CHOb.pdf Gardent:1996:CHOb.ps} } @TechReport{Gardent_Konrad:1999, AUTHOR = {Gardent, Claire and Konrad, Karsten}, TITLE = {Definites or the proper treatment of rabbits}, YEAR = {1999}, MONTH = {June}, NUMBER = {111}, PAGES = {12}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus111.ps}, ABSTRACT = {We argue that model generation programs, i.e., deduction systems that automatically compute the interpretations satisfying a given formula, can provide a procedural interpretation for semantic theories of natural language. We illustrate this claim by describing how the higher-order model generator kimba interprets definite descriptions.}, ANNOTE = {COLIURL : Gardent:1999:DPT.pdf Gardent:1999:DPT.ps} } @TechReport{Gardent_Webber:2000, AUTHOR = {Gardent, Claire and Webber, Bonnie}, TITLE = {Automated Reasoning and Discourse Disambiguation}, YEAR = {2000}, MONTH = {January}, NUMBER = {113}, PAGES = {24}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus113.ps}, ABSTRACT = {The performance of first-order automated reasoning systems has been steadily improving, stimulated in part by the availability of test suites of mathematical problems on which the systems can be tested, tuned and compared. But discourse understanding in Natural Language poses different inference problems than mathematics. In order to tailor automated reasoning systems to the needs of Natural Language understanding, similar test suites need to be developed. In this paper, we claim that several kinds of ambiguity in discourse can be resolved through automated reasoning checks for consistency, informativity and minimality. Future test suites should therefore include problems of these sorts. The overall goal then is to characterise the range of inference problems that discourse understanding gives rise to and that test suites should include.}, ANNOTE = {COLIURL : Gardent:2000:ARD.pdf Gardent:2000:ARD.ps} } @TechReport{Hinkelman_Spackman:1993, AUTHOR = {Hinkelman, Elizabeth and Spackman, Stephen P.}, TITLE = {Abductive Speech Act Recognition, Corporate Agents and the COSMA System}, YEAR = {1993}, NUMBER = {RR-93-31}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {http://www.cs.tufts.edu/~elizh/sard.ps}, ABSTRACT = {This chapter presents an overview of the DISCO project's solutions to several problems in natural language pragmatics. Its central focus is on relating utterances to intentions through speech act recognition. Subproblems include the incorporation of linguistic cues into the speech act recognition process, precise and efficient multiagent belief attribution models (Corporate Agents), and speech act representation and processing using Corporate Agents. These ideas are being tested within the COSMA appointment scheduling system, one application of the DISCO natural language interface. Abductive speech act processing in this environment is not far from realizing its potential for fully bidirectional implementation.}, ANNOTE = {COLIURL : Hinkelman:1993:ASA.pdf Hinkelman:1993:ASA.ps} } @TechReport{Hinkelman_et_al:1993, AUTHOR = {Hinkelman, Elizabeth and Vonerden, Markus and Jung, Christoph}, TITLE = {Natural Language Software Registry}, YEAR = {1993}, NUMBER = {D-93-10}, ADDRESS = {Saarbrücken}, TYPE = {DFKI Document}, INSTITUTION = {DFKI}, URL = {http://www.umich.edu/~archive/linguistics/software/nl.software.registry/DFKI-D-93-10.ps.Z}, ANNOTE = {COLIURL : Hinkelman:1993:NLS.pdf Hinkelman:1993:NLS.ps} } @TechReport{Jaspars:1997, AUTHOR = {Jaspars, Jan}, TITLE = {Minimal Logics for Reasoning with Ambiguous Expressions}, YEAR = {1997}, MONTH = {December}, NUMBER = {94}, PAGES = {27}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus94.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus94.dvi}, ABSTRACT = {Alshawi and Crouch defined a simple multi-valued truth-conditional semantics for quasi logical form, a representation language for underspecified expressions. We incorporate this so-called monotonic semantics within the setting of plain propositional logic, and investigate the underlying calculi. It turns out that evaluation of ambiguous expressions with respect to a partial disambiguation, that is, possible readings maybe excluded on the moment of interpretation, yields the most attractive notion of validity in this setting. Besides the fact that it satisfies characteristic criteria of 'ambiguous reasoning', the underlying logic is also a suitable candidate as a minimal calculus for this task. Natural extensions of the calculus correspond to intuitive constraints on partial disambiguations. The paper presents this calculus and different extensions in a special Gentzen format, well-equipped for reasoning with 'multiple readings'. Two technical appendices contain the completeness proofs for the various calculi.}, ANNOTE = {COLIURL : Jaspars:1997:MLR.pdf Jaspars:1997:MLR.ps} } @TechReport{Karger:1991, AUTHOR = {Karger, Reinhard}, TITLE = {Der morphologische Komparativ in der Nominalphrase}, YEAR = {1991}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Karger:1992, AUTHOR = {Karger, Reinhard}, TITLE = {Phrasal comparatives in HPSG}, YEAR = {1992}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Karger_et_al:1993, AUTHOR = {Karger, Reinhard and Lerner, Jean-Yves and Pinkal, Manfred}, TITLE = {Zur syntaktisch-semantischen Analyse attributiver Komparative}, YEAR = {1993}, MONTH = {March}, NUMBER = {30}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Kasper:1992, AUTHOR = {Kasper, Walter}, TITLE = {Semantische Repräsentation}, YEAR = {1992}, NUMBER = {10}, ADDRESS = {Stuttgart}, TYPE = {Arbeitspapiere des SFB 340 Sprachtheoretische Grundlagen für die Computerlinguistik}, INSTITUTION = {Institut für Maschinelle Sprachverarbeitung (IMS)} } @TechReport{Kasper_Krieger:1996_1, AUTHOR = {Kasper, Walter and Krieger, Hans-Ulrich}, TITLE = {Modularizing Codescriptive Grammars for Efficient Parsing}, YEAR = {1996}, NUMBER = {140}, ADDRESS = {Saarbrücken}, TYPE = {Verbmobil-Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/coling96.ps.gz}, ABSTRACT = {Unification-based theories of grammar allow to integrate different levels of linguistic descriptions in the common framework of typed feature structures. Dependencies among the levels are expressed by coreferences. Though highly attractive theoretically, using such codescriptions for analysis creates problems of efficiency. We present an approach to a modular use of codescriptions on the syntactic and semantic level. Grammatical analysis is performed by tightly coupled parsers running in tandem, each using only designated parts of the grammatical description. In the paper we describe the partitioning of grammatical information for the parsers and present results about the performance.}, ANNOTE = {COLIURL : Kasper:1996:MCGb.pdf Kasper:1996:MCGb.ps} } @TechReport{Kasper_Krieger:1996_3, AUTHOR = {Kasper, Walter and Krieger, Hans-Ulrich}, TITLE = {Integration of Prosodic and Grammatical Information in the Analysis of Dialogs}, YEAR = {1996}, NUMBER = {141}, ADDRESS = {Saarbrücken}, TYPE = {Verbmobil-Report}, INSTITUTION = {DFKI}, URL = {http://www.dfki.de/cgi-bin/verbmobil/htbin/decode.cgi/share/VM-depot/FTP-SERVER/vm-reports/report-141-96.ps.gz}, ABSTRACT = {The analysis of spoken dialogs requires the analysis of complete multi-sentence turns. Especially, the segmentation of turns in sentential or phrasal segments is a problem. In this paper we present a system for turn analysis. It is based on an extension of HPSG grammar for turns and takes into account extra-linguistic prosodic information. We show how this information can be integrated and represented in the grammar, and how it is used to reduce the search space in parsing.}, ANNOTE = {COLIURL : Kasper:1996:IPGb.pdf Kasper:1996:IPGb.ps} } @TechReport{Kasper_et_al:1996, AUTHOR = {Kasper, Walter and Krieger, Hans-Ulrich and Spilker, Jörg and Weber, Hans}, TITLE = {From Word Hypotheses to Logical Form: An Efficient Interleaved Approach}, YEAR = {1996}, NUMBER = {142}, ADDRESS = {Saarbrücken}, TYPE = {Verbmobil-Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/konvens96.ps.gz}, ABSTRACT = {This paper revisits word lattice parsing whose task is to find a plausible semantic interpretation for a given utterance. Our approach of interleaved search and analysis is designed to break the frontier of toy applications. The framework is implemented in two interacting modules, running in parallel. Instead of simply parsing a word lattice, we rather do tree decoding with a probabilistic approximation of a given grammar, employing a beam search strategy. Logical form is build up in tandem according to the decoded derivation histories, using a codescriptive HPSG grammar for dialog turns. In diesem Papier betrachten wir auf neue Weise Wortgraphenparsing, dessen Aufgabe es ist, eine plausible semantische Interpretation fuer eine gegebene Aufforderung zu finden. Unser Ansatz von ueberlagerter Suche und Analyse ist mit dem Ziel entwickelt worden, die Grenzen von Spielapplikationen zu durchbrechen. Das System ist in zwei interagierenden, parallel arbeitenden Modulen implementiert. Anstatt einen Wortgraphen direkt zu parsen, dekodieren wir Baeume mit einer probabilistischen Approximation einer gegebene Grammatik unter Verwendung einer Strahlensuche. Logische Form wird gemaess den Ableitungshistorien gleichzeitig mit aufgebaut, wobei eine HPSG Grammatik fuer Dialoge eingesetzt wird.}, ANNOTE = {COLIURL : Kasper:1996:WHLb.pdf Kasper:1996:WHLb.ps} } @TechReport{Kerber_Kohlhase:1997, AUTHOR = {Kerber, Manfred and Kohlhase, Michael}, TITLE = {Reasoning without Believing: On the Mechanization of Presuppositions and Partiality}, YEAR = {1997}, MONTH = {September}, NUMBER = {CSRP-97-23}, ADDRESS = {Birmingham}, TYPE = {Technical Report}, INSTITUTION = {University of Birmingham, School of Computer Science}, URL = {ftp://ftp.cs.bham.ac.uk/pub/tech-reports/1997/CSRP-97-23.ps.gz}, ABSTRACT = {It is well-known that many relevant aspects of everyday reasoning based on natural language cannot be adequately expressed in classical first-order logic. In this paper we address two of the problems, firstly that of so-called presuppositions, expressions from which it is possible to draw implicit conclusion, which classical logic normally does not warrant, and secondly the related problem of partiality and the adequate treatment of undefined expressions. In natural language, presuppositions are quite common, they can, however, only insufficiently be modeled in classical first-order logic. For instance, in the case of universal quantification one normally uses restrictions in natural language and presupposes that these restrictions are non-empty, while in classical logic it is only assumed that the whole universe is non-empty. On the other hand, all constants mentioned in classical logic are presupposed to exist, while it makes no problems to speak about hypothetical objects in everyday language. Similarly, undefined expressions can be handled in natural language discourses and utterances are not only classified into the two categories 'true' and 'false'. This has led to the development of various better-suited many-valued logics. By combining different approaches we can now give a static description of presuppositions and undefinedness within the same framework. Additionally, we have developed an efficient mechanization of the induced consequence relation (which has been missing in the literature) by combining methods from many-valued truth-functional logics and sort techniques developed for search control in automated theorem proving.}, ANNOTE = {COLIURL : Kerber:1997:RBM.pdf Kerber:1997:RBM.ps} } @TechReport{Kiefer_Fettig:1995, AUTHOR = {Kiefer, Bernd and Fettig, Thomas}, TITLE = {FEGRAMED - An Interactive Graphics Editor for Feature Structures}, YEAR = {1995}, NUMBER = {RR-95-06}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/fegramed.ps.gz ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1995/RR-95-06.ps.gz}, ABSTRACT = {This paper describes a tool for supporting grammar development in those linguistic frameworks which employ some constraint-based formalism, such as LFG (Lexical Functional Grammar), HPSG (Head-Driven Phrase Structure Grammar), FUG (Functional Unification Grammar) and CUG (Categorial Unification Grammar). These approaches have in common that all or at least a substantial part of the grammar (such as rules, lexical entries, node labels etc.) is represented as sets of attribute-value pairs. In LISP or Prolog the structures can be internally represented as lists, but it is much more convenient and sometimes even indispensable to use graphical representations when developing grammars. During grammar processing, feature structures can become quite large (up to several thousand nodes), such that a customized view of the feature structure, which allows to selectively focus on relevant parts, becomes essential. Fegramed provides a fully interactive editor for developing, maintaining and viewing feature structures. It is a tool that is built to cope with the complexity of feature structures in grammar development and use.}, ANNOTE = {COLIURL : Kiefer:1995:FIG.pdf Kiefer:1995:FIG.ps} } @TechReport{Kiefer_et_al:1997, AUTHOR = {Kiefer, Bernd and Netter, Klaus and Neumann, Günter and Uszkoreit, Hans}, TITLE = {PARADICE - Parameterizable Discourse Core Engine}, YEAR = {1997}, NUMBER = {R:S97-223}, ADDRESS = {Saarbrücken}, TYPE = {DFKI-Report}, INSTITUTION = {DFKI}, URL = {http://www.dfki.de/dfkibib/publications/docs/Kiefer_1997_PPDCE.pdf}, ANNOTE = {COLIURL : Kiefer:1997:PPD.pdf} } @TechReport{Kipper_et_al:1995, AUTHOR = {Kipper, Bernhard and Brants, Thorsten and Plach, Marcus and Schäfer, Ralph}, TITLE = {Bayessche Netze: Ein einführendes Beispiel}, YEAR = {1995}, NUMBER = {Nr. 4}, ADDRESS = {Saarbrücken}, TYPE = {Bericht des Graduiertenkolleg Kognitionswissenschaft}, INSTITUTION = {Universität des Saarlandes}, URL = {https://www.coli.uni-saarland.de/~thorsten/publications/Kipper-ea-GKK4.pdf}, ABSTRACT = {Bayessche Netze stellen einen vielbeachteten Formalismus zur Repräsentation und Verarbeitung von unsicherem Wissen dar. Zum Formalismus der Bayesschen Netze existieren zwar einige einführende Arbeiten; was diesen Einführungen jedoch fehlt, ist eine Illustration der innerhalb von Bayesschen Netzen verwendeten Mechanismen an Hand konkreter (Zahlen-)Beispiele. Mit der vorliegenden Arbeit soll genau diese Lücke geschlossen werden: Die grundlegende Struktur Bayesscher Netze wird durch die Modellierung eines Beispielszenarios erläutert. In dem daraus resultierenden Beispielnetz werden ferner die probabilistischen Methoden, die bei Bayesschen Netzen Anwendung finden, mit konkreten Zahlenwerten durchgerechnet.}, ANNOTE = {COLIURL : Kipper:1995:BNE.pdf} } @TechReport{Klein_Dickmann:1992, AUTHOR = {Klein, Judith and Dickmann, Ludwig}, TITLE = {DiTo-Datenbank. Dokumentation zu Verbrektion und Koordination}, YEAR = {1992}, NUMBER = {D-92-04}, ADDRESS = {Saarbrücken}, TYPE = {DFKI Document}, INSTITUTION = {DFKI} } @TechReport{Kohlhase_Kuschert:1997_1, AUTHOR = {Kohlhase, Michael and Kuschert, Susanna}, TITLE = {Dynamic Lambda Calculus}, YEAR = {1997}, MONTH = {September}, NUMBER = {91}, PAGES = {29}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS Report}, INSTITUTION = {Universität des Saarlandes}, URL = {http://ftp.coli.uni-sb.de/claus91.ps http://ftp.coli.uni-sb.de/claus91.dvi}, ABSTRACT = {The goal of this paper is to lay a logical foundation for discourse theories by providing an algebraic foundation of compositional formalisms for discourse semantics as an analogon to the simply typed Lambda-calculus. Just as that can be specialized to type theory by simply providing a special type for truth values and postulating the quantifiers and connectives as constants with fixed semantics, the proposed dynamic Lambda-calculus DLC can be specialized to Lambda-DRT by essentially the same measures, yielding a much more principled and modular treatment of Lambda-DRT than before, which is also expected to provide a conceptually simple basis for studying higher-order unification for compositional discourse theories. N.B.: After printing we realised that alpha-conversion as defined here is not yet correct; we will publish an improved version soon.}, ANNOTE = {COLIURL : Kohlhase:1997:DLCb.pdf} } @TechReport{Koller_Niehren:1999, AUTHOR = {Koller, Alexander and Niehren, Joachim}, TITLE = {Scope Underspecification and Processing}, YEAR = {1999}, TYPE = {Reader for the ESSLLI summer school}, URL = {http://www.ps.uni-sb.de/~niehren/ESSLLI99/ ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/ESSLLI:99.ps.gz}, ABSTRACT = {This reader contains material for the ESSLLI '99 course, Scope Underspecification and Processing''. The reader and course are aimed at a pretty broad audience; we have tried to only presuppose a very general idea of natural language processing and of first-order logic. Underspecification is a general approach to dealing with ambiguity. In the course, we'll be particularly concerned with scope underspecification, which deals with scope ambiguity, a structural ambiguity of the semantics of a sentence. As scope underspecification is at least partially motivated by computational issues, we will pay particular attention to processing aspects. We're going to show how dominance constraints can be used for scope underspecification and how they can be processed efficiently by using concurrent constraint programming technology.}, ANNOTE = {COLIURL : Koller:1999:SUP.pdf Koller:1999:SUP.ps} } @TechReport{Krieger:1993, AUTHOR = {Krieger, Hans-Ulrich}, TITLE = {Derivation Without Lexical Rules}, YEAR = {1993}, MONTH = {June}, NUMBER = {RR-93-27}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/paper.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/paper.entry}, ANNOTE = {COLIURL : Krieger:1993:DLR.pdf Krieger:1993:DLR.ps} } @TechReport{Krieger:1994, AUTHOR = {Krieger, Hans-Ulrich}, TITLE = {Typed Feature Formalisms as a Common Basis for Linguistic Specification}, YEAR = {1994}, NUMBER = {RR-94-39}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-39.ps.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-39.dvi.Z}, ANNOTE = {COLIURL : Krieger:1994:TFF.pdf Krieger:1994:TFF.ps Krieger:1994:TFF.dvi} } @TechReport{Krieger:1995_2, AUTHOR = {Krieger, Hans-Ulrich}, TITLE = {Typed Feature Structures, Definite Equivalences, Greatest Model Semantics, and Nonmonotonicity}, YEAR = {1995}, NUMBER = {RR-95-20}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/GFS4TFS.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/GFS4TFS.entry}, ANNOTE = {COLIURL : Krieger:1995:TFSb.pdf Krieger:1995:TFSb.ps} } @TechReport{Krieger:1995_5, AUTHOR = {Krieger, Hans-Ulrich}, TITLE = {Classification and Representation of Types in TDL}, YEAR = {1995}, NUMBER = {RR-95-17}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kruse-llncs.ps.gz ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1995/RR-95-17.ps.gz}, ABSTRACT = {TDL is a typed feature-based representation language and inference system, specifically designed to support highly lexicalized constraint-based grammar theories. Type definitions in TDL consist of type and feature constraints over the full Boolean connectives together with coreferences, thus making TDL Turing-complete. TDL provides open- and closed-world reasoning over types. Working with partially as well as with fully expanded types is possible. Efficient reasoning in tdl is accomplished through specialized modules. In this paper, we will highlight the type/inheritance hierarchy module of TDL and show how we represent conjunctively and disjunctively defined types. Negated types and incompatible types are handled by specialized bottom symbols. Redefining a type only leads to the redefinition of the dependent types, and not to the redefinition of the whole grammar/lexicon. Undefined types are nothing special. Reasoning over the type hierarchy is partially realized by a bit vector encoding of types, similar to the one used in Ait-Kaci's LOGIN. However, the underlying semantics does not harmonize with the open-world assumption of TDL. Thus, we have to generalize the GLB/LUB operation to account for this fact. The system, as presented in the paper, has been fully implemented in Common Lisp and is an integrated part of a large NL system. It has been installed and successfully employed at other sites and runs on various platforms.}, ANNOTE = {COLIURL : Krieger:1995:CRTa.pdf Krieger:1995:CRTa.ps} } @TechReport{Krieger_Nerbonne:1991, AUTHOR = {Krieger, Hans-Ulrich and Nerbonne, John}, TITLE = {Feature-Based Inheritance Networks for Computational Lexicons}, YEAR = {1991}, NUMBER = {RR-91-31}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-91-31.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-91-31.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-91-31.ps.Z}, ANNOTE = {COLIURL : Krieger:1991:FBIb.pdf Krieger:1991:FBIb.ps} } @TechReport{Krieger_Schäfer:1993_1, AUTHOR = {Krieger, Hans-Ulrich and Schäfer, Ulrich}, TITLE = {TDL ExtraLight User's Guide}, YEAR = {1993}, NUMBER = {D-93-09}, ADDRESS = {Saarbrücken}, TYPE = {DFKI Document}, INSTITUTION = {DFKI}, URL = {ftp://ftp.dfki.uni-kl.de/pub/Publications/Documents/1993/D-93-09.ps.gz http://www.dfki.de/dfkibib/publications/docs/tdl-el.ps ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/127.entry}, ABSTRACT = {This paper serves as a user's guide to the first version of the description language TDL used for the specification of linguistic knowledge in the DISCO project of the DFKI.}, ANNOTE = {COLIURL : Krieger:1993:TEU.pdf Krieger:1993:TEU.ps} } @TechReport{Krieger_Schäfer:1994_1, AUTHOR = {Krieger, Hans-Ulrich and Schäfer, Ulrich}, TITLE = {TDL - A Type Description Language for HPSG. Part 1: Overview}, YEAR = {1994}, NUMBER = {RR-94-37}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-37.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-37.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-37.ps.Z}, ANNOTE = {COLIURL : Krieger:1994:TTDb.pdf Krieger:1994:TTDb.ps Krieger:1994:TTDb.dvi} } @TechReport{Krieger_Schäfer:1994_2, AUTHOR = {Krieger, Hans-Ulrich and Schäfer, Ulrich}, TITLE = {TDL - A Type Description Language for HPSG. Part 2: User Guide}, YEAR = {1994}, NUMBER = {D-94-14}, ADDRESS = {Saarbrücken}, TYPE = {DFKI Document}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/D-94-14.ps.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/D-94-14.entry}, ANNOTE = {COLIURL : Krieger:1994:TTDc.pdf Krieger:1994:TTDc.ps} } @TechReport{Krieger_Schäfer:1995_1, AUTHOR = {Krieger, Hans-Ulrich and Schäfer, Ulrich}, TITLE = {Efficient Parameterizable Type Expansion for Typed Feature Formalisms}, YEAR = {1995}, NUMBER = {RR-95-18}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ijcai.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ijcai.entry}, ANNOTE = {COLIURL : Krieger:1995:EPTb.pdf Krieger:1995:EPTb.ps} } @TechReport{Kuschert:1996, AUTHOR = {Kuschert, Susanna}, TITLE = {Higher Order Dynamics}, YEAR = {1996}, MONTH = {January}, NUMBER = {84}, PAGES = {41}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {https://www.coli.uni-saarland.de/~kuschert/claus.ps.gz}, ANNOTE = {COLIURL : Kuschert:1996:HOD.pdf Kuschert:1996:HOD.ps} } @TechReport{Kuschert:1997_1, AUTHOR = {Kuschert, Susanna}, TITLE = {Accomodation during Anaphora Resolution}, YEAR = {1997}, MONTH = {December}, NUMBER = {92}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS Report}, INSTITUTION = {Universität des Saarlandes} } @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{Kuschert_et_al:1993, AUTHOR = {Kuschert, Susanna and Maier, Holger and Millies, Sebastian and Xu, Hui}, TITLE = {SCOLD Kurzbeschreibung}, YEAR = {1993}, ADDRESS = {Saarbrücken}, TYPE = {GuK Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Latecki_Pinkal:1990, AUTHOR = {Latecki, Longin and Pinkal, Manfred}, TITLE = {Syntactic and Semantic Conditions for Quantifier Scope}, YEAR = {1990}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Laubsch_Nerbonne:1991, AUTHOR = {Laubsch, Joachim and Nerbonne, John}, TITLE = {An Overview of NLL}, YEAR = {1991}, MONTH = {July}, ADDRESS = {Palo Alto}, TYPE = {Technical Report}, INSTITUTION = {Hewlett-Packard Laboratories} } @TechReport{Lerner:2001, AUTHOR = {Lerner, Jan}, TITLE = {Anaphern und Quantoren im elliptischen Rekonstruktionsverfahren}, YEAR = {2001}, MONTH = {December}, NUMBER = {115}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {Man kann die VP-Ellipse als rein semantisches Phänomen auffassen. Das bedeutet, daß man für die elidierte VP ein Denotat durch Zugriff auf die Bedeutung des Antezedens-Satzes bekommt. Einer zweiten Auffassung zufolge ist eine elliptische Konstruktion eine syntaktische Struktur, die implizites, d.h. phonetisch nicht realisiertes Material enthält. Unsere Arbeit besteht aus einem kritischen und einem konstruktiven Teil. Im kritischen Teil erläutern wir an konkreten Problemen die Lösungen, die bestimmte Theorien bieten können. Im konstruktiven Teil entwickeln wir eine Theorie, die die Idee aufgibt, daß Sätze mit VP-Ellipse Strukturen enthalten, die bis auf phonetisch nicht realisiertes Material vollständig sind. Wir nehmen an, daß diese Sätze interpretiert werden müssen. Der Rekonstruktionsprozeß findet sowohl auf der syntaktischen als auch auf der semantischen Ebene statt. Zuerst wird eine syntaktische Struktur rekonstruiert, die bezüglich der Skopushierarchie zwischen Quantoren und bezüglich der Koreferenz-Beziehungen nicht determiniert ist. Daraus wird eine semantische Proto-Repräsentation abgeleitet, die semantisch unterspezifiziert ist. Die semantische Ergänzung dieser Struktur erfolgt durch Regeln, die Parallelität zwischen dem Antezedens-Satz und dem elidierten Satz gewährleisten. Unsere Theorie ist auch auf Sachverhaltsanaphorik und auf Konstruktionen mit fokussierenden Gradpartikeln anwendbar.}, NOTE = {in collaboration with Petra Dünges} } @TechReport{Lerner:1991, AUTHOR = {Lerner, Jean-Yves}, TITLE = {Quantorenanhebung bei Komparativkonstruktionen}, YEAR = {1991}, MONTH = {December}, NUMBER = {18}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Lerner:1993, AUTHOR = {Lerner, Jean-Yves}, TITLE = {Die Schachtelstruktur von Satzkomparativen}, YEAR = {1993}, MONTH = {January}, NUMBER = {27}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Lerner:1994, AUTHOR = {Lerner, Jean-Yves}, TITLE = {Ellipse und Variablenbindung bei Komparativen}, YEAR = {1994}, MONTH = {July}, NUMBER = {41}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Lerner_Pinkal:1992, AUTHOR = {Lerner, Jean-Yves and Pinkal, Manfred}, TITLE = {Comparatives and Nested Quantification}, YEAR = {1992}, MONTH = {March}, NUMBER = {21}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Lerner_Pinkal:1995, AUTHOR = {Lerner, Jean-Yves and Pinkal, Manfred}, TITLE = {Comparative Ellipsis and Variable Bindings}, YEAR = {1995}, MONTH = {June}, NUMBER = {64}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus64.ps}, ABSTRACT = {In this paper, we discuss the question whether phrasal comparatives should be given a direct interpretation, or require an analysis as elliptic constructions, and answer it with Yes and No. The most adequate analysis of wide reading attributive (WRA) comparatives seems to be as cases of ellipsis, while a direct (but asymmetric) analysis fits the data for narrow scope attributive comparatives. The question whether it is a syntactic or a semantic process which provides the missing linguistic material in the complement of WRA comparatives is also given a complex answer: Linguistic context is accessed by combining a reconstruction operation and a mechanism of anaphoric reference. The analysis makes only few and straightforward syntactic assumptions. In part, this is made possible because the use of Generalized Functional Application as a semantic operation allows us to model semantic composition in a flexible way.}, ANNOTE = {COLIURL : Lerner:1995:CEVa.pdf Lerner:1995:CEVa.ps} } @TechReport{Lewin_et_al:2000, AUTHOR = {Lewin, Ian and Rupp, Christopher J. and Hieronymus, Jim and Milward, David and Larsson, Staffan and Berman, Alexander}, TITLE = {Siridus System Architecture and Interface Report}, YEAR = {2000}, MONTH = {September}, NUMBER = {6.1}, ADDRESS = {Göteborg}, TYPE = {Siridus Report}, INSTITUTION = {Göteborg University, Department of Linguistics}, URL = {http://www.ling.gu.se/projekt/siridus/Publications/deliv6-1.ps.gz}, ANNOTE = {COLIURL : Lewin:2000:SSA.pdf Lewin:2000:SSA.ps} } @TechReport{Lux:1992, AUTHOR = {Lux, Andreas}, TITLE = {A Multi-Agent Approach Towards Group Scheduling}, YEAR = {1992}, NUMBER = {RR-92-41}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI} } @TechReport{Mattern_Sturm:1989, AUTHOR = {Mattern, Friedemann and Sturm, Peter}, TITLE = {An Automated Distributed Calendar and Appointment System}, YEAR = {1989}, NUMBER = {SFB124-24/89}, ADDRESS = {Kaiserslautern}, TYPE = {Technical Report}, INSTITUTION = {University of Kaiserslautern, Department of Computer Science} } @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.} } @TechReport{Metzing_Siegel:1994, AUTHOR = {Metzing, Dieter and Siegel, Melanie}, TITLE = {Zero Pronoun Processing: Some Requirements for a VERBMOBIL System}, YEAR = {1994}, NUMBER = {46}, ADDRESS = {Bielefeld}, TYPE = {Verbmobil-Memo}, INSTITUTION = {Universität Bielefeld} } @TechReport{Millies:1990, AUTHOR = {Millies, Sebastian}, TITLE = {Ein modularer Ansatz für prinzipienbasiertes Parsing}, YEAR = {1990}, ADDRESS = {Saarbrücken}, TYPE = {GUK Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Millies:1992, AUTHOR = {Millies, Sebastian}, TITLE = {Modularity, Parallelism and Licensing in a Principle-Based Parser for German}, YEAR = {1992}, MONTH = {December}, NUMBER = {17}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {This paper presents a direct implementation of Government-Binding theory in a parser for German, which faithfully models the modular structure of the theory. The modular design yields a flexible environment, in which it is possible to define and test various versions of principles and parameters. The several modules of linguistic theory and the parser proper are interleaved in parallel fashion for early elimination of ungrammatical structures. Efficient processing of global constraints is made possible by the concept of licensing, and the use of tree indexing techniques.} } @TechReport{Millies:1992_3, AUTHOR = {Millies, Sebastian}, TITLE = {Design Requirements for Principle-Based Parsers as Flexible Research Tools}, YEAR = {1992}, ADDRESS = {Saarbrücken}, TYPE = {GuK Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Millies:1993, AUTHOR = {Millies, Sebastian}, TITLE = {Compositional Interpretation and Syntactic Information in Scold}, YEAR = {1993}, NUMBER = {2}, ADDRESS = {Saarbrücken}, TYPE = {SAMOS Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Millies:1995, AUTHOR = {Millies, Sebastian}, TITLE = {Eine modulare Architektur für die syntaktisch-semantische Analyse}, YEAR = {1995}, MONTH = {May}, NUMBER = {60}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus60.ps}, ABSTRACT = {Für die Darstellung syntaktischer Strukturen und der Art des Zugriffs darauf gibt es im wesentlichen zwei Modelle: Einerseits die integrativen Modelle, in denen eine einheitliche Datenstruktur für die Repräsentation und Manipulation der verschiedenen Ebenen bereitgestellt wird, andererseits die modularen Modelle, die verschiedene, auf die speziellen Anforderungen der Ebenen abgestimmte Formalismen bieten. In diesem Papier werden die beiden Arten von Modellen diskutiert. Es wird eine modulare Architektur vorgestellt, in der von einer genuin semantischen Ebene gezielt und in kontrollierter Weise auf semantisch relevante syntaktische Information zugegriffen wird. Die Syntax wird als abstrakter Datentyp realisiert, so daß die Semantikkonstruktion unabhängig von der konkreten Darstellung syntaktischer Information beschrieben werden kann. Für drei verschiedene Grammatikformalismen (GB, LFG, HPSG) wird die Syntax-Semantik-Schnittstelle betrachtet. Die allgemeinen Grundsätze der beschriebenen Architektur sind auf den Entwurf weiterer Schnittstellen zwischen linguistischen Teilsystemen anwendbar. Schließlich wird der Kompositionalitätsbegriff im Kontext dieses Modells problematisiert.}, ANNOTE = {COLIURL : Millies:1995:MAS.pdf Millies:1995:MAS.ps} } @TechReport{Millies_Pinkal:1991, AUTHOR = {Millies, Sebastian and Pinkal, Manfred}, TITLE = {Eine deklarative Version der DRT in typisierter Merkmalslogik}, YEAR = {1991}, MONTH = {December}, ADDRESS = {Saarbrücken}, TYPE = {GuK report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Millies_Pinkal:1993_1, AUTHOR = {Millies, Sebastian and Pinkal, Manfred}, TITLE = {Linking One Semantic Interpretation System to Different Syntactic Formalisms}, YEAR = {1993}, ADDRESS = {SaarbrückenSaarbrücken}, TYPE = {GuK Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Milward:1996, AUTHOR = {Milward, David}, TITLE = {Integrating Situations into a Theory of Discourse Anaphora}, YEAR = {1996}, MONTH = {February}, NUMBER = {74}, PAGES = {20}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus74.ps}, ABSTRACT = {This paper provides an account of definite and pronominal anaphora which draws together insights from dynamic semantics and situation semantics. The result is a dynamic semantics in which contexts consist of the parts of a scenario which have been brought to a hearer's attention. The contexts are structured by meta-level disjunction, corresponding to a set of situations where one is in attention but the hearer doesn't know which one, and meta-level conjunction corresponding to a set of situations which are simultaneously in attention. Data from bridging reference, disjunction, and telescoping is used to motivate the account, together with some of the data which has been used in the past to argue for and against situation based accounts of anaphora.}, ANNOTE = {COLIURL : Milward:1996:IST.pdf Milward:1996:IST.ps} } @TechReport{Mineur_Buitelaar:1995_1, AUTHOR = {Mineur, Anne-Marie and Buitelaar, Paul}, TITLE = {A Compositional Treatment of Polysemous Arguments in Categorial Grammar}, YEAR = {1995}, MONTH = {January}, NUMBER = {49}, PAGES = {19}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus49.ps}, ABSTRACT = {We discuss the extension of the standard logical rules (functional application and abstraction) in Categorial Grammar, in order to deal with some specific cases of polysemy. We borrow from Generative Lexicon theory which proposes the mechanism of coercion next to a rich nominal lexical semantic structure called qualia structure. In a previous paper we introduced coercion into the framework of sign-based Categorial Grammar and investigated its impact on traditional Fregean compositionality. In this paper we will elaborate on this idea, mostly working towards the introduction of a new semantic dimension. Where in current versions of sign-based Categorial Grammar only two representations are derived: a prosodic one (form) and a logical one (modelling), here we introduce also a more detailed representation of the lexical semantics. This extra knowledge will serve to account for linguistic phenomena like metonymy.}, ANNOTE = {COLIURL : Mineur:1995:CTPb.pdf Mineur:1995:CTPb.ps} } @TechReport{Moshier:1993, AUTHOR = {Moshier, M. Andrew}, TITLE = {On Completeness Theorems for Feature Logics}, YEAR = {1993}, MONTH = {April}, NUMBER = {31}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {We formulate a sequent calculus K and prove that it is sound and complete in a strong sense with respect to a class of feature structures. The proof of completeness involves proving, first, a general characterization of the conditions under which any sequent calculus (that permits unrestricted use of Gentzen's structural rules) is strongly complete with respect to a semantical interpretation. With this general characterization, we prove completeness of the sequent calculus as well as a uniform relativization of strong completeness under appropriateness conditions. This establishes various completeness theorems from the literature as applications of the results here. To demonstrate the generality of our result, we also prove, by exactly the same technique, the completeness of an intuitionistic version of the calculus with respect to a class of Kripke structures. We next turn to a proof theoretic result that is intimately related to completeness: cut elimination. We prove a version of cut elimination for the classical calculus under appropriateness conditions, and as a corollary that various fragments of the calculus are also sound and strongly complete. Finally, completeness of the fragments allows us to investigate a correspondence between certain information systems and certain calculi. With this, we show that Pereira and Shieber's Domain of Descriptions is sound and complete, but only in a weak sense, with respect to its intended semantics.} } @TechReport{Moshier_Pollard:1993, AUTHOR = {Moshier, M. Andrew and Pollard, Carl}, TITLE = {The Domain of Set-Valued Feature Structures}, YEAR = {1993}, MONTH = {November}, NUMBER = {35}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Müller_Niehren:1997, AUTHOR = {Müller, Martin and Niehren, Joachim}, TITLE = {Entailment of Set Constraints is not Feasible}, YEAR = {1997}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report}, INSTITUTION = {Universität des Saarlandes, Programming Systems Lab}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/inesInfeas.ps.gz}, ABSTRACT = {Set constraints are inclusions between expressions denoting sets of trees. They have been used extensively for type inference and program analysis. At the lower end of the expressiveness scale there are atomic set constraints and Ines constraints (inclusions over non-empty sets) for both of which a cubic time satisfiability test is known. Recently, there has been increasing interest in entailment tests for set constraints. We prove that the entailment problem of atomic set constraints is coNP-hard. We also show that the entailment problem of Ines constraints is coNP-hard. This corrects a claim of polynomial complexity presented at CP'96. Our results suggest that a complete entailment test is not feasible even for simple classes of set constraints.}, ANNOTE = {COLIURL : Muller:1997:ESC.pdf Muller:1997:ESC.ps} } @TechReport{Müller_et_al:1997_1, AUTHOR = {Müller, Martin and Niehren, Joachim and Smolka, Gert}, TITLE = {Typed Concurrent Programming with Logic Variables}, YEAR = {1997}, MONTH = {September}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report}, INSTITUTION = {Universität des Saarlandes, Programming Systems Lab}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/plain-report-97.ps.gz}, ABSTRACT = {We present a concurrent higher-order programming language called Plain and a concomitant static type system. Plain is based on logic variables and computes with possibly partial data structures. The data structures of Plain are procedures, cells, and records. Plain's type system features record-based subtyping, bounded existential polymorphism, and access modalities distinguishing between reading and writing.}, ANNOTE = {COLIURL : Muller:1997:TCP.pdf Muller:1997:TCP.ps} } @TechReport{Müller:1997, AUTHOR = {Müller, Stefan}, TITLE = {Scrambling in German - Extraction into the Mittelfeld}, YEAR = {1997}, NUMBER = {RR-97-06}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dfki-report-97-06.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dfki-report-97-06.entry}, ANNOTE = {COLIURL : Muller:1997:SGE.pdf Muller:1997:SGE.ps} } @TechReport{Müller:1997_1, AUTHOR = {Müller, Stefan}, TITLE = {Yet Another Paper about Partial Verb Phrase Fronting in German}, YEAR = {1997}, NUMBER = {RR-97-07}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dfki-report-97-07.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dfki-report-97-07.entry}, ANNOTE = {COLIURL : Muller:1997:YAP.pdf Muller:1997:YAP.ps} } @TechReport{Müller:1997_3, AUTHOR = {Müller, Stefan}, TITLE = {Complement Extraction Lexical Rules and Argument Attraction}, YEAR = {1997}, NUMBER = {RR-97-08}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dfki-report-97-08.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dfki-report-97-08.entry}, ANNOTE = {COLIURL : Muller:1997:CEL.pdf Muller:1997:CEL.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} } @TechReport{Muskens:1997, AUTHOR = {Muskens, Reinhard}, TITLE = {Program Semantics and Classical Logic}, YEAR = {1997}, MONTH = {January}, NUMBER = {86}, PAGES = {29}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus86.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus86.dvi}, ABSTRACT = {In the tradition of Denotational Semantics one usually lets program constructs take their denotations in reflexive domains, i.e. in domains where self-application is possible. For the bulk of programming constructs, however, working with reflexive domains is an unnecessary complication. In this paper we shall use the domains of ordinary classical type logic to provide the semantics of a simple programming language containing choice and recursion. We prove that the rule of Scott Induction holds in this new setting, prove soundness of a Hoare calculus relative to our semantics, give a direct calculus C on programs, and prove that the denotation of any program P in our semantics is equal to the union of the denotations of all those programs L such that P follows from L in our calculus and L does not contain recursion or choice.}, ANNOTE = {COLIURL : Muskens:1997:PSC.pdf Muskens:1997:PSC.ps} } @TechReport{Nerbonne:1992_7, AUTHOR = {Nerbonne, John}, TITLE = {A Feature-Based Syntax/ Semantics Interface}, YEAR = {1992}, NUMBER = {RR-92-42}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-42.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-42.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-42.ps.Z}, ANNOTE = {COLIURL : Nerbonne:1992:FBSb.pdf} } @TechReport{Nerbonne:1992_8, AUTHOR = {Nerbonne, John}, TITLE = {Constraint-Based Semantics}, YEAR = {1992}, NUMBER = {RR-92-18}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-18.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-18.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-18.ps.Z}, ANNOTE = {COLIURL : Nerbonne:1992:CBSb.pdf} } @TechReport{Nerbonne:1992_9, AUTHOR = {Nerbonne, John}, TITLE = {Feature-Based Lexicons: An Example and a Comparison to DATR}, YEAR = {1992}, NUMBER = {RR-92-04}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI} } @TechReport{Nerbonne:1992_10, AUTHOR = {Nerbonne, John}, TITLE = {Representing Grammar, Meaning and Knowledge}, YEAR = {1992}, NUMBER = {RR-92-20}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-18.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-18.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-18.ps.Z} } @TechReport{Nerbonne_et_al:1991, AUTHOR = {Nerbonne, John and Gawron, Jean Mark and Peters, Stanley}, TITLE = {Anaphora, Quantification and Absorption}, YEAR = {1991}, NUMBER = {CSLI-91-153}, ADDRESS = {Stanford}, TYPE = {Technical Report}, INSTITUTION = {Center for the Studies of Linguistics and Information} } @TechReport{Nerbonne_et_al:1991_2, AUTHOR = {Nerbonne, John and Gawron, Jean Mark and Peters, Stanley}, TITLE = {The Absorption Principle and E-Type Anaphora}, YEAR = {1991}, NUMBER = {RR-91-12}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI} } @TechReport{Nerbonne_et_al:1992, AUTHOR = {Nerbonne, John and Laubsch, Joachim and Diagne, Abdel Kader and Oepen, Stefan}, TITLE = {Natural Language Semantics and Compiler Technology}, YEAR = {1992}, NUMBER = {RR-92-55}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI} } @TechReport{Nerbonne_et_al:1991_4, AUTHOR = {Nerbonne, John and Netter, Klaus and Diagne, Abdel Kader and Dickmann, Ludwig and Klein, Judith}, TITLE = {A Diagnostic Tool for German Syntax}, YEAR = {1991}, NUMBER = {RR-91-18}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-91-18.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-91-18.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-91-18.ps.Z}, ANNOTE = {COLIURL : Nerbonne:1991:DTGb.pdf} } @TechReport{Netter:1991, AUTHOR = {Netter, Klaus}, TITLE = {Clause Union and Verb Raising Phenomena in German}, YEAR = {1991}, NUMBER = {RR-91-21}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kn91dyana.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kn91dyana.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kn91dyana.ps.Z} } @TechReport{Netter_Wegst:1999, AUTHOR = {Netter, Klaus and Wegst, Tillmann}, TITLE = {Project Update: DiET - Diagnostic and Evaluation Tools for Natural Language Application}, YEAR = {1999}, NUMBER = {8.2}, PAGES = {8-9}, ADDRESS = {Brighton, Sussex}, TYPE = {ELSNews}, INSTITUTION = {European Network in Language and Speech}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kn-tw-elsnews99.ps ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kn-tw-elsnews99.pdf}, ANNOTE = {COLIURL : Netter:1999:PUD.pdf Netter:1999:PUD.ps} } @TechReport{Neumann:1991_2, AUTHOR = {Neumann, Günter}, TITLE = {Reversibility and Modularity in Natural Language Generation}, YEAR = {1991}, MONTH = {June}, NUMBER = {11}, PAGES = {9}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {A thorough-going use of reversible grammars within natural language generation systems has strong implications for the separation into strategic and tactical components. A central goal of this paper is to make plausible that a uniform architecture for grammatical processing will serve as a basis to achieve more flexible and efficient generation systems.} } @TechReport{Neumann:1991_3, AUTHOR = {Neumann, Günter}, TITLE = {A Bidirectional Model for Natural Language Processing}, YEAR = {1991}, MONTH = {April}, NUMBER = {7}, PAGES = {6}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {In this paper I will argue for a model of grammatical processing that is based on uniform processing and knowledge sources. The main feature of this model is to view parsing and generation as two strongly interleaved tasks performed by a single parametrized deduction process. It will be shown that this view supports flexible and efficient natural language processing.}, ANNOTE = {COLIURL : Neumann:1991:BMNb.pdf} } @TechReport{Neumann:1996, AUTHOR = {Neumann, Günter}, TITLE = {Interleaving Natural Language Parsing and Generation Through Uniform Processing}, YEAR = {1996}, NUMBER = {RR-96-03}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ai-uta.dvi.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ai-uta.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ai-uta.ps.gz}, ANNOTE = {COLIURL : Neumann:1996:INL.pdf Neumann:1996:INL.ps Neumann:1996:INL.dvi} } @TechReport{Neumann:1997_2, AUTHOR = {Neumann, Günter}, TITLE = {An On-line Learning Method to Speed-Up Natural Language Processing}, YEAR = {1997}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report}, INSTITUTION = {DFKI}, URL = {http://www.dfki.de/~neumann/publications/new-ps/incr-ebl.ps.gz}, ANNOTE = {COLIURL : Neumann:1997:LLM.pdf Neumann:1997:LLM.ps} } @TechReport{Neumann_Finkler:1990_1, AUTHOR = {Neumann, Günter and Finkler, Wolfgang}, TITLE = {A Head-Driven Approach to Incremental and Parallel Generation of Syntactic Structures}, YEAR = {1990}, MONTH = {August}, NUMBER = {2}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {This paper describes the construction of syntactic structures within an incremental multi-level and parallel generation system. Incremental and parallel generation imposes special requirements upon syntactic description and processing. A head-driven grammar represented in a unification-based formalism is introduced which satisfies these demands. Furthermore the basic mechanisms for the parallel processing of syntactic segments are presented.} } @TechReport{Neumann_Finkler:1991, AUTHOR = {Neumann, Günter and Finkler, Wolfgang}, TITLE = {A Head-Driven Approach to Incremental and Parallel Generation of Syntactic Structures}, YEAR = {1991}, NUMBER = {RR-91-07}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, ABSTRACT = {This paper describes the construction of syntactic structures within an incremental multi-level and parallel generation system. Incremental and parallel generation imposes special requirements upon syntactic description and processing. A head-driven grammar represented in a unification-based formalism is introduced which satisfies these demands. Furthermore the basic mechanisms for the parallel processing of syntactic segments are presented.} } @TechReport{Neumann_Flickinger:1999, AUTHOR = {Neumann, Günter and Flickinger, Dan}, TITLE = {Learning Stochastic Lexicalized Tree Grammars from HPSG}, YEAR = {1999}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report}, INSTITUTION = {DFKI}, URL = {http://www.dfki.de/~neumann/publications/new-ps/sltg.ps.gz}, ANNOTE = {COLIURL : Neumann:1999:LSL.pdf Neumann:1999:LSL.ps} } @TechReport{Neumann_van Noord:1991, AUTHOR = {Neumann, Günter and van Noord, Gertjan}, TITLE = {Self-Monitoring with Reversible Grammars}, YEAR = {1991}, MONTH = {October}, PAGES = {7}, ADDRESS = {Saarbrücken}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {We describe a method and its implementation for self-monitoring during natural language generation. In situations of communication where the generation of ambiguous utterances should be avoided our method is able to compute an unambiguous utterance for a given semantic input. The proposed method is based on a very strict integration of parsing and generation. During the monitored generation step, a previously generated (possibly) ambiguous utterance is parsed and the obtained alternative derivation trees are used as a guide for re-generating the utterance. To achieve such an integrated approach the underlying grammar should be reversible.}, ANNOTE = {COLIURL : Neumann:1991:SMR.pdf} } @TechReport{Niehren:1995, AUTHOR = {Niehren, Joachim}, TITLE = {Functional Computation as Concurrent Computation}, YEAR = {1995}, NUMBER = {RR-95-14}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI} } @TechReport{Niehren:1999, AUTHOR = {Niehren, Joachim}, TITLE = {Uniform Confluence in Concurrent Computation}, YEAR = {1999}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report}, INSTITUTION = {Universität des Saarlandes, Programming Systems Lab}, URL = {http://www.ps.uni-sb.de/Papers/abstracts/Uniform:2000.html ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Uniform-97.ps.gz}, ABSTRACT = {Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the successful actor is indeterministic. As a consequence, the execution of a concurrent program may be nonconfluent. Even worse, most observables (termination, computational result, and time complexity) typically depend on the scheduling of actors created during program execution. This property contrast concurrent programs from purely functional programs. A functional program is uniformly confluent in the sense that all its possible executions coincide modulo reordering of execution steps. In this paper, we investigate concurrent programs that are uniformly confluent and their relation to eager and lazy functional programs. We study uniform confluence in concurrent computation within the applicative core of the $pi$-calculus which is widely used in different models of concurrent programming (with interleaving semantics). In particular, the applicative core of the $pi$-calculus serves as a kernel in foundations of concurrent constraint programming with first-class procedures (as provided by the programming language Oz). We model eager functional programming in the $lambda$-calculus with weak call-by-value reduction and lazy functional programming in the call-by-need amming in the $lambda$-calculus with standard reduction. As a measure of time complexity, we count application steps. We encode the $lambda$-calculus with both above reduction strategies into the applicative core of the $pi$-calculus and show that time complexity is preserved. Our correctness proofs employs a new technique based on uniform confluence and simulations. The strength of our technique is illustrated by proving a folk theorem, namely that the call-by-need complexity of a functional program is smaller than its call-by-value complexity.}, ANNOTE = {COLIURL : Niehren:1999:UCC.pdf Niehren:1999:UCC.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} } @TechReport{Niehren_Priesnitz:1999, AUTHOR = {Niehren, Joachim and Priesnitz, Tim}, TITLE = {Characterizing Subtype Entailment in Automata Theory}, YEAR = {1999}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report}, INSTITUTION = {Universität des Saarlandes}, URL = {http://www.ps.uni-sb.de/Papers/abstracts/pauto.html ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/pauto.ps.gz}, ABSTRACT = {Subtype entailment is the entailment problem of subtype constraints for some type language. Understanding the algorithmic properties of subtype entailment is relevant to several subtype inference systems. For simple types, subtype entailment is coNP complete; when extended with recursive types it becomes PSPACE complete. Adding the least and greatest type renders subtyping non-structural. Whether non-structural subtype entailment is decidable is a prominent open problem. We characterize subtype entailment in automata theory. This yields a uniform proof method by which all known complexity results on subtype entailment in the literature can be derived. The main contribution of the paper is an equivalent characterization of non-structural subtype entailment in automata theory (by so called P-automata). On the one hand side, our characterization implies that several variants of non-structural subtype entailment are polynomial time equivalent (with or without contravariant function types or recursive types). This robustness result is new and nontrivial. On the other hand side, we believe that our characterization contributes an important and necessary step towards answering the open question on decidability of non-structural subtype entailment.}, ANNOTE = {COLIURL : Niehren:1999:CSE.pdf Niehren:1999:CSE.ps} } @TechReport{Oepen:1994, AUTHOR = {Oepen, Stefan}, TITLE = {German Nominal Syntax in HPSG: On Syntactic Categories and Syntagmatic Relations}, YEAR = {1994}, NUMBER = {D-94-15}, ADDRESS = {Saarbrücken}, TYPE = {DFKI Document}, INSTITUTION = {DFKI}, URL = {ftp://ftp.dfki.uni-kl.de/pub/Publications/Documents/1994/D-94-15.ps.gz}, ANNOTE = {COLIURL : Oepen:1994:GNS.pdf Oepen:1994:GNS.ps} } @TechReport{Oepen_et_al:1996, AUTHOR = {Oepen, Stefan and Fouvry, Frederik and Netter, Klaus and Fettig, Tom and Oberhauser, Fred}, TITLE = {TSNLP User Manual. Volume 2: Core Test Suite Technology}, YEAR = {1996}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report}, INSTITUTION = {DFKI}, URL = {ftp://ftp.coli.uni-sb.de/tsnlp/manual/volume2.ps.gz}, ANNOTE = {COLIURL : Oepen:1996:TUM.pdf Oepen:1996:TUM.ps} } @TechReport{Oepen_Sablayrolles:1992, AUTHOR = {Oepen, Stefan and Sablayrolles, Pierre}, TITLE = {COSMA Internal Representation Language}, YEAR = {1992}, ADDRESS = {Saarbrücken}, TYPE = {Technical Notes} } @TechReport{Oliva:1991, AUTHOR = {Oliva, Karel}, TITLE = {On Cases of Fixed Word Order in a Free Word Order Language}, YEAR = {1991}, MONTH = {November}, NUMBER = {14}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {The main stress of this paper will be put on description and explanation of certain phenomena concerning the crossing dependencies (non-projective constructions), but some more general implications of the proposals contained will be mentioned as well. To this end, two recent approaches to the problem will be reviewed and compared, which comparison creates actually the very core of the paper. The first of the appraches to description of crossing dependencies is presented in the paper On Head Non-Movement by Pollard. This approach tries to implant the crossing into the (syntactic) structure. To achieve this goal, it uses means resulting in changing the intuitive subcategorization requirements of words and phrases involved - actually a non-transformational analog of raising. The second approach, put forward in the paper by Reape A Theory of Word Order And Discontinuous Constituency in West Continental Germanic, keeps the immediate dominance relations (expressing subcategorization, among other) intact, and aims at describing the crossing phenomena by means of non-concatenative phonology. Unsurprisingly, it can be shown that, in the general case, neither of them is to be considered satisfactory alone, and that only a reasonable combination of the two can be hoped to cover the full range of data. Nevertheless, one of the approaches will be shown to be superior to the other as to description of their syntactically interesting part. Later some refinements and changes of this approach will be proposed (together with their motivations), with the aim of making the theory fit better the empirical data. The sketched approach is illustrated on certain constructions from German and Czech.} } @TechReport{Oliva:1992_1, AUTHOR = {Oliva, Karel}, TITLE = {Expressing Linguistic Knowledge in STUF'91 (manual of the formalism)}, YEAR = {1992}, NUMBER = {206}, TYPE = {IWBS Report}, INSTITUTION = {IBM} } @TechReport{Oliva:1992_2, AUTHOR = {Oliva, Karel}, TITLE = {Word Order Constraints in Binary Branching Syntactic Structures}, YEAR = {1992}, MONTH = {February}, NUMBER = {20}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {This paper describes a possibility of expressing ordering constraints among non-sister constituents in binary branching syntactic structures on a local basis, supported by viewing the binary branching structure as a list (rather than a tree) of constituents within HPSG-style grammars. The core idea of such a description of ordering is constituted by creating a type hierarchy for lists. The possibilities of expressing different approaches to word order in the framework are briefly discussed, exemplified and compared to other methods.} } @TechReport{Oliva:1993, AUTHOR = {Oliva, Karel}, TITLE = {String Processing and Text-to-Tree(s) Transformation Tools (manual of the formalism)}, YEAR = {1993}, ADDRESS = {Saarbrücken}, TYPE = {Report of the Project LATESLAV}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Oliva:1994_1, AUTHOR = {Oliva, Karel}, TITLE = {Parsing with Syntactic Lists: Linguistic Intuition, Formal Algorithm, Computer Implementation}, YEAR = {1994}, ADDRESS = {Saarbrücken}, TYPE = {Report of the Project LATESLAV}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Oliva:1994_2, AUTHOR = {Oliva, Karel}, TITLE = {HPSG Lexicon without Lexical Rules}, YEAR = {1994}, MONTH = {April}, NUMBER = {38}, PAGES = {7}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {The paper introduces an alternative to the lexical rules in a lexicon in a HPSG style by replacing them by relational constraints corresponding more directly to the standard lexicographic and morphological practice.} } @TechReport{Oliva:1999, AUTHOR = {Oliva, Karel}, TITLE = {Formal Complexity of Word Order: Linguistic-theoretical Considerations}, YEAR = {1999}, MONTH = {June}, NUMBER = {110}, PAGES = {27}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus110.ps}, ABSTRACT = {In this paper, we review the traditional term word order freedom and show that it can be understood in two ways: first, as the freedom of order of elements within a continuous head domain, and second, as the freedom of extraction out of a finite head domain, that is, as the freedom of making head domain(s) discontinuous. Further on, we concentrate on the more linguistical aspects of the latter understanding. In particular, we compare the pair of languages Czech and English, whose considerably different status as to the severity of constraints on ordering of elements within a continuous head domain of the finite verb is notorious, and aim this comparison at the possibilities which these languages offer for discontinuity of head domains. In this respect, we demonstrate that the two possible ways of understanding of word order freedom correlate, that is to say that English with its rather fixed order freedom within a continuos head domain also imposes severe constraints on extraction out of these domains, while Czech with its almost free order within a domain is also much more liberal as to extraction. The paper contains a longer discussion of this issue, together with a number of relevant examples from both languages.}, ANNOTE = {COLIURL : Oliva:1999:FCW.pdf Oliva:1999:FCW.ps} } @TechReport{Paritong:1992, AUTHOR = {Paritong, Maike}, TITLE = {Constituent Coordination in HPSG}, YEAR = {1992}, MONTH = {July}, NUMBER = {24}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {http://www.dfki.de/dfkibib/publications/docs/Paritong_1992_CCIH.pdf}, ABSTRACT = {In this paper we propose a treatment of constituent coordination within the framework of Head-driven Phrase Structure Grammar (HPSG). In contrast to former approaches which assume that a coordinated structure is either a headless or a multi-headed structure, we take the position that the conjunction is a functional category which functions as the head of the coordinate phrase. Under this assumption, the internal structure of ordinary and complex coordinate constitiuents can be described with the existing inventory of principles and rules in HPSG. Coordination of unsaturated conjuncts is controlled by the lexical entry for the conjunction and without any additional rules or modifications.}, ANNOTE = {COLIURL : Paritong:1992:CCH.pdf} } @TechReport{Pechmann_et_al:1994, AUTHOR = {Pechmann, Thomas and Uszkoreit, Hans and Engelkamp, Johannes and Zerbst, Dieter}, TITLE = {Word Order in the German Middle Field: Linguistic Theory and Psycholinguistic Evidence}, YEAR = {1994}, MONTH = {August}, NUMBER = {43}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {http://www.dfki.de/dfkibib/publications/docs/Pechmann_1994_WOIGMF.pdf}, ABSTRACT = {This paper deals with linearization of complements of German verbs. In German all permutations of the subject, the indirect, and the direct object do occur. Yet, they are supposed to differ regarding their degree of acceptability. Uszkoreit (1987) proposed a set of rules which aimed at representing such preferences as the product of different factors. This theoretical account leads to a predicted ranking of the possible syntactic forms. In a set of experiments we tested some of these predictions by application of different methods for tapping into the actual processing of the sentences. In particular, the predictions were (a) that sentences are more acceptable if subjects precede objects than vice versa and (b) that sentences are more acceptable if indirect objects precede direct objects than vice versa. Both comprehension and production experiments were carried out. The methods we used included a ranking task, delayed sentence matching, delayed articulation, rapid serial visual presentation and a sentence generation task. The findings yielded a very consistent picture concerning the position of the subject. Sentences were particularly easy to process if the subject was in initial position and particularly hard to process in subject-final constructions. Furthermore, there is somewhat weaker evidence for the assumption that sentences are easier to process if direct objects are preceded by indirect objects. Since these results were obtained by rather different methods they can be regarded as particularly reliable. Moreover, the data did provide evidence for a gradual increase or decrease of acceptability and no evidence for a jump function, sharply separating grammatical from ungrammatical forms. One of the principal aims of this first phase of our investigations which is reported in the present paper was to find experimental methods which consistently differentiate between the various permutations of verb complements as predicted by theoretical assumptions. This aim could be achieved. The next step will be to include pragmatic factors which are supposed to play a significant role in determining the acceptability of the sentences we are studying.}, ANNOTE = {COLIURL : Pechmann:1994:WOG.pdf} } @TechReport{Pinkal:1991, AUTHOR = {Pinkal, Manfred}, TITLE = {On the Syntactic-Semantic Analysis of Bound Anaphora}, YEAR = {1991}, MONTH = {February}, NUMBER = {6}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {Two well-known phenomena in the area of pronoun binding are considered: ndirect binding of pronouns by indefinite NPs (donkey sentences) and surface-syntactic constraints on binding (weak cross-over). A common treatment is proposed, and general consequences for the relation between syntactic and semantic processing are discussed. It is argued that syntactic and semantic analysis must interact in a complex way, rather than in a simple sequential or strict rule-to-rule fashion.}, ANNOTE = {COLIURL : Pinkal:1991:SSAa.pdf} } @TechReport{Pinkal:1993, AUTHOR = {Pinkal, Manfred}, TITLE = {Semantikformalismen für die Sprachverarbeitung}, YEAR = {1993}, MONTH = {January}, NUMBER = {26}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {The paper gives an introduction into logic-based formalisms for semantic representation in Natural Language Processing. It discusses First-Order Predicate Logic, Type Theory, Montague's Intensional Logic and Discourse Representation Theory as the most influential formalisms. For each of them, motivating NL examples are presented and discussed. The paper concludes with a short survey of alternative semantic formalisms that have been proposed recently.} } @TechReport{Pinkal:1996, AUTHOR = {Pinkal, Manfred}, TITLE = {Radical Underspecification}, YEAR = {1996}, MONTH = {February}, NUMBER = {72}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Pinkal:1996_1, AUTHOR = {Pinkal, Manfred}, TITLE = {Constraints for Semantic Underspecification}, YEAR = {1996}, MONTH = {February}, NUMBER = {73}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Pinkal:1996_3, AUTHOR = {Pinkal, Manfred}, TITLE = {Vagueness, Ambiguity and Underspecification}, YEAR = {1996}, MONTH = {September}, NUMBER = {82}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {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} } @TechReport{Pinkal_Millies:1992, AUTHOR = {Pinkal, Manfred and Millies, Sebastian}, TITLE = {An Autonomous, Syntax-Sensitive Module for Semantic Interpretation}, YEAR = {1992}, ADDRESS = {Saarbrücken}, TYPE = {GUK Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Piskorski:2002, AUTHOR = {Piskorski, Jakub}, TITLE = {Finite-State Machine Toolkit}, YEAR = {2002}, NUMBER = {RR-02-04}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report}, INSTITUTION = {DFKI}, URL = {http://www.dfki.de/dfkibib/publications/docs/Piskorski_2002_DFSMTK.pdf}, ABSTRACT = {Finite-state devices such as finite-state automata and finite-state transducers have been known since the emergence of computer science and are recently extensively used in many areas of language technology. The use of finite-state devices is mainly motivated by their time and space efficiency. In this paper we present the Finite-State Machine Toolkit for building, combining and optimizing the finite-state machines, developed at the Language Technology Lab of the German Research Cener for Artficial Intelligence.}, ANNOTE = {COLIURL : Piskorski:2002:FSM.pdf} } @TechReport{Podelski_et_al:1997, AUTHOR = {Podelski, Andreas and Charatonik, Witold and Müller, Martin}, TITLE = {Set-Based Error Diagnosis of Concurrent Constraint Programs}, YEAR = {1997}, MONTH = {December}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report}, INSTITUTION = {Universität des Saarlandes}, URL = {http://www.ps.uni-sb.de/Paper/abstracts/Diagnosis-97.html ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Diagnosis-97.ps.gz}, ABSTRACT = {We present an automated method for the static prediction of the run-time error 'deadlock or failure' in concurrent constraint programs. The method is based on a new set-based analysis of reactive logic programs which computes an approximation of the greatest-model semantics. Semantically, the method is based on the connection between the inevitability of 'deadlock or failure' in concurrent constraint programs, finite failure in logic programming and the greatest-model semantics over infinite trees.}, ANNOTE = {COLIURL : Podelski:1997:SBE.pdf Podelski:1997:SBE.ps} } @TechReport{Prescher:2001_1, AUTHOR = {Prescher, Detlef}, TITLE = {Inside-Outside Estimation Meets Dynamic EM - GOLD}, YEAR = {2001}, NUMBER = {RR-01-02}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {http://www.dfki.de/~prescher/papers/bib/2001dfki_report.prescher.pdf}, ABSTRACT = {It is an interesting fact that most of the stochastic models used by linguists can be interpreted as probabilistic context-free grammars. In this paper, this result will be accompanied by the formal proof that the inside-outside algorithm, the standard training method for probabilistic context-free grammars, can be regarded as a dynamic-programming variant of the EM algorithm. Even if this result is considered in isolation this means that most of the probabilistic models used by linguists are trained by a version of the EM algorithm. However, this result is even more interesting when considered in a theoretical context because the well-known convergence behavior of the inside-outside algorithm has been confirmed by many experiments but it seems that it never has been formally proved. Furthermore, being a version of the EM algorithm, the inside-outside algorithm also inherits the good convergence behavior of EM. We therefore contend that the as yet imperfect line of argumentation can be transformed into a coherent proof.}, ANNOTE = {COLIURL : Prescher:2001:IOEa.pdf} } @TechReport{Ramm_et_al:1995, AUTHOR = {Ramm, Wiebke and Rothkegel, Annely and Steiner, Erich and Villiger, Claudia}, TITLE = {Discourse Grammar for German}, YEAR = {1995}, NUMBER = {EP6665; Deliverable R2.3.2}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report ESPRIT Basic Research Action: Dandelion}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Ramm_Villiger:1995_1, AUTHOR = {Ramm, Wiebke and Villiger, Claudia}, TITLE = {Global Text Organization and Sentence-Grammatical Realization: Discourse-Level Constraints on Theme Selection}, YEAR = {1995}, MONTH = {May}, NUMBER = {61}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus61.ps}, ABSTRACT = {In this paper we address aspects of the interaction of global discourse parameters such as text type and subject matter with the selection of local features (e.g., thematic organization in terms of theme-rheme configurations) responsible for the appearance of the individual linguistic units the discourse consists of. Our starting point is the observation that the same propositional content often can be expressed linguistically by different lexical and grammatical means, for instance, by word order alternatives or by using different lexical categories. These alternatives result from the exploitation of a number of linguistic mechanisms (e.g., focussing, thematization) controlling the foregrounding and backgrounding of different parts of information communicated and differ in the pragmatic effects they achieve. Our interest lies in the textual-pragmatic motivations leading to the choice of a certain textual variant; in particular, we investigate the constraints global discourse structure imposes on sentence-level discourse organization. Proceeding from a stratificational model of the language system, our approach aims at the specification of interstratal constraints expressing the interdependency between higher-level discourse organization and lexico-grammatical realization on sentence level. A possible application area would be text generation where a notorious problem is the gap between global-level text planning and lexico-grammatical expression. The choice of grammatical (sentence) theme in German and its text type and domain dependency is taken as a sample phenomenon to illustrate our methodology.}, ANNOTE = {COLIURL : Ramm:1995:GTOb.pdf Ramm:1995:GTOb.ps} } @TechReport{Rayner_et_al:1993_1, AUTHOR = {Rayner, Manny and Alshawi, Hiyan and Bretan, Ivan and Carter, David M. and Digalakis, Vassilios and Gambäck, Björn and Kaja, Jaan and Karlgren, Jussi and Lyberg, Bertil and Pulman, Stephen G. and Price, Patti and Samuelsson, Christer}, TITLE = {A Speech to Speech Translation System Built from Standard Components}, YEAR = {1993}, NUMBER = {CRC-031}, ADDRESS = {Cambridge}, TYPE = {SRI International Technical Report}, INSTITUTION = {Stanford Research Institute} } @TechReport{Rayner_et_al:1993_3, AUTHOR = {Rayner, Manny and Bretan, Ivan and Carter, David M. and Collins, Michael and Digalakis, Vassilios and Gambäck, Björn and Kaja, Jaan and Karlgren, Jussi and Lyberg, Bertil and Pulman, Stephen G. and Price, Patti and Samuelsson, Christer}, TITLE = {Spoken Language Translation with Mid-90's Technology: A Case Study}, YEAR = {1993}, NUMBER = {CRC-032}, ADDRESS = {Cambridge}, TYPE = {SRI International Technical Report}, INSTITUTION = {SRI International} } @TechReport{Riezler:1995, AUTHOR = {Riezler, Stefan}, TITLE = {Binding Without Hierarchies}, YEAR = {1995}, MONTH = {January}, NUMBER = {50}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus50.ps}, ABSTRACT = {The aim of this paper is to show that current HPSG binding theory (and similarly other binding approaches encoding asymmetries explicitly) is inadequate with regard to describing binding variabilities in local binding contexts. This inadequacy stems mainly from the usage of too restrictive and order-independent obliqueness-based hierarchies as constraints on possible binders and bindees. We propose binding constraints to be directly implemented as path equations/path inequations in thematic relation sorts. This allows a more fine-grained description of local binding symmetries and asymmetries via a modular interplay of general binding constraints on thematic arguments together with linear precedence constraints on certain anaphoric elements.}, ANNOTE = {COLIURL : Riezler:1995:BH.pdf Riezler:1995:BH.ps} } @TechReport{Rothkegel_Villiger:1993, AUTHOR = {Rothkegel, Annely and Villiger, Claudia}, TITLE = {CHAINING}, YEAR = {1993}, MONTH = {September}, NUMBER = {EP6665; Deliverable R1.2.2a}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report, ESPRIT Basic Research Action: Dandelion}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Rupp_Milward:2000, AUTHOR = {Rupp, Christopher J. and Milward, David}, TITLE = {A Robust Linguistic Processing Architecture}, YEAR = {2000}, MONTH = {September}, NUMBER = {4.1}, ADDRESS = {Göteborg}, TYPE = {Siridus Report}, INSTITUTION = {Göteborg University, Department of Linguistics}, URL = {http://www.ling.gu.se/projekt/siridus/Publications/deliv4-1.ps.gz}, ANNOTE = {COLIURL : Rupp:2000:RLP.pdf Rupp:2000:RLP.ps} } @TechReport{Sablayrolles_Schupeta:1993, AUTHOR = {Sablayrolles, Pierre and Schupeta, Achim}, TITLE = {Conflict Resolving Negotiation for Cooperative Schedule Management Agents (COSMA)}, YEAR = {1993}, NUMBER = {TM-93-02}, ADDRESS = {Saarbrücken}, TYPE = {Technical Memo}, INSTITUTION = {DFKI} } @TechReport{Samuelsson:1994_5, AUTHOR = {Samuelsson, Christer}, TITLE = {An Efficient Algorithm for Surface Generation}, YEAR = {1994}, MONTH = {September}, NUMBER = {44}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/claus/claus44.ps ftp://ftp.coli.uni-sb.de/pub/claus/claus44.dvi}, ABSTRACT = {A method is given that inverts a grammar and displays it from the point of view of the semantic form, rather than from that of the word string. Techniques for compiling LR-parsing tables are used to allow a simple recursive-descent generation algorithm to perform functor merging in the same way as an LR-parser performs prefix merging. This is an improvement on the semantic-head-driven generator that results in a much smaller search space.}, ANNOTE = {COLIURL : Samuelsson:1994:EAS.pdf Samuelsson:1994:EAS.ps Samuelsson:1994:EAS.dvi} } @TechReport{Samuelsson:1995_3, AUTHOR = {Samuelsson, Christer}, TITLE = {Example-Based Optimization of Surface-Generation Tables}, YEAR = {1995}, MONTH = {April}, NUMBER = {56}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {A method is given that 'inverts' a logic grammar and displays it from the point of view of the logical form, rather than from that of the word string. LR-compiling techniques are used to allow a recursive-descent generation algorithm to perform 'functor merging' much in the same way as an LR parser performs prefix merging. This is an improvement on the semantic-head-driven generator that results in a much smaller search space. The amount of semantic lookahead can be varied, and appropriate tradeoff points between table size and resulting nondeterminism can be found automatically. This can be done by removing all spurious nondeterminism for input sufficiently close to the examples of a training corpus, and large portions of it for other input, while preserving completeness.} } @TechReport{Samuelsson:1996_2, AUTHOR = {Samuelsson, Christer}, TITLE = {Relating Turing's Formula and Zipf's Law}, YEAR = {1996}, MONTH = {June}, NUMBER = {78}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus78.ps}, ABSTRACT = {A general, practical method for handling sparse data that avoids held-out data and iterative reestimation is derived from first principles. It has been tested on a part-of-speech tagging task and outperformed linear (deleted) interpolation even when the latter used a globally optimal parameter setting determined a posteriori. An asymptote is derived from Turing's local reestimation formula for population frequencies, and a local reestimation formula is derived from Zipf's law for the asymptotic behavior of population frequencies. The two are shown to be qualitatively different asymptotically, but nevertheless to be instances of a common class of reestimation-formula-asymptote pairs, in which they constitute the upper and lower bounds of the convergence region of the cumulative of the frequency function, as rank tends to infinity. The results demonstrate that Turing's formula is qualitatively different from the various extensions to Zipf's law, and suggest that it smooths the frequency estimates towards a geometric distribution.}, ANNOTE = {COLIURL : Samuelsson:1996:RTFb.pdf Samuelsson:1996:RTFb.ps} } @TechReport{Samuelsson:1996_3, AUTHOR = {Samuelsson, Christer}, TITLE = {Handling Sparse Data by Successive Abstraction}, YEAR = {1996}, MONTH = {January}, NUMBER = {69}, PAGES = {6}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Unversität des Saarlandes}, ABSTRACT = {A general, practical method for handling sparse data that avoids held-out data and iterative reestimation is derived from first principles. It has been tested on a part-of-speech tagging task and outperformed linear (deleted) interpolation even when the latter used a globally optimal parameter setting determined a posteriori.}, ANNOTE = {COLIURL : Samuelsson:1996:HSDb.pdf} } @TechReport{Samuelsson_Rayner:1991, AUTHOR = {Samuelsson, Christer and Rayner, Manny}, TITLE = {Developing an EBL Bypass for a Large-Scale Natural Language Query Interface to Relational Data Bases}, YEAR = {1991}, MONTH = {January}, NUMBER = {R91001}, ADDRESS = {Stockholm}, TYPE = {Research Report}, INSTITUTION = {Swedish Institute of Computer Science (SICS)} } @TechReport{Samuelsson_et_al:1996_1, AUTHOR = {Samuelsson, Christer and Tapanainen, Pasi and Voutalainen, Atro}, TITLE = {Inducing Constraint Grammars}, YEAR = {1996}, MONTH = {July}, NUMBER = {79}, PAGES = {10}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus79.ps}, ABSTRACT = {Constraint Grammar rules are induced from corpora. A simple scheme based on local information, i.e., on lexical biases and next-neighbour contexts, extended through the use of barriers, reached 87.3 percent precision (1.12 tags/word) at 98.2 percent recall. The results compare favourably with other methods that are used for similar tasks although they are by no means as good as the results achieved using the original hand-written rules developed over several years time.}, ANNOTE = {COLIURL : Samuelsson:1996:ICGb.pdf Samuelsson:1996:ICGb.ps} } @TechReport{Saurer:1991, AUTHOR = {Saurer, Werner}, TITLE = {A Natural Deduction System for Discourse Representation Theory}, YEAR = {1991}, MONTH = {December}, NUMBER = {16}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Saurer:1994, AUTHOR = {Saurer, Werner}, TITLE = {A Note on Anaphora and Inference}, YEAR = {1994}, MONTH = {October}, NUMBER = {46}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {There are cases of anaphoric relations that even dynamic semantic theories such as Discourse Representation Theory (DRT) have difficulties with in that they cannot provide for an appropriate antecedent for certain occurrences of pronouns. Some people think this shows that those theories are not dynamic enough and have suggested various remedies such as accommodation. In this paper I show how inference can provide for the missing antecedent in those problem cases even within the framework of existing dynamic theories. A natural deduction system working directly with Discourse Representation Structures is used to accomplish this.} } @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.} } @TechReport{Schulte:2000_1, AUTHOR = {Schulte, Christian}, TITLE = {Parallel Search Made Simple}, YEAR = {2000}, MONTH = {September}, NUMBER = {TRA9/00}, ADDRESS = {Singapore}, TYPE = {Technical Report}, INSTITUTION = {National University of Singapore, School of Computing}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/par-trics.ps.gz}, ABSTRACT = {Search in constraint programming is a time consuming task. Search can be speeded up by exploring subtrees of a search tree in parallel. This paper presents distributed search engines that achieve parallelism by distribution across networked computers. The main point of the paper is a simple design of the parallel search engine. Simplicity comes as an immediate consequence of clearly separating search, concurrency, and distribution. The obtained distributed search engines are simple yet offer substantial speedup on standard network computers.}, ANNOTE = {COLIURL : Schulte:2000:PSM.pdf Schulte:2000:PSM.ps} } @TechReport{Siegel:1994, AUTHOR = {Siegel, Melanie}, TITLE = {Definitheit und Numerus. Anforderungen an den Transfer Japanisch-Englisch}, YEAR = {1994}, NUMBER = {56}, ADDRESS = {Bielefeld}, TYPE = {Verbmobil-Memo}, INSTITUTION = {Universität Bielefeld} } @TechReport{Siegel:1996_1, AUTHOR = {Siegel, Melanie}, TITLE = {Die japanische Syntax im Verbmobil-Forschungsprototypen}, YEAR = {1996}, NUMBER = {133}, ADDRESS = {Saarbrücken}, TYPE = {Verbmobil Report}, INSTITUTION = {DFKI}, URL = {http://www.dfki.de/~siegel/vm-report.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/vm-report.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/vm-report.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/vm-report.ps.Z}, ANNOTE = {COLIURL : Siegel:1996:JSIa.pdf Siegel:1996:JSIa.ps} } @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} } @TechReport{Siegel_et_al:1993, AUTHOR = {Siegel, Melanie and Kuroda, Hideko and Kudo, Eri}, TITLE = {Dialogdaten: Terminplanung japanisch-deutsch}, YEAR = {1993}, NUMBER = {2-93}, ADDRESS = {Bielefeld}, TYPE = {Arbeitsberichte Computerlinguistik}, INSTITUTION = {Universität Bielefeld} } @TechReport{Siegel_Metzing:1993, AUTHOR = {Siegel, Melanie and Metzing, Dieter}, TITLE = {Dialogdolmetschen. Eine Pilotstudie zu aufgabenorientierten Dialogen (Terminabsprachen) Japanisch-Deutsch}, YEAR = {1993}, NUMBER = {2-93}, ADDRESS = {Bielefeld}, TYPE = {Arbeitsberichte Computerlinguistik}, INSTITUTION = {Universität Bielefeld} } @TechReport{Siegel_Metzing:1994, AUTHOR = {Siegel, Melanie and Metzing, Dieter}, TITLE = {Nullpronomina und die Organisation von Wissensquellen für den Transfer Japanisch - Englisch}, YEAR = {1994}, NUMBER = {12}, ADDRESS = {Bielefeld}, TYPE = {Verbmobil Memo}, INSTITUTION = {Universität Bielefeld} } @TechReport{Traum_Hinkelman:1993, AUTHOR = {Traum, David and Hinkelman, Elizabeth}, TITLE = {Conversation Acts in Task-Oriented Spoken Dialogue}, YEAR = {1993}, NUMBER = {RR-93-32}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {http://www.cs.tufts.edu/~elizh/ci-single.ps}, ANNOTE = {COLIURL : Traum:1993:CAT.pdf Traum:1993:CAT.ps} } @TechReport{Trost:1990_1, AUTHOR = {Trost, Harald}, TITLE = {The Application of Two-Level Morphology to Non-Concatenative German Morphology}, YEAR = {1990}, NUMBER = {RR-90-15}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1990/RR-90-15.ps.gz}, ANNOTE = {COLIURL : Trost:1990:ATLb.pdf Trost:1990:ATLb.ps} } @TechReport{Trost:1991, AUTHOR = {Trost, Harald}, TITLE = {X2MORF: A Morphological Component Based on Augmented Two-Level Morphology}, YEAR = {1991}, NUMBER = {RR-91-04}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1991/RR-91-04.ps.gz}, ANNOTE = {COLIURL : Trost:1991:XMCa.pdf Trost:1991:XMCa.ps} } @TechReport{Uszkoreit:1991_1, AUTHOR = {Uszkoreit, Hans}, TITLE = {Adding Control Information to Declarative Grammars}, YEAR = {1991}, NUMBER = {RR-91-29}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI} } @TechReport{Uszkoreit:1991_2, AUTHOR = {Uszkoreit, Hans}, TITLE = {Adding Control Information to Declarative Grammars}, YEAR = {1991}, MONTH = {June}, NUMBER = {10}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {Strategies are proposed for combining different kinds of constraints in declarative grammars with a detachable layer of control information. The added control information is the basis for parametrized dynamically controlled linguistic deduction, a form of linguistic processing that permits the implementation of plausible linguistic performance models without giving up the declarative formulation of linguistic competence. The information can be used by the linguistic processor for ordering the sequence in which conjuncts and disjuncts are processed, for mixing depth-first and breadth-first search, for cutting off undesired derivations, and for constraint-relaxation.} } @TechReport{Uszkoreit:1993, AUTHOR = {Uszkoreit, Hans}, TITLE = {Towards Performance Models for Declarative Grammar Formalisms}, YEAR = {1993}, NUMBER = {29}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Uszkoreit_et_al:1994_1, AUTHOR = {Uszkoreit, Hans and Backofen, Rolf and Busemann, Stephan and Diagne, Abdel Kader and Hinkelman, Elizabeth and Kasper, Walter and Kiefer, Bernd and Krieger, Hans-Ulrich and Netter, Klaus and Neumann, Günter and Oepen, Stefan and Spackmann, Stephen}, TITLE = {DISCO - An HPSG-Based NLP System and its Application for Appointment Scheduling}, YEAR = {1994}, NUMBER = {RR-94-38}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, ABSTRACT = {The natural language system DISCO is described. It combines o a powerful and flexible grammar development system; o linguistic competence for German including morphology, syntax and semantics; o new methods for linguistic performance modelling on the basis of high-level competence grammars; o new methods for modelling multi-agent dialogue competence; o an interesting sample application for appointment scheduling and calendar management.}, ANNOTE = {COLIURL : Uszkoreit:1994:DHBb.pdf Uszkoreit:1994:DHBb.ps} } @TechReport{Uszkoreit_et_al:1996, AUTHOR = {Uszkoreit, Hans and Backofen, Rolf and Calder, Jo and Capstick, Joanne and Dini, Luca and Dörre, Jochen and Erbach, Gregor and Estival, Dominique and Manandhar, Suresh and Mineur, Anne-Marie and Oepen, Stefan}, TITLE = {The EAGLES Formalisms Working Group - Final Report Expert Advisory Group on Language Engineering Standards}, YEAR = {1996}, NUMBER = {LRE 61-100}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/eagles-fwg-report.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/eagles-fwg-report.entry}, ANNOTE = {COLIURL : Uszkoreit:1996:EFW.pdf Uszkoreit:1996:EFW.ps} } @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} } @TechReport{Uszkoreit_Jörg:to appear, AUTHOR = {Uszkoreit, Hans and Jörg, Brigitte}, TITLE = {A Virtual Information Center for Language Technology: Ontology, Datastructure, Realization}, YEAR = {2003}, ADDRESS = {Copenhagen}, INSTITUTION = {CST Copenhagen} } @TechReport{van Leusen:1997, AUTHOR = {van Leusen, Noor}, TITLE = {The Role of Inference in the resolution of corrections}, YEAR = {1997}, MONTH = {December}, NUMBER = {93}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes} } @TechReport{van Noord:1991, AUTHOR = {van Noord, Gertjan}, TITLE = {Head Corner Parsing}, YEAR = {1991}, MONTH = {December}, NUMBER = {15}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {I describe a head-driven parser for a class of grammars that handle discontinuous constituency by a richer notion of string combination than ordinary concatenation. The parser is a generalization of the left-corner parser and can be used for grammars written in powerful formalisms such as non- concatenative versions of UCG and HPSG.} } @TechReport{Villiger:1995, AUTHOR = {Villiger, Claudia}, TITLE = {Theme Discourse Topic, and Information Structuring in German Texts}, YEAR = {1995}, MONTH = {December}, NUMBER = {EP6665; Deliverable R1.2.2c}, ADDRESS = {Saarbrücken}, TYPE = {ESPRIT Basic Research Action: Dandelion}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Wirén:1993_1, AUTHOR = {Wirén, Mats}, TITLE = {Bounded Incremental Parsing}, YEAR = {1993}, MONTH = {December}, NUMBER = {36}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/claus/claus36.ps}, ABSTRACT = {This paper generalizes the notion of parsing as deduction to non-cumulative text production, in which changes can be made to already parsed material, for example, by a person using a grammar-checking text editor. The basic approach is to exploit the properties of a chart to determine which parts of the string need to be reanalysed in response to a change, thereby obtaining an incremental solution. An implementation of the proposed technique exists, which has been adapted to on-line processing under a simple text editor, thus providing a system which parses a text simultaneously as it is entered and edited.}, ANNOTE = {COLIURL : Wiren:1993:BIPb.pdf Wiren:1993:BIPb.ps} } @TechReport{Wirén_Rönnquist:1993_1, AUTHOR = {Wirén, Mats and Rönnquist, Ralph}, TITLE = {Fully Incremental Parsing}, YEAR = {1993}, MONTH = {June}, NUMBER = {32}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/claus/claus32.ps}, ABSTRACT = {This paper generalizes the notion of parsing as deduction to non-cumulative text production, in which changes can be made to already parsed material, for example, by a person using a grammar-checking text editor. The basic approach is to exploit the properties of a chart to determine which parts of the string need to be reanalysed in response to a change, thereby obtaining an incremental solution. An implementation of the proposed technique exists, which has been adapted to on-line processing under a simple text editor, thus providing a system which parses a text simultaneously as it is entered and edited.}, ANNOTE = {COLIURL : Wiren:1993:FIPb.pdf Wiren:1993:FIPb.ps} } @TechReport{Worm:1995, AUTHOR = {Worm, Karsten}, TITLE = {An Experiment with LUDRs in Oz}, YEAR = {1995}, NUMBER = {30}, ADDRESS = {Saarbrücken}, TYPE = {Vermobil Technisches Dokument}, INSTITUTION = {Universität des Saarlandes} } @TechReport{Zaenen_et_al:2000, AUTHOR = {Zaenen, Annie and Ericsson, Stinaand and Larsson, Staffan and Mikheev, A. and Milward, David and Pinkal, Manfred and Poesio, Massimo and Rupp, Christopher J. and Worm, Karsten L.}, TITLE = {Robust Interpretation and Dialogue Dynamics}, YEAR = {2000}, ADDRESS = {Göteborg}, TYPE = {Technical Report}, INSTITUTION = {Göteborg University, Department of Linguistics}, URL = {http://www.ling.gu.se/research/projects/trindi/private/deliverables/D5.2/D5.2.pdf}, ANNOTE = {COLIURL : Zaenen:2000:RID.pdf} } @TechReport{Ziff_et_al:1991, AUTHOR = {Ziff, Donald A. and Waclena, Keith and Spackman, Stephen P.}, TITLE = {CAL: Combinator Assembly Language}, YEAR = {1991}, ADDRESS = {Chicago}, TYPE = {Technical Report}, INSTITUTION = {University of Chicago Center for Information and Language Studies}, URL = {http://www.lib.uchicago.edu/keith/cils-tr/tr91-02.ps}, ANNOTE = {COLIURL : Ziff:1991:CCA.pdf Ziff:1991:CCA.ps} } @TechReport{Ziff_et_al:1992, AUTHOR = {Ziff, Donald A. and Waclena, Keith and Spackman, Stephen P.}, TITLE = {Using a Lazy Functional Language for Textual Information Retrieval}, YEAR = {1992}, ADDRESS = {Chicago}, TYPE = {Technical Report}, INSTITUTION = {University of Chicago Center for Information and Language Studies} } @TechReport{Brinckmann:1997, AUTHOR = {Brinckmann, Caren}, TITLE = {German in Eight Weeks -- A Crash Course for CHATR}, YEAR = {1997}, MONTH = {September}, NUMBER = {TR-IT-0236}, ADDRESS = {Brinckmann:1997:GEWa}, INSTITUTION = {ATR Interpreting Telecommunications Research Laboratories}, ABSTRACT = {With all its different modules, CHATR is an extremely big system. If the output doesn't sound quite right, there are always several ways of improvement. As an example of what can be achieved within eight weeks, this technical report describes how to improve the German voice of CHATR focussing on the database, the lexicon and the prosody prediction.} } @TechReport{Korbayova:1997, AUTHOR = {Korbayova, Ivana}, TITLE = {Final Report of a research project granted by the Open Society Institute: A System for Analysis of Czech Texts}, YEAR = {1997}, INSTITUTION = {Final Report of a research project granted by the Open Society Institute} } @TechReport{Korbayova:1996, AUTHOR = {Korbayova, Ivana}, TITLE = {Pronominal reference in the Plinius corpus}, YEAR = {1996}, NUMBER = {UT-KBS-96-06}, TYPE = {Memoranda Informatica}, INSTITUTION = {Twente University} } @TechReport{Korbayova:1993, AUTHOR = {Korbayova, Ivana}, TITLE = {Pronominal reference in the Plinius corpus}, YEAR = {1993}, NUMBER = {KBS-NOTE 93-030}, INSTITUTION = {Knowledge-Based Systems Group, Twente University} } @TechReport{Adonova_et_al:1999, AUTHOR = {Adonova, Elena and Bateman, John and Gromova, Nevena and Hartley, Anthony and Kruijff, Geert-Jan M. and Kruijff-Korbayova, Ivana and Sharoff, Serge and Skoumalová, Hana and Sokolova, Lena and Staykova, Kamenka and Teich, Elke}, TITLE = {Formal specification of extended grammar models}, YEAR = {1999}, TYPE = {AGILE project deliverable LSPEC2}, INSTITUTION = {ITRI, University of Brighton, UK}, URL = {http://ufal.mff.cuni.cz/~agile/reports.html} } @TechReport{Speel_Korbayova:1992, AUTHOR = {Speel, Piet-Hein and Korbayova, Ivana}, TITLE = {Inferences making use of relations of the Plinius ontology}, YEAR = {1992}, NUMBER = {KBS-NOTE 92-050}, INSTITUTION = {Knowledge-Based Systems Group, University Twente} } @TechReport{Hajicova_et_al:1994, AUTHOR = {Hajicová, Eva and Sgall, Petr and Uszkoreit, Hans and Oliva, Karel and Platek, Martin and Kubon, Vladislav and Hric, Jano and Bemova, Alevtina and Petkevic, Vladimir and Skoumalová, Hana and Rosen, Alexandr and Korbayova, Ivana}, TITLE = {Adaptation and transfer of parsing techniques}, YEAR = {1994}, TYPE = {Deliverable of the joint project PECO 2824}, INSTITUTION = {Charles University} } @TechReport{BlFrGe2006, AUTHOR = {Blaylock, Nate and Fromkorth, Bettina and Gerstenberger, Ciprian and Kruijff-Korbayova, Ivana and Lemon, Oliver and Manchon, Pilar and Moos, Anja and Rieser, Verena}, TITLE = {Annotators Handbook}, YEAR = {2006}, TYPE = {Deliverable 6.2}, NOTE = {TALK project} }