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




@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{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_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}
}

@InProceedings{Becker_et_al:2002,
      AUTHOR = {Becker, Markus and Drozdzynski, Witold and Krieger, Hans-Ulrich and Piskorski, Jakub and Schäfer, Ulrich and Xu, Feiyu},
      TITLE = {SProUT - Shallow Processing with Typed Feature Structures and Unification},
      YEAR = {2002},
      BOOKTITLE = {Proceedings of the International Conference on NLP (ICON 2002). December 18-21},
      ADDRESS = {Mumbai, India},
      URL = {http://www.dfki.de/~feiyu/sprout.pdf},
      ABSTRACT = {We present SProUT, a platform for the development of multilingual shallow text processing systems. A grammar in SProUT consists of a set of rules, where the left-hand side is a regular expression over typed feature structures (TFSs), representing the recognition pattern, and the right-hand side is a sequence of TFSs, specifying how the output structure looks like. The reusable core components fo SProUT are a finite-state machine toolkit, a regular compiler, a typed feature structure package, and a finite-state machine interpreter.},
      ANNOTE = {COLIURL : Becker:2002:SSP.pdf}
}

@Proceedings{Tilman_Hans-Ulrich:1997,
      TITLE = {Proceedings of the Fifth Meeting on Mathematics of Language - MOL5},
      YEAR = {1997},
      NUMBER = {D-97-02},
      EDITOR = {Becker, Tilman and Krieger, Hans-Ulrich},
      SERIES = {DFKI Document},
      ADDRESS = {Saarbrücken},
      PUBLISHER = {DFKI},
      URL = {ftp://ftp.dfki.uni-kl.de/pub/Publications/Documents/1997/D-97-02.tar.gz},
      ABSTRACT = {The Fifth Meeting on Mathematics of Language (MOL5) covers all areas of study that deal with the mathematical properties of natural language. These areas include, but are not limited to, mathematical models of syntax, semantics and phonology; computational complexity of linguistic frameworks/theories and models of natural language processing; mathematical theories of language learning; parsing theory; and quantitative models of language. The 1997 meeting takes place in the wonderfully located Schloss Dagstuhl, the International Meeting and Research Center for Computer Science near Saarbrücken, Germany.},
      ANNOTE = {COLIURL : Becker:1997:PFM.tar}
}

@InProceedings{Crysmann_et_al:2002,
      AUTHOR = {Crysmann, Berthold and Frank, Anette and Kiefer, Bernd and Krieger, Hans-Ulrich and Müller, Stefan and Neumann, Günter and Piskorski, Jakub and Schäfer, Ulrich and Siegel, Melanie and Uszkoreit, Hans and Xu, Feiyu},
      TITLE = {An Integrated Architecture for Shallow and Deep Processing},
      YEAR = {2002},
      BOOKTITLE = {Proceedings of ACL-2002, Association for Computational Linguistics 40th Anniversary Meeting, July 7-12},
      ADDRESS = {Philadelphia, USA},
      URL = {http://www.dfki.de/~feiyu/wb-acl02.pdf http://www.dfki.de/~neumann/publications/new-ps/wb-acl02.pdf},
      ANNOTE = {COLIURL : Crysmann:2002:IAS.pdf}
}

@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}
}

@InProceedings{Graf_Krieger:1990,
      AUTHOR = {Graf, Winfried and Krieger, Hans-Ulrich},
      TITLE = {Bedeutung multimodaler Benutzerschnittstellen am Beispiel eines Expertensystems in der MRI-Diagnostik},
      YEAR = {1990},
      BOOKTITLE = {Biometrie und Informatik - Neue Wege zur Erkenntnisgewinnung in der Medizin. 34. Jahrestagung der GMDS, September 1989},
      VOLUME = {71},
      PAGES = {257-260},
      EDITOR = {Giani, G. and Repges, R.},
      SERIES = {Medizinische Informatik, Biometrie und Epidemiologie},
      ADDRESS = {Aachen, Germany},
      PUBLISHER = {Springer}
}

@InProceedings{Kasper_et_al:1999,
      AUTHOR = {Kasper, Walter and Kiefer, Bernd and Krieger, Hans-Ulrich and Rupp, Christopher J. and Worm, Karsten},
      TITLE = {Charting the Depths of Robust Speech Parsing},
      YEAR = {1999},
      BOOKTITLE = {37th Annual Meeting of the Association for Computational Linguistics (ACLANNUAL '99), June 20-26},
      PAGES = {405-412},
      EDITOR = {ACL},
      ADDRESS = {University of Maryland, College Park, USA},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/131.entry}
}

@InProceedings{Kasper_et_al:1999_1,
      AUTHOR = {Kasper, Walter and Kiefer, Bernd and Krieger, Hans-Ulrich and Rupp, Christopher J. and Worm, Karsten L.},
      TITLE = {Charting the Depths of Robust Speech Parsing},
      YEAR = {1999},
      BOOKTITLE = {Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics (ACL'99), June 20-26},
      PAGES = {405-412},
      ADDRESS = {University of Maryland, College Park, USA},
      URL = {http://acl.ldc.upenn.edu/P/P99/P99-1052.pdf},
      ABSTRACT = {We describe a novel method for coping with ungrammatical input based on the use of chart-like data structures, which permit anytime processing. Priority is given to deep syntactic analysis. Should this fail, the best partial analyses are selected, according to a shortest-paths algorithm, and assembled in a robust processing phase. The method has been applied in a speech translation project with large HPSG grammars.},
      ANNOTE = {COLIURL : Kasper:1999:CDRb.pdf}
}

@InProceedings{Kasper_Krieger:1996,
      AUTHOR = {Kasper, Walter and Krieger, Hans-Ulrich},
      TITLE = {Modularizing Codescriptive Grammars for Efficient Parsing},
      YEAR = {1996},
      BOOKTITLE = {Proceedings of the 16th International Conference on Computational Linguistics (COLING'96), August 5-9},
      PAGES = {628-633},
      EDITOR = {ACL},
      ADDRESS = {Copenhagen, Danmark},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/coling96.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/coling96.entry},
      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:MCGa.pdf Kasper:1996:MCGa.ps}
}

@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}
}

@InProceedings{Kasper_Krieger:1996_2,
      AUTHOR = {Kasper, Walter and Krieger, Hans-Ulrich},
      TITLE = {Integration of Prosodic and Grammatical Information in the Analysis of Dialogs},
      YEAR = {1996},
      BOOKTITLE = {Proceedings of the 20th Annual German Conference on Artificial Intelligence. KI-96: Advances in Artificial Intelligence, September 17-19},
      NUMBER = {1137},
      PAGES = {163-174},
      EDITOR = {Görz, Günther and Hölldobler, Steffen},
      SERIES = {Lecture Notes in Artificial Intelligence},
      ADDRESS = {Dresden, Germany},
      PUBLISHER = {Springer Verlag},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ki96.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ki96.entry},
      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:IPGa.pdf Kasper:1996:IPGa.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}
}

@InProceedings{Kasper_et_al:1995_2,
      AUTHOR = {Kasper, Walter and Krieger, Hans-Ulrich and Diagne, Abdel Kader},
      TITLE = {Distributed Parsing with HPSG Grammars},
      YEAR = {1995},
      BOOKTITLE = {Proceedings of the 4th International Workshop on Parsing Technologies (IWPT'95), September 20-24},
      PAGES = {79-86},
      ADDRESS = {Prague and Karlovy Vary, Czech Republic},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/iwpt95.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/iwpt95.entry},
      ANNOTE = {COLIURL : Kasper:1995:DPH.pdf Kasper:1995:DPH.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}
}

@InProceedings{Kasper_et_al:1996_1,
      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},
      BOOKTITLE = {Proceedings of the Natural Language Processing and Speech Technology: Results of the 3rd KONVENS Conference, October 7-9},
      PAGES = {77-88},
      EDITOR = {Gibbon, Dafydd},
      ADDRESS = {Bielefeld, Germany},
      PUBLISHER = {Mouton de Gruyter},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/konvens96.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/konvens96.entry},
      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:WHLa.pdf Kasper:1996:WHLa.ps}
}

