%
% 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 = MastersThesis
%




@MastersThesis{Backofen:1989,
      AUTHOR = {Backofen, Rolf},
      TITLE = {Integration von Funktionen, Relationen und Typen beim Sprachentwurf. Teil II: Attributterme und Relationen},
      YEAR = {1989},
      ADDRESS = {Erlangen-Nürnberg},
      SCHOOL = {Friedrich-Alexander Universität}
}

@MastersThesis{Becker:1999,
      AUTHOR = {Becker, Markus},
      TITLE = {Unsupervised Training of a Rule-Based Part-of-Speech Tagger},
      YEAR = {1999},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Computational Linguistics, University of Saarland},
      URL = {http://www.dfki.de/~mbecker/diplom.ps},
      NOTE = {unpublished master's thesis},
      ANNOTE = {COLIURL : Becker:1999:UTR.pdf Becker:1999:UTR.ps}
}

@MastersThesis{Brunklaus:2000,
      AUTHOR = {Brunklaus, Thorsten},
      TITLE = {Der Oz Inspector - Browsen: Interaktiver, einfacher, effizienter},
      YEAR = {2000},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes, Fachbereich 14 Informatik},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/OzInspector.ps.gz},
      ABSTRACT = {Diese Arbeit beschreibt Konzept, Entwurf und Implementierung des Inspectors. Der Inspector ist ein interaktives, grafisches Werkzeug zur Darstellung von Oz-Datenstrukturen. Oz-Datenstrukturen sind komplex und deren Darstellung erfordert ein grafisches Werkzeug. Aus Sicht des Benutzers muss ein solches vor allem sehr effizient, flexibel und interaktiv sein. In dieser Arbeit wird ein System vorgestellt, dass diese Anforderungen durch einen zweistufigen Ansatz erfüllt. Dieser besteht darin, neben effizienten Basisdiensten einen flexiblen Transformationsmechanismus einzusetzen. Die vorgestellte Implementierung ist hochmodular und sehr kompakt. Deren Effizienz wird schließlich durch Vergleich mit einemähnlichen System demonstriert.},
      ANNOTE = {COLIURL : Brunklaus:2000:OIB.pdf Brunklaus:2000:OIB.ps}
}

@MastersThesis{Callmeier:2001,
      AUTHOR = {Callmeier, Ulrich},
      TITLE = {Efficient Parsing with Large-Scale Unification Grammars},
      YEAR = {2001},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Universität des Saarlandes, Informatik},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Debusmann:2001_2,
      AUTHOR = {Debusmann, Ralph},
      TITLE = {A Declarative Grammar Formalism for Dependency Grammar},
      YEAR = {2001},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes, Department of Computational Linguistics},
      URL = {http://www.ps.uni-sb.de/~rade/papers/da.pdf},
      ABSTRACT = {Beginning with the groundbreaking work of Chomsky in the 1950s, syntactians have concentrated mostly on the English language. But English is not a typical natural language: in particular, its word order is very rigid, as opposed to most other languages which exhibit freer word order. The phrase structure-based approach employed for the analysis of English runs into severe problems when confronted with freer word order languages. Aside from the mainstream, linguists in Eastern Europe and Japan have pursued an approach to syntax which seemed better suited for the analysis of freer word order languages: dependency grammar. The key asset of dependency grammar is that it allows for a clean separation of syntactic dependency and surface word order. Unfortunately, none of the frameworks for dependency grammar has really caught on. We suggest two reasons for their failure: 1. many of the dependency-based frameworks lack proper formalization and, perhaps surprisingly, 2. most of them lack a realistic and workable account of word order. In this thesis, we try to remedy these problems in the setting of a constraint-based approach to dependency grammar based on (Duchier 1999). We present a new account of word order for dependency grammar couched in a declarative grammatical formalism called Topological Dependency Grammar (TDG). TDG allows to cleanly separate the two levels of syntactic dependency and surface word order, which greatly facilitates the conception of grammars for freer word order languages. In addition, we can efficiently parse with TDG grammars: using a reduction described in (Duchier 2000), we achieved an efficient parser implementation using modern constraint programming techniques.},
      ANNOTE = {COLIURL : Debusmann:2001:DGF.pdf}
}

