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




@Article{Baum_et_al:2001,
      AUTHOR = {Baum, Micha and Erbach, Gregor and Kommenda, Markus},
      TITLE = {Spracherkennung: Kommunikation mit Maschinen},
      YEAR = {2001},
      JOURNAL = {Funkschau},
      VOLUME = {1/ 2001},
      PAGES = {26-29},
      URL = {http://www.dfki.de/dfkibib/publications/docs/funkschau.pdf},
      ANNOTE = {COLIURL : Baum:2001:SKM.pdf}
}

@InProceedings{Capstick_et_al:2002,
      AUTHOR = {Capstick, Joanne and Declerck, Thierry and Erbach, Gregor and Jameson, Anthony and Jörg, Brigitte and Karger, Reinhard and Uszkoreit, Hans and Wahlster, Wolfgang and Wegst, Tillmann},
      TITLE = {COLLATE: Competence Center in Speech and Language Technology},
      YEAR = {2002},
      BOOKTITLE = {Proceedings of the 3rd International Conference on Language Resources an Evaluation (LREC'02), May 28-31},
      ADDRESS = {Las Palmas, Canary Islands, Spain},
      URL = {https://www.coli.uni-saarland.de/~erbach/pub/collate_lrec_2002.pdf},
      ABSTRACT = {This paper presents the structure and activitities of the recently established Competence Center in Speech and Language Technology in Saarbrücken. The objectives of the Competence Center are to provide a comprehensive information service about speech and language technologies, including live demonstrations of the most important language technology (LT) systems, and to advance the state of the art in the evaluation of LT systems for realworld applications. The Competence Center comprises the following components: 1. the Virtual Information Center Language Technology World (www.ltworld.org), the world's most comprehensive information resource about speech and language technology 2. the Demonstration Center in Saarbrücken, which offers interested parties the possibility to play and experiment with different speech and language technologies, or to attend guided demonstrations, 3. the Evaluation Center, which conducts evaluations of the overall usability of language technology systems and advances knowledge of relevant usability issues and evaluation methods. The work presented in this paper was carried out by the German Research Center for Artificial Intelligence in collaboration with Saarland University in the context of the project COLLATE (COmputational Linguistics and LAnguage TEchnology for Real Life Applications), funded by the German Federal Ministry of Education and Research (www.bmbf.de).},
      ANNOTE = {COLIURL : Capstick:2002:CCC.pdf}
}

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

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

@Article{Capstick_et_al:1999,
      AUTHOR = {Capstick, Joanne and Diagne, Abdel Kader and Erbach, Gregor and Uszkoreit, Hans and Leisenberg, Anne and Leisenberg, Manfred},
      TITLE = {A System for Supporting Cross-Lingual Retrieval},
      YEAR = {1999},
      JOURNAL = {Information Processing and Management. An International Journal},
      VOLUME = {36},
      NUMBER = {2},
      PAGES = {275-289},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mulinex-ipm99.pdf ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mulinex-ipm99.ps},
      ANNOTE = {COLIURL : Capstick:1999:SSC.pdf Capstick:1999:SSC.ps}
}

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

@InProceedings{Dörre_et_al:1996,
      AUTHOR = {Dörre, Jochen and Erbach, Gregor and Manandhar, Suresh and Skut, Wojciech and Uszkoreit, Hans},
      TITLE = {A Report on the Draft EAGLES Encoding Standard for HPSG},
      YEAR = {1996},
      BOOKTITLE = {Proceedings of the 3rd International Conference on HPSG and Traitement Automatique du Langage Naturel (TALN'96), May 22-24},
      PAGES = {161-168},
      ADDRESS = {Marseille, France},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/eagles-taln96.ps ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/eagles-taln96.pdf},
      ANNOTE = {COLIURL : Dorre:1996:RDE.pdf Dorre:1996:RDE.ps}
}

@TechReport{Engelkamp_et_al:1992,
      AUTHOR = {Engelkamp, Judith and Erbach, Gregor and Uszkoreit, Hans},
      TITLE = {Handling Linear Precedence Constraints by Unification},
      YEAR = {1992},
      MONTH = {January},
      NUMBER = {19},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {https://www.coli.uni-saarland.de/~erbach/pub/acl92/eeu-ACL92.pdf},
      ABSTRACT = {Linear precedence (LP) rules are widely used for stating word order principles. They have been adopted as constraints by HPSG but no encoding in the formalism has been provided. Since they only order siblings, they are not quite adequate, at least not for German. We propose a notion of LP constraints that applies to linguistically motivated branching domains such as head domains. We show a type-based encoding in an HPSG-style formalism that supports processing. The encoding can be achieved by a compilation step.},
      ANNOTE = {COLIURL : Engelkamp:1992:HLPa.pdf}
}

@InProceedings{Engelkamp_et_al:1992_1,
      AUTHOR = {Engelkamp, Judith and Erbach, Gregor and Uszkoreit, Hans},
      TITLE = {Handling Linear Precedence Constraints by Unification},
      YEAR = {1992},
      BOOKTITLE = {Proceedings of the 30th Annual Meeting of the Association of Computational Linguistics, June 28 - July 2},
      PAGES = {201-208},
      ADDRESS = {Delaware, USA},
      PUBLISHER = {ACL},
      URL = {https://www.coli.uni-saarland.de/~erbach/pub/acl92/eeu-ACL92.pdf},
      ANNOTE = {COLIURL : Engelkamp:1992:HLPb.pdf}
}

@Book{Erbach:1986,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Textverarbeitungsprogramme - heute und morgen},
      YEAR = {1986},
      SERIES = {KMI Bürowirtschaft Lehre und Praxis},
      ADDRESS = {Darmstadt},
      PUBLISHER = {Winklers Verlag}
}

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

@TechReport{Erbach:1990,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Syntactic Processing of Unknown Words},
      YEAR = {1990},
      NUMBER = {131},
      ADDRESS = {Stuttgart},
      TYPE = {IWBS Report},
      INSTITUTION = {IBM}
}

@InProceedings{Erbach:1990_1,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Syntactic Processing of Unknown Words},
      YEAR = {1990},
      BOOKTITLE = {Artificial Intelligence IV - Methodology, Systems, Applications (AIMSA '90)},
      PAGES = {371-382},
      EDITOR = {Jorrand, P. and Sgurev, V.},
      ADDRESS = {Amsterdam, The Netherlands},
      ANNOTE = {COLIURL : Erbach:1990:SPUb.pdf}
}

@TechReport{Erbach:1990_2,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Natural Language Understanding in LILOG: An Intermediate Overview},
      YEAR = {1990},
      NUMBER = {137},
      PAGES = {43-47},
      ADDRESS = {Stuttgart},
      TYPE = {IWBS Report},
      INSTITUTION = {IBM Deutschland GmbH}
}

@TechReport{Erbach:1990_3,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Parsing},
      YEAR = {1990},
      NUMBER = {IWBS Report 137},
      ADDRESS = {Stuttgart},
      INSTITUTION = {IBM Deutschland GmbH}
}

@TechReport{Erbach:1990_4,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Syntactic Processing of Unknown Words},
      YEAR = {1990},
      MONTH = {September},
      NUMBER = {3},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      ABSTRACT = {A method for processing sentences which contain unknown words, i. e. words for which no lexical entry exists, is presented. There are three different stages of processing: The sentence with the unknown word is parsed. There are no special requirements for the parsing algorithm, but the lexical lookup procedure needs to be modified. Based on the syntactic structure of the parse, information about the unknown word can be extracted. The information obtained in step 2 may be too fully specified for a lexical entry. Therefore a filter is applied to it to create a new lexical entry. An application of the method is illustrated with examples from Categorial Unification Grammar. The problem of using the extracted information for lexical knowledge acquisition is discussed.}
}

@TechReport{Erbach:1991,
      AUTHOR = {Erbach, Gregor},
      TITLE = {A Flexible Parser for a Linguistic Development Environment},
      YEAR = {1991},
      MONTH = {May},
      NUMBER = {9},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      ABSTRACT = {We describe the parser of LEU/2, the Linguistic Experimentation Environment of the LILOG project. The parser is designed to support and encourage experimentation with different grammars, different styles of writing grammar, and with different parsing strategies. Unlike the parser of the first LILOG prototype, which was designed specifically for Categorial Unification Grammars, the present parser places hardly any restrictions on the format of the grammar, and also supports rules in ID/LP-format under two interpretations of LP statements. Empty categories can be processed. The parser includes a mechanism for processing unknown words, and for determining sentence boundaries in continuous text. The parser is a bottom-up chart parser for grammars encoded in STUF. Although the emphasis of the parser is on experimentation with different grammars rather than efficient analysis of texts, we have tried to make the parser as efficient as possible to make it a powerful experimentation tool for the grammar designer. In order to implement parsing strategies, the parsing process is decomposed into individual parsing tasks, which are placed onto an agenda according to their priority. This paper consists of two parts. In the first part, we discuss various choices in parser design, and motivate our design decisions by the use of the parser in a linguistic development environment. In the second part, the parser is described in more detail. Some familiarity with chart parsing is assumed.},
      ANNOTE = {COLIURL : Erbach:1991:FPLa.pdf}
}

@TechReport{Erbach:1991_1,
      AUTHOR = {Erbach, Gregor},
      TITLE = {An Environment for Experimenting with Parsing Strategies},
      YEAR = {1991},
      NUMBER = {167},
      ADDRESS = {Stuttgart},
      TYPE = {IWBS Report},
      INSTITUTION = {IBM Deutschland GmbH}
}

@InCollection{Erbach:1991_2,
      AUTHOR = {Erbach, Gregor},
      TITLE = {A Flexible Parser for a Linguistic Development Environment},
      YEAR = {1991},
      BOOKTITLE = {Textunderstanding in LILOG. Integrating Computational Linguistics and Artificial Intelligence.},
      PAGES = {74-87},
      EDITOR = {Herzog, Otthein and Rollinger, C.-R.},
      SERIES = {Lecture Notes in Artificial Intelligence},
      ADDRESS = {Berlin},
      PUBLISHER = {Springer Verlag},
      ANNOTE = {COLIURL : Erbach:1991:FPLb.pdf}
}

@InProceedings{Erbach:1991_3,
      AUTHOR = {Erbach, Gregor},
      TITLE = {An Environment for Experimenting with Parsing Strategies},
      YEAR = {1991},
      BOOKTITLE = {12th International Joint Conference on Artificial Intelligence (IJCAI '91), August 24-30},
      VOLUME = {2},
      PAGES = {931-936},
      EDITOR = {Mylopoulos, John and Reiter, Raymond},
      ADDRESS = {Sydney, Australia},
      PUBLISHER = {Morgan Kaufmann},
      ANNOTE = {COLIURL : Erbach:1991:EEPb.pdf}
}

@TechReport{Erbach:1991_4,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Lexical Representation of Idioms},
      YEAR = {1991},
      NUMBER = {169},
      ADDRESS = {Stuttgart},
      TYPE = {IWBS-Report},
      INSTITUTION = {IBM Deutschland GmbH}
}

@TechReport{Erbach:1991_5,
      AUTHOR = {Erbach, Gregor},
      TITLE = {A Bottom-Up Algorithm for Parsing and Generation},
      YEAR = {1991},
      MONTH = {February},
      NUMBER = {5},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {https://www.coli.uni-saarland.de/~erbach/pub/claus5/erbach-claus5-92.pdf},
      ABSTRACT = {We present a bottom-up algorithm for parsing and for the generation of language samples. A language sample is a subset of the language generated by a grammar which is restricted to avoid uninteresting variation. We discuss the use of the generation of language samples for grammar development, where inspection of a language sample can help to detect overgeneration in a grammar. The algorithm is a bottom-up chart parser, whose lexical lookup phase has been modified for generation of language samples. An analysis of the algorithm offers interesting insights into the relationship between parsing and generation, summarized by the statement that parsing is a constrained form of generation.},
      ANNOTE = {COLIURL : Erbach:1991:BAP.pdf}
}

@TechReport{Erbach:1991_6,
      AUTHOR = {Erbach, Gregor},
      TITLE = {An Environment for Experimenting with Parsing Strategies},
      YEAR = {1991},
      MONTH = {April},
      NUMBER = {8},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      ABSTRACT = {An environment for the experimentation with parsing strategies is presented which consists of a parser which can process arbitrary parsing strategies, a functional language for the definition of strategies, and a statistical component which helps the user assess the effects of the different strategies.}
}

@InProceedings{Erbach:1992,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Ambiguity and Linguistic Preferences},
      YEAR = {1992},
      BOOKTITLE = {Workshop of the 10th European Conference on Artificial Intelligence W2 (ECAI '92). Coping with Ambiguity in Typed Feature Formalisms, August 3-7},
      EDITOR = {Trost, Harald and Backofen, Rolf},
      ADDRESS = {Vienna, Austria},
      PUBLISHER = {John Wiley and Sons},
      URL = {https://www.coli.uni-saarland.de/~erbach/pub/ecai92/erbach-ecai92.pdf},
      ANNOTE = {COLIURL : Erbach:1992:ALPa.pdf}
}

@InProceedings{Erbach:1992_1,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Head-Driven Lexical Representation of Idioms in HPSG},
      YEAR = {1992},
      BOOKTITLE = {International Conference on Idioms, September},
      PAGES = {11-24},
      EDITOR = {Everaert, M. and van der Linden, E.-J. and Schenk, A. and Schreuder, R.},
      ADDRESS = {Tilburg, The Netherlands},
      ANNOTE = {COLIURL : Erbach:1992:HDLa.pdf}
}

@Article{Erbach:1992_2,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Rezension von Wissensbasierte Systeme im Büro. In: Künstliche Intelligenz 6(1)},
      YEAR = {1992}
}

@InProceedings{Erbach:1992_3,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Tools for Grammar Engineering},
      YEAR = {1992},
      BOOKTITLE = {3rd Conference on Applied Natural Language Processing, April 1-3},
      EDITOR = {ACL},
      ADDRESS = {Trento, Italy},
      PUBLISHER = {ACL},
      NOTE = {Poster},
      ANNOTE = {COLIURL : Erbach:1992:TGE.pdf}
}

@TechReport{Erbach:1992_4,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Ambiguity and Linguistic Preferences},
      YEAR = {1992},
      MONTH = {June},
      NUMBER = {23},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {https://www.coli.uni-saarland.de/~erbach/pub/ecai92/erbach-ecai92.pdf ftp://ftp.coli.uni-sb.de/pub/coli/papers/preference_values.ps ftp://ftp.coli.uni-sb.de/pub/coli/papers/preference_values.dvi},
      ABSTRACT = {Attempting to treat ambiguities in typed feature formalisms presents a dilemma. The exploitation of linguistic knowledge for adding additional constraints (e.g. word order, selectional restrictions) to the grammar may indeed help disambiguation, but it also rules out some perfectly grammatical non-ambiguous strings. Ways out of this dilemma are discussed in this paper. They include - reliance on processin g strategies without addition of additional knowledge - processing guided by statistical probability - leaving desambiguation to external knowledge sources - using additional constraints only if they are needed for disambiguation. We propose the addition of preference values to typed ferature structures. Using preference values has the effect that violation of the additional constraints needed for disambiguation only decreases the preference value, but does not make the sentence unacceptable. Disambiguation is achieved by selecting the reading with the highest preference value. We think that it is possible to define a processing strategy (preference-driven linguistic deduction) that finds the preferred reading first.},
      NOTE = {URL is a revised version},
      ANNOTE = {COLIURL : Erbach:1992:ALPb.pdf Erbach:1992:ALPb.ps Erbach:1992:ALPb.dvi}
}

@TechReport{Erbach:1992_5,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Head-Driven Lexical Representation of Idioms in HPSG},
      YEAR = {1992},
      MONTH = {May},
      NUMBER = {22},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      ABSTRACT = {This paper is concerned with the lexical representation of idioms. We distinguish idioms from other kinds of multiple-word expressions like collocations, support-verb constructions, and lexicalized metaphors. A lexical representation for idioms in Head-driven Phrease Structure Grammar (HPSG) is proposed, which can account for the syntactic variability found in idiomatic constructions, and for the non-compositional semantics of idioms. Since all idioms, which are not completely fixed, consist of a lexical head and frozen complements, the information about an idiomatic expression can be encoded in the subcategorization list of the idiom's lexical head. Since idioms in volve selection for particular lexemes, a feature is added to HPSG signs to encode this lexemic information. It will be argued that the Locality Principle of HPSG is too strong because it prohibits the representation of idioms proposed in this paper, and that the Semantics Principle must be modified. We explain the fact that some idioms do not passivize by the fact that no thematic role is assigned to accusative objects like the bucket in kick the bucket.}
}

@InCollection{Erbach:1993,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Preference Values in Typed Feature Structures},
      YEAR = {1993},
      BOOKTITLE = {Feature Formalisms and Linguistic Ambiguity},
      EDITOR = {Trost, Harald},
      ADDRESS = {Chichester},
      PUBLISHER = {Ellis Horwood}
}

@InProceedings{Erbach:1993_1,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Toward a Theory of Degrees of Grammaticality},
      YEAR = {1993},
      BOOKTITLE = {1st International Conference on Mathematical Linguistics},
      PAGES = {15-16},
      EDITOR = {Martin-Vide, C.},
      ADDRESS = {Tarragona, Spain}
}

@TechReport{Erbach:1993_2,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Towards a Theory of Degrees of Grammaticality},
      YEAR = {1993},
      MONTH = {November},
      NUMBER = {34},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      ABSTRACT = {This paper is concerned with ill-formed language. We distinguish two types of ill-formed language: string errors which can be explained by modifications to the string generated by the grammar, and grammar errors which can be explained by a modification of the grammar which generates the string. A chart-based method for dealing with string errors is presented. We discuss the adequacy of different grammatical formalisms for dealing with grammar errors, and show that context-free grammars are not expressive enough, but that constraint-based grammars are more suitable, if absolute and non-absolute constraints are distinguished. We augment non-absolute constraints in these grammars with probabilities. The relationship between the grammaticality of a string and its probability is discussed.}
}

@InProceedings{Erbach:1994,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Bottom-Up Earley Deduction},
      YEAR = {1994},
      BOOKTITLE = {15th International Conference on Computational Linguistics (COLING '94), August 5-9},
      VOLUME = {2},
      PAGES = {796-802},
      EDITOR = {Linguistics, Association for Computational},
      ADDRESS = {Kyoto, Japan},
      PUBLISHER = {ACL}
}

@InProceedings{Erbach:1994_1,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Multi-Dimensional Inheritance},
      YEAR = {1994},
      BOOKTITLE = {2. Konferenz Verarbeitung Natürlicher Sprache (KONVENS '94), 28.-30. September},
      PAGES = {102-111},
      EDITOR = {Trost, Harald},
      ADDRESS = {Vienna, Austria},
      PUBLISHER = {Springer Verlag}
}

@InCollection{Erbach:1994_2,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Specification of Datatypes for LFG},
      YEAR = {1994},
      BOOKTITLE = {The Reusability of Grammatical Resources. Deliverable B: Specification of Datatypes},
      EDITOR = {Erbach, Gregor and van der Kraan, Mark and Manandhar, Suresh and Moshier, M. Andrew and Ruessink, Herbert and Thiersch, Craig},
      ADDRESS = {Edinburgh, Saarbrücken, Tilburg, Utrecht}
}

@InCollection{Erbach:1994_2,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Specification of Datatypes for LFG},
      YEAR = {1994},
      BOOKTITLE = {The Reusability of Grammatical Resources. Deliverable B: Specification of Datatypes},
      EDITOR = {Erbach, Gregor and van der Kraan, Mark and Manandhar, Suresh and Moshier, M. Andrew and Ruessink, Herbert and Thiersch, Craig},
      ADDRESS = {Edinburgh, Saarbrücken, Tilburg, Utrecht}
}

@TechReport{Erbach:1994_3,
      AUTHOR = {Erbach, Gregor},
      TITLE = {ProFit - Prolog with Features, Inheritance, and Templates},
      YEAR = {1994},
      MONTH = {July},
      NUMBER = {42},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/claus/claus42.ps ftp://ftp.coli.uni-sb.de/pub/claus/claus42.dvi https://www.coli.uni-saarland.de/~erbach/pub/claus42.pdf},
      ABSTRACT = {ProFIT is an extension of Standard Prolog with Features, Inheritance and Templates. ProFIT allows the programmer or grammar developer to declare an inheritance hierarchy, features and templates. Typed feature terms can be used in ProFIT programs together with Prolog terms to provide a clearer description language for linguistic structures. ProFIT compiles all typed feature terms into a Prolog term representation, so that the built-in Prolog term unification can be used for the unification of typed feature structures, and no special unification algorithm is needed. ProFIT programs are compiled into Prolog programs, so that no meta-interpreter is needed for their execution. ProFIT thus provides a direct step from grammars developed with typed feature terms to Prolog programs usable for applications.},
      ANNOTE = {COLIURL : Erbach:1994:PPF.pdf Erbach:1994:PPF.ps Erbach:1994:PPF.dvi}
}

@TechReport{Erbach:1994_4,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Bottom-Up Earley Deduction},
      YEAR = {1994},
      MONTH = {April},
      NUMBER = {39},
      PAGES = {7},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/claus/claus39.ps ftp://ftp.coli.uni-sb.de/pub/claus/claus39.dvi},
      ABSTRACT = {We propose a bottom-up variant of Earley deduction. Bottom-up deduction is preferable to top-down deduction because it allows incremental processing (even for head-driven grammars), it is data-driven, no subsumption check is needed, and preference values attached to lexical items can be used to guide best-first search. We discuss the scanning step for bottom-up Earley deduction and indexing schemes that help avoid useless deduction steps.},
      ANNOTE = {COLIURL : Erbach:1994:BEDb.pdf Erbach:1994:BEDb.ps Erbach:1994:BEDb.dvi}
}