@InProceedings{Kiefer_Krieger:2000,
      AUTHOR = {Kiefer, Bernd and Krieger, Hans-Ulrich},
      TITLE = {A Context-Free Approximation of Head-Driven Phrase Structure Grammar},
      YEAR = {2000},
      BOOKTITLE = {Proceedings of the 6th International Workshop on Parsing Technologies (IWPT'00), February 23-25},
      PAGES = {135-146},
      ADDRESS = {Trento, Italy},
      ABSTRACT = {We present a context-free approximation of unification-based grammars, such as HPSG or PATR-II. The theoretical underpinning is established through a least fixpoint construction over a certain monotonic function. In order to reach a finite fixpoint, the concrete implementation can be parameterized in several ways, either by specifying a finite iteration depth, by using different restrictors, or by making the symbols of the CFG more complex adding annotations à la GPSG. We also present several methods that speed up the approximation process and help to limit the size of the resulting CF grammar.}
}

@InCollection{Kiefer_Krieger:2001,
      AUTHOR = {Kiefer, Bernd and Krieger, Hans-Ulrich},
      TITLE = {A Context-Free Approximation of Head-Driven Phrase Structure Grammar},
      YEAR = {2001},
      BOOKTITLE = {Efficiency in Unification-Based Processing},
      PUBLISHER = {CSLI Lecture Notes},
      ABSTRACT = {We present a context-free approximation of unification-based grammars, such as HPSG or PATR-II. The theoretical underpinning is established through a least fixpoint construction over a certain monotonic function. In order to reach a finite fixpoint, the concrete implementation can be parameterized in several ways, either by specifying a finite iteration depth, by using different restrictors, or by making the symbols of the CFG more complex adding annotations à la GPSG. We also present several methods that speed up the approximation process and help to limit the size of the resulting CF grammar.}
}

@InCollection{Kiefer_Krieger:2002,
      AUTHOR = {Kiefer, Bernd and Krieger, Hans-Ulrich},
      TITLE = {A Context-Free Approximation of Head-Driven Phrase Structure Grammar},
      YEAR = {2002},
      BOOKTITLE = {Collaborative Language Engineering. A Case Study in Efficient Grammar-Based Processing},
      EDITOR = {Oepen, Stephan and Flickinger, Dan and Tsujii, Jun-ichi and Uszkoreit, Hans},
      ADDRESS = {Stanford},
      PUBLISHER = {CSLI Publications},
      ABSTRACT = {We present a context-free approximation of unification-based grammars, such as HPSG or PATR-II. The theoretical underpinning is established through a least fixpoint construction over a certain monotonic function. In order to reach a finite fixpoint, the concrete implementation can be parameterized in several ways, either by specifying a finite iteration depth, by using different restrictors, or by making the symbols of the CFG more complex adding annotations à la GPSG. We also present several methods that speed up the approximation process and help to limit the size of the resulting CF grammar.}
}

@InProceedings{Kiefer_et_al:1999,
      AUTHOR = {Kiefer, Bernd and Krieger, Hans-Ulrich and Carroll, John and Malouf, Robert},
      TITLE = {A Bag of Useful Techniques for Efficient and Robust Parsing},
      YEAR = {1999},
      BOOKTITLE = {Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics (ACL-ANNUAL'99), June 20 - 26},
      PAGES = {473-480},
      ADDRESS = {College Park, Maryland, USA},
      PUBLISHER = {ACL},
      URL = {http://www.cogs.susx.ac.uk/lab/nlp/carroll/papers/acl99.pdf},
      ABSTRACT = {This paper describes new and improved techniques which help a unification based parser to process input efficiently and robustly. In combination these methods result in a speed up in parsing time of more than an order of magnitude. The methods are correct in the sense that none of them rule out legal rule applications.},
      ANNOTE = {COLIURL : Kiefer:1999:BUT.pdf}
}

@InCollection{Kiefer_et_al:2000,
      AUTHOR = {Kiefer, Bernd and Krieger, Hans-Ulrich and Nederhof, Mark-Jan},
      TITLE = {Efficient and Robust Parsing of Word Hypotheses Graphs},
      YEAR = {2000},
      BOOKTITLE = {Verbmobil: Foundations of Speech-to-Speech Translation},
      PAGES = {280-295},
      EDITOR = {Wahlster, Wolfgang},
      ADDRESS = {Berlin},
      PUBLISHER = {Springer},
      ABSTRACT = {This paper describes new and improved techniques which help a unification-based parser to process input efficiently and robustly. In combination these methods result in a speed-up in parsing time of more than an order of magnitude. The methods are correct in the sense that none of them rule out legal rule applications.}
}

@InProceedings{Kiefer_et_al:2002,
      AUTHOR = {Kiefer, Bernd and Krieger, Hans-Ulrich and Prescher, Detlef},
      TITLE = {A Novel Disambiguation Method For Unification-Based Grammars Using Probabilistic Context-Free Approximations},
      YEAR = {2002},
      BOOKTITLE = {Proceedings of the 19th International Conference on Computational Linguistics (COLING'02), August 24 - September 1},
      ADDRESS = {Taipei, Taiwan},
      URL = {http://www.dfki.de/dfkibib/publications/docs/paper-alternative-font2},
      ABSTRACT = {We present a novel disambiguation method for unificationbased grammars (UBGs). In contrast to other methods, our approach obviates the need for probability models on the UBG side in that it shifts the responsibility to simpler contextfree models, indirectly obtained from the UBG. Our approach has three advantages: (i) training can be effectively done in practice, (ii) parsing and disambiguation of contextfree readings requires only cubic time, and (iii) involved probability distributions are mathematically clean. In an experiment for a midsize UBG, we show that our novel approach is feasible. Using unsupervised training, we achieve 88% accuracy on an exactmatch task.},
      ANNOTE = {COLIURL : Kiefer:2002:NDM.pdf Kiefer:2002:NDM.ps}
}

@InProceedings{Kiefer_et_al:2000_1,
      AUTHOR = {Kiefer, Bernd and Krieger, Hans-Ulrich and Siegel, Melanie},
      TITLE = {An HPSG-to-CFG Approximation of Japanese},
      YEAR = {2000},
      BOOKTITLE = {Proceedings of the 18th International Conference on Computational Linguistics (COLING'00), July 31 - August 4},
      VOLUME = {2},
      PAGES = {1046-1050},
      ADDRESS = {Saarbrücken, Deutschland},
      PUBLISHER = {Morgan Kaufmann Publishers},
      URL = {http://www.dfki.de/~siegel/coling00.ps.gz},
      ABSTRACT = {We present a simple approximation method for turn- ing a Head-Driven Phrase Structure Grammar into a context-free grammar. The approximation method can be seen as the construction of the least fixpoint of a certain monotonic function. We discuss an ex- periment with a large HPSG for Japanese.},
      ANNOTE = {COLIURL : Kiefer:2000:HCA.pdf Kiefer:2000:HCA.ps}
}

@InCollection{Krieger:1991,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {Derivation Without Lexical Rules},
      YEAR = {1991},
      BOOKTITLE = {Constraints, Language and Computation},
      PAGES = {277-313},
      EDITOR = {Rupp, Christopher J. and Rosner, Michael and Johnson, Roderick},
      ADDRESS = {London},
      PUBLISHER = {Academic Press},
      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:1991:DLRa.pdf Krieger:1991:DLRa.ps}
}

@InProceedings{Krieger:1991_1,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {Derivation Without Lexical Rules},
      YEAR = {1991},
      BOOKTITLE = {Proceedings of the Workshop on Constraint Propagation, Linguistic Description, and Computation, November},
      NUMBER = {5},
      SERIES = {IDSIA Working Paper},
      ADDRESS = {Lugano, Switzerland},
      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:1991:DLRb.pdf Krieger:1991:DLRb.ps}
}

@InProceedings{Krieger:1991_2,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {Feature-Based Inheritance Networks for Computational Lexicons},
      YEAR = {1991},
      BOOKTITLE = {ACQUILEX Workshop on Default Inheritance in the Lexicon, April 15},
      NUMBER = {238},
      EDITOR = {Briscoe, Ted and Copestake, Ann and de Paiva, Valeria},
      SERIES = {Technical Report},
      ADDRESS = {Cambridge, England}
}

@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}
}

@InCollection{Krieger:1994_1,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {Derivation Without Lexical Rules},
      YEAR = {1994},
      BOOKTITLE = {Constraints, Language and Computation},
      PAGES = {277-313},
      EDITOR = {Rupp, Christopher J. and Rosner, Michael and Johnson, Roderick},
      ADDRESS = {London},
      PUBLISHER = {Academic Press},
      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:1994:DLR.pdf Krieger:1994:DLR.ps}
}

@PhdThesis{Krieger:1995,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {TDL - A Type Description Language for Constraint-Based Grammars. Foundation, Implementation, and Application},
      YEAR = {1995},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes, Department of Computer Science},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/diss.entry}
}

@InProceedings{Krieger:1995_1,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {Typed Feature Structures, Definite Equivalences, Greatest Model Semantics, and Nonmonotonicity},
      YEAR = {1995},
      BOOKTITLE = {Proceedings of the 4th Meeting on Mathematics of Language (MOL4), October 26-28},
      ADDRESS = {Philadelphia, USA},
      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:TFSa.pdf Krieger:1995:TFSa.ps}
}

@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}
}

@InProceedings{Krieger:1995_3,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {Classification and Representation of Types in TDL},
      YEAR = {1995},
      BOOKTITLE = {Proceedings of the International KRUSE Symposium, Knowledge Retrieval, Use, and Storage for Efficiency, August 11-13},
      PAGES = {74-85},
      ADDRESS = {University of California, Santa Cruz, USA},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kruse-llncs.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kruse-llncs.entry},
      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:CRTb.pdf Krieger:1995:CRTb.ps}
}