@MastersThesis{Erbach:1987,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Maschinelle Syntaxanalyse des Deutschen, Englischen und Französischen auf Grundlage verschiedener Grammatikformalismen},
      YEAR = {1987},
      ADDRESS = {Mainz},
      SCHOOL = {Johannes-Gutenberg Universität}
}

@MastersThesis{Gabsdil:2001,
      AUTHOR = {Gabsdil, Malte},
      TITLE = {Interpreting Questions and Answers in a Prototype Dialogue System},
      YEAR = {2001},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes, Computerlinguistik},
      URL = {https://www.coli.uni-saarland.de/~gabsdil/papers/msc01.ps.gz},
      ANNOTE = {COLIURL : Gabsdil:2001:IQA.pdf Gabsdil:2001:IQA.ps}
}

@MastersThesis{Gambäck:1991,
      AUTHOR = {Gambäck, Björn},
      TITLE = {A Micro-World for Reasoning about Communicating Agents: the Bidding Phase of Contract Bridge},
      YEAR = {1991},
      ADDRESS = {Stockholm},
      SCHOOL = {The Royal Institute of Technology, Dept. of Telecommunication and Computer Systems}
}

@MastersThesis{Koller:1999,
      AUTHOR = {Koller, Alexander},
      TITLE = {Constraint Languages for Semantic Underspecification},
      YEAR = {1999},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Computational Linguistics},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Koller99.ps.gz},
      ABSTRACT = {At all levels of linguistic analysis, natural language can be ambiguous. The numbers of readings of different ambiguous components of a sentence or discourse multiply over all these components, yielding a number of readings that can be exponential in the number of ambiguities. Both from a computational and a cognitive point of view, it seems necessary to find small representations for ambiguities that describe all readings in a compact way. This approach is called underspecification, and it has received increasing attention in the past few years. Lately, two particularly elegant formalisms for the underspecified treatment of scope ambiguities in semantics have been proposed: Context Unification and the Constraint Language for Lambda Structures, CLLS. Common to both is that they regard the term representing the semantics of a sentence as a tree and describe it by imposing tree constraints. Furthermore, both offer the expressive power to describe simple ellipses and their interaction with scope ambiguities. This thesis investigates some formal properties of these two formalisms. It examines their relation and shows that, except for a few additional constructs of CLLS, both languages are equivalent in expressive power. In terms of computational complexity, this gives us the immediate result that the complexity of the satisfiability problem of CLLS is exactly the same as that of context unification, which, unfortunately, is unknown. The thesis further investigates the complexity of the satisfiability problem of dominance constraints, an important sublanguage of CLLS, and shows that it is NP-complete. In the course of the discussion of complexity, it also briefly explains how techniques from concurrent constraint programming can be applied to implement solution algorithms for these formalisms.},
      ANNOTE = {COLIURL : Koller:1999:CLS.pdf Koller:1999:CLS.ps}
}

@MastersThesis{Konrad:1994,
      AUTHOR = {Konrad, Karsten},
      TITLE = {Abstrakte Syntaxtransformation mit getypten Merkmalstermen},
      YEAR = {1994},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes, Department of Computer Science}
}