@TechReport{Erbach:1994_5,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Multi-Dimensional Inheritance},
      YEAR = {1994},
      MONTH = {December},
      NUMBER = {40},
      PAGES = {10},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/claus/claus40.ps},
      ABSTRACT = {In this paper, we present an alternative approach to multiple inheritance for typed feature structures. In our approach, a feature structure can be associated with several types coming from different hierarchies (dimensions). In case of multiple inheritance, a type has supertypes from different hierarchies. We contrast this approach with approaches based on a single type hierarchy where a feature structure has only one unique most general type, and multiple inheritance involves computation of greatest lower bounds in the hierarchy. The proposed approach supports current linguistic analyses in constraint-based formalisms like HPSG, inheritance in the lexicon, and knowledge representation for NLP systems. Finally, we show that multi-dimensional inheritance hierarchies can be compiled into a Prolog term representation, which allows to compute the conjunction of two types efficiently by Prolog term unification.},
      ANNOTE = {COLIURL : Erbach:1994:MDIb.pdf Erbach:1994:MDIb.ps}
}

@InProceedings{Erbach:1995,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Why NLP needs Oz},
      YEAR = {1995},
      BOOKTITLE = {Proceedings of the 1st Workshop on Oz Programming (WOz'95), November 29 - December 1},
      PAGES = {51-54},
      ADDRESS = {Martigny, Switzerland},
      URL = {https://www.coli.uni-saarland.de/~erbach/pub/woz/woz-erbach.pdf},
      ABSTRACT = {The purpose of this paper is to survey the requirements that natural language processing (NLP) has on a programming language, evaluate to what extent they are satisfied by various programming logic programming languages, and in particular by the Oz language. It turns out that Oz appers to be a promising candidate for NLP implementations.},
      ANNOTE = {COLIURL : Erbach:1995:WNN.pdf}
}

@InProceedings{Erbach:1995_1,
      AUTHOR = {Erbach, Gregor},
      TITLE = {ProFit - Prolog with Features, Inheritance, and Templates},
      YEAR = {1995},
      BOOKTITLE = {Proceedings of the 7th Conference of the European Chapter of the Association for Computational Linguistics (EACL'95), March 27-31},
      PAGES = {180-187},
      ADDRESS = {University College Dublin, Ireland},
      ABSTRACT = {ProFIT is an extension of Standard Prolog with Features, Inheritance and Templates. ProFIT allows the programmer or grammar developer to declare an inheritance hierarchy, features and templates. Typed feature terms can be used in ProFIT programs together with Prolog terms to provide a clearer description language for linguistic structures. ProFIT compiles all typed feature terms into a Prolog term representation, so that the built-in Prolog term unification can be used for the unification of typed feature structures, and no special unification algorithm is needed. ProFIT programs are compiled into Prolog programs, so that no meta-interpreter is needed for their execution. ProFIT thus provides a direct step from grammars developed with typed feature terms to Prolog programs usable for applications.}
}

@PhdThesis{Erbach:1997,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Bottom-Up Earley Deduction for Preference-Driven Natural Language Processing},
      YEAR = {1997},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes, Department of Computational Linguistics},
      URL = {https://www.coli.uni-saarland.de/~erbach/pub/diss/erbach-diss.pdf},
      ABSTRACT = {The thesis discusses the processing of principle-based grammars such as HPSG, with an application to best-first processing for disambiguation, selection of paraphrases and possibly also handling ill-formed input. Grammars are treated as a definite clause programs, to which program transformation and deduction techniques can be applied. In particular, the view of constraint logic programming is adopted, which abstracts away from the handling of constraints (which is regarded as a service provided by the constraint solver) and concentrates on resolution strategies. The contributions of the thesis are the following: A constraint language supporting sorted feature terms, Prolog terms, multi-dimensional inheritance, finite domains, by compilation to Prolog terms. The constraint language has been extended with external constraint solvers for set constraints, LP constraints, guarded constraints. A partial deduction system for compiling a principle-based grammar into a set of grammar rules. Partial deduction can be applied selectively through control information in the program, which makes it possible to do experimental work in order to determine the selection of goals to which partial deduction is best applied in order to bring the greatest performance improvement. Bottom-Up Earley deduction as a deduction system which generalises bottom-up chart parsing to a wider class of grammars/programs than just those with a context-free backbone. Bottom-up Earley deduction is better suited for handling discontinuous constituency than its top-down counterpart, it allows best-first search based on bottom-up information (e.g. tag probabilities), and provides different indexing schemes for different modes of combination of items. The correctness, completeness and termination properties of the algorithm have been shown. A generalised linguistic deduction system, which allows combination of different deduction strategies via control annotations, and which is tightly integrated with the underlying programming language in order to achieve efficiency. A fully incremental algorithm for bottom-up Earley deduction has been specified, which can cope efficiently with a change in the query by re-using intermediate deduction results as much as possible. Augmentation of a definite clause language with preference values. We have discussed how preference values from a variety of sources can be combined.},
      ANNOTE = {COLIURL : Erbach:1997:BED.pdf}
}

@InProceedings{Erbach_Arens:1991,
      AUTHOR = {Erbach, Gregor and Arens, Roman G.},
      TITLE = {Evaluation von Grammatiken für die Analyse natürlicher Sprache durch Generierung einer repräsentstiven Satzmenge},
      YEAR = {1991},
      BOOKTITLE = {15. Fachtagung für Künstliche Intelligenz (GWAI '91), 16.-20. September},
      VOLUME = {285},
      PAGES = {126-129},
      EDITOR = {Christaller, T.},
      ADDRESS = {Bonn, Germany},
      PUBLISHER = {Springer Verlag}
}

@TechReport{Erbach_Krenn:1993,
      AUTHOR = {Erbach, Gregor and Krenn, Brigitte},
      TITLE = {Idioms and Support Verb Constructions in HPSG},
      YEAR = {1993},
      MONTH = {February},
      NUMBER = {28},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {ftp://ftp.coli.uni-sb.de/pub/claus/claus28.ps ftp://ftp.coli.uni-sb.de/pub/claus/claus28.dvi https://www.coli.uni-saarland.de/~erbach/pub/claus28.pdf},
      ABSTRACT = {The paper presents a description and analysis of two kinds of collocational phenomena of German: idioms and support verb constructions (Funktionsverbgefüge). Collocational phenomena in general are characterized by restricted lexical selection of the collocation partners. First a characterization of idioms and support verb constructions is given, and idioms and support verb constructions are differentiated from compositional collocations''. Compositional collocations differ from idioms and support verb constructions as the meaning of a compositional collocation is derived by the usual compositional semantic functions from the meanings of its constituents, and their syntactic properties are similar to non collocational constructions. Further syntactic and semantic properties of idioms and support verb constructions are described. Unanalyzable and metaphorical idioms are distinguished. While unanalyzable idioms are diachronical often derived from metaphors, a metaphorical interpretation is no longer possible, and their meaning must be listed in the lexicon. In case of metaphorical idioms, where each part must be assigned a (metaphorical) meaning, the meaning of the parts either must be assigned in the lexicon or metaphorization rules must be stated in the grammar. Support verb constructions, which consist of a verb (the support verb) and a noun phrase including the nominal collocation partner (the predicative noun) of the verb, function as predicates and differ from idioms in the ability to express different phases of a process via Aktionsart, and the ability to express causative as well as non causative variation. Both idioms and support verb constructions allow for different degrees of syntactic variation and internal modification. There are some idioms and support verb constructions which are completely fixed. The majority, however, allows for considerably more flexibility such as passivisation, or flexibility in word order, heads and complements need not be adjacent. Due to this simmilarity, we have made an attempt to treat idioms and support verb constructions in a simmilar way. HPSG, as it stands, is not well equipped to handle lexical selection. We have argued that in case of totally fixed idioms a representation of multi-word lexemes with the specification of the PHON feature is appropriate. For idioms which consist of a head and a frozen complement and support verb constructions we proposed to handle the relationship between the head and the frozen complement or predicative noun, respectively, by subcategorization. Depending on how fixed the frozen complement or predicative noun is, either the PHON feature, the DAUGHTERS feature or the newly introduced INDEX feature LEXEME is specified. As a consequence, we subcategorize for feature structures of type SIGN instead of SYNSEM. We have specified the semantics of idioms in the syntactic head of the construction. The semantics of the frozen complement is ignored, and the Quantifier Inheritance Principle is modified so that quantification over the frozen complement is avoided. The semantic core of the support verb construction is inherited from the predicative noun; in general the support verb adds the Aktionsart and possibly information about the causative relation. The support verb fills one of its argument positions with the predicative noun, and its other argument positions with arguments of the predicative noun. Any remaining arguments of the predicative noun are appended to the SUBCAT list of the support verb. In case of causative support verb constructions, one argument position of the support verb is filled by the cause(r).},
      ANNOTE = {COLIURL : Erbach:1993:ISV.pdf Erbach:1993:ISV.ps Erbach:1993:ISV.dvi}
}

@InCollection{Erbach_Krenn:1994,
      AUTHOR = {Erbach, Gregor and Krenn, Brigitte},
      TITLE = {Idioms and Support Verb Constructions in HPSG},
      YEAR = {1994},
      BOOKTITLE = {Grammar in HPSG CSLI Lecture Notes},
      PAGES = {365-396},
      EDITOR = {Nerbonne, John and Netter, Klaus and Pollard, Carl},
      ADDRESS = {Stanford},
      PUBLISHER = {Center for the Study of Language and Information}
}

@InProceedings{Erbach_Manandhar:1995,
      AUTHOR = {Erbach, Gregor and Manandhar, Suresh},
      TITLE = {Visions for the Future of Logic-Based Natural Language Processing},
      YEAR = {1995},
      BOOKTITLE = {Proceedings of the ILPS'95 Workshop Visions for the Future of Logic Programming - Laying the Foundations for a Modern Successor to Prolog, December 8},
      ADDRESS = {Portland, USA},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ilps95.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ilps95.entry},
      ANNOTE = {COLIURL : Erbach:1995:VFL.pdf Erbach:1995:VFL.ps}
}

@Article{Erbach_et_al:1994,
      AUTHOR = {Erbach, Gregor and Moshier, M. Andrew and Manandhar, Suresh and Ruessink, Herbert and van der Kraan, Mark and Thiersch, Craig},
      TITLE = {The Reusability of Grammatical Resources},
      YEAR = {1994},
      JOURNAL = {AUG News: The Newsletter of the ALEP User Group},
      VOLUME = {1},
      NUMBER = {1},
      PAGES = {8-12}
}

@TechReport{Erbach_et_al:1994_1,
      AUTHOR = {Erbach, Gregor and Moshier, M. Andrew and Manandhar, Suresh and Ruessink, Herbert and van der Kraan, Mark and Thiersch, Craig},
      TITLE = {The Reusability of Grammatical Resources},
      YEAR = {1994},
      NUMBER = {3(2)},
      PAGES = {5-7},
      ADDRESS = {Brighton, Sussex},
      TYPE = {ELSNews},
      INSTITUTION = {European Network in Language and Speech}
}

@TechReport{Erbach_et_al:1994_2,
      AUTHOR = {Erbach, Gregor and Moshier, M. Andrew and Uszkoreit, Hans},
      TITLE = {Multiple Inheritance for ALEP. ET 9.2 deliverable},
      YEAR = {1994}
}

@InProceedings{Erbach_et_al:1997,
      AUTHOR = {Erbach, Gregor and Neumann, Günter and Uszkoreit, Hans},
      TITLE = {MULINEX - Multilingual Indexing, Navigation and Editing Extensions for the World Wide Web},
      YEAR = {1997},
      BOOKTITLE = {Proceedings of the 3rd DELOS Workshop - Cross-Language Information Retrieval, March 5-7},
      PAGES = {17-24},
      ADDRESS = {Zurich, Switzerland},
      PUBLISHER = {European Research Consortium for Informatics and Mathematics},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mulinex-aaai97.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mulinex-aaai97.entry},
      ANNOTE = {COLIURL : Erbach:1997:MMIa.pdf Erbach:1997:MMIa.ps}
}

@InProceedings{Erbach_et_al:1997_1,
      AUTHOR = {Erbach, Gregor and Neumann, Günter and Uszkoreit, Hans},
      TITLE = {MULINEX - Multilingual Indexing, Navigation and Editing Extensions for the World Wide Web},
      YEAR = {1997},
      BOOKTITLE = {2nd Tbilisi Symposium in Language, Logic and Computation},
      EDITOR = {Ginzburg, J. and Khasidashvili, Y. and Vogel, K. and Lévy, J.-J. and Vallduví, E.},
      PUBLISHER = {CSLI Publications},
      ANNOTE = {COLIURL : Erbach:1997:MMIb.pdf}
}

@InProceedings{Erbach_et_al:1997_2,
      AUTHOR = {Erbach, Gregor and Neumann, Günter and Uszkoreit, Hans},
      TITLE = {MULINEX - Multilingual Indexing, Navigation and Editing Extensions for the World Wide Web},
      YEAR = {1997},
      BOOKTITLE = {Cross-Language Text and Speech Retrieval - Papers from the 1997 AAAI Spring Symposium},
      PAGES = {22-28},
      EDITOR = {Hull, David and Oard, Doug},
      ADDRESS = {Menlo Park},
      PUBLISHER = {AAAI Press},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mulinex-aaai97.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mulinex-aaai97.entry},
      ANNOTE = {COLIURL : Erbach:1997:MMIc.pdf Erbach:1997:MMIc.ps}
}

@InProceedings{Erbach_et_al:1997_3,
      AUTHOR = {Erbach, Gregor and Neumann, Günter and Uszkoreit, Hans},
      TITLE = {MULINEX: Design and Evaluation of a Psychological Experiment on the Effectiveness of Document Summarisation for the Retrieval of Multilingual WWW Documents},
      YEAR = {1997},
      BOOKTITLE = {Proceedings of the AAAI Spring Symposium Intelligent Text Summarisation''},
      SERIES = {Cross-Language Text and Speech Retrieval},
      ADDRESS = {Stanford},
      PUBLISHER = {AAAI Press},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mulinex-aaai98.ps.gz},
      ABSTRACT = {Since for the foreseeable future, retrieval will be an interactive task of the user looking through lists of potentially relevant documents, adequate support through various types of information is very important. A psychological experiment was conducted to examine the extent to which different types of automatically generated summaries aid retrieval and systematically evaluate user needs and behaviour in the area of cross-language retrieval for the WWW.},
      ANNOTE = {COLIURL : Erbach:1997:MDE.pdf Erbach:1997:MDE.ps}
}

@Article{Erbach_Saurer:2000,
      AUTHOR = {Erbach, Gregor and Saurer, Werner},
      TITLE = {Review of Handbook of Logic in Artificial Intelligence and Logic Programming},
      YEAR = {2000},
      JOURNAL = {Artificial Intelligence Review},
      VOLUME = {14},
      NUMBER = {6},
      PAGES = {615-617},
      URL = {http://purl.org/net/gregor/pub/gabbay.txt},
      NOTE = {Original publication: Dov M. Gabbay, Christopher J. Hogger, John Alan Robinson (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 2: Deduction Methodologies},
      ANNOTE = {COLIURL : Erbach:2000:RHL.pdf Erbach:2000:RHL.ps}
}

@TechReport{Erbach_et_al:1994_3,
      AUTHOR = {Erbach, Gregor and Skut, Wojciech and Uszkoreit, Hans},
      TITLE = {Linear Precedence Constraints in Lean Formalisms (Part II). ET 9.2 deliverable},
      YEAR = {1994},
      URL = {http://www.dfki.de/dfkibib/publications/docs/Uszkoreit_1994_LPCLFP2.pdf},
      ABSTRACT = {In this report, we demonstrate the practical application of the methods outlined in Part I by the implementation of a grammar that covers the ordering of adjuncts and complements in the German Mittelfeld.},
      ANNOTE = {COLIURL : Erbach:1994:LPCa.pdf}
}

@TechReport{Erbach_et_al:1995,
      AUTHOR = {Erbach, Gregor and Skut, Wojciech and Uszkoreit, Hans},
      TITLE = {Linear Precedence Constraints in Lean Formalisms (I und II)},
      YEAR = {1995},
      NUMBER = {55},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {http://www.dfki.de/dfkibib/publications/docs/Uszkoreit_1994_LPCLFP1.pdf http://www.dfki.de/dfkibib/publications/docs/Uszkoreit_1994_LPCLFP2.pdf},
      ABSTRACT = {1. In this report a method for encoding LP constraints is presented that lends itself for a an easy integration into ALEP grammars since it does not require any changes to the formalism and to the implementation of the current ALEP development platform 2. In this report, we demonstrate the practical application of the methods outlined in Part I by the implementation of a grammar that covers the ordering of adjuncts and complements in the German Mittelfeld},
      ANNOTE = {COLIURL : Erbach:1995:LPC1.pdf Erbach:1995:LPC2.pdf Erbach:1995:LPC.zip}
}

@InCollection{Erbach_Thompson:1993,
      AUTHOR = {Erbach, Gregor and Thompson, Henry},
      TITLE = {Datatypes for LFG},
      YEAR = {1993},
      BOOKTITLE = {The Reusability of Grammatical Resources. Deliverable A: Selection of Datatypes},
      EDITOR = {Erbach, Gregor and van der Kraan, Mark and Manandhar, Suresh and Moshier, M. Andrew and Ruessink, Herbert and Thiersch, Craig and Thompson, Henry},
      ADDRESS = {Edinburgh}
}

@InCollection{Erbach_Thompson:1993,
      AUTHOR = {Erbach, Gregor and Thompson, Henry},
      TITLE = {Datatypes for LFG},
      YEAR = {1993},
      BOOKTITLE = {The Reusability of Grammatical Resources. Deliverable A: Selection of Datatypes},
      EDITOR = {Erbach, Gregor and van der Kraan, Mark and Manandhar, Suresh and Moshier, M. Andrew and Ruessink, Herbert and Thiersch, Craig and Thompson, Henry},
      ADDRESS = {Edinburgh}
}

@InCollection{Erbach_et_al:1999,
      AUTHOR = {Erbach, Gregor and Unz, Dagmar and Capstick, Joanne},
      TITLE = {Interface-Design zur Unterstützung von Selektionsentscheidungen},
      YEAR = {1999},
      BOOKTITLE = {Selektion im Internet},
      EDITOR = {Wirth, Werner and Schweiger, Wolfgang},
      PUBLISHER = {Westdeutscher Verlag},
      URL = {https://www.coli.uni-saarland.de/~erbach/pub/mulinex-mefis/unz-et-al.pdf},
      ANNOTE = {COLIURL : Erbach:1999:IDU.pdf}
}

@TechReport{Erbach_Uszkoreit:1990,
      AUTHOR = {Erbach, Gregor and Uszkoreit, Hans},
      TITLE = {Grammar Engineering: Problems and Prospects - Report of the Saarbrücken Workshop on Grammar Engineering},
      YEAR = {1990},
      MONTH = {July},
      NUMBER = {1},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {https://www.coli.uni-saarland.de/~erbach/pub/claus1/ge-claus1.pdf},
      ABSTRACT = {TheSaarbrücken Workshop on Grammar Engineeringtook place from June 21st to 23rd, 1990. The aim of the workshop was to bring together for 3 days of intensive discussion a number of people with practical experience in the development of large-coverage grammars and researchers who have investigated concepts and tools for grammar development. The workshop focused on the methodology of grammar engineering, testing and evaluation of grammars, the problem of distributed development, the formalisms and tools needed, and grammar maintenance and reusability. A variety of approaches to grammar writing were presented. Prerequisites for effective grammar engineering were identified.},
      ANNOTE = {COLIURL : Erbach:1990:GEP.pdf}
}

@TechReport{Erbach_Uszkoreit:1994,
      AUTHOR = {Erbach, Gregor and Uszkoreit, Hans},
      TITLE = {Linear Precedence Constraints in Lean Formalisms (Part I). ET 9.2 deliverable},
      YEAR = {1994},
      URL = {http://www.dfki.de/dfkibib/publications/docs/Uszkoreit_1994_LPCLFP1.pdf},
      ABSTRACT = {In this report a method for encoding LP constraints is presented that lends itself for a an easy integration into ALEP grammars since it does not require any changes to the formalism and to the implementation of the current ALEP development platform.},
      ANNOTE = {COLIURL : Erbach:1994:LPCb.pdf}
}

@Book{Erbach_et_al:1993,
      AUTHOR = {Erbach, Gregor and van der Kraan, Mark and Manandhar, Suresh and Moshier, M. Andrew and Ruessink, Herbert and Thiersch, Craig},
      TITLE = {The Reusability of Grammatical Resources. Deliverable A: Selection of Datatypes},
      YEAR = {1993},
      ADDRESS = {Edinburgh, Saarbrücken, Tilburg, Utrecht}
}

@Book{Gregor_et_al:1994,
      TITLE = {The Reusability of Grammatical Resources. Deliverable C},
      YEAR = {1994},
      EDITOR = {Erbach, Gregor and van der Kraan, Mark and Manandhar, Suresh and Moshier, M. Andrew and Ruessink, Herbert and Thiersch, Craig},
      ADDRESS = {Edinburgh, Saarbrücken, Tilburg, Utrecht}
}

@Book{Gregor_et_al:1994_1,
      TITLE = {The Reusability of Grammatical Resources. Deliverable B: Specification of Datatypes},
      YEAR = {1994},
      EDITOR = {Erbach, Gregor and van der Kraan, Mark and Manandhar, Suresh and Moshier, M. Andrew and Ruessink, Herbert and Thiersch, Craig},
      ADDRESS = {Edinburgh, Saarbrücken, Tilburg, Utrecht}
}

@Book{Gregor_et_al:1995,
      TITLE = {The Reusability of Grammatical Resources. Deliverable D},
      YEAR = {1995},
      EDITOR = {Erbach, Gregor and van der Kraan, Mark and Manandhar, Suresh and Moshier, M. Andrew and Ruessink, Herbert and Thiersch, Craig},
      ADDRESS = {Edinburgh, Saarbrücken, Tilburg, Utrecht}
}

@InProceedings{Erbach_et_al:1995_1,
      AUTHOR = {Erbach, Gregor and van der Kraan, Mark and Manandhar, Suresh and Ruessink, Herbert and Thiersch, Craig and Skut, Wojciech},
      TITLE = {Extending Unification Formalisms},
      YEAR = {1995},
      BOOKTITLE = {Proceedings of the 2nd Language Engineering Convention, October 16-18},
      ADDRESS = {London, UK},
      ABSTRACT = {This paper describes some of the results of the project LRE-61-061: The Reusability of Grammatical Resources. The aim of the project is to extend unification formalisms with notational devices and constraint solvers in order to facilitate the development of reusable grammars. Work covers both the theoretical description of the extensions as well as the practical implementation. The project took the Advanced Linguistic Engineering Platform (ALEP) as its starting point. ALEP was designed to allow for two levels of extension: additional syntactic expressions syntactic sugar and external specialised constraint solvers. The syntactic additions to ALEP comprise LFG coherence and completeness and an extended notation for phrase-structure rules. The project has developed solvers for set constraints and set operations, linear precedence constraints and for implicational or guarded constraints.},
      ANNOTE = {COLIURL : Erbach:1995:EUFa.pdf}
}

@TechReport{Erbach_et_al:1995_2,
      AUTHOR = {Erbach, Gregor and van der Kraan, Mark and Manandhar, Suresh and Ruessink, Herbert and Thiersch, Craig and Skut, Wojciech},
      TITLE = {Extending Unification Formalisms},
      YEAR = {1995},
      MONTH = {May},
      NUMBER = {62},
      PAGES = {8},
      ADDRESS = {Saarbrücken},
      TYPE = {CLAUS-Report},
      INSTITUTION = {Universität des Saarlandes},
      URL = {https://www.coli.uni-saarland.de/claus/claus62.ps},
      ABSTRACT = {This paper describes some of the results of the project LRE-61-061: The Reusability of Grammatical Resources. The aim of the project is to extend unification formalisms with notational devices and constraint solvers in order to facilitate the development of reusable grammars. Work covers both the theoretical description of the extensions as well as the practical implementation. The project took the Advanced Linguistic Engineering Platform (ALEP) as its starting point. ALEP was designed to allow for two levels of extension: additional syntactic expressions syntactic sugar and external specialised constraint solvers. The syntactic additions to ALEP comprise LFG coherence and completeness and an extended notation for phrase-structure rules. The project has developed solvers for set constraints and set operations, linear precedence constraints and for implicational or guarded constraints.},
      ANNOTE = {COLIURL : Erbach:1995:EUFb.pdf Erbach:1995:EUFb.ps}
}

@TechReport{Uszkoreit_et_al:1996,
      AUTHOR = {Uszkoreit, Hans and Backofen, Rolf and Calder, Jo and Capstick, Joanne and Dini, Luca and Dörre, Jochen and Erbach, Gregor and Estival, Dominique and Manandhar, Suresh and Mineur, Anne-Marie and Oepen, Stefan},
      TITLE = {The EAGLES Formalisms Working Group - Final Report Expert Advisory Group on Language Engineering Standards},
      YEAR = {1996},
      NUMBER = {LRE 61-100},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/eagles-fwg-report.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/eagles-fwg-report.entry},
      ANNOTE = {COLIURL : Uszkoreit:1996:EFW.pdf Uszkoreit:1996:EFW.ps}
}

@InProceedings{Uszkoreit_et_al:2003,
      AUTHOR = {Uszkoreit, Hans and Jörg, Brigitte and Erbach, Gregor},
      TITLE = {An Ontology-based Knowledge Portal for Language Technology},
      YEAR = {2003},
      BOOKTITLE = {Proceedings of ENABLER/ELSNET Workshop International Roadmap for Language Resources},
      ADDRESS = {Paris},
      URL = {https://www.coli.uni-saarland.de/~erbach/pub/COLLATE-EnablerElsnet03.pdf}
}

@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{Yao_et_al:2002,
      AUTHOR = {Yao, Tianfang and Ding, W. and Erbach, Gregor},
      TITLE = {Correcting word segmentation and part-of-speech tagging errors for Chinese named entity recognition},
      YEAR = {2002},
      BOOKTITLE = {The Internet Challenge: Technology and Applications},
      PAGES = {29-36},
      EDITOR = {Hommel, Günter and Huanye, Shen},
      ADDRESS = {Dordrecht},
      PUBLISHER = {Kluwer Academic Publishers}
}

@InProceedings{Yao_et_al:2002_1,
      AUTHOR = {Yao, Tianfang and Ding, W. and Erbach, Gregor},
      TITLE = {Repairing Errors for Chinese Word Segmentation and Part-of-speech Tagging},
      YEAR = {2002},
      BOOKTITLE = {Proceedings of the First International Conference on Machine Learning and Cybernetics 2002 (ICMLC 2002)},
      PAGES = {1881-1886},
      ADDRESS = {Beijing},
      PUBLISHER = {Yao:2002:RECa}
}

@InProceedings{Yao_et_al:2003,
      AUTHOR = {Yao, Tianfang and Ding, W. and Erbach, Gregor},
      TITLE = {CHINERS: A Chinese Named Entity Recognition System for the Sports Domain},
      YEAR = {2003},
      BOOKTITLE = {Proceedings of the Second SIGHAN Workshop on Chinese Language Processing (ACL 2003 Workshop)},
      ADDRESS = {Sapporo, Japan}
}

@InProceedings{Erbach:2004,
      AUTHOR = {Erbach, Gregor},
      TITLE = {Mapping, Measuring, and Modelling the Diffusion of Linguistic Material on the Internet},
      YEAR = {2004},
      BOOKTITLE = {Proceedings of the First International Workshop on the Emergence and Evolution of Linguistic Communication},
      ADDRESS = {Kanazawa},
      URL = {http://purl.org/net/gregor/pub/eelc04/Erbach-EELC2004-ExtendedAbstract.pdf}
}

@Proceedings{Wei Ding_Gregor:2003,
      TITLE = {CHINERS: A Chinese Named Entity Recognition System for the Sports Domain.},
      YEAR = {2003},
      MONTH = {July},
      VOLUME = {Proc. of the Second SIGHAN Workshop on Chinese Language Processing (ACL 2003 Workshop)},
      EDITOR = {Tianfang Yao, Wei Ding and Erbach, Gregor},
      ADDRESS = {Sapporo, Japan},
      PUBLISHER = {ACL 2003}
}

@Proceedings{Wei Ding_Gregor:2002,
      TITLE = {Repairing Errors for Chinese Word Segmentation and Part-of-Speech Tagging},
      YEAR = {2002},
      MONTH = {November},
      VOLUME = {Proc. of the First International Conference on Machine Learning and Cybernetics 2002 (ICMLC 2002)},
      EDITOR = {Tianfang Yao, Wei Ding and Erbach, Gregor},
      ADDRESS = {Beijing, China},
      PUBLISHER = {IEEE and Hebei University}
}

@Proceedings{Wei Ding_Gregor:2002_1,
      TITLE = {Correcting Word Segmentation and Part-Of-Speech Tagging Errors for Chinese Named Entity Recognition},
      YEAR = {2002},
      MONTH = {October},
      VOLUME = {In Günter Hommel and Sheng Huanye (Eds.): The Internet Challenge: Technology and Applications},
      EDITOR = {Tianfang Yao, Wei Ding and Erbach, Gregor},
      ADDRESS = {Dordrecht, The Netherlands},
      PUBLISHER = {Kluwer Academic Publishers}
}

@InProceedings{Zheng_Erbach:2003,
      AUTHOR = {Zheng, Zhiping and Erbach, Gregor},
      TITLE = {Using Specialized Knowledge in Automated Web Document Summarization},
      YEAR = {2003},
      BOOKTITLE = {The Fifth International Conference on Enterprise Information Systems (ICEIS 2003).},
      ADDRESS = {Angers, France}
}

@InProceedings{EGJJ2005,
      AUTHOR = {Erbach, Gregor and Grobelnik, Marko and Jermol, Mitja and Jörg, Brigitte},
      TITLE = {Network Approaches to Current Research Information Systems.},
      YEAR = {2005},
      MONTH = {19-21 October},
      BOOKTITLE = {Proceedings of e-2005: eChallenges Conference},
      PUBLISHER = {Ljubljana, Slovenia}
}