@InProceedings{Krieger:1995_4,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {Typed Feature Formalisms as a Common Basis for Linguistic Specification},
      YEAR = {1995},
      BOOKTITLE = {Proceedings of the 3rd International EAMT Workshop, April 26-28},
      PAGES = {101-119},
      EDITOR = {Steffens, Petra},
      SERIES = {Machine Translation and the Lexicon},
      ADDRESS = {Heidelberg, Germany},
      PUBLISHER = {Springer Verlag},
      URL = {ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1994/RR-94-39.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-39.ps.Z},
      ABSTRACT = {Typed feature formalisms (TFF) play an increasingly important role in CL and NLP. Many of these systems are inspired by Pollard and Sag's work on Head-Driven Phrase Structure Grammar (HPSG), which has shown that a great deal of syntax and semantics can be neatly encoded within TFF. However, syntax and semantics are not the only areas in which TFF can be beneficially employed. In this paper, I will show that TFF can also be used as a means to model finite automata (FA) and to perform certain types of logical inferencing. In particular, I will (i) describe how FA can be defined and processed within TFF and (ii) propose a conservative extension to HPSG, which allows for a restricted form of semantic processing within TFF, so that the construction of syntax and semantics can be intertwined with the simplification of the logical form of an utterance. The approach which I propose provides a uniform, HPSG-oriented framework for different levels of linguistic processing, including allomorphy and morphotactics, syntax, semantics, and logical form simplification.},
      ANNOTE = {COLIURL : Krieger:1995:TFF.pdf Krieger:1995:TFF.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}
}

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

@Article{Krieger:2001,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {Greatest Model Semantics for Typed Feature Structures},
      YEAR = {2001},
      JOURNAL = {Grammars},
      VOLUME = {4},
      NUMBER = {2},
      PAGES = {139-165},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/2001_krieger_grammars.entry}
}