@MastersThesis{Kornstaedt:1996,
      AUTHOR = {Kornstaedt, Leif},
      TITLE = {Definition und Implementierung eines Front-End-Generators für Oz},
      YEAR = {1996},
      PAGES = {115},
      ADDRESS = {Kaiserslautern},
      SCHOOL = {Universität Kaiserslautern, FB Informatik},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/DA-Kornstaedt.ps.gz},
      ABSTRACT = {In der vorliegenden Diplomarbeit wird ein Front-End-Generator entwickelt, der die multiparadigmatische Sprache Oz als Zielsprache verwendet. Damit wird die Eignung von Oz als Implementierungssprache für Compiler demonstriert und die Reimplementierung des Oz-Compilers in Oz vorbereitet. Das Werkzeug ist besonders auf die Übersetzung vollkompositionaler Sprachen ausgelegt. Das bedeutet, dass neben der lexikalischen und syntaktischen Analyse, bei der über sogenannte /Produktionsschemata/ auch eigene EBNF-Operatoren definiert werden können, auch die Reduktion in eine Kernsprache von dem Werkzeug abgedeckt wird. Um letztere mächtig zu machen und die Implementierung von Baumtransformationen zu vereinfachen, bei denen keine Konflikte der Variablennamen auftreten dürfen, wird weiterhin eine automatisch durchgeführte Bindungsanalyse mit Umbenennung aller gebundenen Bezeichner von dem Werkzeug angeboten.},
      NOTE = {Kornstaedt:1996:DIF},
      ANNOTE = {COLIURL : Kornstaedt:1996:DIF.pdf Kornstaedt:1996:DIF.ps}
}

@MastersThesis{Kurz:2000,
      AUTHOR = {Kurz, Daniela},
      TITLE = {Wortstellungspräferenzen im Deutschen},
      YEAR = {2000},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes, Computerlinguistik}
}

@MastersThesis{Lorenz:1999,
      AUTHOR = {Lorenz, Benjamin},
      TITLE = {Ein Debugger für Oz},
      YEAR = {1999},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes, Fachbereich Informatik},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/OzDebugger.ps.gz},
      ABSTRACT = {Im Rahmen des Software-Entwicklungsprozesses nimmt die Fehlersuche eine wichtige Stellung ein. Syntaktische Fehler können bereits vom Compiler entdeckt werden, semantische Fehler dagegen sind häufig schwer zu finden; der Zeitbedarf hierfür kann enorm hoch sein. In vielen professionellen Programmierumgebungen existiert daher ein leistungsfähiges Werkzeug, ein Debugger, der die Fehlersuche erleichtert, indem das fehlerhafte Programm an beliebigen Stellen angehalten und zusammen mit seinen Daten untersucht werden kann. Diese Arbeit beschreibt den Entwurf eines Debuggers für die Programmiersprache Oz sowie seine Implementierung im Programmiersystem Mozart.},
      ANNOTE = {COLIURL : Lorenz:1999:DO.pdf Lorenz:1999:DO.ps}
}

@MastersThesis{Oepen:1993,
      AUTHOR = {Oepen, Stefan},
      TITLE = {German Nominal Syntax in HPSG. On Syntactic Categories and Syntagmatic Relations},
      YEAR = {1993},
      ADDRESS = {Berlin},
      SCHOOL = {Freie Universität Berlin}
}

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

@MastersThesis{Plaehn:1999,
      AUTHOR = {Plaehn, Oliver},
      TITLE = {Probabilistic Parsing with Discontinuous Phrase Structure Grammar},
      YEAR = {1999},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes},
      URL = {https://www.coli.uni-saarland.de/~plaehn/papers/dt.ps},
      ANNOTE = {COLIURL : Plaehn:1999:PPD.pdf Plaehn:1999:PPD.ps}
}

@MastersThesis{Priesnitz:2000,
      AUTHOR = {Priesnitz, Tim},
      TITLE = {Entailment von nicht-strukturellen Teiltyp-Constraints},
      YEAR = {2000},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes, Fachbereich Informatik},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Priesnitz-2000.ps.gz},
      ABSTRACT = {Teiltyp-Entailment ist die Frage, ob eine Implikation zwischen Teiltyp-Constraints $t_1sm t_2$ gilt. Algorithmen, die diese Frage lösen, sind für die Vereinfachung von Teiltyp-Constraints relevant. Die Vereinfachung von Teiltyp-Constraints ist hingegen in contraintbasierten Typ-Sytemen dringend erforderlich. Die Komplexität von Teiltyp-Entailment hängt von der gewählten Typsprache ab; schon für ausdrucksschwache Typsprachen ist es überraschend schwierig, einen Algorithmus für Teiltyp-Entailment zu entwerfen. So ist Teiltyp-Entailment für einfache Typen coNP-vollständig und wird durch die Hinzunahme von rekursiven Typen PSPACE-vollständig. Entailment wird durch die Erweiterung um einen kleinsten und größten Typ nicht-strukturell. Henglein und Rehof haben bewiesen, daß nicht-strukturelles Teiltyp-Entailment, sowohl im einfachen wie auch im rekursiven Fall, PSPACE-schwer ist; einen vollständigen Algorithmus konnten sie allerdings nicht angeben. Es ist eine bekannte offene Frage, ob nicht-strukturelles Teiltyp-Entailment überhaupt entscheidbar ist. Ausgehend von dieser Situation untersucht diese Arbeit, worin die Schwierigkeiten liegen. Wir isolieren ein Teilproblem von nicht-strukturellem Teiltyp-Entailment, von dem wir zeigen, dass es PSPACE-vollständig ist. Damit zeigen wir zum ersten Mal Entscheidbarkeit für ein nicht-triviales Fragment von nicht-strukturellem Entailment. Wir charakterisieren Teiltyp-Entailment in der Automaten-Theorie; dazu erweitern wir das Konzept der endlichen Automaten zu sogenannten P-Automaten, deren Eigenschaften wir systematisch analysieren. Im nächsten Schritt reduzieren wir nun Teiltyp-Entailment auf das Universalitätsproblem von eingeschränkten P-Automaten. Für unser ausgezeichnetes Fragment können wir uns in der Tat auf endliche Automaten zurückziehen, deren Universalitätsproblem PSPACE-vollständig ist.},
      ANNOTE = {COLIURL : Priesnitz:2000:EST.pdf Priesnitz:2000:EST.ps}
}

@MastersThesis{Samuelsson:1991,
      AUTHOR = {Samuelsson, Christer},
      TITLE = {Using Explanation-Based Learning to Speed up Natural Language Systems},
      YEAR = {1991},
      ADDRESS = {Stockholm},
      SCHOOL = {The Royal Institute of Technology}
}

@MastersThesis{Schäfer:1995,
      AUTHOR = {Schäfer, Ulrich},
      TITLE = {Parameterized Type Expansion in TDL},
      YEAR = {1995},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes}
}

@MastersThesis{Schäfer:1995_1,
      AUTHOR = {Schäfer, Ulrich},
      TITLE = {Parameterized Type Expansion in the Feature Structure Formalism TDL},
      YEAR = {1995},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes},
      URL = {http://www.dfki.de/dfkibib/publications/docs/usthesis.pdf},
      ABSTRACT = {Over the last few years, unification-based grammar formalisms have become the predominant paradigm in natural language processing systems because of their monotonicity, declarativeness, and reversibility. From the viewpoint of computer science, typed feature structures can be seen as data structures that allow representation of linguistic knowledge in a uniform fashion. Type expansion is an operation that makes the constraints on a typed feature structure explicit and determines their satisfiability. We describe an efficient expansion algorithm that takes care of recursive type definitions and allows exploration of different expansion strategies through the use of control knowledge. This knowledge is specified in a separate layer, independently of grammatical information. Memoization of the type expansion function drastically reduces the number of unifications. In the second part, nonmonotonic extensions to TDL and the implementation of well-typedness checks are presented. Both are closely related to the type expansion algorithm. The algorithms have been implemented in Common Lisp and are integrated parts of TDL and a large natural language dialog system.},
      ANNOTE = {COLIURL : Schafer:1995:PTEb.pdf}
}

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

@MastersThesis{Simon:2000,
      AUTHOR = {Simon, Daniel},
      TITLE = {An Implementation of the Programming Language DML in Java: Runtime Environment},
      YEAR = {2000},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes, Fachbereich Informatik},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Simon:2000.ps.gz},
      ABSTRACT = {DML is an experimental language that has emerged from the developement of the Oz dialect Alice. DML is dynamically typed, functional, and concurrent. It supports transients and provides a distributed programming model. To translate DML to the Java Virtual Machine, a runtime environment is needed. This work presents a simple and secure implementation of the basic DML runtime classes and elaborates on relevant improvements. Pickling, a mechanism to make higher order values persistent, is provided on top of the Java Object Serialization. Finally, a high-level distributed programming model for DML is implemented based on Java's Remote Method Invocation architecture. Finally, the implemented compiler and the runtime environment of DML are compared to similar projects.},
      ANNOTE = {COLIURL : Simon:2000:IPL.pdf Simon:2000:IPL.ps}
}