@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}
}

@InCollection{Krieger_Nerbonne:1993,
      AUTHOR = {Krieger, Hans-Ulrich and Nerbonne, John},
      TITLE = {Feature-Based Inheritance Networks for Computational Lexicons},
      YEAR = {1993},
      BOOKTITLE = {Inheritance, Defaults, and the Lexicon},
      PAGES = {90-136},
      EDITOR = {Briscoe, Ted and Copestake, Ann and de Paiva, Valeria},
      SERIES = {Studies in Natural Language Processing},
      ADDRESS = {New York},
      PUBLISHER = {Cambridge University Press},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/128.entry}
}

@InProceedings{Krieger_et_al:1993,
      AUTHOR = {Krieger, Hans-Ulrich and Pirker, Hannes and Nerbonne, John},
      TITLE = {Feature-Based Allomorphy},
      YEAR = {1993},
      BOOKTITLE = {31st Annual Meeting of the Association for Computational Linguistics (ACL '93), June 22-26},
      PAGES = {140-147},
      EDITOR = {ACL},
      ADDRESS = {Ohio State University, Columbus, Ohio, USA},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-93-28.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-93-28.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-93-28.ps.Z},
      ANNOTE = {COLIURL : Krieger:1993:FBA.pdf Krieger:1993:FBA.ps Krieger:1993:FBA.dvi}
}

@InProceedings{Krieger_Schäfer:1993,
      AUTHOR = {Krieger, Hans-Ulrich and Schäfer, Ulrich},
      TITLE = {TDL - A Type Description Language for Unification-Based Grammars},
      YEAR = {1993},
      BOOKTITLE = {Proceedings of the Workshop on Neuere Entwicklungen der deklarativen KI-Programmierung},
      NUMBER = {RR-93-35},
      PAGES = {67-82},
      EDITOR = {Boley, Harold and Bry, François and Geske, Ulrich},
      SERIES = {DFKI Research Report},
      ADDRESS = {Saarbrücken, Germany},
      PUBLISHER = {DFKI},
      URL = {http://www.dfki.de/dfkibib/publications/docs/long_version.ps},
      ABSTRACT = {This paper presents TDL, a typed feature-based representation language and inference system. Type definitions in TDL consist of type and feature constraints over the boolean connectives. TDL supports open- and closed-world reasoning over types and allows for partitions and incompatible types. Working with partially as well as with fully expanded types is possible. Efficient reasoning in TDL is accomplished through specialized modules.},
      ANNOTE = {COLIURL : Krieger:1993:TTD.pdf Krieger:1993:TTD.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}
}

@InProceedings{Krieger_Schäfer:1994,
      AUTHOR = {Krieger, Hans-Ulrich and Schäfer, Ulrich},
      TITLE = {TDL - A Type Description Language for Constraint-Based Grammars},
      YEAR = {1994},
      BOOKTITLE = {Proceedings of the15th International Conference on Computational Linguistics (COLING '94), August 5-9},
      VOLUME = {2},
      PAGES = {893-899},
      EDITOR = {ACL},
      ADDRESS = {Kyoto, Japan},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/tdl-coli94.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/tdl-coli94.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/tdl-coli94.ps.Z},
      ANNOTE = {COLIURL : Krieger:1994:TTDa.pdf Krieger:1994:TTDa.ps Krieger:1994:TTDa.dvi}
}

@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}
}

@InProceedings{Krieger_Schäfer:1995,
      AUTHOR = {Krieger, Hans-Ulrich and Schäfer, Ulrich},
      TITLE = {Efficient Parameterizable Type Expansion for Typed Feature Formalisms},
      YEAR = {1995},
      BOOKTITLE = {14th International Joint Conference on Artificial Intelligence (IJCAI '95), August 20-25},
      PAGES = {1428-1434},
      ADDRESS = {Montréal, Québec, Canada},
      PUBLISHER = {Morgan Kaufmann Publishers},
      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:EPTa.pdf Krieger:1995:EPTa.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}
}

@InProceedings{Strom_et_al:1997,
      AUTHOR = {Strom, Volker and Elsner, Aanja and Hess, Wolfgang and Kasper, Walter and Klein, Alexandra and Krieger, Hans-Ulrich and Spilker, Jörg and Weber, Hans and Görz, Günther},
      TITLE = {On the Use of Prosody in a Speech-to-Speech Translator},
      YEAR = {1997},
      BOOKTITLE = {Proceedings of the 5th Biennial European Conference on Speech Communication and Technology (Eurospeech'97), September 22-25},
      PAGES = {1479-1482},
      ADDRESS = {Rhodes, Greece},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/eurospeech_paper.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/eurospeech97.entry},
      ABSTRACT = {In this paper a speech-to-speech translator from German to English is presented. Beside the traditional processing steps it takes advantage of acoustically detected prosodic phrase boundaries and focus. The prosodic phrase boundaries reduce search space during syntactic parsing and rule out analysis trees during semantic parsing. The prosodic focus faciliates a shallow translation based on the best word chain in cases where the deep analysis fails.},
      ANNOTE = {COLIURL : Strom:1997:UPS.ps}
}

@InProceedings{Uszkoreit_et_al:1994,
      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, Stephan and Spackman, Stephen P.},
      TITLE = {DISCO - An HPSG-Based NLP System and its Application for Appointment Scheduling},
      YEAR = {1994},
      BOOKTITLE = {Proceedings of the 15th International Conference on Computational Linguistics (COLING'94), August 5-9},
      VOLUME = {1},
      PAGES = {436-440},
      ADDRESS = {Kyoto, Japan},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/coli.ps.Z ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1994/RR-94-38.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/coli.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/coli.entry},
      ABSTRACT = {The natural language system DISCO is described. It combines - a powerful and flexible grammar development system - linguistic competence for German including morphology, syntax and semantics - new methods for linguistic performance modelling on the basis of high-level competence grammars - new methods for modelling multi-agent dialogue competence - an interesting sample application for appointment scheduling and calendar management},
      ANNOTE = {COLIURL : Uszkoreit:1994:DHBa.pdf Uszkoreit:1994:DHBa.ps}
}

@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}
}

@InProceedings{Bering_et_al:2003,
      AUTHOR = {Bering, Ch. and Drozdzynski, Witold and Erbach, Gregor and Guasch, C. and Homola, P. and Lehmann, Sabine and Li, Hong and Krieger, Hans-Ulrich and Piskorski, Jakub and Schäfer, Ulrich and Shimada, Atsuko and Siegel, Melanie and Xu, Feiyu and Ziegler-Eisele, Dorothea},
      TITLE = {Corpora and Evaluation Tools for Multilingual Named Entity Grammar Development},
      YEAR = {2003},
      BOOKTITLE = {Proceedings of the Workshop on Multilingual Corpora, Corpus Linguistics Conference},
      EDITOR = {Neumann, Stella and Hansen-Schirra, Silvia},
      ADDRESS = {Lancaster}
}

@InProceedings{Busemann_et_al:2003,
      AUTHOR = {Busemann, Stephan and Drozdzynski, Witold and Krieger, Hans-Ulrich and Piskorski, Jakub and Schäfer, Ulrich and Uszkoreit, Hans and Xu, Feiyu},
      TITLE = {Integrating Information Extraction and Automatic Hyperlinking},
      YEAR = {2003},
      BOOKTITLE = {Proceedings of ACL-2003, 41st Annual Meeting of the Association for Computational Linguistics},
      ADDRESS = {Sapporo, Japan}
}

@InProceedings{FKXU2005,
      AUTHOR = {Frank, Anette and Krieger, Hans-Ulrich and Xu, Feiyu and Uszkoreit, Hans},
      TITLE = {Querying Structured Knowledge Sources},
      YEAR = {2005},
      BOOKTITLE = {Proceedings of AAAI-05. Workshop on Question Answering in Restricted Domains},
      ADDRESS = {Pittsburgh, Pennsylvania},
      PUBLISHER = {AAAI Press}
}

@InProceedings{BUFK2006,
      AUTHOR = {Bertomeu, Nuria and Uszkoreit, Hans and Frank, Anette and Krieger, Hans-Ulrich},
      TITLE = {Contextual phenomena and thematic relations in database QA dialogues: results from a Wizard-of-Oz Experiment},
      YEAR = {2006},
      BOOKTITLE = {Proceedings of the HLT-NAACL 2006 Workshop on Interactive Question Answering, New York}
}

@Article{FrKrXuUsCrSc2007,
      AUTHOR = {Frank, Anette and Krieger, Hans-Ulrich and Xu, Feiyu and Uszkoreit, Hans and Crysmann, Berthold and Schäfer, Ulrich},
      TITLE = {Question Answering from Structured Knowledge Sources},
      YEAR = {2007},
      JOURNAL = {Journal of Applied Logics, Special Issue on Questions and Answers: Theoretical and Applied Perspectives},
      VOLUME = {5},
      NUMBER = {1},
      PAGES = {20-48},
      NOTE = {HU, MP}
}

@InProceedings{DeKrKiSpLe2997,
      AUTHOR = {Declerck, Thierry and Krieger, Hans-Ulrich and Kiefer, Bernd and Spies, Marcus and Leibold, Christian},
      TITLE = {Integration of Semantic Resources and Tools for Business Intelligence},
      YEAR = {2007},
      BOOKTITLE = {International Workshop on Semantic-Based Software Development, Montreal, Canada},
      NOTE = {HU}
}

@InProceedings{KrKiDe2008,
      AUTHOR = {Krieger, Hans-Ulrich and Kiefer, Bernd and Declerck, Thierry},
      TITLE = {A framework for temporal representation and reasoning in business intelligence applications},
      YEAR = {2008},
      BOOKTITLE = {AI meets business rules and process management : papers from the AAAI spring symposium ; [held March 26 - 28, 2008 at Stanford University, Stanford, California, USA]},
      ADDRESS = {Menlo Park, Calif.},
      ORGANIZATION = {AAAI},
      PUBLISHER = {AAAI Press},
      NOTE = {HU}
}

@InProceedings{KrKiDe2008a,
      AUTHOR = {Krieger, Hans-Ulrich and Kiefer, Bernd and Declerck, Thierry},
      TITLE = {A hybrid reasoning architecture for business intelligence applications},
      YEAR = {2008},
      BOOKTITLE = {Proceedings of the 2008 8th International Conference on Hybrid Intelligent Systems : Barcelona, Spain, September 10-12, 2008},
      PAGES = {843-848},
      ADDRESS = {Los Alamitos, CA},
      ORGANIZATION = {IEEE Computer Society},
      NOTE = {HU}
}

@InProceedings{DeKrSpSa2008,
      AUTHOR = {Declerck, Thierry and Krieger, Hans-Ulrich and Spies, Marcus and Saggion, Horacio},
      TITLE = {Human language and semantic web technologies for business intelligence applications},
      YEAR = {2008},
      BOOKTITLE = {Proceedings of LangTech : 28-29 February, 2008, Rome, Italy},
      NOTE = {HU}
}

@InProceedings{DeKrSaSp2008,
      AUTHOR = {Declerck, Thierry and Krieger, Hans-Ulrich and Saggion, Horacio and Spies, Marcus},
      TITLE = {Ontology-driven human language technology for semantic-based business intelligence},
      YEAR = {2008},
      BOOKTITLE = {ECAI 2008 : 18th European Conference on Artificial Intelligence, July 21 - 25, 2008, Patras, Greece ... ; proceedings. - Amsterdam, (Frontiers in artificial intelligence and applications ; 178)},
      PAGES = {841-843},
      ADDRESS = {Amsterdam},
      PUBLISHER = {IOS Press},
      NOTE = {HU}
}

@InProceedings{Kr2008,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {Where temporal description logics fall : representing temporally-changing relationships},
      YEAR = {2008},
      BOOKTITLE = {KI 2008: advances in artificial intelligence : 31st Annual German Conference on AI, KI 2008, Kaiserslautern, Germany, September 23 - 26, 2008 ; proceedings, (Lecture notes in computer science ; 5243 : Lecture notes in artificial intelligence)},
      PAGES = {249-257},
      ADDRESS = {Berlin},
      PUBLISHER = {Springer},
      NOTE = {HU}
}

@InProceedings{KriKru2011,
      AUTHOR = {Krieger, Hans-Ulrich and Kruijff, Geert-Jan M.},
      TITLE = {Combining uncertainty and description logic rule-based reasoning in situation-aware robots},
      YEAR = {2011},
      BOOKTITLE = {Logical formalizations of commonsense reasoning : papers from the AAAI spring symposium ; [held March 21 - 23, 2011 at Stanford University, Stanford, California USA]. (Technical report / Association for the Advancement of Artificial Intelligence ; SS-11-0},
      PAGES = {147-150},
      ADDRESS = {Menlo Park, Calif.},
      PUBLISHER = {AAAI Press},
      NOTE = {HU,
978-1-577-35498-7}
}

@InProceedings{Kri2011,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {A temporal extension of the Hayes/ter Horst entailment rules and a detailed comparison with W3C´s N-ary relations},
      YEAR = {2011},
      BOOKTITLE = {Research report / Deutsches Forschungszentrum für Künstliche Intelligenz ; RR-11-02},
      PUBLISHER = {DFKI}
}

@InProceedings{Kri2011b,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {An efficient direct implementation of equivalence relations in OWL},
      YEAR = {2011},
      BOOKTITLE = {Research report / Deutsches Forschungszentrum für Künstliche Intelligenz ; RR-11-01},
      PUBLISHER = {DFKI}
}

@InProceedings{KriKi2011,
      AUTHOR = {Krieger, Hans-Ulrich and Kiefer, Bernd},
      TITLE = {Converting CCGs into typed feature structure grammars},
      YEAR = {2011},
      BOOKTITLE = {Proceedings of the HPSG 2011 Conference : [Seattle, Wash.], University of Washington, August 22–25, 2011 / 18th International Conference on Head-Driven Phrase Structure Grammar},
      PAGES = {109–125},
      ADDRESS = {Stanford, Calif.},
      PUBLISHER = {CSLI Publications}
}

@InProceedings{Kri2011c,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {An efficient direct implementation of equivalence relations in OWL},
      YEAR = {2011},
      BOOKTITLE = {Research report / Deutsches Forschungszentrum für Künstliche Intelligenz ; RR-11-01},
      ADDRESS = {Kaiserslautern ; Saarbrücken ; Bremen}
}

@InProceedings{ZhaKri,
      AUTHOR = {Zhang, Yi and Krieger, Hans-Ulrich},
      TITLE = {Large-scale corpus-driven PCFG approximation of an HPSG},
      YEAR = {2011},
      MONTH = {5-7 October},
      BOOKTITLE = {Proceedings of the 12th International Conference on Parsing Technologies : IWPT 2011},
      PAGES = {198-208},
      ADDRESS = {Stroudsburg, PA},
      ORGANIZATION = {Dublin City University},
      PUBLISHER = {ACL},
      NOTE = {ISBN/ISSN: 978-1-932432-04-6}
}

@InProceedings{DecKol2012,
      AUTHOR = {Declerck, Thierry and Koleva, Nikolina and Krieger, Hans-Ulrich},
      TITLE = {Ontology-based incremental annotation of characters in folktales},
      YEAR = {2012},
      MONTH = {24-24 April},
      BOOKTITLE = {Proccedings of the 6th Workshop on Language Technology for Cultural Heritage, Social Sciences, and Humanities (LaTeCH 2012)},
      PAGES = {30-34},
      ADDRESS = {Stroudsburg, PA},
      NOTE = {HU}
}

@InProceedings{Krie2012,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {A temporal extension of the Hayes/ter Horst entailment rules and an alternative to W3C´s N-ary relations},
      YEAR = {2012},
      BOOKTITLE = {Formal ontology in information systems : proceedings of the seventh international conference (FOIS 2012)},
      PAGES = {323 - 335},
      NOTE = {HU}
}

@InProceedings{KrieDec2012,
      AUTHOR = {Krieger, Hans-Ulrich and Declerck, Thierry and Nedunchezhian, Asok},
      TITLE = {MFO - the federated financial ontology for the MONNET project},
      YEAR = {2012},
      MONTH = {4-7 October},
      BOOKTITLE = {KEOD 2012 : proceedings of the International Conference on Knowledge Engineering and Ontology Development},
      PAGES = {327-330},
      PUBLISHER = {SciTePress},
      NOTE = {HU}
}

@InProceedings{FedGro2012,
      AUTHOR = {Federmann, Christian and Gromann, Dagmar and Declerck, Thierry and Hunsicker, Sabine and Krieger, Hans-Ulrich and Budin, Gerhard},
      TITLE = {Multilingual terminology acquisition for ontology-based information extraction},
      YEAR = {2012},
      BOOKTITLE = {New frontiers in the constructive symbiosis of terminology and knowledge engineering : proceedings of the 10th Terminology and Knowledge Engineering Conference (TKE 2012)},
      PAGES = {166-175},
      ADDRESS = {Madrid},
      NOTE = {HU}
}

@InProceedings{DecKrie2012,
      AUTHOR = {Declerck, Thierry and Krieger, Hans-Ulrich and Gromann, Dagmar},
      TITLE = {Acquisition, representation, and extension of multilingual labels of financial ontologies},
      YEAR = {2012},
      BOOKTITLE = {Workshop Challenges to Knowledge Representation in Multilingual Contexts : TKE 2012},
      PAGES = {17-26},
      ADDRESS = {Madrid},
      NOTE = {HU}
}

@InProceedings{KolDec2012,
      AUTHOR = {Koleva, Nikolina and Declerck, Thierry and Krieger, Hans-Ulrich},
      TITLE = {An ontology-based iterative text processing strategy for detecting and recognizing characters in folktales},
      YEAR = {2012},
      MONTH = {16-22 July},
      BOOKTITLE = {Digital Humanities 2012 : conference abstracts},
      PAGES = {470-473},
      ADDRESS = {Hamburg},
      PUBLISHER = {Hamburg Univ. Press},
      NOTE = {HU}
}

@InProceedings{KieKrie2013,
      AUTHOR = {Kiefer, Bernd and Krieger, Hans-Ulrich},
      TITLE = {An efficient typed feature structure index : theory and implementation},
      YEAR = {2013},
      MONTH = {27-29 November},
      BOOKTITLE = {Proceedings of the 13th International Conference on Parsing Technologies, IWPT-2013},
      PAGES = {17-25},
      ADDRESS = {Nara},
      NOTE = {HU}
}

@InProceedings{Krie2013,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {An efficient implementation of equivalence relations in OWL via rule and query rewriting},
      YEAR = {2013},
      MONTH = {26-28 June},
      BOOKTITLE = {Proceedings / 2013 IEEE Seventh International Conference on Semantic Computing, ICSC 2013},
      PAGES = {260-263},
      ADDRESS = {Los Alamitos, California},
      ORGANIZATION = {IEEE},
      NOTE = {HU}
}

@InProceedings{OriCou2013,
      AUTHOR = {O'Riain, Sean and Coughlan, Barry and Buitelaar, Paul and Declerck, Thierry and Krieger, Hans-Ulrich and Marie-Thomas, Susan},
      TITLE = {Cross-lingual querying and comparison of linked financial and business data},
      YEAR = {2013},
      MONTH = {26-30 May},
      BOOKTITLE = {The semantic web: ESWC 2013 satellite events},
      PAGES = {242-247},
      EDITOR = {Cimiano, Philipp and Fernández, Miriam and Lopez, Vanessa and Schlobach, Stefan and Völker, Johanna},
      SERIES = {Lecture notes in computer science},
      ADDRESS = {Montpellier},
      PUBLISHER = {Springer},
      NOTE = {HU}
}

@InProceedings{KrieDec2013,
      AUTHOR = {Krieger, Hans-Ulrich and Declerck, Thierry},
      TITLE = {The xEBR ontology : transforming the XBRL Europe business registers taxonomy into an OWL ontology},
      YEAR = {2013},
      MONTH = {16-18 April},
      BOOKTITLE = {XBRL 26 : international conference},
      ADDRESS = {Dublin, Ireland},
      NOTE = {HU}
}

@InProceedings{Kri2014,
      AUTHOR = {Krieger, Hans-Ulrich},
      TITLE = {A Detailed Comparison of Seven Approaches for the Annotation of Time-Dependent Factual Knowledge in RDF and OWL},
      YEAR = {2014},
      BOOKTITLE = {Proceedings of the 10th Joint ACL-ISO Workshop on Interoperable Semantic Annotation (held in conjunction with LREC 2014), European Language Resources Association}
}

@InProceedings{DecKri2014,
      AUTHOR = {Declerck, Thierry and Krieger, Hans-Ulrich},
      TITLE = {Harmonization of German Lexical Resources for Opinion Mining},
      YEAR = {2014},
      MONTH = {May},
      BOOKTITLE = {Proceedings of the 9th International Conference on Language Resources and Evaluation (LREC-2014)},
      ADDRESS = {Reykjavik, Iceland}
}

@InProceedings{KriSpu2014,
      AUTHOR = {Krieger, Hans-Ulrich and Spurk, Christian and Uszkoreit, Hans and Xu, Feiyu and Zhang, Yi and Müller, F. and Tolxdorff, Thomas},
      TITLE = {Information Extraction from German Patient Records via Hybrid Parsing and Relation Extraction Strategies},
      YEAR = {2014},
      BOOKTITLE = {Proceedings of the 9th International Conference on Language Resources and Evaluation (LREC-2014), European Language Resources Association},
      ADDRESS = {Reykjavik, Iceland}
}

@InProceedings{KriDec2014,
      AUTHOR = {Krieger, Hans-Ulrich and Declerck, Thierry},
      TITLE = {TMO - The Federated Ontology of the TrendMiner Project},
      YEAR = {2014},
      BOOKTITLE = {Proceedings of the Ninth International Conference on Language Resources and Evaluation (LREC'14)},
      ADDRESS = {Reykjavik, Iceland},
      ORGANIZATION = {European Language Resource Association}
}