@MastersThesis{Skut:1995,
      AUTHOR = {Skut, Wojciech},
      TITLE = {Underspecification-Based Representation of Noun Phrase Semantics},
      YEAR = {1995},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes, Department of Computational Linguistics}
}

@MastersThesis{Spackman:1992,
      AUTHOR = {Spackman, Stephen P.},
      TITLE = {Images of Type},
      YEAR = {1992},
      ADDRESS = {River Forest},
      SCHOOL = {Concordia University}
}

@MastersThesis{Striegnitz:1999,
      AUTHOR = {Striegnitz, Kristina},
      TITLE = {On Modeling Meaning Shifts by Relaxing Underspecified Semantic Representations},
      YEAR = {1999},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes},
      TYPE = {Diplomarbeit},
      URL = {https://www.coli.uni-saarland.de/cl/projects/chorus/papers/kris99.html},
      ABSTRACT = {The context in which a word appears in natural language often influences its interpretation in such a way that the base meaning of the word is changed or made more specific. Polysemy and metonymy are examples for this phenomenon. These meaning shifts of words can be modeled by augmenting the semantic representation of a natural language utterance with the information that is missing to make the shift in meaning explicit. This information can be provided by linguistic or non-linguistic sources or an interaction of both. Recently, Egg (1999) has suggested an account of meaning shifts which exploits underspecification methods to yield a monotonic augmentation process. The main idea is to have semantic construction derive a sufficiently relaxed (i.e. made less specific) semantic representation, so that adding the missing information is simply further specification of this representation. This thesis will examine a treatment of meaning shifts due to systematic polysemy or metonymy within Egg's framework. We will present a syntax/semantics interface which derives appropriately relaxed semantic representations. To account for meaning shifts these representations can be augmented monotonically with additional information. We will point out a potential problem for this approach: making underspecified semantic representations less specific may cause overgeneration. However, as we will show, for our applications relaxation is safe, i.e. there is no danger of overgeneration. The underspecification formalism that we will use throughout this thesis is in the class of tree description languages subsuming dominance constraints. We will distinguish a novel class of subconstraints with a certain structure which powerfully support the type of inferences on dominance and disjointness which we have to make for proving safety of relaxation.},
      ANNOTE = {COLIURL : Striegnitz:1999:MMS.pdf Striegnitz:1999:MMS.ps}
}

@MastersThesis{Vasishth:2002_1,
      AUTHOR = {Vasishth, Shravan},
      TITLE = {An Abductive Inference Based Model of Human Sentence Parsing},
      YEAR = {2002},
      MONTH = {March},
      ADDRESS = {Columbus},
      SCHOOL = {Ohio State University, Department of Computer and Information Science},
      URL = {ftp://ftp.ling.ohio-state.edu/pub/Students/Vasishth/MSThesis/msthesis.ps},
      ANNOTE = {COLIURL : Vasishth:2002:AIB.pdf Vasishth:2002:AIB.ps}
}

@MastersThesis{Walter:2000,
      AUTHOR = {Walter, Andreas},
      TITLE = {An Implementation of the Programming Language DML in Java: Compiler},
      YEAR = {2000},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes, Fachbereich Informatik},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Walter:2000.ps.gz},
      ABSTRACT = {DML is an experimental language that has emerged from the developement of the Oz dialect Alice. DML is dynamically typed, functional, and concurrent. It supports transients and provides a distributed programming model. Subject of this work is the implementation of a compiler backend that translates DML programs to Java Virtual Machine code. Code-optimizing techniques and possibilities for the treatment of tail calls are described. Finally, the implemented compiler and the runtime environment of DML are compared to similar projects.},
      ANNOTE = {COLIURL : Walter:2000:IPL.pdf Walter:2000:IPL.ps}
}

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

@MastersThesis{Vasishth:2002_3,
      AUTHOR = {Vasishth, Shravan},
      TITLE = {An Abductive Inference Based Model of Human Sentence Parsing},
      YEAR = {2002},
      ADDRESS = {Columbus, OH},
      SCHOOL = {Computer and Information Science, Ohio State University}
}

@MastersThesis{Paris:2004,
      AUTHOR = {Paris, Garance},
      TITLE = {Lexical Gender and Non-Native Spoken Word Recognition},
      YEAR = {2004},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Paris:2004:LGN}
}

@MastersThesis{Amoia:2003,
      AUTHOR = {Amoia, Marilisa},
      TITLE = {Generation of definite descriptions with set constraints},
      YEAR = {2003},
      ADDRESS = {Saarbrücken, Saarland},
      ORGANIZATION = {Amoia:2003:GDD},
      SCHOOL = {Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Brockmann:2002,
      AUTHOR = {Brockmann, Carsten},
      TITLE = {Evaluating and Combining Approaches to Selectional Preference},
      YEAR = {2002},
      ADDRESS = {Saarbrücken, Saarland},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Burchardt_Stephan:2002,
      AUTHOR = {Burchardt, Aljoscha and Stephan, Walter},
      TITLE = {BuGS: Tableau Machine for Language Understanding},
      YEAR = {2002},
      ADDRESS = {Im Stadtwald, 66123 Saarbrücken, Saarland},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Crispi:2002,
      AUTHOR = {Crispi, Claudia},
      TITLE = {Linguistische Fragmentkombination und Annotation auf der Basis von Chunk-Parsing},
      YEAR = {2002},
      ADDRESS = {Im Stadtwald, 66123 Saarbrücken, Saarland},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Detemple:2001,
      AUTHOR = {Detemple, Philipp},
      TITLE = {Natürlichsprachliche Bedienung im Kraftfahrzeug - Erweiterung des Dialogkonzeptes um eine Komponente zur Steuerung von Mensch-Maschine-Dialogen},
      YEAR = {2001},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Debusman:2001,
      AUTHOR = {Debusman, Ralph},
      TITLE = {A declarative grammar formalism for dependency grammar},
      YEAR = {2001},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Dege:2003,
      AUTHOR = {Dege, Christopher},
      TITLE = {Integration prosodischer Information in Phonetisierung mit Entscheidungsbäumen},
      YEAR = {2003},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Fliedner:2001_1,
      AUTHOR = {Fliedner, Gerd},
      TITLE = {Überprüfung und Korrektur von Nominalkongruenzen im Deutschen},
      YEAR = {2001},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit},
      ANNOTE = {COLIURL : Fliedner:2001:UKN.pdf}
}

@MastersThesis{Földesi:2003,
      AUTHOR = {Földesi, Christine},
      TITLE = {A Ner-system for Dutch},
      YEAR = {2003},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit},
      ANNOTE = {Foldesi:2003:NSD}
}

@MastersThesis{Fuchss:2004,
      AUTHOR = {Fuchss, Ruth},
      TITLE = {Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation and Analysis},
      YEAR = {2004},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Gabsdil:2001_1,
      AUTHOR = {Gabsdil, Malte},
      TITLE = {Interpreting Answers in dialogue},
      YEAR = {2001},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Freihat:2003,
      AUTHOR = {Freihat, Abdelhakim},
      TITLE = {Linguistische Realisierung von Aggregationskostrukten für multilinguale Texte und mathematische Formeln},
      YEAR = {2003},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Jäger:2002,
      AUTHOR = {Jäger, Tilman},
      TITLE = {AntEx: Ein diagnostizierbares, domänenadaptives Eigennamenerkennungssystem},
      YEAR = {2002},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Klöckner:2002,
      AUTHOR = {Klöckner, Kerstin},
      TITLE = {Arbeitsgedächtnis oder Erfahrenheit: Experimentelle Evidenzen und ihre netzwerkbasierte Simulation zu deutschen Subjekt- und Objektrelativsätzen},
      YEAR = {2002},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Korthals:2002,
      AUTHOR = {Korthals, Christian},
      TITLE = {Unsupervised Learning of Word Order Rules},
      YEAR = {2002},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Mohr:2004,
      AUTHOR = {Mohr, Sibylle},
      TITLE = {Cross-linguale, textuelle Frage-Antwort-Verarbeitung: Linguistische Methoden},
      YEAR = {2004},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Müller:2001_1,
      AUTHOR = {Müller, Christian},
      TITLE = {Symptome von Zeitdruck und kognitiver Belastung in gesprochener Sprache: eine experimentelle Untersuchung},
      YEAR = {2001},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Neis_Schlarb:2003,
      AUTHOR = {Neis, Holger and Schlarb, Hubert},
      TITLE = {Cross-linguale, textuelle Frage-Antwort-Verarbeitung: Algorithmische Methoden},
      YEAR = {2003},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Pfleger:2002,
      AUTHOR = {Pfleger, Norbert},
      TITLE = {Discourse Processing for Multimodal Dialogues and its Application in SmartKom},
      YEAR = {2002},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Raileanu:2002,
      AUTHOR = {Raileanu, Diana},
      TITLE = {Semantic Tagging of Medical Texts with GermaNet},
      YEAR = {2002},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Rinck:2002,
      AUTHOR = {Rinck, Matthias},
      TITLE = {Ein Metaregelformalismus für TG/2},
      YEAR = {2002},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Sacaleanu:2001,
      AUTHOR = {Sacaleanu, Bogdan},
      TITLE = {Domain Specific Tuning and Extension of Lexical Semantic Resources},
      YEAR = {2001},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Sauer:2002,
      AUTHOR = {Sauer, Joachim},
      TITLE = {Textsorten-adaptives Template-Merging - Steigerung der Performanz durch Anaphern-Resolution},
      YEAR = {2002},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Scheffler:2003,
      AUTHOR = {Scheffler, Tatjana},
      TITLE = {Generation with TAG - A Semantics Interface and Syntactic Realizer},
      YEAR = {2003},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Sonntag:2001,
      AUTHOR = {Sonntag, Daniel},
      TITLE = {Dekomposition},
      YEAR = {2001},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Stenzhorn:2002,
      AUTHOR = {Stenzhorn, Holger},
      TITLE = {XtraGen. A Natural Language Generation System Using Java and XML Technologies},
      YEAR = {2002},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Thater:2001,
      AUTHOR = {Thater, Stefan},
      TITLE = {Parsing and Generation with Tree Description},
      YEAR = {2001},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Walter:2003,
      AUTHOR = {Walter, Joachim},
      TITLE = {Der Einsatz von Generierungstechniken in einem natürlichsprachlichen Dialogsystem},
      YEAR = {2003},
      ADDRESS = {Saarbrücken, Germany},
      SCHOOL = {Computerlinguistik, Universität des Saarlandes},
      TYPE = {Diplomarbeit}
}

@MastersThesis{Wan2007,
      AUTHOR = {Wang, Rui},
      TITLE = {Textual Entailment Recognition: A Data-Driven Approach},
      YEAR = {2007},
      SCHOOL = {Universität des Saarlandes, Saarbrücken, Germany},
      NOTE = {HU}
}

@MastersThesis{Ell2007,
      AUTHOR = {Ellsiepen, Emilia},
      TITLE = {The influence of plausible event information on incremental syntactic disambiguation: co-present and recently inspected scenes},
      YEAR = {2007},
      SCHOOL = {Universität des Saarlandes},
      NOTE = {MC}
}

@MastersThesis{Fo2007,
      AUTHOR = {Fokkens, Antske},
      TITLE = {A Hybrid System for Compound Noun Disambiguation},
      YEAR = {2007},
      SCHOOL = {University of Saarland},
      NOTE = {HU}
}