%0 Edited Proceedings
%A Abeillé, Anne
%A Brants, Thorsten
%A Uszkoreit, Hans
%D 2000
%T Proceedings of the Workshop on Linguistically Interpreted Corpora LINC-2000, August 6
%C Luxembourg
%! Proceedings of the Workshop on Linguistically Interpreted Corpora LINC-2000, August 6
%3 j
%F Abeille:2000:PWL


%0 Conference Proceedings
%D 2003
%T Proceedings of the 4th International Workshop on Linguistically Interpreted Corpora (LINC-03)
%E Abeille, Anne
%E Hansen-Schirra, Silvia
%E Uszkoreit, Hans
%C Budapest
%! Proceedings of the 4th International Workshop on Linguistically Interpreted Corpora (LINC-03)
%F Abeille:2003:PIW


%0 Conference Proceedings
%A Abramowicz, Witold
%A Piskorski, Jakub
%D 2002
%T Information Extraction from Free Text Business Documents
%B Proceedings of IRMA - Information Resources Management Association International Conference, May 19-22
%C Seattle
%! Information Extraction from Free Text Business Documents
%3 j
%F Abramowicz:2002:IEF
%X One of the most difficult aspects of using search technology is the process of getting information in shape for searching. The objective of this paper is an investigation of the applicability of information extraction techniques in real-world business applications dealing with textual data since business relevant data is mainly transmitted through free-text documents. Further, we demonstrate an enormous indexing potential of lightweight linguistic text processing techniques applied in information extraction systems in other closely related fields of information technology which concern processing vast amounts of textual data.


%0 Report
%A Adonova, Elena
%A Bateman, John
%A Gromova, Nevena 
%A Hartley, Anthony
%A Kruijff, Geert-Jan
%A Kruijff-Korbayova, Ivana
%A Sharoff, Serge
%A Skoumalova, Hana
%A Sokolova, Lena
%A Staykova, Kamenka
%A Teich, Elke
%D 1999
%T Formal specification of extended grammar models
%C Brighton, UK
%I ITRI, University of Brighton, UK
%9 AGILE project deliverable LSPEC2
%! Formal specification of extended grammar models
%F Adonova:1999:FSE
%U http://ufal.mff.cuni.cz/~agile/reports.html


%0 Conference Proceedings
%A Albrecht, Irene
%A Haber, Jörg
%A Kähler, Kolja
%A Schröder, Marc
%A Seidel, Hans-Peter
%D 2002
%T "May I talk to you? :-)" - Facial Animation from Text
%E Coquillart, Sabine
%E Shum, Heung-Yeung
%E Hu, Shi-Min
%B Proceedings of the 10th Pacific Conference on Computer Graphics and Applications (Pacific Graphics 2002), October 9-11
%C Tsinghua University, Beijing
%! "May I talk to you? :-)" - Facial Animation from Text
%2 Albrecht:2002:FAT.pdf
%3 j
%F Albrecht:2002:MTY
%X We introduce a facial animation system that produces real-time animation sequences including speech synchronization and non-verbal speech-related facial expressions from plain text input. A state-of-the-art text-to-speech synthesis component performs linguistic analysis of the text input and creates a speech signal from phonetic and intonation information. The phonetic transcription is additionally used to drive a speech synchronization method for the physically based facial animation. Further high-level information from the linguistic analysis such as different types of accents or pauses as well as the type of the sentence is used to generate non-verbal speech-related facial expressions such as movement of head, eyes, and eyebrows or voluntary eye blinks. Moreover, emoticons are translated into XML markup that triggers emotional facial expressions.
%U http://www.mpi-sb.mpg.de/resources/FAM/publ/pg2002.pdf


%0 Report
%A Alexandersson, Jan
%A Becker, Tilman
%A Finkler, Wolfgang
%A Kasper, Walter
%A Kilger, Anne
%A Karger, Reinhard
%A Krieger, Hans-Ulrich
%A Maier, Elisabeth
%A Reithinger, Norbert
%A Siegel, Melanie
%A Uszkoreit, Hans
%A Wahlster, Wolfgang
%D 1997
%T 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
%C Saarbrücken
%I German Research Center for Artificial Intelligence (DFKI)
%S Technical Report
%7 R:S 97-226
%! 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
%2 Alexandersson:1997:AVT.pdf Alexandersson:1997:AVT.ps
%3 j
%F Alexandersson:1997:AVT
%X 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.
%U ftp://ftp.dfki.uni-kl.de/pub/Publications/FinalReports/1997/vm6-15.ps.gz


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


%0 Journal Article
%A Alonso Pardo, Miguel
%A Nederhof, Mark-Jan
%A Villemonte de la Clergerie, Eric
%D 2000
%T Tabulation of Automata for Tree-Adjoining Languages
%B Grammars
%V 3
%P 89-110
%! Tabulation of Automata for Tree-Adjoining Languages
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof00c.entry
%2 Pardo:2000:TAT.pdf Pardo:2000:TAT.ps
%3 j
%F Pardo:2000:TAT
%X We propose a modular design of tabular parsing algorithms for tree-adjoining languages. The modularity is made possible by a separation of the parsing strategy from the mechanism of tabulation. The parsing strategy is expressed in terms of the construction of a nondeterministic automaton from a grammar; three distinct types of automaton will be discussed. The mechanism of tabulation leads to the simulation of these nondeterministic automata in polynomial time, independent of the parsing strategy. The proposed application of this work is the design of efficient parsing algorithms for tree-adjoining grammars and related formalisms.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof00c.ps.gz


%0 Edited Book
%A Alshawi, Hiyan
%D 1992
%T The Core Language Engine
%E Joshi, A. K.
%E Sparck Jones, K.
%E Liberman, M. Y.
%B ACL-MIT Press Series in Natural Language Processing
%C Cambridge, England
%I MIT Press
%! The Core Language Engine
%F Alshawi:1992:CLE


%0 Conference Proceedings
%A Alshawi, Hiyan
%A Block, Hans Ullrich 
%A Carter, David M.
%A Gambäck, Björn
%A Hunze, Richard
%A Peng, Ping
%A Rayner, Manny
%A Schachtl, Stephanie 
%A Schmid, Ludwig
%D 1991
%T Communication multilinguale par forme quasi logique
%B Conference on Natural Language Processing and its Applications
%C Avignon, France
%P 245-252
%! Communication multilinguale par forme quasi logique
%2 Alshawi:1991:CMP.pdf Alshawi:1991:CMP.ps
%F Alshawi:1991:CMP
%X In this paper we describe the experience gained and results obtained through devloping a transferbased interactive translation system which combines two language processing systems. The only part these systems have in common is the level of the semantic representation, for which we chose the quasilogical form.
%U http://www.sics.se/~gamback/publications/avignon91.ps


%0 Report
%A Alshawi, Hiyan
%A Brown, Charles G.
%A Carter, David M.
%A Gambäck, Björn
%A Pulman, Stephen G.
%A Rayner, Manny
%D 1991
%T Bilingual Conversation Interpreter: A Prototype Message Translator
%C Stockholm, Sweden and Cambridge, England
%I SICS and SRI
%S Final report. Joint Research Report
%7 R91011 and CRC-018
%! Bilingual Conversation Interpreter: A Prototype Message Translator
%2 Alshawi:1991:BCI.pdf
%F Alshawi:1991:BCI
%X This document is the final report for a research project aimed at producing a prototype system for on-line translation of typed dialogues between speakers of different natural languages. The work was carried out jointly by SICS and SRI Cambridge. The resulting prototype system (called Bilingual Conversation Interpreter, or BCI) translates between English and Swedish in both directions. The major components of the BCI are two copies of the SRI Core Language Engine, equipped with English and Swedish grammars respectively. These are linked by the transfer and disambiguation components. Translation takes place by analyzing the source-language sentence into Quasi Logical Form (QLF), a linguistically motivated logical representation, transferring this into a target-language QLF, and generating a targetlanguage sentence. When ambiguities occur that cannot be resolved automatically, they are clarified by querying the appropriate user. The clarification dialogue presupposes no knowledge of either linguistics or the other language. The prototype system has a broad grammatical coverage, a initial vocabulary of about 1000 words together with vocabulary expansion tools, and a set of English-Swedish transfer rules. The formalisms developed for coding this linguistic information make it relatively easy to extend the system. We believe that the project was successful in demonstrating the feasibility of using these techniques for interactive translation applications, and provides a sound basis for development of a large scale message translator system with potential for commercial exploitation.
%U www.sics.se/humle/papers/R91011.ps


%0 Report
%A Alshawi, Hiyan
%A Carter, David M.
%A Gambäck, Björn
%A Pulman, Stephen G.
%A Rayner, Manny
%D 1991
%T Transfer through Quasi Logical Form: A New Approach to Machine Translation
%C Stockholm, Sweden
%I SICS
%S Technical Report
%7 T91020
%! Transfer through Quasi Logical Form: A New Approach to Machine Translation
%2 Alshawi:1991:TTQ.pdf Alshawi:1991:TTQ.ps
%F Alshawi:1991:TTQ
%X This document is an introduction to a research project aimed at produc- ing a prototype system for on-line translation of typed dialogues between speakers of different natural languages. The work was carried out jointly by SICS and SRI Cambridge. The resulting prototype system (called Bilingual Conversation Interpreter, or BCI) translates between English and Swedish in both directions.
%U www.sics.se/humle/papers/T91020.ps


%0 Conference Proceedings
%A Alshawi, Hiyan
%A Carter, David M.
%A Gambäck, Björn
%A Pulman, Stephen G.
%A Rayner, Manny
%D 1992
%T English-Swedish Translation Dialogue Software
%B Conference on Translating and the Computer
%C London, England
%! English-Swedish Translation Dialogue Software
%2 Alshawi:1992:EST.pdf Alshawi:1992:EST.ps
%F Alshawi:1992:EST
%X The paper describes the BCI, a prototype interactive machinetranslation system, constructed by connecting English and Swedish versions of the SRI Core Language Engine through a transfer component. Transfer takes place at the level of Quasi Logical Form (QLF), a contextually sensitive logical form representation which is deep enough for dealing with crosslinguistic differences. Theoretical arguments are presented to support the claim that QLF transfer represents a good compromise between the opposing paradigms of syntactic transfer and semantic interlingua based MT. An annotated example dialogue is shown. A followon project, in which the BCI is used as the core of a spokenlanguage translation system, is briefly described.
%U http://www.sics.se/~gamback/publications/aslib92.ps


%0 Report
%A Alshawi, Hiyan
%A Carter, David M.
%A Gambäck, Björn
%A Rayner, Manny
%D 1991
%T Translation by Quasi Logical Form Transfer
%C Cambridge, England
%S SRI International Technical Report
%7 CRC-021
%! Translation by Quasi Logical Form Transfer
%2 Alshawi:1991:TQLa.pdf
%F Alshawi:1991:TQLa
%X The paper describes work on applying a general purpose natural language processing system to transfer-based interactive translation. Transfer takes place at the level of Quasi Logical Form (QLF), a contextually sensitive logical form representation which is deep enough for dealing with cross-linguistic differences. Theoretical arguments and experimental results are presented to support the claim that this framework has good properties in terms of modularity, compositionality, reversibility and monotonicity. QLFs were selected as the appropriate level for transfer because they are far enough removed from surface linguistic form to provide the flexibility required by cross-linguistic differences. On the other hand, the linguistic, unification-based processing involved in creating them can be carried out efficiently and without the need to reason about the domain or context; the QLF language has constructs for explicit representation of contextually sensitive aspects of interpretation.
%U http://acl.ldc.upenn.edu/P/P91/P91-1021.pdf


%0 Book Section
%A Alshawi, Hiyan
%A Carter, David M.
%A Gambäck, Björn
%A Rayner, Manny
%D 1992
%T Swedish-English QLF Translation
%E Alshawi, H.
%B The Core Language Engine
%C Cambridge, England
%I MIT Press
%P 277-309
%! Swedish-English QLF Translation
%F Alshawi:1992:SEQ


%0 Conference Proceedings
%A Alshawi, Hiyan
%A Carter, David M.
%A Rayner, Manny
%A Gambäck, Björn
%D 1991
%T Translation by Quasi Logical Form Transfer
%E ACL
%B 29th Annual Meeting of the Association for Computational Linguistics (ACLANNUAL '91), June 18-21
%C Berkeley, California, USA
%P 161-168
%! Translation by Quasi Logical Form Transfer
%F Alshawi:1991:TQLb
%X The paper describes work on applying a general purpose natural language processing system to transfer-based interactive translation. Transfer takes place at the level of Quasi Logical Form (QLF), a contextually sensitive logical form representation which is deep enough for dealing with cross-linguistic differences. Theoretical arguments and experimental results are presented to support the claim that this framework has good properties in terms of modularity, compositionality, reversibility and monotonicity. QLFs were selected as the appropriate level for transfer because they are far enough removed from surface linguistic form to provide the flexibility required by cross-linguistic differences. On the other hand, the linguistic, unification-based processing involved in creating them can be carried out efficiently and without the need to reason about the domain or context; the QLF language has constructs for explicit representation of contextually sensitive aspects of interpretation.
%U http://acl.ldc.upenn.edu/P/P91/P91-1021.pdf


%0 Conference Proceedings
%A Althaus, Ernst
%A Duchier, Denys
%A Koller, Alexander
%A Mehlhorn, Kurt
%A Niehren, Joachim
%A Thiel, Sven
%D 2001
%T An Efficient Algorithm for the Configuration Problem of Dominance Graphs
%B 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), January 7-9
%C Washington D.C., USA
%I ACM Press
%! An Efficient Algorithm for the Configuration Problem of Dominance Graphs
%2 Althaus:2001:EAC.pdf Althaus:2001:EAC.ps
%F Althaus:2001:EAC
%X Dominance constraints are logical tree descriptions originating from automata theory that have multiple applications in computational linguistics. The satisfiability problem of dominance constraints is NP-complete. In most applications, however, only \emph(normal) dominance constraints are used. The satisfiability problem of normal dominance constraints can be reduced in linear time to the configuration problem of dominance graphs, as shown recently. In this paper, we give a polynomial time algorithm testing configurability of dominance graphs (and thus satisfiability of normal dominance constraints). Previous to our work no polynomial time algorithms were known.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/dom-graph.ps.gz


%0 Journal Article
%A Althaus, Ernst
%A Duchier, Denys
%A Koller, Alexander
%A Mehlhorn, Kurt
%A Niehren, Joachim
%A Thiel, Sven
%D 2003
%T An Efficient Graph Algorithm for Dominance Constraints
%B Journal of Algorithms
%V 48
%P 194--219
%! An Efficient Graph Algorithm for Dominance Constraints
%2 Althaus:19xx:EGA.pdf Althaus:19xx:EGA.ps
%F Althaus:2003:EGA
%X Dominance constraints are logical descriptions of trees that are widely used
  in computational linguistics. Their general satisfiability problem is known
  to be NP-complete. Here we identify normal dominance constraints and present
  an efficient graph algorithm for testing their satisfiablity in deterministic
  polynomial time. Previously, no polynomial time algorithm was known.
%U http://www.coli.uni-sb.de/~koller/papers/eff-dom.ps.gz


%0 Conference Proceedings
%A Andersen, Ove
%A Dalsgaard, Paul
%A Barry, William J.
%D 1993
%T Data-Driven Identification of Poly- and Monophonemes for Four European Languages
%E Fellbaum, K.
%B 3rd European Conference on Speech Communication and Technology (EUROSPEECH), September 21-23
%C Berlin, Deutschland
%V 2
%P 759-762
%! Data-Driven Identification of Poly- and Monophonemes for Four European Languages
%F Andersen:1993:DDI


%0 Conference Proceedings
%A Andersen, Ove
%A Dalsgaard, Paul
%A Barry, William J.
%D 1994
%T On the Use of Data-Driven Clustering Techniques for Identification of Poly- and Monophonemes for Four European Languages
%B International Conference on Acoustics Speech and Signal Processing (ICASSP'94), April 19-22
%C Adelaide, Australia
%! On the Use of Data-Driven Clustering Techniques for Identification of Poly- and Monophonemes for Four European Languages
%F Andersen:1994:UDD


%0 Book Section
%A Andreeva, Bistra
%A Avgustinova, Tania
%A Barry, William J.
%D 2001
%T Link-Associated and Focus-Associated Accent Patterns in Bulgarian
%E Zybatow, Gerhild
%E Junghanns, Uwe
%E Mehlhorn, Grit
%E Szucsich, Luka
%B Current Issues in Formal Slavic Linguistics
%C Frankfurt/Main, Germany
%I Peter Lang GmbH, Europäischer Verlag der Wissenschaften
%V 5
%P 353-364
%S Linguistik International
%! Link-Associated and Focus-Associated Accent Patterns in Bulgarian
%3 j
%F Andreeva:2001:LAF


%0 Journal Article
%A Andreeva, Bistra
%A Barry, William J.
%D 1997
%T Intonation von Checks in der Sofia-Varietaet des Bulgarischen
%B PHONUS
%C Universität des Saarlandes, Phonetik, Saarbrücken
%V 4
%P 1-14
%! Intonation von Checks in der Sofia-Varietaet des Bulgarischen
%2 Andreeva:1997:ICS.pdf Andreeva:1997:ICS.ps
%F Andreeva:1997:ICS
%X Die checks bilden eine kommunikative Unterart der Entscheidungsfragen. Sie ersuchen eine Bestätigung von schon bekannter Information und werden deshalb auch Bestätigungsfragen genannt. In der traditionellen Literatur über die bulgarische Intonationsphonologie ist die Beschreibung dieser Fragen extrem widersprüchlich. Ziel der vorliegenden Arbeit ist es, im Rahmen eines Perzeptionsexperiments Evidenz dafür zu finden, welche akustischen Parameter eine Äußerung als Frage kennzeichnen, wenn sie nicht syntaktisch bzw. lexikalisch markiert ist, d.h. welche die distinktive Intonationskontur ist, die bei Fragen und Aussagen mit gleicher segmentaler und syntaktischer Struktur die Satzmoduszuweisung steuert.
%U http://www.coli.uni-sb.de/Phonetics/Research/PHONUS_research_reports/Phonus4/Andreeva_PHONUS4.ps.gz


%0 Conference Proceedings
%A Andreeva, Bistra
%A Barry, William J.
%D 2000
%T Sentence Mode and Emotional Load in Bulgarian: Economy of Intonational Form?
%B Proceedings of the 7th Conference on Laboratory Phonology (LabPhon7), June 29 -July 1
%C Nijmegen, Netherlands
%! Sentence Mode and Emotional Load in Bulgarian: Economy of Intonational Form?
%F Andreeva:19xx:SME
%X An earlier study [1] illuminated the role of F0 contours on the focus accent in differentiating question and sentence mode in the Sofia variety of Bulgarian.The results showed that placement of the low target of the pitch accent at the beginning and the peak at the end of the accented syllable or in the following syllable (L*+H) is critical for the perception of (syntactically and lexically unmarked) checks, which are used to confirm already known information [2]. By shifting the peak leftwards towards the beginning of the accented syllable (H*) the pragmatic category changed from check to statement. Both categories have a L% boundary tone. 

However, subjects' judgements indicated that the strength of the intonational information was not equal for the two utterance types. The situational pre-context had a strong influence on the interpretation of the utterance as a check or statement. In case the intonation contour diverged from the unmarked contour for a particular function, the category judgement was accompanied by a change in the emotional message. 

To examine the general validity of these observations a further experiment was carried out. Three checks, three statements with low terminal boundary tones (L%), and three statements with continuation rises (H%) were selected from Map Task recordings made for a number of male and female speakers [3]. From each of these 9 natural utterances three intonational variants were generated, one for each pragmatic category. Firstly, a stylised resynthesized version of the original (e.g. a check) was produced. Then the intonation contours for the other two pragmatic categories (e.g. statement with terminal fall and continuation rise) were derived from the stylised contour. 

Four repetitions of the stimuli were presented (Roman square design) to 15 native speakers of Sofia Bulgarian in three situational contexts: question, neutral statement and polite statement. The context utterance together with the stimulus form a minimal dialogue. The natural context for the check was a statement, and for the two statement forms it was a question. In the test, each context was offered with each pragmatic category, producing potential tension between context and stimulus. The subjects were required to judge - on a five-point scale - the degree to which each stimulus was suited to its context. 

The results show that all three intonational contours can be accepted as statements in the context of a preceding question, whereas the change of context cannot shift the interpretation of a statement to a check. The following explanation can be offered for this asymmetry of reinterpretation. 

The context plays an extremely important role for the interpretation of checks or statements. The context priming a statement (question-answer sequence) provides enough information to uniquely specify the communicative frame. It is a strong enough speech act marker to relegate function of the intonational form to a minor one. Thus the context weakens the distinctive function that intonation has when word sequence and syntactic structure are identical.This does not, however, mean that the intonational form is irrelevant. The shift in the interpretation of the sentence mode (check to statement) can only occur because a compensatory change of modal meaning accompanies it. The check contour cannot be accepted as a neutral statement, it can only be accepted as an emphatic, impatient or angry statement. The statements with a continuation rise were also accepted in the statement context, but the compensatory modal message was of an exaggeratedly polite speaker. 

Apparently, when a typical (neutral) feature of a particular communicative situation is replaced by a feature typical of another situation, it introduces an additional modal marking. Thus intonation alone, without syntactic and lexical support, can imply a certain shade of modal meaning. This phenomenon is already known at the grammatical level. In Bulgarian, for example, the future tense is the neutral form for referring to events in the future. If the present tense is used, the utterance is immediately modally marked as a firm intention. In English and German the reverse is true.


%0 Conference Proceedings
%A Andreeva, Bistra
%A Koreman, Jacques
%A Barry, William J.
%D 1999
%T On the Role of the Burst and Transitions for the Identification of Palatalized and Non-Palatalized Plosives in Bulgarian
%B Proceedings of the 14th International Congress of Phonetic Sciences (ICPhS'99), August 1-7
%C San Francisco, USA
%! On the Role of the Burst and Transitions for the Identification of Palatalized and Non-Palatalized Plosives in Bulgarian
%2 Andreeva:1999:RBT.pdf Andreeva:1999:RBT.ps
%F Andreeva:1999:RBT
%U http://www.coli.uni-sb.de/~koreman/Publications/1999/ICPhS99_BulgPal.ps.gz


%0 Report
%A Areces, Carlos
%A Blackburn, Patrick
%A Marx, Maarten
%D 1999
%T Hybrid Logics: Characterization, Interpolation and Complexity
%C Saarbrücken
%I Universität des Saarlandes
%P 35
%S CLAUS-Report
%7 108
%8 February
%! Hybrid Logics: Characterization, Interpolation and Complexity
%2 Areces:1999:HLC.pdf Areces:1999:HLC.ps Areces:1999:HLC.dvi
%F Areces:1999:HLC
%X Hybrid languages are extended modal languages which can refer to (or even quantify over) worlds. The use of strong hybrid languages dates back to at least 1967 (in the work of Arthur Prior), but recent work has focussed on more constrained systems. The purpose of the present paper is to examine one such system in detail. We begin by studying its expressivity, and provide both model theoretic characterizations (via a restricted notion of Ehrenfeucht-Fraisse game, and an enriched notion of bisimulation) and a syntactic characterization (in terms of bounded formulas). The key result to emerge is that the system corresponds precisely to the first-order fragment which is invariant for generated submodels. We further establish that it has (strong) interpolation, and provide failure results in the finite variable fragments. We also show that weak interpolation holds for an important sublanguage and provide complexity results for this sublanguage and other fragments and variants (the full logic being undecidable).
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus108.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus108.dvi


%0 Conference Proceedings
%A Asker, Lars
%A Boström, Henrik
%A Samuelsson, Christer
%D 1993
%T Dynamic Explanation-Based Generalization
%B 3rd International Workshop on Knowledge Compilation and Speedup Learning, June
%C Amherst, Massachusetts
%P 1-6
%! Dynamic Explanation-Based Generalization
%F Asker:1993:DEB


%0 Conference Proceedings
%A Asker, Lars
%A Gambäck, Björn
%D 1995
%T Acquiring a Lexicon by Actively Querying the User
%B AAAI Fall Symposium on Active Learning, November 10-12
%C Cambridge, Massachussetts
%! Acquiring a Lexicon by Actively Querying the User
%2 Asker:1995:ALA.pdf
%F Asker:1995:ALA
%U www.sics.se/~gam/aaaifall95.ps


%0 Conference Proceedings
%A Asker, Lars
%A Gambäck, Björn
%A Samuelsson, Christer
%D 1992
%T EBL2: An Approach to Automatic Lexical Acquisition
%B 14th International Conference on Computational Linguistics (COLING '92), July 23-28
%C Nantes, France
%V 4
%P 1172-1176
%! EBL2: An Approach to Automatic Lexical Acquisition
%2 Asker:1992:EAA.pdf Asker:1992:EAA.ps
%F Asker:1992:EAA
%U www.sics.se/~gam/coling92.ps


%0 Conference Proceedings
%A Asker, Lars
%A Samuelsson, Christer
%D 1991
%T Automating Lexical Acquisition
%B 10th Annual Meeting of the Swedish Artificial Intelligence Society, April
%C Uppsala, Sweden
%P 1-3
%! Automating Lexical Acquisition
%F Asker:1991:ALA


%0 Journal Article
%A Avgustinova, Tania
%D 1993
%T Review of: Sells, Peter; Shieber, Stuart M.; Wasow, Thomas (Eds.): Foundational Issues in Natural Language Processing. System Development Foundation Benchmark Series. Cambridge: The MIT Press, 1991. In: The Prague Bulletin of Mathematical Linguistics. Volume 59-60. Univerzita Karlova Praha
%! Review of: Sells, Peter; Shieber, Stuart M.; Wasow, Thomas (Eds.): Foundational Issues in Natural Language Processing. System Development Foundation Benchmark Series. Cambridge: The MIT Press, 1991. In: The Prague Bulletin of Mathematical Linguistics. Volume 59-60. Univerzita Karlova Praha
%3 j
%F Avgustinova:1993:RSP


%0 Report
%A Avgustinova, Tania
%D 1993
%T On Bulgarian Verb Clitics
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 33
%8 August
%! On Bulgarian Verb Clitics
%3 j
%F Avgustinova:1993:BVC


%0 Journal Article
%A Avgustinova, Tania
%D 1994
%T On Bulgarian Verb Clitics
%B Journal of Slavic Linguistics
%V 2
%N 1
%P 29-47
%! On Bulgarian Verb Clitics
%3 j
%F Avgustinova:1994:BVC


%0 Report
%A Avgustinova, Tania
%D 1994
%T Morphosyntactic Phrase - Evidence from Bulgarian
%C Saarbrücken
%I Universität des Saarlandes
%S Internal Report, Projekt LATESLAV
%! Morphosyntactic Phrase - Evidence from Bulgarian
%3 j
%F Avgustinova:1994:MPE


%0 Report
%A Avgustinova, Tania
%D 1996
%T An HPSG-Style Grammar of Bulgarian (for the Purposes of a Grammar-Checker Implementation)
%C Saarbrücken
%I Universität des Saarlandes
%S Final Deliverable Report, Project LATESLAV
%! An HPSG-Style Grammar of Bulgarian (for the Purposes of a Grammar-Checker Implementation)
%3 j
%F Avgustinova:1996:HSG


%0 Report
%A Avgustinova, Tania
%D 1996
%T Relative Clause Constructions in Bulgarian HPSG
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 71
%8 January
%! Relative Clause Constructions in Bulgarian HPSG
%3 j
%F Avgustinova:1996:RCC
%X An analysis of Bulgarian relative clause constructions is proposed, taking into consideration the standard HPSG theory of unbounded dependency constructions as well as the related recent research aiming at avoiding phonologically empty categories in the language description.


%0 Report
%A Avgustinova, Tania
%D 1996
%T Between Lexicon and Syntax Proper
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 80
%8 September
%! Between Lexicon and Syntax Proper
%3 j
%F Avgustinova:1996:BLS
%X Bulgarian exhibits the free word order properties that are typical for all Slavic languages although it has a very impoverished system of nominal inflection. The fairly rich verbal conjugation system with complex analytic verb forms, and the well-developed mechanism of "clitic replication" (also referred to in the literature as "pronominal reprise", "clitic doubling", etc.) are specific properties of this language. This paper concentrates on structural distinguishing of two word order domains in the Bulgarian clause - the morphosyntactic one of the verb complex and the syntactic one of the verb and its modifiers within the clause. Special attention is paid to the morphosyntactic dimension.


%0 Book Section
%A Avgustinova, Tania
%D 1997
%T An HPSG Approach to the Syntax of Bulgarian Relatives
%E Junghanns, U.
%E Zybatow, G.
%B Formale Slavistik
%C Frankfurt am Main
%I Vervuert Verlag
%P 177-191
%S Leipziger Schriften zur Kultur-, Literatur-, Sprach- und Übersetzungswissenschaft; 7
%! An HPSG Approach to the Syntax of Bulgarian Relatives
%3 j
%F Avgustinova:1997:HAS


%0 Conference Proceedings
%A Avgustinova, Tania
%D 1997
%T Clustering Clitics in Bulgarian Nominal Constituents
%E Kosta, P.
%E Unger, M.
%B 2nd European Conference on Formal Description of Slavic Languages (FDSL 2), November 20-22
%C Potsdam, Germany
%! Clustering Clitics in Bulgarian Nominal Constituents
%2 Avgustinova:1997:CCB.pdf
%3 j
%F Avgustinova:1997:CCB
%U http://www.coli.uni-sb.de/~tania/ta-pub/np-clitics-fdsl2.pdf


%0 Thesis
%A Avgustinova, Tania
%D 1997
%T Word Order and Clitics in Bulgarian
%C Saarbrücken
%I Universität des Saarlandes, Department of Slavistics, Computational Linguistics
%! Word Order and Clitics in Bulgarian
%3 j
%F Avgustinova:1997:WOC
%O Dissertation in Computational Linguistics and Language Technology, Volume 5


%0 Report
%A Avgustinova, Tania
%D 1997
%T Determinedness Constraints on Clitic Replication
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 87
%8 March
%! Determinedness Constraints on Clitic Replication
%3 j
%F Avgustinova:1997:DCC
%X The proposed typology of Bulgarian articled and non-articled noun phrases provides criteria for determining which nominal material can be replicated by a clitic pronoun under the appropriate verb-lexeme specific, syntactic and communicative conditions. The main claim is that only nominal material used as identifying specific description of a given object is replicable in Bulgarian. Non-articled noun phrases that are categorising or non-specific descriptions as well as articled noun phrases that are generic or non-specific descriptions completely lack replication potential.


%0 Book Section
%A Avgustinova, Tania
%D 1998
%T Determinedness and Replication Potential of Nominal Material in Bulgarian
%E Dyer, D.L.
%B Balkanistica
%C Wilkes-Barre
%I Design Systems Printing
%V 11
%P 1-17
%! Determinedness and Replication Potential of Nominal Material in Bulgarian
%3 j
%F Avgustinova:1998:DRP


%0 Book Section
%A Avgustinova, Tania
%D 1998
%T On Word Order Types in Bulgarian
%E Giger, M.
%E Wiemer, B.
%B Beiträge der Europäischen Slavistischen Linguistik (POLYSLAV 1)
%C München
%I Verlag Otto Sagner
%V 1
%P 19-25
%Y Giger, M. 
%E Wiemar, B.
%S Die Welt der Slaven, 2. Sammelband
%! On Word Order Types in Bulgarian
%3 j
%F Avgustinova:1998:WOT


%0 Electronic Source
%A Avgustinova, Tania
%D 1998
%T Review of: Cook, Walter A.: "Case Grammar Applied".  A Publication of The Summer Institute of Linguistics and The University of Texas at Arlington. 1998
%! Review of: Cook, Walter A.: "Case Grammar Applied".  A Publication of The Summer Institute of Linguistics and The University of Texas at Arlington. 1998
%2 Avgustinova:1998:RCW.pdf
%3 j
%F Avgustinova:1998:RCW
%U http://linguistlist.org/issues/9/9-1813.html


%0 Journal Article
%A Avgustinova, Tania
%D 1999
%T Prosodic Constraints in Morphosyntactic Domains
%E Böttger, K.
%E Giger, M.
%E Wiemer, B.
%B Beiträge der Europäschen Slavistischen Linguistik (POLYSLAV-2)
%C München
%I Verlag Otto Sagner
%V 4
%P 10-15
%S Die Welt der Slaven
%! Prosodic Constraints in Morphosyntactic Domains
%2 Avgustinova:1999:PCM.pdf
%3 j
%F Avgustinova:1999:PCM
%U http://www.coli.uni-sb.de/~tania/ta-pub/polyslav2.pdf


%0 Report
%A Avgustinova, Tania
%D 1999
%T Shared Grammatical Resources for Slavic Languages (Selected Topics in Multilingual Grammar Design)
%C Saarbrücken
%I Universität des Saarlandes
%S DFG-Abschlußbericht
%! Shared Grammatical Resources for Slavic Languages (Selected Topics in Multilingual Grammar Design)
%3 j
%F Avgustinova:1999:SGR


%0 Conference Proceedings
%A Avgustinova, Tania
%D 2000
%T Gaining the Perspective of Language-Family-Oriented Grammar Design: Predicative Special Clitics in Slavic
%E Banski, P.
%E Przepiorkowski, A.
%B 1st Conference on Generative Linguistics in Poland (GLiP-1), November 13-14
%C Warsaw, Poland
%P 5-14
%! Gaining the Perspective of Language-Family-Oriented Grammar Design: Predicative Special Clitics in Slavic
%2 Avgustinova:2000:GPL.pdf
%3 j
%F Avgustinova:2000:GPL
%O also in: Selected Topics in Multilingual Grammar Design (Based on Data from Slavic Language Family), DFG-Zwischenbericht, Mai 1998 - April 1999
%U http://www.coli.uni-sb.de/~tania/ta-pub/glip1.pdf


%0 Electronic Source
%A Avgustinova, Tania
%D 2000
%T Review of: Tesar, Bruce; Smolensky, Paul: Learnability in Optimality Theory. Cambridge: MIT Press, 2000
%! Review of: Tesar, Bruce; Smolensky, Paul: Learnability in Optimality Theory. Cambridge: MIT Press, 2000
%2 Avgustinova:2000:RTB.pdf
%3 j
%F Avgustinova:2000:RTB
%U http://linguistlist.org/issues/11/11-2024.html


%0 Conference Proceedings
%A Avgustinova, Tania
%D 2000
%T Arguments, Grammatical Relations, and Diathetic Paradigm
%E Flickinger, D.
%E Kathol, A.
%B 7th International Conference on Head-Driven Phrase Structure Grammar, July 22-23
%C University of California, Berkeley, USA
%I CSLI Publications
%P 23-42
%! Arguments, Grammatical Relations, and Diathetic Paradigm
%2 Avgustinova:2000:AGR.pdf
%3 j
%F Avgustinova:2000:AGR
%U http://cslipublications.stanford.edu/HPSG/HPSG00/hpsg00avgustinova.pdf


%0 Book Section
%A Avgustinova, Tania
%D 2001
%T Distinguishing Argument Structure, Syntactic Dependents and Valence in HPSG: Relevance for Slavic
%E Zybatow, G.
%E Junghanns, U.
%E Mehlhorn, G.
%E Szucsich, L.
%B Current Issues in Formal Slavic Linguistics
%C Frankfurt am Main
%I Peter Lang GmbH, Europäischer Verlag der Wissenschaften
%V 5
%P 554-567
%S Linguistik International
%! Distinguishing Argument Structure, Syntactic Dependents and Valence in HPSG: Relevance for Slavic
%2 Avgustinova:2001:DAS.pdf
%3 j
%F Avgustinova:2001:DAS
%U http://www.coli.uni-sb.de/~tania/ta-pub/ta-hpsg-fdsl3.pdf


%0 Electronic Source
%A Avgustinova, Tania
%D 2001
%T Review of: Stump, Gregory T.: Inflectional Morphology. A Theory of Paradigm Structure. Cambridge Studies in Linguistics 93. Cambridge: Cambridge University Press, 2001
%! Review of: Stump, Gregory T.: Inflectional Morphology. A Theory of Paradigm Structure. Cambridge Studies in Linguistics 93. Cambridge: Cambridge University Press, 2001
%2 Avgustinova:2001:RSG.pdf
%3 j
%F Avgustinova:2001:RSG
%U http://linguistlist.org/issues/12/12-1861.html#1


%0 Electronic Source
%A Avgustinova, Tania
%D 2001
%T Review of: Corbett, Greville G.: Number. Cambridge Textbooks in Linguistics. Cambridge: Cambridge University Press, 2000
%! Review of: Corbett, Greville G.: Number. Cambridge Textbooks in Linguistics. Cambridge: Cambridge University Press, 2000
%2 Avgustinova:2001:RCG.pdf
%3 j
%F Avgustinova:2001:RCG
%U http://www.linguistlist.org/issues/12/12-1357.html


%0 Electronic Source
%A Avgustinova, Tania
%D 2001
%T Review of: Levine, Robert D.; Green, Georgina M. (Eds.): Studies in Contemporary Phrase Structure Grammar. Cambridge: Cambridge University Press, 1999
%! Review of: Levine, Robert D.; Green, Georgina M. (Eds.): Studies in Contemporary Phrase Structure Grammar. Cambridge: Cambridge University Press, 1999
%2 Avgustinova:2001:RLR.pdf
%3 j
%F Avgustinova:2001:RLR
%U http://linguistlist.org/issues/12/12-492.html


%0 Conference Proceedings
%A Avgustinova, Tania
%D 2001
%T Russian Infinitival Existential Constructions from an HPSG Perspective
%B 4th European Conference on Formal Description of Slavic Languages (FDSL4), November 28-30
%C Potsdam
%! Russian Infinitival Existential Constructions from an HPSG Perspective
%3 j
%F Avgustinova:2001:RIE
%O to appear


%0 Electronic Source
%A Avgustinova, Tania
%D 2002
%T Review of: Goldsmith, John A., (Ed.): Phonological Theory: The Essential Readings. Blackwell Publishers, 1999. In: LINGUIST List 13.621. Thu, Mar 7 2002
%! Review of: Goldsmith, John A., (Ed.): Phonological Theory: The Essential Readings. Blackwell Publishers, 1999. In: LINGUIST List 13.621. Thu, Mar 7 2002
%3 j
%F Avgustinova:2002:RGJ
%U http://linguistlist.org/issues/13/13-621.html#1


%0 Book Section
%A Avgustinova, Tania
%D 2002
%T Clustering Clitics in Bulgarian Nominal Constituents
%E Kosta, Peter
%E Frasek, Jens
%B Current Approaches to Formal Slavic Linguistics Contributions of the Second European Conference on Formal Description of Slavic Languages. FDSL II held at the University of Potsdam, November 20-22, 1997
%C Frankfurt a. M., Berlin, Bern
%I Lang, Peter Frankfurt
%V 9
%S Linguistik International
%! Clustering Clitics in Bulgarian Nominal Constituents
%3 j
%F Avgustinova:2002:CCB


%0 Conference Proceedings
%A Avgustinova, Tania
%A Andreeva, Bistra
%D 1998
%T Intonational Properties of Bulgarian Replicated Nominal Material. A Study Based on Map Task Dialogues
%B 1st Conference on Linguistic Theory in Eastern Europaen Languages (CLITE-1), April 19-21
%C Szeged, Hungary
%! Intonational Properties of Bulgarian Replicated Nominal Material. A Study Based on Map Task Dialogues
%3 j
%F Avgustinova:1998:IPB


%0 Conference Proceedings
%A Avgustinova, Tania
%A Andreeva, Bistra
%D 1999
%T Link-Associated Accent Patterns in Bulgarian
%B 3rd Conference on Formal Description of Slavic Languages (FDSL-3), December 1-3
%C Leipzig, Germany
%! Link-Associated Accent Patterns in Bulgarian
%2 Avgustinova:1999:LAA.pdf
%3 j
%F Avgustinova:1999:LAA
%O Abstract in URL
%U http://www.coli.uni-sb.de/~tania/ta-pub/avg-andr-fdsl3.pdf


%0 Conference Proceedings
%A Avgustinova, Tania
%A Andreeva, Bistra
%D 1999
%T Intonational Aspects of Bulgarian Clitic Replication
%E Ohala, J.
%E Hasgawa, Y.
%E Ohala, M.
%E Granville, D.
%E Bailey, A.
%B The 14th International Congress of Phonetic Sciences, August 1-7
%C San Francisco, USA
%P 1501-1504
%! Intonational Aspects of Bulgarian Clitic Replication
%2 Avgustinova:1999:IAB.pdf
%3 j
%F Avgustinova:1999:IAB
%U http://www.coli.uni-sb.de/~tania/ta-pub/1501.pdf


%0 Report
%A Avgustinova, Tania
%A Gardent, Claire
%A Oliva, Karel
%D 1999
%T Binding of Reciprocals with Particular Respect to Czech
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 109
%8 February
%! Binding of Reciprocals with Particular Respect to Czech
%2 Avgustinova:1999:BRP.pdf Avgustinova:1999:BRP.ps Avgustinova:1999:BRP.dvi
%3 j
%F Avgustinova:1999:BRP
%X Drawing on data from Czech and English, we first argue against a uniform syntactic treatment of reciprocals and reflexives. We then define a binding theory for Czech which differs from HPSG binding theory in two main points. First, it is based on an ordering (the D-ordering) which is more general than HPSG's obliqueness ordering -- this permits a natural treatment of adjuncts. Second, it distinguishes between reflexives and reciprocals and submits them to different binding constraints. Finally, we provide a semantics for reciprocals with summated antecedents.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus109.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus109.dvi


%0 Conference Proceedings
%A Avgustinova, Tania
%A Oliva, Karel
%D 1990
%T Syntactic Description of Free Word Order Languages
%E Karlgren, H.
%B 13th International Conference on Computational Linguistics (COLING '90), August 20-25
%C Helsinki, Finland
%V 3
%P 311-313
%! Syntactic Description of Free Word Order Languages
%3 j
%F Avgustinova:1990:SDF


%0 Report
%A Avgustinova, Tania
%A Oliva, Karel
%D 1991
%T The Structure of Bulgarian Verb Complex
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 4
%8 February
%! The Structure of Bulgarian Verb Complex
%3 j
%F Avgustinova:1991:SBV
%X In this article we wish to concentrate on a non-transformational description of the structure of complex verb forms in Modern Bulgarian, Slavonic language performing some Balkanic features in its morphology and syntax, which makes it differ considerably from other languages of the Slavonic group. Almost no such attempts have been made before, although some of the syntactic problems that arise have been mentioned and treated from different viewpoints in studies concerned with complex tenses, with voice and mood, with the status of pronouns, of negative and interrogative particles etc. The partially free word order of Bulgarian has been mentioned in very few works based on the transformational approach. 

For the sake of description of the Bulgarian verb complex, we felt we had to refrain from some of the standards of the linguistic background of many current non-transformational (as well as other) approaches. The changes we introduced concern the constituent structures used and they consist inriching the established approach with ideas stemming from the works of the Prague Linguistic School, namely with the notion of communicative dynamism. The shape of the structures is briefly sketched in the first part of the work, while the linguistic facts and their description are the main content of its second part; in the closing paragraphs, some phenomena are mentioned which were not examined in detail in the central sections of the work and their incorporation into the description as presented before is considered.


%0 Journal Article
%A Avgustinova, Tania
%A Oliva, Karel
%D 1995
%T Wackernagel Position and Related Phenomena in Czech
%B Wiener Slavistisches Jahrbuch
%C Wien
%I Verlag der Österreichischen Akademie der Wissenschaften
%V 41
%P 21-42
%! Wackernagel Position and Related Phenomena in Czech
%3 j
%F Avgustinova:1995:WPR


%0 Report
%A Avgustinova, Tania
%A Oliva, Karel
%D 1995
%T The Position of Sentential Clitics in the Czech Clause
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 68
%8 December
%! The Position of Sentential Clitics in the Czech Clause
%3 j
%F Avgustinova:1995:PSC
%X Our main goal is to propose a unified analysis of the "second position" and Wackernagel phenomena, which would adequately accommodate also certain non-trivial data that seem to be problematic for the currently available approaches: 

1. Correct sentences with multiple syntactic constituents preceding the sentential clitics in Czech, and respectively, multiple syntactic constituency in the German "Vorfeld": 
a. Czech clitics (respectively, the tensed verb in German main clauses) preceded by two or more adverbials describing together a spatial or temporal interval; 
b. Czech clitics (respectively, the tensed verb in German main clauses) preceded by two or more adverbials of the same type, which can be viewed as a repetition of the respective modification; 
c. Czech clitics (respectively, the tensed verb in German main clauses) preceded by a combination of a temporal and a local adverbial; 
d. Czech clitics (respectively, the tensed verb in German main clauses) preceded by more than one contrasted syntactic constituents 
2. Sentences with a single constituent preceding the sentential clitics (respectively, single constituent in the "Vorfeld") but judged to be highly unacceptable . 
We reconsider the Prague School treatment of the communicative structure of the sentence, and assume that, for each particular utterance, it can be determined which of the contained elements are informationally essential (significant) - i.e. informationally indispensable from a communicative perspective - and which of them are informationally unessential (insignificant) - i.e. without actual communicative contribution - and occur in the utterance for other, e.g., structural, pleonastic etc., reasons only. On such a basis we (re)introduce the notion of communicative importance. We further assume that not all elements of an utterance can be assigned a degree of communicative dynamism - i.e. that there are items for which the feature communicative importance is inappropriate. Another assumption is that in an utterance there might exist two or more syntactically distinguishable constituents which are of equal communicative importance. 
After these modifications, we introduce a structuring of an utterance into communicative units which we tentatively call communicative segments. A substantial communicative segment is defined as a contiguous sequence of adjacent syntactic units (i.e. words or phrases) of equal communicative importance, while an auxiliary communicative segment is a contiguous sequence of informationally insignificant items for which communicative importance is inappropriate as a feature. From such a perspective the Wackernagel's clitic cluster in Czech is regarded as an instance of an auxiliary communicative segment. We further define the "second" / Wackernagel position as the position delimiting the first (leftmost) substantial communicative segment in an utterance, and thus propose an alternative treatment also of the German "Vorfeld". 

Inasmuch as there are language-specific constraints on what can form a substantial communicative segment, our analysis allows for a natural explanation also of, e.g., the "constituent-second" / "word-second" position of Serbo-Croatian clitics.


%0 Conference Proceedings
%A Avgustinova, Tania
%A Oliva, Karel
%D 1996
%T The Communicative Nature of the Wackernagel Position
%B Prague School Linguistics Conference
%C Prague
%! The Communicative Nature of the Wackernagel Position
%3 j
%F Avgustinova:1996:CNW


%0 Report
%A Avgustinova, Tania
%A Oliva, Karel
%D 1996
%T Unbounded Dependencies in HPSG Without Traces or Lexical Rules
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 70
%8 January
%! Unbounded Dependencies in HPSG Without Traces or Lexical Rules
%3 j
%F Avgustinova:1996:UDH
%X In the course of work on large-coverage HPSG grammars destinated for application in commercial grammar checkers for Bulgarian and Czech, two languages typologically different from English with respect to the word order freedom, we have developed and practically tested an alternative, efficient-implementation oriented treatment of unbounded dependencies dispensing both with gaps and with lexical rules. In this paper we shall explain the theoretical basis of the approach as well as try to prove that it is not only practically, but also theoretically superior to the current standard treatment.


%0 Book Section
%A Avgustinova, Tania
%A Oliva, Karel
%D 1997
%T On the Nature of the Wackernagel Position in Czech
%E Junghanns, U.
%E Zybatow, G.
%B Formale Slavistik
%C Frankfurt am Main
%I Vervuert Verlag
%P 25-47
%S Leipziger Schriften zur Kultur-, Literatur-, Sprach- und Übersetzungswissenschaft; 7
%! On the Nature of the Wackernagel Position in Czech
%3 j
%F Avgustinova:1997:NWP


%0 Conference Proceedings
%A Avgustinova, Tania
%A Oliva, Karel
%D 1997
%T The Proper Treatment of Binding in HPSG (in general) and in Czech (in particular)
%B 30th Poznan Linguistic Meeting. Workshop on Slavic Languages in HPSG, May 1-3
%C Poznan, Poland
%! The Proper Treatment of Binding in HPSG (in general) and in Czech (in particular)
%3 j
%F Avgustinova:1997:PTB


%0 Conference Proceedings
%A Avgustinova, Tania
%A Skut, Wojciech
%D 1997
%T Encoding Common Slavic Linguistic Knowledge in HPSG
%E Kosta, P.
%E Unger, M.
%B 2nd European Conference on Formal Description of Slavic Languages (FDSL2), November 20-22
%C Potsdam, Germany
%! Encoding Common Slavic Linguistic Knowledge in HPSG
%3 j
%F Avgustinova:1997:ECS


%0 Conference Proceedings
%A Avgustinova, Tania
%A Skut, Wojciech
%D 1997
%T Panslavism Revisited
%B 30th Poznan Linguistic Meeting. Workshop on Slavic Languages in HPSG, May 1-3
%C Poznan, Poland
%! Panslavism Revisited
%3 j
%F Avgustinova:1997:PR


%0 Book Section
%A Avgustinova, Tania
%A Skut, Wojciech
%A Uszkoreit, Hans
%D 1999
%T Typological Similarities in HPSG: A Case Study on Slavic Verb Diathesis
%E Borsley, R. D.
%E Przepiórkowski, A.
%B Slavic in Head-Driven Phrase Structure Grammar
%C Stanford
%I CSLI Publications
%P 1-28
%! Typological Similarities in HPSG: A Case Study on Slavic Verb Diathesis
%3 j
%F Avgustinova:1999:TSH


%0 Conference Proceedings
%A Avgustinova, Tania
%A Uszkoreit, Hans
%D 2000
%T An Ontology of Systematic Relations for a Shared Grammar of Slavic
%B 18th International Conference on Computational Linguistics (COLING '00), July 31 - August 4
%C Saarbrücken, Germany
%I Morgan Kaufmann Publishers
%V 1
%P 28-34
%! An Ontology of Systematic Relations for a Shared Grammar of Slavic
%2 Avgustinova:2000:OSR.pdf
%3 j
%F Avgustinova:2000:OSR
%X Sharing portions of grammars across languages greatly reduces the costs of multilingual grammar engineering. Related languages share a much wider range of linguistic information than typically assumed in standard multilingual grammar architectures. Taking grammatical relatedness seriously, we are particularly interested in designing linguistically motivated grammatical resources for Slavic languages to be used in applied and theoretical computational linguistics. In order to gain the perspective of a languagefamily oriented grammar design, we consider an array of systematic relations that can hold between syntactical units. While the categorisation of primitive linguistic entities tends to be languagespecific or even constructionspecific, the relations holding between them allow various degrees of abstraction. On the basis of Slavic data, we show how a domain ontology conceptualising morphosyntactic "building blocks" can serve as a basis of a shared grammar of Slavic.
%U http://www.coli.uni-sb.de/~tania/ta-pub/ta-hu-coling2000.pdf


%0 Conference Proceedings
%A Avgustinova, Tania
%A Uszkoreit, Hans
%D 2001
%T Towards a Typology of Agreement Phenomena
%E Griffin, W.
%B "The Role of Agreement in Natural Languages". Texas Linguistic Society Conference (TLS'2001), March 2-4
%C Austin, Texas, USA
%I Lincom Europa
%! Towards a Typology of Agreement Phenomena
%2 Avgustinova:2001:TTA.pdf
%3 j
%F Avgustinova:2001:TTA
%X Agreement phenomena are instances of co-variation of linguistic forms which is typically realised as feature congruity, i.e. compatibility of values of identical grammatical categories of syntactically combined linguistic items. Agreement is a relatively well-researched topic, especially in Slavic linguistics, cf. (Corbett, 2000a). However, the investigations have mainly concentrated on the linguistic items themselves (as agreement sources) and on the relevant properties of these items (in terms of agreement features and conditions). The nature of the relations holding between the "agreeing" items has not received proper attention yet.
%U http://www.coli.uni-sb.de/~tania/ta-pub/TA-HU-TLS-2001-agreement.pdf


%0 Conference Proceedings
%A Avgustinova, Tania
%A Uszkoreit, Hans
%D 2001
%T Reconsidering the Relations in Constructions with Non-Verbal Predicates
%B 4th European Conference on Formal Description of Slavic Languages (FDSL4), November 28-30
%C Potsdam, Germany
%! Reconsidering the Relations in Constructions with Non-Verbal Predicates
%3 j
%F Avgustinova:2001:RRC


%0 Master's Thesis
%A Backofen, Rolf
%D 1989
%T Integration von Funktionen, Relationen und Typen beim Sprachentwurf. Teil II: Attributterme und Relationen
%C Erlangen-Nürnberg
%I Friedrich-Alexander Universität
%! Integration von Funktionen, Relationen und Typen beim Sprachentwurf. Teil II: Attributterme und Relationen
%3 j
%F Backofen:1989:IFR


%0 Conference Proceedings
%A Backofen, Rolf
%D 1993
%T On the Decidability of Functional Uncertainty
%E ACL
%B 31st Annual Meeting of the Association for Computational Linguistics (ACL), June 22-26
%C Ohio State University Columbus, Ohio, USA
%I Association for Computational Linguistics
%P 201-208
%! On the Decidability of Functional Uncertainty
%3 j
%F Backofen:1993:DFU
%O A full version has appeared as Research Report RR-93-17


%0 Conference Proceedings
%A Backofen, Rolf
%D 1993
%T Regular Path Expressions in Feature Logic
%E Kirchner, C.
%B 5th International Conference of the Rewriting Techniques and Applications (RTA '93), June 16-18
%C Montreal, Canada
%I Springer
%P 121-135
%S LNCS
%7 690
%! Regular Path Expressions in Feature Logic
%2 Backofen:1993:RPEa.pdf Backofen:1993:RPEa.ps Backofen:1993:RPEa.dvi
%3 j
%F Backofen:1993:RPEa
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RegularPathExprJSC94.ps.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RegularPathExprJSC94.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RegularPathExprJSC94.dvi.Z


%0 Report
%A Backofen, Rolf
%D 1993
%T Regular Path Expressions in Feature Logic
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-93-17
%! Regular Path Expressions in Feature Logic
%2 Backofen:1993:RPEb.pdf Backofen:1993:RPEb.ps Backofen:1993:RPEb.dvi
%3 j
%F Backofen:1993:RPEb
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RegularPathExprJSC94.ps.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RegularPathExprJSC94.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RegularPathExprJSC94.dvi.Z


%0 Thesis
%A Backofen, Rolf
%D 1994
%T Expressivity and Decidability of First-Order Languages over Feature Trees
%C Saarbrücken
%I Universität des Saarlandes, Technische Fakultät
%! Expressivity and Decidability of First-Order Languages over Feature Trees
%2 Backofen:1994:EDF.pdf Backofen:1994:EDF.ps Backofen:1994:EDF.dvi
%F Backofen:1994:EDF
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kndisco.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kndisco.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kndisco.ps.Z


%0 Journal Article
%A Backofen, Rolf
%D 1994
%T Regular Path Expressions in Feature Logic
%B Journal of Symbolic Computation
%V 17
%P 412-455
%! Regular Path Expressions in Feature Logic
%2 Backofen:1994:RPE.pdf Backofen:1994:RPE.ps Backofen:1994:RPE.dvi
%F Backofen:1994:RPE
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RegularPathExprJSC94.ps.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RegularPathExprJSC94.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RegularPathExprJSC94.dvi.Z


%0 Journal Article
%A Backofen, Rolf
%D 1995
%T A Complete Axiomatization of a Theory with Feature and Arity Constraints
%B The Journal of Logic Programming
%V 24
%P 37-72
%! A Complete Axiomatization of a Theory with Feature and Arity Constraints
%2 Backofen:1995:CAT.pdf Backofen:1995:CAT.ps Backofen:1995:CAT.dvi
%F Backofen:1995:CAT
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-35.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-35.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-35.ps.Z


%0 Report
%A Backofen, Rolf
%A Busemann, Stephan
%A Diagne, Abdel Kader
%A Hinkelman, Elizabeth
%A Kasper, Walter
%A Kiefer, Bernd
%A Krieger, Hans-Ulrich
%A Netter, Klaus
%A Neumann, Günter
%A Oepen, Stephan
%A Spackman, Stephen P.
%A Uszkoreit, Hans
%D 1994
%T Abschlussbericht: DISCO - Dialogsystem für autonome kooperierende Agenten
%C Saarbrücken
%I DFKI
%S Report
%7 R:S95-060
%! Abschlussbericht: DISCO - Dialogsystem für autonome kooperierende Agenten
%2 Backofen:1994:ADD.pdf
%3 j
%F Backofen:1994:ADD
%X 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.
%U http://www.dfki.de/dfkibib/publications/docs/Backofen_1994_DDFAKA.pdf


%0 Conference Proceedings
%A Backofen, Rolf
%A Euler, Lutz
%A Görz, Günther
%D 1990
%T Towards the Integration of Functions, Relations and Types in an AI Programming Language
%E Marburger, H.
%B 14th German Workshop on Artificial Intelligence (GWAI '90), September 10-14
%C Eringerfeld, Germany
%I Springer
%V 251
%P 297-306
%S Informatik-Fachberichte
%! Towards the Integration of Functions, Relations and Types in an AI Programming Language
%3 j
%F Backofen:1990:TIF


%0 Conference Proceedings
%A Backofen, Rolf
%A Euler, Lutz
%A Görz, Günther
%D 1991
%T Distributed Disjunctions for LIFE
%E Boley, H.
%E Richter, M.M.
%B International Workshop on Processing Declarative Knowledge (PDK '91), July 1-3
%C Kaiserslautern, Germany
%I Springer Verlag
%P 161-170
%S Lecture Notes in Computer Science
%! Distributed Disjunctions for LIFE
%3 j
%F Backofen:1991:DDL


%0 Report
%A Backofen, Rolf
%A Euler, Lutz
%A Görz, Günther
%D 1991
%T Towards the Integration of Functions, Relations and Types in an AI Programming Language
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-91-032
%! Towards the Integration of Functions, Relations and Types in an AI Programming Language
%3 j
%F Backofen:1991:TIF


%0 Report
%A Backofen, Rolf
%A Krieger, Hans-Ulrich
%D 1993
%T The TDL/ UDiNe System
%C Saarbrücken
%I DFKI
%P 67-74
%S DFKI Document
%7 D-93-27
%! The TDL/ UDiNe System
%2 Backofen:1993:TUS.pdf Backofen:1993:TUS.ps
%3 j
%F Backofen:1993:TUS
%X 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.
%U 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


%0 Report
%A Backofen, Rolf
%A Krieger, Hans-Ulrich
%A Spackman, Stephen P.
%A Uszkoreit, Hans
%D 1993
%T Report of the EAGLES Workshop on Implemented Formalisms at DFKI
%C Saarbrücken
%I DFKI
%S Technical Report
%7 D-93-27
%! Report of the EAGLES Workshop on Implemented Formalisms at DFKI
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/D-93-27.entry
%2 Backofen:1993:REW.pdf Backofen:1993:REW.ps
%3 j
%F Backofen:1993:REW
%X 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.
%U http://www.tcs.informatik.uni-muenchen.de/ftp/backofen/publ/EAGLES-WS-Implemented93.ps.gz


%0 Report
%A Backofen, Rolf
%A Krieger, Hans-Ulrich
%A Spackmann, Stephen
%A Uszkoreit, Hans
%D 1993
%T EAGLES Workshop on Implemented Formalisms at DFKI
%C Saarbrücken
%I DFKI
%S DFKI Document
%7 D-93-27
%! EAGLES Workshop on Implemented Formalisms at DFKI
%2 Backofen:1993:EWI.pdf Backofen:1993:EWI.ps
%3 j
%F Backofen:1993:EWI
%U 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


%0 Journal Article
%A Backofen, Rolf
%A Rogers, James
%A Shanker, Vijay K.
%D 1995
%T A First-Order Axiomatization of the Theory of Finite Trees
%B Journal of Logic, Language and Information
%V 4
%N 1
%P 5-39
%! A First-Order Axiomatization of the Theory of Finite Trees
%2 Backofen:1995:FOA.pdf Backofen:1995:FOA.ps Backofen:1995:FOA.dvi
%F Backofen:1995:FOA
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/JOLLI95-trees.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/JOLLI95-trees.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/JOLLI95-trees.ps.Z


%0 Report
%A Backofen, Rolf
%A Smolka, Gert
%D 1992
%T A Complete and Recursive Feature Theory
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-92-30
%! A Complete and Recursive Feature Theory
%2 Backofen:1992:CRF.pdf Backofen:1992:CRF.ps Backofen:1992:CRF.dvi
%3 j
%F Backofen:1992:CRF
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.ps.Z


%0 Conference Proceedings
%A Backofen, Rolf
%A Smolka, Gert
%D 1993
%T A Complete and Recursive Feature Theory
%B 31st Annual Meeting of the Association for Computational Linguistics (ACL), June 22-26
%C Ohio State University Columbus, Ohio, USA
%I Association for Computational Linguistics
%P 193-200
%! A Complete and Recursive Feature Theory
%2 Backofen:1993:CRF.pdf Backofen:1993:CRF.ps Backofen:1993:CRF.dvi
%F Backofen:1993:CRF
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.ps.Z


%0 Journal Article
%A Backofen, Rolf
%A Smolka, Gert
%D 1995
%T A Complete and Recursive Feature Theory
%B Theoretical Computer Science
%V 146
%N 1-2
%P 243-268
%! A Complete and Recursive Feature Theory
%2 Backofen:1995:CRF.pdf Backofen:1995:CRF.ps Backofen:1995:CRF.dvi
%F Backofen:1995:CRF
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-30.ps.Z


%0 Conference Proceedings
%A Backofen, Rolf
%A Treinen, Ralf
%D 1994
%T How to Win a Game with Features
%E Jouannaud, J.-P.
%B 1st International Conference on Constraints in Computational Logics (CCL'94), September 7-9
%C München, Germany
%I Springer
%V 845
%P 320-335
%S Lecture Notes in Computer Science
%! How to Win a Game with Features
%2 Backofen:1994:HWG.pdf Backofen:1994:HWG.ps Backofen:1994:HWG.dvi
%F Backofen:1994:HWG
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/FeatureGamesCCL94.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/FeatureGamesCCL94.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/FeatureGamesCCL94.ps.Z


%0 Report
%A Backofen, Rolf
%A Trost, Harald
%A Uszkoreit, Hans
%D 1991
%T Linking Typed Feature Formalisms and Terminological Knowledge Representation Languages in Natural Language Front-Ends
%C Saarbrücken
%I Deutsches Forschungszentrum für Künstliche Intelligenz
%S Research Report
%7 RR-91-28
%! Linking Typed Feature Formalisms and Terminological Knowledge Representation Languages in Natural Language Front-Ends
%2 Backofen:1991:LTFa.pdf Backofen:1991:LTFa.ps
%3 j
%F Backofen:1991:LTFa
%X In this Paper wie describe an interface between typed formalisms and terminological languages like KL-ONE. The definition of such an iterface is motivated by the needs of natural language front-ends to AI-systems where information must be transmittes from the front-end to the back-end system and vice versa. We show some minor extensions to the feature formalism allow for a syntactic description of individual concepts in terms of typed feature structures. Namely, we propose to include intervals and a special kind of sets. Partial consistency checks can be made on these concepts descriptions during the unification of feature terms. Type checking on these special involves calling the classifier of the terminological language. The final consistency check is performed only when transferring these concept description into structures of the A-Box of the terminological language.
%U ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1991/RR-91-28.ps.gz


%0 Conference Proceedings
%A Backofen, Rolf
%A Trost, Harald
%A Uszkoreit, Hans
%D 1991
%T Linking Typed Feature Formalisms and Terminological Knowledge Representation Languages in Natural Language Front-Ends
%E Brauer, W.
%E Hernandez, D.
%B 4th Internationaler GI-Kongress Wissenbasierte Systeme. Verteilte Künstliche Intelligenz und kooperatives Arbeiten, 23.-24. Oktober
%C München, Germany
%I Springer
%P 375-383
%Y Brauer, W.
%S Informatik-Fachberichte 291
%! Linking Typed Feature Formalisms and Terminological Knowledge Representation Languages in Natural Language Front-Ends
%2 Backofen:1991:LTFb.pdf Backofen:1991:LTFb.ps
%3 j
%F Backofen:1991:LTFb
%X In this Paper we describe an interface between typed formalisms and terminological languages like KL-ONE. The definition of such an iterface is motivated by the needs of natural language front-ends to AI-systems where information must be transmittes from the front-end to the back-end system and vice versa. We show some minor extensions to the feature formalism allow for a syntactic description of individual concepts in terms of typed feature structures. Namely, we propose to include intervals and a special kind of sets. Partial consistency checks can be made on these concepts descriptions during the unification of feature terms. Type checking on these special involves calling the classifier of the terminological language. The final consistency check is performed only when transferring these concept description into structures of the A-Box of the terminological language.
%U ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1991/RR-91-28.ps.gz


%0 Report
%A Balari, Sergio
%D 1991
%T Why German is not a Null-Subject Language
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 12
%8 September
%! Why German is not a Null-Subject Language
%F Balari:1991:WGN


%0 Report
%A Balari, Sergio
%D 1992
%T Agreement and Theta-Roles: Towards an Account of Null Subjects in HPSG
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 25
%8 July
%! Agreement and Theta-Roles: Towards an Account of Null Subjects in HPSG
%F Balari:1992:ATR


%0 Thesis
%A Balari, Sergio
%D 1993
%T On the Organization of Knowledge in a Constraint-Based Theory of Grammar
%C Barcelona
%I University of Barcelona
%! On the Organization of Knowledge in a Constraint-Based Theory of Grammar
%F Balari:1993:OKC


%0 Conference Proceedings
%A Baldridge, Jason
%A Kruijff, Geert-Jan M.
%D 2002
%T Coupling CCG with Hybrid Logic Dependency Semantics
%B Proceedings of the 40th Annual Meeting of the Association of Computational Linguistics (ACL'02), June 7-12
%C University of Pennsylvania, Philadelphia
%! Coupling CCG with Hybrid Logic Dependency Semantics
%F Baldridge:2002:CCH


%0 Conference Proceedings
%A Balkan, Lorna
%A Netter, Klaus
%A Arnold, Doug
%A Meijer, Siety
%D 1994
%T TNSLP - Test Suites for Language Processing
%B CEC Language Engineering Convention
%C Paris, France
%! TNSLP - Test Suites for Language Processing
%2 Balkan:1994:TTSb.pdf Balkan:1994:TTSb.ps
%3 j
%F Balkan:1994:TTSb
%X The growing language technology industry needs measurement tools to allow researchers, engineers, managers, and customers to track development, evaluate and assure quality, and assess suitability for a variety of applications. The tsnlp (Test Suites for Natural Language Processing) project (1) has investigated various aspects of the construction, maintenance and application of systematic test suites as diagnostic and evaluation tools for NLP applications. The paper summarizes the motivation and main results of tsnlp: besides the solid methodological foundation of the project, tsnlp has produced substantial (i.e. larger than any existing general test suites) multi-purpose and multi-user test suites for three European languages together with a set of specialized tools that facilitate the construction, extension, maintenance, retrieval, and customization of the test data. The publicly available results of tsnlp represent a valuable linguistic resource that has the potential of providing a wide-spread pre-standard diagnostic and evaluation tool for both developers and users of NLP applications.
%U ftp://issco-ftp.unige.ch/pub/publications/tsnlp-coling.ps.gz


%0 Journal Article
%A Barry, William J.
%D 1971
%T Remedial Pronunciation Practice for German-Speaking Students of English
%B English Language Teaching
%V 26
%P 43-47
%! Remedial Pronunciation Practice for German-Speaking Students of English
%F Barry:1971:RPP


%0 Conference Proceedings
%A Barry, William J.
%D 1972
%T Zur Problematik des subphonemischen Ausspracheunterrichts
%B Kongressberichte der 3. Jahrestagung der GAL
%I Groos
%P 293-301
%! Zur Problematik des subphonemischen Ausspracheunterrichts
%F Barry:1972:PSA


%0 Journal Article
%A Barry, William J.
%D 1974
%T Language Background and the Perception of Foreign Accent
%B Journal of Phonetics
%V 2
%P 65-89
%! Language Background and the Perception of Foreign Accent
%F Barry:1974:LBP


%0 Book
%A Barry, William J.
%D 1974
%T Perzeption und Produktion im sub-phonemischen Bereich. Eine kontrastive Untersuchung an intersprachlichen Minimalpaaren des Deutschen und Englischen
%C Tübingen
%I Niemeyer
%! Perzeption und Produktion im sub-phonemischen Bereich. Eine kontrastive Untersuchung an intersprachlichen Minimalpaaren des Deutschen und Englischen
%F Barry:1974:PPI


%0 Book Section
%A Barry, William J.
%D 1975
%T Das Dilemma des Ausspracheunterrichts
%B Arbeitsberichte des Instituts für Phonetik und digitale Sprachverarbeitung der
Universität Kiel (AIPUK)
%C Kiel
%I Universität Kiel, Institut für Phonetik
%V 4
%P 1-19
%! Das Dilemma des Ausspracheunterrichts
%F Barry:1975:DA


%0 Book Section
%A Barry, William J.
%D 1975
%T Was testen Hörtests eigentlich?
%B Arbeitsberichte des Instituts für Phonetik und digitale Sprachverarbeitung der
Universität Kiel (AIPUK)
%C Kiel
%I Universität Kiel, Institut für Phonetik
%V 4
%P 20-23
%! Was testen Hörtests eigentlich?
%F Barry:1975:WTH


%0 Book Section
%A Barry, William J.
%D 1975
%T Untersuchungen zu fremdsprachlichen Perzeptionsaufgaben
%B Arbeitsberichte des Instituts für Phonetik und digitale Sprachverarbeitung der
Universität Kiel (AIPUK)
%C Kiel
%I Universität Kiel, Institut für Phonetik
%V 4
%P 36-56
%! Untersuchungen zu fremdsprachlichen Perzeptionsaufgaben
%F Barry:1975:UFP


%0 Book Section
%A Barry, William J.
%D 1976
%T Parallel Encoding as a Source of Interference: An Investigation of the Final-Voiced Consonant Problem in English
%E Gutknecht, C.
%B Contemporary English: Occasional Papers
%C Frankfurt a. M.
%I Lange
%P 107-117
%! Parallel Encoding as a Source of Interference: An Investigation of the Final-Voiced Consonant Problem in English
%F Barry:1976:PES


%0 Book Section
%A Barry, William J.
%D 1977
%T Some Areas of Applied Phonetics
%E Gutknecht, C.
%B Grundbegriffe und Hauptströmungen in der Linguistik
%C Hamburg
%I Hoffmann und Campe
%P 53-94
%! Some Areas of Applied Phonetics
%F Barry:1977:SAA


%0 Conference Proceedings
%A Barry, William J.
%D 1977
%T Thesen zu: Perzeption und Ausspracheschulung
%B Kongressbericht der 8. Jahrestagung der Gesellschaft für Angewandte Linguistik (GAL)
%I Hochschulverlag
%V 1
%P 57-60
%! Thesen zu: Perzeption und Ausspracheschulung
%F Barry:1977:TPA


%0 Book Section
%A Barry, William J.
%D 1978
%T Precategorical Acoustic Storage and Foreign Language Sound Categories
%B Arbeitsberichte des Instituts für Phonetik und digitale Sprachverarbeitung der Universität Kiel (AIPUK)
%C Kiel
%I Universität Kiel, Institut für Phonetik
%V 10
%P 16-27
%! Precategorical Acoustic Storage and Foreign Language Sound Categories
%F Barry:1978:PAS
%O Revised version of a paper presented at the 8. International Kongress of Phonetic Sciences, Leeds 1975


%0 Book Section
%A Barry, William J.
%D 1978
%T Fremdkontrolle, Selbstkontrolle und Ausspracheunterricht
%E Jung, U.
%E Haase, M.
%B Fehlinvestition Sprachlabor? Beiträge zu einem konstruktiven Sprachunterricht mit technischen Medien
%C Königstein
%I Scriptor Verlag
%! Fremdkontrolle, Selbstkontrolle und Ausspracheunterricht
%F Barry:1978:FSA


%0 Book Section
%A Barry, William J.
%D 1978
%T Zur Frage der Effektivität apparativer Verfahren in der korrektiven Phonetik im Fremdsprachenerwerb
%B Arbeitsberichte des Instituts für Phonetik und digitale Sprachverarbeitung der Universität Kiel (AIPUK)
%C Kiel
%I Universität Kiel, Institut für Phonetik
%V 10
%P 4-15
%! Zur Frage der Effektivität apparativer Verfahren in der korrektiven Phonetik im Fremdsprachenerwerb
%F Barry:1978:FEA


%0 Book Section
%A Barry, William J.
%D 1979
%T Temporal Aspects of Speech Perception: Primary vs. Secondary Processing
%E Kohler, Klaus J.
%B Arbeitsberichte des Instituts für Phonetik und digitale Sprachverarbeitung der Universität Kiel (AIPUK)
%C Kiel
%I Universität Kiel, Institut für Phonetik
%V 12 (Colloquium Report)
%P 205-220
%! Temporal Aspects of Speech Perception: Primary vs. Secondary Processing
%F Barry:1979:TAS


%0 Journal Article
%A Barry, William J.
%D 1979
%T Complex Encoding in Word-Final Voiced and Voiceless Stops
%B Phonetica
%V 36
%P 361-372
%! Complex Encoding in Word-Final Voiced and Voiceless Stops
%F Barry:1979:CEW


%0 Book Section
%A Barry, William J.
%D 1981
%T Articulatory Coordination: Pysiological Constraints vs. Phonemic Structure
%B Arbeitsberichte des Instituts für Phonetik und digitale Sprachverarbeitung der
Universität Kiel (AIPUK)
%C Kiel
%I Universität Kiel, Institut für Phonetik
%V 16
%P 289-321
%! Articulatory Coordination: Pysiological Constraints vs. Phonemic Structure
%F Barry:1981:ACP


%0 Book Section
%A Barry, William J.
%D 1981
%T Die Problematik der Aussprache in der Fremdsprachenerlernung. Die Unvermeidbarkeit eines fremden Akzents
%B Arbeitsberichte des Instituts für Phonetik und digitale Sprachverarbeitung der
Universität Kiel (AIPUK)
%C Kiel
%I Universität Kiel, Institut für Phonetik
%V 16
%P 1-28
%! Die Problematik der Aussprache in der Fremdsprachenerlernung. Die Unvermeidbarkeit eines fremden Akzents
%F Barry:1981:PAF


%0 Journal Article
%A Barry, William J.
%D 1981
%T Prosodic Functions Revisited Again!
%B Phonetica
%V 38
%P 320-340
%! Prosodic Functions Revisited Again!
%F Barry:1981:PFR


%0 Book Section
%A Barry, William J.
%D 1981
%T Internal Juncture and Speech Communication
%B Arbeitsberichte des Instituts für Phonetik und digitale Sprachverarbeitung der Universität Kiel (AIPUK)
%C Kiel
%I Universität Kiel, Institut für Phonetik
%V 16
%P 229-288
%! Internal Juncture and Speech Communication
%F Barry:1981:IJS


%0 Conference Proceedings
%A Barry, William J.
%D 1983
%T On the Perception of Juncture in English
%B 10th International Congress of Phonetic Sciences
%C Utrecht
%P 529-536
%! On the Perception of Juncture in English
%F Barry:1983:PJE


%0 Journal Article
%A Barry, William J.
%D 1983
%T Instrumentelle Phonetik für den Ausspracheunterricht: Hilfe oder Humbug?
%B Die Neueren Sprachen
%V 82
%P 2-14
%! Instrumentelle Phonetik für den Ausspracheunterricht: Hilfe oder Humbug?
%F Barry:1983:IPA


%0 Journal Article
%A Barry, William J.
%D 1983
%T Click Placement and Units of Perceptual Processing
%B Phonetica
%V 40
%P 247-268
%! Click Placement and Units of Perceptual Processing
%F Barry:1983:CPU


%0 Journal Article
%A Barry, William J.
%D 1983
%T Some Problems of Interarticulator Phasing as an Index of Temporal Regularity in Speech
%B Journal of Experimental Psychology, Human Perception and Performance
%V 9
%P 826-828
%! Some Problems of Interarticulator Phasing as an Index of Temporal Regularity in Speech
%F Barry:1983:SPI


%0 Journal Article
%A Barry, William J.
%D 1984
%T Segment or Syllable? A Reaction-Time Investigation of Phonetic Processing
%B Language & Speech
%V 27
%P 1-15
%! Segment or Syllable? A Reaction-Time Investigation of Phonetic Processing
%F Barry:1984:SSR


%0 Journal Article
%A Barry, William J.
%D 1984
%T Place-of-Articulation Information in the Closure Voicing of Plosives
%B Journal of the Acoustical Society of America
%V 76
%P 1245-1247
%! Place-of-Articulation Information in the Closure Voicing of Plosives
%F Barry:1984:PAI


%0 Book Section
%A Barry, William J.
%D 1985
%T Articulatory and Communicative Factors in Phonetic Decoding for Automatic Speech Recognition
%B Cambridge Papers in Phonetics and Experimental Linguistics
%C Cambridge
%I University of Cambridge, Department of Linguistics
%V 4
%! Articulatory and Communicative Factors in Phonetic Decoding for Automatic Speech Recognition
%F Barry:1985:ACF


%0 Journal Article
%A Barry, William J.
%D 1986
%T Vokalqualitätsunterschiede in Dithmarschen und Angeln. Eine kontrastive Vokaluntersuchung zweier niederdeutscher Dialekte, mit instrumentalphonetischer Unterstützung
%B Zeitschrift für Dialektologie und Linguistik
%V 53
%P 145-157
%! Vokalqualitätsunterschiede in Dithmarschen und Angeln. Eine kontrastive Vokaluntersuchung zweier niederdeutscher Dialekte, mit instrumentalphonetischer Unterstützung
%F Barry:1986:VDA


%0 Book Section
%A Barry, William J.
%D 1986
%T Automatic Identification of Regional Accents. Theory and Practice
%B Cambridge Papers in Phonetics and Experimental Linguistics
%C Cambridge
%I University of Cambridge, Department of Linguistics
%V 5
%! Automatic Identification of Regional Accents. Theory and Practice
%F Barry:1986:AIR


%0 Conference Proceedings
%A Barry, William J.
%D 1987
%T Regional Accent Identification: Principles, Problems, Results
%B European Conference on Speech Technology
%C Edinburgh, Scotland
%V 2
%P 468-471
%! Regional Accent Identification: Principles, Problems, Results
%F Barry:1987:RAI


%0 Conference Proceedings
%A Barry, William J.
%D 1987
%T Adaptation to Regional Accents in Automatic Speech Recognition
%B 11th International Congress of Phonetic Sciences
%C Tallinn, Estonia
%V 2
%P 89-92
%! Adaptation to Regional Accents in Automatic Speech Recognition
%F Barry:1987:ARA


%0 Conference Proceedings
%A Barry, William J.
%D 1989
%T Invited Reply to: Browman and Goldstein: "Targetless" schwa: An Articulatory Analysis
%B 2nd Conference on Laboratory Phonology
%C Edinburgh, Scotland
%I Cambridge University Press
%! Invited Reply to: Browman and Goldstein: "Targetless" schwa: An Articulatory Analysis
%F Barry:1989:IRB


%0 Book Section
%A Barry, William J.
%D 1989
%T Auditory Processing of Tonal Glides
%B Speech, Hearing and Language
%C London
%V 3
%P 33-44
%! Auditory Processing of Tonal Glides
%F Barry:1989:APT


%0 Journal Article
%A Barry, William J.
%D 1989
%T Perception and Production of English Vowels by German Learners: Instrumental-Phonetic Support in Language Teaching
%B Phonetica
%V 46
%P 155-168
%! Perception and Production of English Vowels by German Learners: Instrumental-Phonetic Support in Language Teaching
%F Barry:1989:PPE


%0 Book Section
%A Barry, William J.
%D 1990
%T Levels of Labelling
%B Speech, Hearing and Language
%C London
%V 4
%P 29-44
%! Levels of Labelling
%F Barry:1990:LL


%0 Conference Proceedings
%A Barry, William J.
%D 1991
%T Critical Parameters in the Definition of Speech Recogniser Performance
%B 12th International Congress of Phonetic Sciences
%C Aix-en-Provence, France
%V 5
%P 426-429
%! Critical Parameters in the Definition of Speech Recogniser Performance
%F Barry:1991:CPD


%0 Conference Proceedings
%A Barry, William J.
%D 1993
%T Ausspracheschulung
%B Tagungsbericht 10. Internationale Deutschlehrertagung
%C Leipzig, Germany
%I Iudicium-Verlag
%P 209-215
%! Ausspracheschulung
%F Barry:1993:A


%0 Book Section
%A Barry, William J.
%D 1994
%T Databases in Speech Technology
%E Asher, R. E.
%B The Encyclopedia of Language and Linguistics
%C Oxford
%I Pergamon Press
%V 2
%P 817-822
%! Databases in Speech Technology
%F Barry:1994:DST


%0 Conference Proceedings
%A Barry, William J.
%D 1995
%T Phonetics and Phonology of Speaking Styles
%E Elenius, K.
%E Branderud, P.
%B 13th International Congress of Phonetic Sciences, August 13-19
%C Stockholm, Sweden
%V 2
%P 4-10
%! Phonetics and Phonology of Speaking Styles
%F Barry:1995:PPS


%0 Journal Article
%A Barry, William J.
%D 1995
%T Schwa vs. Schwa+/r/ in German
%B Phonetica
%V 52
%N 3
%P 228-235
%! Schwa vs. Schwa+/r/ in German
%F Barry:1995:SVS


%0 Journal Article
%A Barry, William J.
%D 1995
%T Phonetik im Kopf und im Computer. Gedanken zur Theorie der Phonetik
%B PHONUS
%C Universität des Saarlandes, Phonetik, Saarbrücken
%V 1
%P 1-18
%! Phonetik im Kopf und im Computer. Gedanken zur Theorie der Phonetik
%2 Barry:1995:PIK.pdf
%F Barry:1995:PIK
%X The following text is a version of my Inaugural Lecture, slightly modified for the purpose of distribution in printed form, which was held on 6 June 1994 in the Faculty of Arts, University of the Saarland, Saarbrücken.
%U http://www.coli.uni-sb.de/Phonetics/Research/PHONUS_research_reports/Phonus1/Barry_PHONUS1.ps.gz


%0 Conference Proceedings
%A Barry, William J.
%D 1996
%T Some Fundamental Problems of Looking at Connected Speech
%E Simpson, Adrian P.
%E Pätzold, Matthias
%B Proceedings of the Symposium "Sound Patterns of Connected Speech - Description, Models and Explanation", Arbeitsberichte des Instituts für Phonetik, Universität Kiel (AIPUK 31), 14-15 June
%C Kiel University
%P 113-117
%! Some Fundamental Problems of Looking at Connected Speech
%F Barry:1996:SFP


%0 Journal Article
%A Barry, William J.
%D 1996
%T The Relevance of Phonetics for Pronunciation Teaching
%B PHONUS
%C Universität des Saarlandes, Phonetik, Saarbrücken
%V 2
%P 5-20
%! The Relevance of Phonetics for Pronunciation Teaching
%F Barry:1996:RPP


%0 Journal Article
%A Barry, William J.
%D 1997
%T Another R-tickle
%B Journal of the International Phonetic Association
%V 27
%N 1-2
%P 35-45
%! Another R-tickle
%F Barry:1997:ART


%0 Book Section
%A Barry, William J.
%D 1998
%T Zur Analyse prosodischer Abweichungen in der Fremdsprache. Rhythmische Probleme koreanischer Deutschlerner
%E Kröger, B.
%E Riek, C.
%E Sachse, G.
%B Festschrift Georg Heike
%C Frankfurt a.M.
%I 311-322
%! Zur Analyse prosodischer Abweichungen in der Fremdsprache. Rhythmische Probleme koreanischer Deutschlerner
%F Barry:1998:APA


%0 Book Section
%A Barry, William J.
%D 1998
%T Mikrophonetik, Makrophonetik und Sprechwissenschaft
%E Biege, A.
%E Bose, I.
%B Theorie und Empirie der Sprechwissenschaft
%C Hanau, Halle
%I Verlag Werner Dausien
%P 22-29
%! Mikrophonetik, Makrophonetik und Sprechwissenschaft
%F Barry:1998:MMS


%0 Conference Proceedings
%A Barry, William J.
%D 1998
%T Time as a Factor in the Acoustic Variation of schwa
%B The 5th International Conference on Spoken Language Processsing  (ICSLP '98), November 30 -December 4
%C Sydney, Australia
%V 5
%! Time as a Factor in the Acoustic Variation of schwa
%F Barry:1998:TFA


%0 Journal Article
%A Barry, William J.
%D 1999
%T Trend und Ergebnisse der phonetischen Forschung und ihr Nutzen für den Fremdsprachenunterricht
%B Deutsch als Fremdsprache
%V 36
%N 2
%P 81-87
%! Trend und Ergebnisse der phonetischen Forschung und ihr Nutzen für den Fremdsprachenunterricht
%F Barry:1999:TEP


%0 Journal Article
%A Barry, William J.
%A Andreeva, Bistra
%D 2001
%T Cross-Language Similarities and Differences in Spontaneous Speech Patterns
%B Journal of the International Phonetic Association
%V 31
%N 1
%! Cross-Language Similarities and Differences in Spontaneous Speech Patterns
%F Barry:2001:CLS


%0 Conference Proceedings
%A Barry, William J.
%A Dalsgaard, Paul
%D 1993
%T Speech Database Annotation. The Importance of a Multi-Lingual Approach
%E Fellbaum, K.
%B 3rd European Conference on Speech Communication and Technology (EUROSPEECH '93), September 21-23
%C Berlin, Germany
%V 1
%P 13-20
%! Speech Database Annotation. The Importance of a Multi-Lingual Approach
%F Barry:1993:SDA


%0 Journal Article
%A Barry, William J.
%A Fourcin, Adrian J.
%D 1992
%T Levels of Labelling
%B Computer Speech and Language
%V 6
%P 1-14
%! Levels of Labelling
%F Barry:1992:LL


%0 Conference Proceedings
%A Barry, William J.
%A Goldsmith, M.
%A Fourcin, Adrian J.
%A Fuller, H.
%D 1991
%T Stability of Voice Frequency Measures in Speech
%B 12th International Congress of Phonetic Sciences
%C Aix-en-Provence, France
%V 2
%P 38-41
%! Stability of Voice Frequency Measures in Speech
%F Barry:1991:SVF


%0 Book Section
%A Barry, William J.
%A Grice, Martine
%D 1991
%T Auditory and Visual Factors in Speech Database Analysis
%B Speech, Hearing and Language
%C London
%V 5
%! Auditory and Visual Factors in Speech Database Analysis
%F Barry:1991:AVF


%0 Conference Proceedings
%A Barry, William J.
%A Grice, Martine
%A Hazan, Valerie
%A Fourcin, Adrian J.
%D 1989
%T Excitation Distributions for Synthesised Speech
%E Tubach, J. P.
%E Mariani, J. J.
%B 1st European Conference on Speech Communication and Technology (EUROSPEECH '89)
%C Paris, France
%V 1
%P 353-356
%! Excitation Distributions for Synthesised Speech
%F Barry:1989:EDS


%0 Journal Article
%A Barry, William J.
%A Gutknecht, C.
%D 1970
%T Model for Remedial Courses in English Phonetics at German Universities
%B Linguistische Berichte
%V 7
%P 74-79
%! Model for Remedial Courses in English Phonetics at German Universities
%F Barry:1970:MRC


%0 Book
%A Barry, William J.
%A Gutknecht, C.
%D 1974
%T Practical English Ponetics. A Programmed Course in English Pronunciation
%C Hamburg
%I Buske
%! Practical English Ponetics. A Programmed Course in English Pronunciation
%F Barry:1974:PEP


%0 Conference Proceedings
%A Barry, William J.
%A Hawkins, S.
%D 1989
%T Invited Reply to: Hewlett and Shockey: On Types of Coarticulation
%B 2nd Conference on Laboratory Phonology
%C Edinburgh, Scotland
%I Cambridge University Press
%! Invited Reply to: Hewlett and Shockey: On Types of Coarticulation
%F Barry:1989:IRH


%0 Journal Article
%A Barry, William J.
%A Hoequist, C. E.
%A Nolan, F. J.
%D 1989
%T An Approach to the Problem of Regional Accent in Automatic Speech Recognition
%B Computer Speech and Language
%V 3
%P 355-366
%! An Approach to the Problem of Regional Accent in Automatic Speech Recognition
%F Barry:1989:APR


%0 Journal Article
%A Barry, William J.
%A Klein, Cordula
%A Köser, S.
%D 1999
%T Speech Production Evidence for Ambisyllabicity in German
%B PHONUS
%C Universität des Saarlandes, Phonetik, Saarbrücken
%V 4
%P 87-102
%! Speech Production Evidence for Ambisyllabicity in German
%2 Barry:1999:SPE.pdf
%F Barry:1999:SPE
%X Speech production behaviour for cases where, in German, the assumed syllable structure demands of the Maximum Onset Principle (MOP) and the shortstressed vowel Compulsory Coda Principle (CCP) are in conflict, is compared with cases where there is no conflict. The results of two word manipulation tasks are presented in which subjects were required to divide firstsyllablestressed disyllabic words into two parts, in one case ("scanning") introducing a pause between the first and second part, in the other case ("swapping") speaking the parts in reverse order. Production of an intervocalic single consonant both as a coda to the (original) first syllable and as an onset to the (original) second syllable is seen as behavioural evidence for the psychological reality of ambisyllabicity, which, as a theoretical construct, resolves the conflict in syllable structure demands. We also discuss the relation of the results to orthographic and taskrelated factors and their implication for the phonological status of the syllable.
%U http://www.coli.uni-sb.de/Phonetics/Research/PHONUS_research_reports/Phonus4/Barry_PHONUS4.ps.gz


%0 Book Section
%A Barry, William J.
%A Kohler, Klaus J.
%D 1978
%T Unter welchen Bedingungen werden phonologisch redundante Merkmale auditiv relevant?
%B Arbeitsberichte des Instituts für Phonetik und digitale Sprachverarbeitung der Universität Kiel (AIPUK)
%C Kiel
%I Universität Kiel, Institut für Phonetik
%V 10
%P 28-59
%! Unter welchen Bedingungen werden phonologisch redundante Merkmale auditiv relevant?
%F Barry:1978:WBW


%0 Journal Article
%A Barry, William J.
%A Künzel, H. J.
%D 1975
%T Co-Articulatory Airflow Characteristics of Intervocalic Voiceless Plosives
%B Journal of Phonetics
%V 3
%P 263-282
%! Co-Articulatory Airflow Characteristics of Intervocalic Voiceless Plosives
%F Barry:1975:CAA


%0 Book Section
%A Barry, William J.
%A Künzel, H. J.
%D 1975
%T Luftstromuntersuchungen zur Koartikulation bei stimmlosen Okklusiven im Deutschen
%B Arbeitsberichte des Instituts für Phonetik und digitale Sprachverarbeitung der
Universität Kiel (AIPUK)
%C Kiel
%I Universität Kiel, Institut für Phonetik
%V 5
%P 22-46
%! Luftstromuntersuchungen zur Koartikulation bei stimmlosen Okklusiven im Deutschen
%F Barry:1975:LKS


%0 Journal Article
%A Barry, William J.
%A Künzel, H. J.
%D 1978
%T A Note on the Devoicing of Nasals
%B Journal of the International Phonetics Association
%V 8
%P 47-55
%! A Note on the Devoicing of Nasals
%F Barry:1978:NDN


%0 Conference Proceedings
%A Barry, William J.
%A Nielsen, C.
%A Andersen, Ove
%D 2001
%T Must Diphone Synthesis be so Unnatural?
%E Dalsgaard, P.
%E Lindberg, B.
%E Benner, H.
%B 7th European Conference on Speech Communication and Technology (EUROSPEECH '01), September 3-7
%C Aalborg, Denmark
%! Must Diphone Synthesis be so Unnatural?
%F Barry:2001:MDS


%0 Journal Article
%A Barry, William J.
%A Pützer, Manfred
%D 1995
%T Zur phonetischen Basis der Fortis-Lenis-Opposition bei Plosiven in moselfränkischen und rheinfränkischen Dialektgebieten im Saarland und in Rheinland-Pfalz
%B PHONUS
%C Universität des Saarlandes, Phonetik, Saarbrücken
%V 1
%P 53-64
%! Zur phonetischen Basis der Fortis-Lenis-Opposition bei Plosiven in moselfränkischen und rheinfränkischen Dialektgebieten im Saarland und in Rheinland-Pfalz
%2 Barry:1995:PBF.pdf
%F Barry:1995:PBF
%X Das häufige Auftreten von wortinitialem /p, t, k/ in phonetisch/phonologischen Darstellungen des Moselfränkischen und gegensätzlich dazu /b, d, g/ in ebensolchen über rheinfränkische Dialekte erhebt die Frage nach der phonetischen Basis der Fortis-Lenis-Opposition, die trotz der Alternation in beiden Dialektgebieten  vorhanden  ist.  Eine  Untersuchung  der  Produktion  dieser Opposition bei den Plosiven und ein Perzeptionstest mit manipulierten Stimuli aus dem Produktionskorpus wurden mit Dialektsprechern und -hörern aus zwei moselfränkischen  und  zwei  rheinfränkischen  Orten  durchgeführt.  Die  Ergebnisse zeigen, daß trotz gruppenmäßig- und individuell systematischer Produktionsunterschiede für beide Gruppen die Plosivlösung das stärkste Signal für die perzeptorische Unterscheidung ist. Eine unterschiedliche Tendenz bei den Hörergruppen  bezüglich  der  Gewichtung  unterschiedlicher  Lösungsintensitäten bei  kurzer  Lösungsdauer  entspricht  der  in  der  Dialektliteratur  gefundenen Transkriptionsvariation.
%U http://www.coli.uni-sb.de/Phonetics/Research/PHONUS_research_reports/Phonus1/BarryPuetzer_PHONUS1.ps.gz


%0 Journal Article
%A Barry, William J.
%A Pützer, Manfred
%D 1997
%T Zur phonetischen Basis der Fortis-Lenis-Opposition bei Plosiven in moselfränkischen und rheinfränkischen Dialekten sowie Übergangsgebieten im germanophonen Lothringen (Frankreich)
%B Zeitschrift für Dialektologie und Linguistik
%V 64
%N 2
%P 155-178
%! Zur phonetischen Basis der Fortis-Lenis-Opposition bei Plosiven in moselfränkischen und rheinfränkischen Dialekten sowie Übergangsgebieten im germanophonen Lothringen (Frankreich)
%F Barry:1997:PBF


%0 Book
%A Barry, William J.
%A Pützer, Manfred
%D 2002
%T Festschrift für Max Mangold zum 80. Geburtstag
%B PHONUS
%C Universität des Saarlandes, Phonetik, Saarbrücken
%V 6
%! Festschrift für Max Mangold zum 80. Geburtstag
%F Barry:2002:FMM


%0 Conference Proceedings
%A Barry, William J.
%A Russo, Michela
%D 2002
%T Lamdacismo e Rotacismo in Area Napolitana: Realizzazione Fonetica e Posizione Fonologica
%E Pompoli, Roberto
%E Carletti, Eleonora
%E Fausti, Patrizio
%E Pedrielli, Francesca
%E Peretti, Alessandro
%E Pompoli, Francesco
%E Prodi, Nicola
%B Atti 29{$^o$}, Convegno Nazionale. Associazione Italiana di Acustica (AIA 2002), 12-14 giugno
%C Ferrara, Italia
%P 377-382
%! Lamdacismo e Rotacismo in Area Napolitana: Realizzazione Fonetica e Posizione Fonologica
%F Barry:2002:LRA


%0 Journal Article
%A Barry, William J.
%A Timmermann, G.
%D 1985
%T Mispronunciation and Compensatory Movements of Tongue-Operated Patients
%B British Journal of Disorders of Communication
%V 20
%P 81-90
%! Mispronunciation and Compensatory Movements of Tongue-Operated Patients
%F Barry:1985:MCM


%0 Journal Article
%A Barry, William J.
%A Waine, A. E.
%D 1970
%T An Advanced Level Language Laboratory Remedial Grammar Course
%B Linguistische Berichte
%V 10
%P 88-90
%! An Advanced Level Language Laboratory Remedial Grammar Course
%F Barry:1970:ALL


%0 Book Section
%A Barry, William J.
%A Weiher, E.
%D 1975
%T Die Beurteilung der Lautproduktion von Fremdsprachenlernenden
%B Arbeitsberichte des Instituts für Phonetik und digitale Sprachverarbeitung der
Universität Kiel (AIPUK)
%C Kiel
%I Universität Kiel, Institut für Phonetik
%P 57-72
%! Die Beurteilung der Lautproduktion von Fremdsprachenlernenden
%F Barry:1975:BLF


%0 Conference Proceedings
%A Bateman, John
%A Teich, Elke
%A Kruijff, Geert-Jan M.
%A Kruijff-Korbayová, Ivana
%A Sharoff, Serge
%A Skoumalová, Hana
%D 2000
%T Resources for Multilingual Text Generation in Three Slavic Languages
%B 2nd International Conference on Language Resources and Evaluation (LREC-2000), May 31 - June 2
%C Athens, Greece
%P 1763-1768
%! Resources for Multilingual Text Generation in Three Slavic Languages
%2 Bateman:2000:RMT.pdf
%F Bateman:2000:RMT
%U http://ufal.mff.cuni.cz/agile/biblio/publications/2000/LREC00.pdf


%0 Journal Article
%A Baum, Micha
%A Erbach, Gregor
%A Kommenda, Markus
%D 2001
%T Spracherkennung: Kommunikation mit Maschinen
%B Funkschau
%V 1/ 2001
%P 26-29
%! Spracherkennung: Kommunikation mit Maschinen
%2 Baum:2001:SKM.pdf
%3 j
%F Baum:2001:SKM
%U http://www.dfki.de/dfkibib/publications/docs/funkschau.pdf


%0 Book Section
%A Baumann, Stefan
%D 1999
%T Zum Verhältnis von Akzentform und kognitivem Status von Diskurseinheiten
%E Joachimsthaler, J.
%E Engel, U.
%E Kaszynski, S. H.
%B Convivium. Germanistisches Jahrbuch Polen 1999
%C Bonn
%I DAAD
%P 201-224
%S Reihe Germanistik
%! Zum Verhältnis von Akzentform und kognitivem Status von Diskurseinheiten
%2 Baumann:1999:VAK.pdf
%F Baumann:1999:VAK
%X This article deals with accent placement in spontaneous German speech. Using data from an extempore narrative as an example, the author discusses to what extent accent placement on a discourse unit is influenced by semantic-syntactic principles on the one hand and pragmatic considerations on the other. Of particular interest is the question whether there is a correspondence between the phonetic form of an accent a speaker assigns to a constituent (low or high pitch accent) and the constituent's assumed activation state in the addressee's consciousness (given or new) at the time of utterance.


%0 Conference Proceedings
%A Baumann, Stefan
%A Brinckmann, Caren
%A Hansen-Schirra, Silvia
%A Kruijff, Geert-Jan
%A Kruijff-Korbayova, Ivana 
%A Neumann, Stella
%A Steiner, Erich
%A Teich, Elke
%A Uszkoreit, Hans
%D 2004
%T The MULI Project: Annotation and Analysis of information structure in German and English
%B Proceedings of 4th International Conference on Language Resources and Evaluation (LREC) 2004
%C Lisbon
%! The MULI Project: Annotation and Analysis of information structure in German and English
%F Baumann:2004:MPAa


%0 Conference Proceedings
%A Baumann, Stefan
%A Brinckmann, Caren
%A Hansen-Schirra, Silvia
%A Kruijff, Geert-Jan
%A Kruijff-Korbayova, Ivana
%A Neumann, Stella
%A Teich, Elke
%D 2004
%T Application of stand off annotation to three heterogeneous layers
%B Proceedings of Frontiers in Corpus Annotation 2004: NAACL/HLT Conference Workshop
%C Boston
%! Application of stand off annotation to three heterogeneous layers
%F Baumann:2004:ASA


%0 Conference Proceedings
%A Baumann, Stefan
%A Grice, Martine
%A Benzmüller, Ralf
%D 2000
%T GToBI - A Phonological System for the Transcription of German Intonation
%B Prosody 2000: Speech Recognition and Synthesis Workshop, October 2-5
%C Kraków, Poland
%P 21-28
%! GToBI - A Phonological System for the Transcription of German Intonation
%2 Baumann:2000:GPS.pdf
%F Baumann:2000:GPS


%0 Conference Proceedings
%A Baumann, Stefan
%A Trouvain, Jürgen
%D 2001
%T On the Prosody of German Telephone Numbers
%E Dalsgaard, P.
%E Lindberg, B.
%E Benner, H.
%B 7th European Conference on Speech Communication and Technology (EUROSPEECH '01), September 3-7
%C Aalborg, Denmark
%P 557-560
%! On the Prosody of German Telephone Numbers
%2 Baumann:2001:PGT.pdf Baumann:2001:PGT.ps
%F Baumann:2001:PGT
%X Spoken telephone numbers are prosodically structured. This is reflected on various levels, such as grouping, wording and accenting. Realisation strategies employed by German speakers are used to model the prosody of telephone number production. In a listening preference test using synthetic speech two strategies used by commercial inquiry systems proved to be less acceptable than the versions based on the proposed models. These models are proposed for use in speech-synthesis-based telephone number inquiry services.


%0 Conference Proceedings
%A Becker, Markus
%D 1998
%T Unsupervised Part of Speech Tagging with Extended Templates
%E Kruijff, Geert-Jan
%E Kruijff-Korbayová, Ivana
%B 10th European Summer School in Logic, Language and Information (ESSLLI'98), Student Session, August 17-28
%C Saarbrücken
%P 43-50
%! Unsupervised Part of Speech Tagging with Extended Templates
%2 Becker:1998:UPS.pdf Becker:1998:UPS.ps
%F Becker:1998:UPS
%X In this paper we describe an extension of the unsupervised learning algorithm for automatically training a rule-based part of speech tagger, originally proposed by [Brill,1995]. We claim that the employment of templates with wider contexts will yield both linguistically more satisfying results and also higher precision rates.
%U http://www.dfki.de/~mbecker/unsup.ps


%0 Master's Thesis
%A Becker, Markus
%D 1999
%T Unsupervised Training of a Rule-Based Part-of-Speech Tagger
%C Saarbrücken
%I Computational Linguistics, University of Saarland
%! Unsupervised Training of a Rule-Based Part-of-Speech Tagger
%2 Becker:1999:UTR.pdf Becker:1999:UTR.ps
%F Becker:1999:UTR
%O unpublished master's thesis
%U http://www.dfki.de/~mbecker/diplom.ps


%0 Conference Proceedings
%A Becker, Markus
%A Drozdzynski, Witold
%A Krieger, Hans-Ulrich
%A Piskorski, Jakub
%A Schäfer, Ulrich
%A Xu, Feiyu
%D 2002
%T SProUT - Shallow Processing with Typed Feature Structures and Unification
%B Proceedings of the International Conference on NLP (ICON 2002). December 18-21
%C Mumbai, India
%! SProUT - Shallow Processing with Typed Feature Structures and Unification
%2 Becker:2002:SSP.pdf
%3 j
%F Becker:2002:SSP
%X 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.
%U http://www.dfki.de/~feiyu/sprout.pdf


%0 Conference Proceedings
%A Becker, Markus
%A Frank, Anette
%D 2002
%T A Stochastic Topological Parser of German
%B Proceedings of the 19th Conference on Computational Linguistics (COLING'02), August 24 - September 1
%C Taipei, Taiwan
%! A Stochastic Topological Parser of German
%2 Becker:2002:STP.pdf Becker:2002:STP.ps
%F Becker:2002:STP
%X We present a new approach to topological parsing for German which is corpus-based, and built on a simple model of probabilistic CFG parsing. The topological field model is a theory-neutral model of clausal syntax that provides a linguistically motivated, but flat macro structure for complex sentences. Topological structures are highly compatible with deep syntactic analysis, thus perfectly suited for seamless integration of shallow and deep NLP. Besides the practical aspect of developing a robust and accurate topological parser, we investigate to what extent topological structures can be handled by context-free probabilistic models, while trying to detect specific phenomena that require more sophisticated models. We discuss experiments with systematic variants of a topological treebank grammar, which yield competitive results.
%U http://www.dfki.de/~frank/papers/Coling2002_Becker_Frank_245.ps


%0 Edited Proceedings
%A Becker, Tilman
%A Busemann, Stephan
%D 1999
%T "May I Speak Freely?" Between Templates and Free Choice in Natural Language Generation. Workshop at the 23rd German Annual Conference for Artificial Intelligence (KI'99), Bonn
%C Saarbrücken
%I DFKI
%S DFKI Document
%7 D-99-01
%! "May I Speak Freely?" Between Templates and Free Choice in Natural Language Generation. Workshop at the 23rd German Annual Conference for Artificial Intelligence (KI'99), Bonn
%2 Becker:1999:MSF.tar
%3 j
%F Becker:1999:MSF
%X This workshop is, to our knowledge, the first one topicalizing the relation between application tasks and technologies used. It aims at exploring the tension between more general and more specific approaches to NLG, thereby clarifying what NLG technology is suited best for which task. It is intended to be an opportunity to get an overview over existing state-of-the-art technology and its optimal usage. It will be relevant for both developers and users of NLG systems. Exploring conditions for successful NLG applications is a step that should be taken jointly by technology providers and current and potential users of NLG software. The invited speaker, Paul Heisterkamp of DaimlerChrysler AG, will focus on the industrial usage of NLG software, and we appreciate his contribution to this volume. 
The workshop is embedded into the German Annual AI conference KI'99, following its tradition of hosting small hot-topic workshops. At the same time it is an activity of the Special Interest Group for Natural Language Systems (Fachgruppe 1.3.1) of the German association for computer science, Gesellschaft für Informatik (GI). 
The ten contributions to this volume are unpublished research reports reviewed by the workshop organizers. The authors agreed to make available to each other the submitted papers before preparing the final versions. The papers can also be downloaded from the workshop's web page at http://www.dfki.de/service/NLG/KI99.html.
%U ftp://ftp.dfki.uni-kl.de/pub/Publications/Documents/1999/D-99-01.tar.gz


%0 Edited Proceedings
%A Becker, Tilman
%A Busemann, Stephan
%D 2000
%T Impacts in Natural Language Generation: NLG between Technology and Applications. Workshop at Schloss Dagstuhl, Germany
%C Saarbrücken
%I DFKI
%S DFKI Document
%7 D-00-01
%! Impacts in Natural Language Generation: NLG between Technology and Applications. Workshop at Schloss Dagstuhl, Germany
%2 Becker:2000:INL.tar
%3 j
%F Becker:2000:INL
%X This report contains the presented papers, abstracts of the invited talk and four sessions on 'burning issues' of the IMPACTS workshop on Natural Language Generation between Technology and Applications, held at Schloss Dagstuhl, July 26-28, 2000.
%U ftp://ftp.dfki.uni-kl.de/pub/Publications/Documents/2000/D-00-01.tar.gz


%0 Edited Proceedings
%A Becker, Tilman
%A Busemann, Stephan
%A Finkler, Wolfgang
%D 1997
%T DFKI Workshop on Natural Language Generation
%C Saarbrücken
%I DFKI
%S DFKI Document
%7 D-97-06
%! DFKI Workshop on Natural Language Generation
%2 Becker:1997:DWN.tar
%3 j
%F Becker:1997:DWN
%X On the Saarbrücken campus sites as well as at DFKI, many research activities are pursued in the field of Natural Language Generation (NLG). We felt that too little is known about the total of these activities and decided to organize a workshop in order to share ideas and promote the results. 
This DFKI workshop brought together local researchers working on NLG. Several papers are co-authored by international researchers. Although not all NLG activities are covered in the present document, the papers reviewed for this workshop clearly demonstrate that Saarbrücken counts among the important NLG sites in the world.
%U ftp://ftp.dfki.uni-kl.de/pub/Publications/Documents/1997/D-97-06.tar.gz


%0 Edited Proceedings
%A Becker, Tilman
%A Krieger, Hans-Ulrich
%D 1997
%T Proceedings of the Fifth Meeting on Mathematics of Language - MOL5
%C Saarbrücken
%I DFKI
%S DFKI Document
%7 D-97-02
%! Proceedings of the Fifth Meeting on Mathematics of Language - MOL5
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/D-97-02.entry
%2 Becker:1997:PFM.tar
%3 j
%F Becker:1997:PFM
%X 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.
%U ftp://ftp.dfki.uni-kl.de/pub/Publications/Documents/1997/D-97-02.tar.gz


%0 Conference Proceedings
%A Bedersdorfer, Jochen
%A Konrad, Karsten
%A Neis, Ingo
%A Scherf, Oliver
%A Steffen, Jörg
%A Wein, Michael
%D 1993
%T Eine Spezifikationssprache für Transformationen auf getypten Merkmalsstrukturen
%E Boley, Harold
%E Bry, François
%E Geske, Ulrich
%B Neuere Entwicklungen der deklarativen KI-Programmierung, September 13-25
%C Berlin, Germany
%P 17-30
%S Research Report
%7 RR-93-35
%! Eine Spezifikationssprache für Transformationen auf getypten Merkmalsstrukturen
%2 Bedersdorfer:1993:STG.pdf Bedersdorfer:1993:STG.ps
%3 j
%F Bedersdorfer:1993:STG
%X The field of declarative AI programming is briefly characterized. Its recent developments in Germany are reflected by a workshop as part of the scientific congress KI-93 at the Berlin Humboldt University. Three tutorials introduce to the state of the art in deductive databases, the programming language Gödel, and the evolution of knowledge bases. Eleven contributed papers treat knowledge revision/program transformation, types, constraints, and type-constraint combinations.
%U http://www.ags.uni-sb.de/~konrad/papers/slant.ps.gz


%0 Conference Proceedings
%A Beil, Franz
%A Prescher, Detlef
%A Schmid, Helmut
%A Schulte im Walde, Sabine
%D 2002
%T Evaluation of the Gramotron Parser for German
%B Proceedings of the LREC Workshop: Beyond PARSEVAL, May 29-31
%C Las Palmas, Gran Canaria
%! Evaluation of the Gramotron Parser for German
%2 Beil:2002:EGP.pdf
%3 j
%F Beil:2002:EGP
%X The paper describes an experiment in inside-outside estimation of a lexicalized probabilistic context free grammar for German. Grammar and formalism features which make the experiment feasible are described. Successive models are evaluated on precision and recall of phrase markup consisting of labels for noun chunks and subcategorization frames. Our approach to parsing is a blend of symbolic and stochastic methods where we use evaluation results in both incremental grammar development and validation of selected output to be used in lexical semantic clustering. Our results are that (i) scrambling-style free phrase order, case morphology, subcategorization, and NP-internal gender, number and case agreement can be dealt within a lexicalized probabilistic context-free grammar formalism, and (ii) inside-outside estimation appears to be beneficial, however relies on a carefully built grammar and an evaluation based on carefully selected linguistic criteria. Additionally, we report experiments on overtraining with inside-outside estimation, especially focusing on comparison of the results of mathematical and linguistic evaluations.
%U http://www.dfki.de/~prescher/papers/bib/2002lrec.beil.prescher.schmid.schulte_im_walde.pdf


%0 Journal Article
%A Benoît, Christian
%A Grice, Martine
%A Hazan, Valerie
%D 1996
%T The SUS Test: A Method for the Assessment of Text-to-Speech Synthesis Intelligibility Using Semantically Unpredictable Sentences
%B Speech Communication
%V 18
%N 4
%P 381-392
%! The SUS Test: A Method for the Assessment of Text-to-Speech Synthesis Intelligibility Using Semantically Unpredictable Sentences
%F Benoit:1996:STM


%0 Journal Article
%A Benzmüller, Ralf
%D 1997
%T SAMPA als Eingabeformat für die Sprachausgabe Logox
%B PHONUS
%C Universität des Saarlandes, Phonetik, Saarbrücken
%V 3
%P 61-81
%! SAMPA als Eingabeformat für die Sprachausgabe Logox
%2 Benzmuller:1997:SES.pdf Benzmuller:1997:SES.ps
%F Benzmuller:1997:SES
%X In der Sprachausgabe Logox wird SAMPA als Eingabeformat für die Aussprache benutzt. Durch die eher phonetische Orientierung an der Aussprache und einige Eigenschaften der Mikrosegmentsynthese wurden Anpassungen und Erweiterungen eingeführt. Z.B.: [(] als Zeichen für das kurze, ungespannte /E/, Klammerung () von Diphthongen und Affrikaten, "=" für silbische Konsonanten und unsilbische Vokale, [Sb] und [Sd] für unaspirierte Plosive nach /S/ am Wort- bzw. Silbenanfang. Die Aussprache von Wörtern, die auf "-ig" enden wird durch ein "Archiphonem" /G/ geregelt. Für potentiell intervokalische /r/ am Ende des Wortstammes wird [6r] transkribiert. So können durch systeminterne Umwandlungsregeln sowohl intervokalische als auch präkonsonantische /r/ korrekt ausgesprochen werden. Bezüglich der Realisierung der Phonemfolge /@r/ wurde ein Bewertungsexperiment mit folgendem Ergebnis durchgeführt: [6] wurde in den meisten Kontexten besser bewertet als [@]. Insbesondere im Folgen von unbetonten Silben, wenn der Wortstamm auf /@r/ endet (unabhängig von Betontheit der Folgesilbe) und in den Vorsilben "ver-", "zer-" und "er-". [@] wird eher erwartet in den Vorsilben "be-" und "ge-" und vor betonten Silben innerhalb eines Wortstamms. 

In the Logox Text-to-Speech system SAMPA is used as input format for the extension of the pronunciation lexicon. Due to certain features of the microsegment synthesis some adaptations and deviations from other SAMPA standards were necessary. The most important are: [\{]} as symbol for short, lax /E/, diphthongs and affricates are enclosed in brackets (), "=" is used for syllabic consonants and non-syllabic vowels, [Sb] and [Sd] for unaspirated plosives after /S/ word or syllable-initially. An "archiphoneme" /G/ controls the pronunciation of morphemes ending in "-ig". By transcribing [6r] system internal rules can be used to account for the different realisation of /r/ stem-finally in intervocalic and preconsonantal position. A perception experiment was carried out in order to evaluate the realisation of /@/ before /r/. Results indicate, that [6] is prefered over [@] especially in unstressed syllable sequences, in a stem ending in /@r/ regardless of stress of the following syllable, and in the prefixes "ver-", "zer-" and "er-". [@] is mostly preferred in the prefixes "be-" and "ge-" and in word stems before stressed syllables.
%U ftp://ftp.coli.uni-sb.de/pub/people/ralf/logox+SAMPA.ps.gz


%0 Conference Proceedings
%A Benzmüller, Ralf
%A Barry, William J.
%D 1996
%T Mikrosegmentsynthese - Ökonomische Prinzipien bei der Konkatenation subphonemischer Spracheinheiten
%E Mehnert, Dieter
%B 7. Konferenz Elektronische Sprachsignalverarbeitung (ESSV1996), November 25-27
%C Berlin, Germany
%P 86-93
%! Mikrosegmentsynthese - Ökonomische Prinzipien bei der Konkatenation subphonemischer Spracheinheiten
%2 Benzmuller:1996:MOP.pdf Benzmuller:1996:MOP.ps
%F Benzmuller:1996:MOP
%X Es wird ein KonkatenationsSprachsynthesesystem vorgestellt, in dem das Wissen über sprachliche Kategorien ausgenutzt wird, um die Einschränkungen, die das System vorgibt, zu überwinden. Dazu werden die Konkatenationseinheiten, Mikrosegmente genannt, so häufig benutzt wie möglich. Konsonanten werden dabei in einer weitgehend kontextfreien Weise verwendet, und Vokale werden aus zwei Vokalhälften zusammengesetzt, die nach der Artikulationsstelle des folgenden bzw. vorhergehenden Konsonanten in drei Kontextkategorien eingeteilt werden. Außerdem werden quasistationäre Vokalteile an unterschiedlichen Positionen eingesetzt. Prosodische Variationen werden ausschließlich im Zeitbereich durchgeführt, um die natürliche Sprachqualität zu bewahren. Die Dauer der Mikrosegmente ist in 6 Stufen veränderbar, und deren Tonhöhe wird bei sonoranten Lauten durch Manipulationen in der offenen Phase der Stimmgebungsperiode verändert. Die entsprechenden Abschnitte der Mikrosegmente sind durch Markierungen gekennzeichnet.
%U ftp://ftp.coli.uni-sb.de/pub/people/ralf/Mseg.ESSV7-96.ps.gz


%0 Conference Proceedings
%A Benzmüller, Ralf
%A Barry, William J.
%D 1996
%T Microsegment Synthesis - Economic Principles in a Low-Cost Solution
%B 4th International Conference on Spoken Language Processing (ICSLP '96), October 3-6
%C Philadelphia, USA
%V 4
%! Microsegment Synthesis - Economic Principles in a Low-Cost Solution
%2 Benzmuller:1996:MSE.pdf
%F Benzmuller:1996:MSE


%0 Conference Proceedings
%A Benzmüller, Chris 
%A Fiedler, Armin 
%A Gabsdil, Malte
%A Horacek, Helmut 
%A Kruijff-Korbayova, Ivana 
%A Tsovaltzi, Dimitra 
%A Quoc Vo, Bao 
%A Wolska, Magdalena
%D 2003
%T Language Phenomena in Tutorial Dialogs on Mathematical Proofs
%E Kruijff-Korbayova, Ivana 
%E Kosny, Claudia
%B Proceedings of the 7th workshop on the semantics and pragmatics of dialogue DiaBruck
%P 165-166
%8 September 4-6
%! Language Phenomena in Tutorial Dialogs on Mathematical Proofs
%F Benzmuller:2003:LPT


%0 Journal Article
%A Benzmüller, Ralf
%A Grice, Martine
%D 1997
%T Trainingsmaterialien zur Etikettierung deutscher Intonation mit GToBI
%B PHONUS
%C Universität des Saarlandes, Phonetik, Saarbrücken
%V 3
%P 9-34
%! Trainingsmaterialien zur Etikettierung deutscher Intonation mit GToBI
%2 Benzmuller:1997:TED.pdf
%F Benzmuller:1997:TED
%X In this paper we provide an overview of GToBI, a consensus transcription system for German intonation. Basic pitch accents and edge tones along with tonal modifications such as upstep and downstep are introduced with the help of schematic diagrams, lists of important criteria and speech files containing canonical examples. The system also provides for the labelling of a limited number of juncture phenomena.
%U http://www.coli.uni-sb.de/Phonetics/Research/PHONUS_research_reports/Phonus3/BenzmuellerGrice_PHONUS3.ps.gz


%0 Conference Proceedings
%A Benzmüller, Ralf
%A Grice, Martine
%D 1998
%T The Nuclear Accentual Fall in the Intonation of Standard German
%E (ZAS), Zentrum für allgemeine Sprachwissenschaft
%B Papers on the Conference "The Word as a Phonetic Unit"
%C Berlin, Germany
%P 79-89
%! The Nuclear Accentual Fall in the Intonation of Standard German
%F Benzmuller:1998:NAF


%0 Conference Proceedings
%A Berglund, Charlotta
%A Gambäck, Björn
%D 1995
%T On Testing Domain Adaptability
%E Koskenniemi, K.
%B 10th Nordic Conference of Computational Linguistics, May 30-31
%C Helsinki, Finland
%I University of Helsinki
%P 90-94
%! On Testing Domain Adaptability
%2 Berglund:1995:TDA.pdf Berglund:1995:TDA.ps
%F Berglund:1995:TDA
%U www.sics.se/humle/papers/nodalida95_eval.ps


%0 Journal Article
%A Bertsch, Eberhard
%A Nederhof, Mark-Jan
%D 1999
%T On Failure of the Pruning Technique in "Error Repair in Shift-Reduce Parsers"
%B ACM Transactions on Programming Languages and Systems (TOPLAS)
%V 21
%N 1
%P 1-10
%! On Failure of the Pruning Technique in "Error Repair in Shift-Reduce Parsers"
%2 Bertsch:1999:FPT.pdf Bertsch:1999:FPT.ps
%3 j
%F Bertsch:1999:FPT
%X A previous article presented a technique to compute the least-cost error repair by incrementally generating congurations that result from inserting and deleting tokens in a syntactically incorrect input. An additional mechanism to improve the run-time efficiency of this algorithm by pruning some of the congurations was discussed as well. In this communication we show that the pruning mechanism may lead to suboptimal repairs or may block all repairs. Certain grammatical errors in a common construct of the Java programming language also lead to the above kind of failure.
%U http://www.dfki.de/dfkibib/publications/docs/nederhof99d.ps.gz


%0 Journal Article
%A Bertsch, Eberhard
%A Nederhof, Mark-Jan
%D 1999
%T Regular Closure of Deterministic Languages
%B SIAM Journal on Computing
%V 29
%N 1
%P 81-102
%! Regular Closure of Deterministic Languages
%2 Bertsch:1999:RCD.pdf Bertsch:1999:RCD.ps
%3 j
%F Bertsch:1999:RCD
%X We recall the notion of regular closure of classes of languages. We present two important results. The first result is that all languages which are in the regular closure of the class of deterministic (context-free) languages can be recognized in linear time. This is a nontrivial result, since this closure contains many inherently ambiguous languages. The second result is that the class of deterministic languages is contained in the closure of the class of deterministic languages with the prefix property or, stated in an equivalent way, all LR(k) languages are in the regular closure of the class of LR(0) languages.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof99c.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof99c.ps.gz


%0 Journal Article
%A Bertsch, Eberhard
%A Nederhof, Mark-Jan
%D 2001
%T Size/ Lookahead Tradeoff for LL(k)-Grammars
%B Information Processing Letters
%V 80
%P 125-129
%! Size/ Lookahead Tradeoff for LL(k)-Grammars
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof01d.entry
%2 Bertsch:2001:SLT.pdf Bertsch:2001:SLT.ps
%3 j
%F Bertsch:2001:SLT
%X For a family of languages a precise tradeoff relationship between the size of LL(k) grammars and the length k of lookahead is demonstrated.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof01d.ps.gz


%0 Conference Proceedings
%A Bertsch, Eberhard
%A Nederhof, Mark-Jan
%D 2001
%T On the Complexity of some Extensions of RCG Parsing
%B Proceedings of the 7th International Workshop on Parsing Technologies (IWPT'01), October 17-19
%C Beijing, China
%P 66-77
%! On the Complexity of some Extensions of RCG Parsing
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof01c.entry
%2 Bertsch:2001:CSE.pdf Bertsch:2001:CSE.ps
%3 j
%F Bertsch:2001:CSE
%X We consider the parsing problem for range concatenation grammars (RCGs). Two new applications of RCG parsing are studied. The first is the parsing of finite automata, the second is string-to-string transduction, with an extension of RCGs. We show that these problems are undecidable in general, but become tractable for subclasses of the formalism.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof01c.ps.gz


%0 Edited Book
%A Bes, Gabriel
%D 1991
%T The Construction of a Natural Language and Graphics Interface. Results and Perspectives from the ACORD Project
%B Research Reports ESPRIT
%C Berlin
%I Springer
%! The Construction of a Natural Language and Graphics Interface. Results and Perspectives from the ACORD Project
%F Bes:1991:CNL


%0 Report
%A Blackburn, Patrick
%D 1998
%T Internalizing Labeled Deduction
%C Saarbrücken
%I Universität des Saarlandes
%P 39
%S CLAUS-Report
%7 102
%8 November
%! Internalizing Labeled Deduction
%2 Blackburn:1998:ILD.pdf Blackburn:1998:ILD.ps Blackburn:1998:ILD.dvi
%F Blackburn:1998:ILD
%X This paper shows how to internalize the Kripke satisfaction definition using labeled modal languages and explores the proof theoretic consequences of this. As we shall see, using labeled modal languages enables us to transfer classic Gabbay-style labeled deduction from the metalanguage to the object language, and to handle the required labeling discipline purely logically. Moreover, internalized labeled deduction links neatly with the Gabbay-style rules now widely used in modal Hilbert-systems, completeness results for a wide range of first-order definable frame classes can be obtained automatically, and the method extends straightforwardly to richer languages. The paper discusses related work by Jerry Seligman and Miroslava Tzakova and concludes with some reflections on the status of labeling in modal logic.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus102.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus102.dvi


%0 Report
%A Blackburn, Patrick
%A Bos, Johan
%D 1997
%T Representation and Inference for Natural language. A First Course in Computational Semantics
%C Saarbrücken
%I Universität des Saarlandes
%P 50
%S CLAUS Report
%7 90
%8 August
%! Representation and Inference for Natural language. A First Course in Computational Semantics
%2 Blackburn:1997:RIN.pdf Blackburn:1997:RIN.ps
%F Blackburn:1997:RIN
%X These are the course notes for Representation and Inference for Natural Language: A First Course in Computational Semantics, which will be given in the second week of ESSLLI97, Aix-en-Provence, by Patrick Blackburn and Johan Bos. The course is an introduction to computational semantics in Prolog. It introduces some fundamental techniques for computing semantic representations for natural language, and working with the result. Both the underlying theory, and their implementation in Prolog, are discussed. We believe that the reader who masters these techniques will be in a good position to appreciate (and critically assess) ongoing developments in computational semantics.
%U http://www.iccs.informatics.ed.ac.uk/~jbos/comsem/download/volume1.ps.gz


%0 Report
%A Blackburn, Patrick
%A Bos, Johan
%A Kohlhase, Michael
%A de Nivelle, Hans
%D 1998
%T Inference and Computational Semantics
%C Saarbrücken
%I Universität des Saarlandes
%P 15
%S CLAUS-Report
%7 106
%8 November
%! Inference and Computational Semantics
%2 Blackburn:1998:ICS.pdf Blackburn:1998:ICS.ps Blackburn:1998:ICS.dvi
%F Blackburn:1998:ICS
%X This paper discusses inference in computational semantics. We argue that state-of-the-art methods in first-order {\it theorem proving\/} and {\it model building\/} are of direct relevance to inference for natural language processing. We support our claim by discussing our implementation of van der Sandt's presupposition projection algorithm in Discourse Representation Theory, an algorithm which demands sustained use of powerful inference mechanisms.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus106.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus106.dvi


%0 Book Section
%A Blackburn, Patrick
%A Bos, Johan
%A Kohlhase, Michael
%A de Nivelle, Hans
%D 2001
%T Inference and Computational Semantics
%E Bunt, Harry
%E Muskens, Reinhard
%E Thijsse, Elias
%B Computing Meaning
%C Dordrecht
%I Kluwer Academic Publishers
%V 2
%P 11-28
%S Studies in Linguistics and Philosophie
%7 77
%! Inference and Computational Semantics
%F Blackburn:2001:ICS


%0 Report
%A Blackburn, Patrick
%A de Rijke, Maarten
%D 1994
%T Zooming In, Zooming Out
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 48
%8 November
%! Zooming In, Zooming Out
%2 Blackburn:1994:ZZ.pdf Blackburn:1994:ZZ.ps Blackburn:1994:ZZ.dvi
%F Blackburn:1994:ZZ
%X This is an exploratory paper about combining logics, combining theories and combining structures. Typically when one applies logic to such areas as computer science, artificial intelligence or linguistics, one encounters hybrid ontologies. The aim of this paper is to identify plausible strategies for coping with ontological richness.
%U ftp://ftp.coli.uni-sb.de/pub/claus/claus48.dvi ftp://ftp.coli.uni-sb.de/pub/claus/claus48.ps


%0 Report
%A Blackburn, Patrick
%A de Rijke, Maarten
%D 1995
%T Why Combine Logics?
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 57
%8 April
%! Why Combine Logics?
%2 Blackburn:1995:WCL.pdf Blackburn:1995:WCL.ps
%F Blackburn:1995:WCL
%X Combining logics has become a rapidly expanding enterprise that is inspired mainly by concerns about modularity and the wish to join together tailored made logical tools into more powerful but still manageable ones. 
A natural question is whether it offers anything new over and above existing standard languages. By analysing a number of applications where combined logics arise, we argue that combined logics are a potentially valuable tool in applied logic, and that endorsements of standard languages often miss the point. 
Using the history of quantified modal logic as our main example, we also show that the use of combined structures and logics is a recurring theme in the analysis of existing logical systems.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus57.ps


%0 Journal Article
%A Blackburn, Patrick
%A de Rijke, Maarten
%D 1996
%T Combining Logics. Special Issue
%B Notre Dame Journal of Formal Logic
%V 37
%! Combining Logics. Special Issue
%F Blackburn:1996:CLS


%0 Journal Article
%A Blackburn, Patrick
%A de Rijke, Maarten
%D 1997
%T Why Combine Logics?
%B Studia Logica. An International Journal for Symbolic Logic
%V 59
%N 1
%P 5-27
%! Why Combine Logics?
%F Blackburn:1997:WCL
%O but published later


%0 Journal Article
%A Blackburn, Patrick
%A de Rijke, Maarten
%D 1997
%T Zooming In, Zooming Out
%B Journal of Logic, Language and Information
%V 6
%P 5-31
%! Zooming In, Zooming Out
%F Blackburn:1997:ZZ


%0 Report
%A Blackburn, Patrick
%A de Rijke, Maarten
%A Vennema, Ide
%D 1994
%T The Algebra of Modal Logic
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 47
%8 November
%! The Algebra of Modal Logic
%2 Blackburn:1994:AML.ps Blackburn:1994:AML.dvi
%F Blackburn:1994:AML
%X Our main aim is to review the frame semantics and axiomatics of modal logic from the perspective of the duality between (Kripke) frames and boolean algebras with operators as defined by Jónsson and Tarski. 

To this end, we introduce modal languages and their interpretation in models and frames in Part II. We define and discuss the notion of a modal formula characterizing a class of frames or models, and give the Sahlqvist algorithm which yields, given a suitable modal formula as input, the corresponding first-order condition on the class of frames characterized by the formula. We define the concept of a normal modal logic and explain the canonical frame method for proving completeness of a logic with respect to classes of frames. 

In Part III we develop the algebraic perspective on modal logic. We introduce boolean algebras with operators and show how they arise naturally in both the semantic and the axiomatic approach towards algebraizing modal logic. We discuss in detail how the category of boolean algebras with operators and homomorphisms links up with the category of frames with so-called bounded morphisms. Finally, we apply this duality to give easy proofs for some important and well-known results from modal logic.
%U ftp://ftp.coli.uni-sb.de/pub/claus/claus47.dvi


%0 Report
%A Blackburn, Patrick
%A de Rijke, Maarten
%A Vennema, Ide
%D 1995
%T Relational Methods in Logic, Language and Information
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 65
%8 September
%! Relational Methods in Logic, Language and Information
%2 Blackburn:1995:RML.pdf Blackburn:1995:RML.ps
%F Blackburn:1995:RML
%X This paper discusses the use of relational methods in the interdisciplinary field of Logic, Language and Information. We first sketch the developments that lead to the current focus on dynamics in the area. After that we give examples of logics of transitions that naturally arise in this setting, and we identify more general themes such as bisimulations, relativisations and dynamic modes of inference. We conclude with a discussion of newly emerging themes, and the limitations of the relational perspective.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus65.ps


%0 Book Section
%A Blackburn, Patrick
%A de Rijke, Maarten
%A Vennema, Ide
%D 1997
%T Relational Methods in Logic, Language and Information
%E Brink, C.
%E Kahl, W.
%E Schmidt, G.
%B Relational Methods in Computer Science
%C Berlin
%I Springer
%P 211-225
%S Advances in Computing Sciences
%! Relational Methods in Logic, Language and Information
%F Blackburn:1997:RML


%0 Conference Proceedings
%A Blackburn, Patrick
%A Gardent, Claire
%D 1995
%T A Specification Language for Lexical Functional Grammars
%B 7th Conference of the European Chapter of the Association for Computational Linguistics (EACL '91)
%C Dublin
%P 39-44
%! A Specification Language for Lexical Functional Grammars
%F Blackburn:1995:SLLa


%0 Report
%A Blackburn, Patrick
%A Gardent, Claire
%D 1995
%T A Specification Language for Lexical Functional Grammars
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 51
%8 February
%! A Specification Language for Lexical Functional Grammars
%2 Blackburn:1995:SLLb.pdf Blackburn:1995:SLLb.ps Blackburn:1995:SLLb.dvi
%F Blackburn:1995:SLLb
%X This paper defines a language L for specifying LFG grammars. This enables constraints on LFG's composite ontology (c-structures synchronised with f-structures) to be stated directly; no appeal to the LFG construction algorithm is needed. We use L to specify schemata annotated rules and the LFG uniqueness, completeness and coherence principles. Broader issues raised by this work are noted and discussed.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus51.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus51.dvi


%0 Conference Proceedings
%A Blackburn, Patrick
%A Gardent, Claire
%D 1998
%T A Description Language for Discourse Semantics
%B Logical Aspects of Computational Linguistics (LACL '98), December 14-16
%C Grenoble, France
%! A Description Language for Discourse Semantics
%F Blackburn:1998:DLD


%0 Report
%A Blackburn, Patrick
%A Jaspars, Jan
%A de Rijke, Maarten
%D 1996
%T Reasoning about Changing Information
%C Saarbrücken
%I Universität des Saarlandes
%P 25
%S CLAUS-Report
%7 81
%8 September
%! Reasoning about Changing Information
%2 Blackburn:1996:RAC.pdf Blackburn:1996:RAC.ps
%F Blackburn:1996:RAC
%X The purpose of these notes is two-fold: (i) to give a reasonably self-contained introduction to a particular approach to theory change, known as the Alchourron-Gardenfors-Makinson (AGM) approach, and to discuss some of the alternatives and extensions that have been proposed to it over the past few years; (ii) to relate the AGM approach to other 'information-oriented' branches of logic, including intuitionistic logic, non-monotonic reasoning, verisimilitude, and modal and dynamic logic.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus81.ps


%0 Report
%A Blackburn, Patrick
%A Meyer Viol, Wilfried
%A de Rijke, Maarten
%D 1995
%T A Proof System for Finite Trees
%C Saarbrücken
%I Universität des Saarlandes
%P 19
%S CLAUS-Report
%7 67
%8 October
%! A Proof System for Finite Trees
%2 Blackburn:1995:PSFb.pdf Blackburn:1995:PSFb.ps
%F Blackburn:1995:PSFb
%X In this paper we introduce a description language for finite trees. Although we briefly note some of its intended applications, the main goal of the paper is to provide it with a sound and complete proof system. We do so using standard axioms from modal provability logic and modal logics of programs, and prove completeness by extending techniques due to Van Benthem and Meyer-Viol and Blackburn and Meyer-Viol. We conclude with a proof of the EXPTIME-completeness of the satisfiability problem, and a discussion of issues related to complexity and theorem proving.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus67.ps


%0 Conference Proceedings
%A Blackburn, Patrick
%A Meyer-Viol, Wilfried
%A de Rijke, Maarten
%D 1995
%T A Proof System for Finite Trees
%E Kleine Büning, H.
%B Computer Science Logic. 9th International Workshop (CSL '95)
%C Berlin
%I Springer
%P 86-105
%S Lecture Notes in Computer Science
%7 1092
%! A Proof System for Finite Trees
%F Blackburn:1995:PSFa


%0 Report
%A Blackburn, Patrick
%A Seligman, Jerry
%D 1995
%T Hybrid Languages
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 66
%8 October
%! Hybrid Languages
%2 Blackburn:1995:HLA.pdf Blackburn:1995:HLA.ps
%F Blackburn:1995:HLa
%X Hybrid languages have both modal and first-order characteristics: a Kripke semantics, and explicit variable binding apparatus. This paper motivates the development of hybrid languages, sketches their history, and examines the expressive power of three hybrid binders. We show that all three binders give rise to languages strictly weaker than the corresponding first-order language, that full first-order expressivity can be gained by adding the universal modality, and that all three binders can force the existence of infinite models and have undecidable satisfiability problems.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus66.ps


%0 Journal Article
%A Blackburn, Patrick
%A Seligman, Jerry
%D 1995
%T Hybrid Languages
%B Journal of Logic, Language and Information
%V 4
%P 251-272
%! Hybrid Languages
%F Blackburn:1995:HLb


%0 Report
%A Blackburn, Patrick
%A Seligman, Jerry
%D 1996
%T What are Hybrid Languages?
%C Saarbrücken
%I Universität des Saarlandes
%P 19
%S CLAUS-Report
%7 83
%8 November
%! What are Hybrid Languages?
%2 Blackburn:1996:WHL.pdf
%F Blackburn:1996:WHL
%X Hybrid languages exhibit two kinds of hybridisation. First, they combine the distinguishing features of modal logic and classical logic: although they have a Kripke semantics, they also make use of explicit variables and quantifiers that bind them. Second, they don't draw a syntactic distinction between terms and formulas: terms are part of the formula algebra, thus enabling the free combination of two different types of information. 
The goals of this paper are to introduce a number of hybrid languages, to discuss some of their fundamental logical properties (expressivity, decidability, and undecidability), and then, brie to indicate why such systems deserve further attention. 
Although hybrid languages have a long and varied history, it is quite likely that most readers will know little, if anything, about them. This dictates the structure of this paper: before we can explain why we're interested in hybrid languages, we're going to have to explain what they are and give some insight into their capabilities, for only then will a discussion of broader motivational issues make much sense.
%U http://turing.wins.uva.nl/~carlos/hybrid/Papers/what.pdf


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


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


%0 Report
%A Blackburn, Patrick
%A Tzakova, Miroslava
%D 1998
%T Hybridizing Concept Languages
%C Saarbrücken
%I Universität des Saarlandes
%P 26
%S CLAUS-Report
%7 97
%8 October
%! Hybridizing Concept Languages
%2 Blackburn:1998:HCL.pdf Blackburn:1998:HCL.ps Blackburn:1998:HCL.dvi
%F Blackburn:1998:HCL
%X This paper shows how to increase the expressivity of concept languages using a strategy called hybridization. Building on the well-known correspondences between modal and description logics, two hybrid languages are defined. These languages are called 'hybrid' because, as well as the familiar propositional variables and modal operators, they also contain variables across individuals and a binder that binds these variables. As is shown, combining aspects of modal and first-order logic in this manner allows the expressivity of concept languages to be boosted in a natural way, making it possible to define number restrictions, collections of individuals, irreflexivity of roles, and TBox- and ABox-statements. Subsequent addition of the universal modality allows the notion of subsumption to internalized, and enables the representation of queries to arbitrary first-order knowledge bases. The paper notes themes shared by the hybrid and concept language literatures, and draws attention to a little-known body of work by the late Arthur Prior.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus97.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus97.dvi


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


%0 Conference Proceedings
%A Bodirsky, Manuel
%A Erk, Katrin
%A Koller, Alexander
%A Niehren, Joachim
%D 2001
%T Beta Reduction Constraints
%E Middeldorp, Aart
%B 12th International Conference on Rewriting Techniques and Applications (RTA'01), May 22-24
%C Utrecht, The Netherlands
%I Springer-Verlag
%P 31-46
%S Lecture Notes in Computer Science
%! Beta Reduction Constraints
%2 Bodirski:2001:BRC.pdf Bodirsky:2001:BRC.ps
%F Bodirsky:2001:BRC
%X The constraint language for lambda structures (CLLS) can model lambda terms that are known only partially.
In this paper, we introduce beta reduction constraints to describe beta reduction steps between partially known lambda terms. We show that beta reduction constraints can be expressed in an extension of CLLS by group parallelism. We then extend a known semi-decision procedure for CLLS to also deal with group parallelism and thus with beta-reduction constraints.
%U http://www.coli.uni-sb.de/~koller/papers/beta.ps.gz


%0 Conference Proceedings
%A Bodirsky, Manuel
%A Erk, Katrin
%A Koller, Alexander
%A Niehren, Joachim
%D 2001
%T Underspecified Beta Reduction
%B Proceedings of the 39th Annual Meeting of the Association of Computational Linguistics (ACL'01), July 6-11
%C Toulouse, France
%P 74-81
%! Underspecified Beta Reduction
%2 Bodirski:2001:UBR.pdf Bodirsky:2001:UBR.ps
%F Bodirsky:2001:UBR
%X For ambiguous sentences, traditional semantics construction produces large numbers of higher-order formulas, which must then be beta-reduced individually. Underspecified versions can produce compact descriptions of all readings, but it is not known how to perform beta reduction on these descriptions. We show how to do this using beta reduction constraints in the constraint language for $\lambda$-structures (CLLS).
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/usp-beta.ps.gz http://www.coli.uni-sb.de/~koller/papers/usp-beta.ps.gz


%0 Conference Proceedings
%A Bos, Johan
%D 1994
%T Focusing Particles and Ellipsis Resolution
%E Bosch, P.
%B Focus and Natural Language Processing: Linguistic, Cognitive, and Computational Perspectives
%C Schloss Wolfsbrunnen, Germany
%I Cambridge University Press
%! Focusing Particles and Ellipsis Resolution
%F Bos:1994:FPE


%0 Conference Proceedings
%A Bos, Johan
%D 1994
%T Presupposition and VP-Ellipsis
%E ACL
%B 15th International Conference on Computational Linguistics (COLING'94), August 5-9
%C Kyoto, Japan
%V 2
%P 1184-1190
%! Presupposition and VP-Ellipsis
%F Bos:1994:PVEa


%0 Report
%A Bos, Johan
%D 1994
%T Presupposition and VP-Ellipsis
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 37
%8 April
%! Presupposition and VP-Ellipsis
%2 Bos:1994:PVEb.pdf Bos:1994:PVEb.ps
%F Bos:1994:PVEb
%X We discuss a treatment of VP-ellipsis resolution in DRT in general, and particularly cases where the source clause of the elliptical VP contains presupposition triggers. We propose to restrain VP-ellipsis resolution by presupposition neutralization. We view presupposition as a kind of anaphora, with the ability to accommodate an antecedent if not provided by discourse.
%U ftp://ftp.coli.uni-sb.de/pub/claus/claus37.ps


%0 Conference Proceedings
%A Bos, Johan
%D 2001
%T DORIS 2001: Underspecification, Resolution and Inference for Discourse Representation Structures
%E Blackburn, Patrick
%E Kohlhase, Michael
%B Proceedings of the Workshop on Inference in Compuational Semantics (ICoS-3), June 18-19
%C Siena, Italy
%! DORIS 2001: Underspecification, Resolution and Inference for Discourse Representation Structures
%2 Bos:2001:DUR.pdf
%F Bos:2001:DUR
%U http://www.coli.uni-sb.de/~bos/doris2001.pdf


%0 Conference Proceedings
%A Bos, Johan
%A Buitelaar, Paul
%A Mineur, Anne-Marie
%D 1995
%T Bridging as Coercive Accomodation
%E Manandhar, S.
%B Computational Logic for Natural Language Processing (CLNLP '95) - Workshop Proceedings, April 3-5
%C South Queensferry, Scotland
%! Bridging as Coercive Accomodation
%2 Bos:1995:BCAa.pdf Bos:1995:BCAa.ps
%3 j
%F Bos:1995:BCAa
%O A shorter version also appeared in the Lecture Notes of a workshop on "The Computational Lexicon", at the 6th ESSLLI, Barcelona 1995
%U http://www.elsnet.org/publications/clnlp95/Bos-Mineur.ps.gz


%0 Conference Proceedings
%A Bos, Johan
%A Buitelaar, Paul
%A Mineur, Anne-Marie
%D 1995
%T Bridging as Coercive Accomodation
%B 6th European Summer School in Logic, Language, and Information (ESSLLI'95). Workshop on "The Computational Lexicon", August 13-25
%C Barcelona, Spain
%! Bridging as Coercive Accomodation
%3 j
%F Bos:1995:BCAb


%0 Conference Proceedings
%A Bos, Johan
%A Buschbeck-Wolf, Bianka
%A Dorna, Michael
%A Rupp, C. J.
%D 1998
%T Managing Information at Linguistic Interfaces
%E ACL
%B Proceedings of the 17th International Conference on Computational Linguistics (COLING'98), August 10-14
%C Montréal, Québec, Canada
%! Managing Information at Linguistic Interfaces
%F Bos:1998:MIL


%0 Conference Proceedings
%A Bos, Johan
%A Gabsdil, Malte
%D 2000
%T First-Order Inference and the Semantics of Questions and Answers
%E Poesio, M.
%E Traum, D.
%B Götalog 2000: 4th Workshop on the Semantics and Pragmatics of Dialogue, June 15-17
%C Göteborg, Sweden
%I Gothenburg Papers in Computational Linguistics 00-5
%P 43-50
%! First-Order Inference and the Semantics of Questions and Answers
%2 Bos:2000:FOI.pdf Bos:2000:FOI.ps
%F Bos:2000:FOI
%U http://www.coli.uni-sb.de/~gabsdil/papers/goetalog00.ps.gz


%0 Conference Proceedings
%A Bos, Johan
%A Gambäck, Björn
%A Lieske, Christian
%A Mori, Yoshiki
%A Pinkal, Manfred
%A Worm, Karsten
%D 1996
%T Compositional Semantics in Verbmobil
%E ACL
%B 16th International Conference on Computational Linguistics (COLING '96), August 5-9
%C Copenhagen, Denmark
%V 1
%P 131-136
%! Compositional Semantics in Verbmobil
%2 Bos:1996:CSV.pdf
%F Bos:1996:CSV
%U http://lanl.arxiv.org/PS_cache/cmp-lg/pdf/9607/9607031.pdf


%0 Book Section
%A Bos, Johan 
%A Heine, Julia
%D 2000
%T Discourse and Dialog Semantics for Translation
%E Wahlster, Wolfgang
%B Verbmobil: Foundations of Speech-to-Speech Translation
%C Berlin - Heidelberg - New York
%I Springer
%P 337-348
%! Discourse and Dialog Semantics for Translation
%F Bos:2000:DDS


%0 Edited Proceedings
%A Bos, Johan
%A Kohlhase, Michael
%D 2000
%T Proceedings of the Workshop on Inference in Computational Semantics (ICoS-2), International Conference and Research Center for Computer Science, July 29-30
%C Schloss Dagstuhl
%P 149
%! Proceedings of the Workshop on Inference in Computational Semantics (ICoS-2), International Conference and Research Center for Computer Science, July 29-30
%2 Bos:2000:PWI.ps
%F Bos:2000:PWI
%U http://www.coli.uni-sb.de/~bos/icos/icos2.ps.gz


%0 Conference Proceedings
%A Bos, Johan
%A Mastenbroek, Elsbeth
%A McGlashan, Scott
%A Millies, Sebastian
%A Pinkal, Manfred
%D 1994
%T A Compositional DRS-Based Formalism for NLP-Applications
%B 1st International Workshop on Computational Semantics
%C Tilburg, The Netherlands
%P 21-31
%! A Compositional DRS-Based Formalism for NLP-Applications
%2 Bos:1994:CDB.pdf
%F Bos:1994:CDB


%0 Report
%A Bos, Johan
%A Mastenbroek, Elsbeth
%A McGlashan, Scott
%A Millies, Sebastian
%A Pinkal, Manfred
%D 1994
%T Verbmobil Semantikkonstruktion
%C Saarbrücken
%I Universität des Saarlandes
%S Verbmobil-Report
%7 6
%! Verbmobil Semantikkonstruktion
%2 Bos:1994:VS.pdf
%F Bos:1994:VS


%0 Report
%A Bos, Johan
%A Mineur, Anne-Marie
%A Buitelaar, Paul
%D 1995
%T Bridging as Coercive Accomodation
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 52
%8 March
%! Bridging as Coercive Accomodation
%2 Bos:1995:BCAc.pdf Bos:1995:BCAc.ps
%3 j
%F Bos:1995:BCAc
%X This paper combines insights from Pustejovsky's GL theory with Van der Sandt's anaphora resolution algorithm. The phenomenon of bridging is accounted for in terms of linking anaphoric expressions to information that can be inferred from the lexical semantic knowledge that is stored in lexical entries. In doing so, we can distinguish between the normal linking cases as in (1), the special cases of coercive accommodation as in (2) and the bottom cases of accommodation as in (3). 

(1) When I call a barkeeper, the barkeeper never comes.
(2) When I go to a bar, the barkeeper always throws me out.
(3) When I came in, the barkeeper said hello.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus52.ps


%0 Conference Proceedings
%A Branco, António
%A Crysmann, Berthold
%D 1999
%T Negative Concord and Linear Constraints on Quantification
%E d'Hulst, Y.
%E Rooryck, J.
%E Schroten, J.
%B Romance Languages and Linguistic Theory 1999.Selected papers from 'Going Romance' 1999, December 9-11
%C Leiden
%I John Benjamins Publishing
%! Negative Concord and Linear Constraints on Quantification
%3 j
%F Branco:1999:NCL
%U http://www.coli.uni-sb.de/~crysmann/papers/NC.html


%0 Conference Proceedings
%A Brants, Sabine
%A Dipper, Stefanie
%A Hansen, Silvia
%A Lezius, Wolfgang
%A Smith, George
%D 2002
%T The TIGER Treebank
%B Proceedings of the Workshop on Treebanks and Linguistic Theories, September 20-21
%C Sozopol, Bulgaria
%! The TIGER Treebank
%2 Brants:2002:TT.pdf
%F Brants:2002:TT
%X This paper reports on the TIGER Treebank, a corpus of currently 35.000 syntactically annotated German newspaper sentences. We describe what kind of information is encoded in the treebank and introduce the different representation formats that are used for the annotation and exploitation of the treebank. We explain the different methods used for the annotation: interactive annotation, using the tool (\em Annotate), and LFG parsing. Furthermore, we give an account of the annotation scheme used for the TIGER treebank. This scheme is an extended and improved version of the NEGRA annotation scheme and we illustrate in detail the linguistic extensions that were made concerning the annotation in the TIGER project. The main differences are concerned with coordination, verb-subcategorization, expletives as well as proper nouns. In addition, the paper also presents the query tool TIGERSearch that was developed in the project to exploit the treebank in an adequate way. We describe the query language which was designed to facilitate a simple formulation of complex queries; furthermore, we shortly introduce TIGERin, a graphical user interface for query input. The paper concludes with a summary and some directions for future work.
%U http://www.coli.uni-sb.de/~sabine/tigertreebank.pdf


%0 Conference Proceedings
%A Brants, Sabine
%A Hansen, Silvia
%D 2002
%T Developments in the TIGER Annotation Scheme and their Realization in the Corpus
%B Proceedings of the 3rd International Conference on Language Resources and Evaluation (LREC-2002), May 29-31
%C Las Palmas de Gran Canaria, Spain
%! Developments in the TIGER Annotation Scheme and their Realization in the Corpus
%2 Brants:2002:DTA.pdf
%F Brants:2002:DTA
%X This paper presents the annotation of the German TIGER Treebank. First, issues concerning the annotation, representation as well as querying of the treebank are discussed. Within this context, the annotation tool ANNOTATE, the export and XML formats of the TIGER Treebank and the TIGER search tool are briefly introduced. Secondly, the developments of the TIGER annotation scheme and their realization in the corpus are introduced focussing on the differences between the underlying NEGRA annotation scheme and the further developed TIGER annotation scheme. The main differences are concerned with verb-subcategorization, coordination, appositions and parentheses as well as proper nouns. Thirdly, the annotation scheme is assessed through an evaluation and a problem discussion of the above mentioned changes. For this purpose, inter- annotator agreement in the TIGER project has been analyzed focussing on exactly these changes. This analysis shows where the annotators' decision problems are. These difficulties are discussed in greater detail on the basis of annotation examples. The paper concludes with some suggestions for the improvement of the TIGER annotation scheme.
%U http://www.coli.uni-sb.de/~sabine/brants-hansen.pdf


%0 Conference Proceedings
%A Brants, Thorsten
%D 1994
%T Parameteroptimierung für ein Statistisches Sprachmodell
%B 1. Fachtagung der Gesellschaft für Kognitionswissenschaft, 13.-15. Oktober
%C Freiburg, Germany
%P 13-17
%! Parameteroptimierung für ein Statistisches Sprachmodell
%F Brants:1994:PSS


%0 Conference Proceedings
%A Brants, Thorsten
%D 1995
%T Tagset Reduction Without Information Loss
%B 33rd Annual Meeting of the Association for Computational Linguistics (ACLANNUAL'95)
%C Cambridge, Massachussetts, USA
%! Tagset Reduction Without Information Loss
%2 Brants:1995:TRI.pdf
%F Brants:1995:TRI


%0 Conference Proceedings
%A Brants, Thorsten
%D 1995
%T Estimating HMM Topologies
%B Tbilisi Symposium on Language, Logic, and Computation, October 19-22
%C Tbilisi, Georgia
%! Estimating HMM Topologies
%F Brants:1995:EHT


%0 Report
%A Brants, Thorsten
%D 1995
%T Some Experiments with the CRATER Corpus
%C Saarbrücken
%I Universität des Saarlandes
%S Technical Report
%! Some Experiments with the CRATER Corpus
%F Brants:1995:SEC


%0 Conference Proceedings
%A Brants, Thorsten
%D 1996
%T Better Language Models with Model Merging
%B Conference on Empirical Methods in Natural Language Processing (EMNLP '96), May 17-18
%C Philadelphia, USA
%! Better Language Models with Model Merging
%2 Brants:1996:BLM.pdf
%F Brants:1996:BLM


%0 Conference Proceedings
%A Brants, Thorsten
%D 1996
%T Estimating Markov Model Structures
%E Bunnell, H. T.
%E Idsardi, W.
%B 4th International Conference on Spoken Language Processing (ICSLP'96), October 3-6
%C Philadelphia, USA
%V 2
%P 893-896
%! Estimating Markov Model Structures
%F Brants:1996:EMM


%0 Report
%A Brants, Thorsten
%D 1996
%T TnT - A Statistical Part-of-Speech Tagger
%C Saarbrücken
%I Universität des Saarlandes
%S Technical Report
%! TnT - A Statistical Part-of-Speech Tagger
%2 Brants:1996:TSP.pdf
%F Brants:1996:TSP


%0 Conference Proceedings
%A Brants, Thorsten
%D 1997
%T Internal and External Tagsets in Part-of-Speech Tagging
%E Kokkinakis, G.
%E Fakotakis, N.
%E Dermatas, E.
%B 5th European Conference on Speech Communication and Technology (EUROSPEECH'97), September 22-25
%C Rhodes, Greece
%V 5
%P 2787-2790
%! Internal and External Tagsets in Part-of-Speech Tagging
%2 Brants:1997:IET.pdf
%F Brants:1997:IET
%X We present an approach to statistical part-of-speech tagging that uses two different tagsets, one for its internal and one for its external representation. The internal tagset is used in the underlying Markov model, while the external tagset constitutes the output of the tagger. The internal tagset can be modified and optimized to increase tagging accuracy (with respect to the external tagset). We evaluate this approach in an experiment and show that it performs significantly better than approaches using only one tagset.
%U http://www.coli.uni-sb.de/~thorsten/eurospeech97/


%0 Report
%A Brants, Thorsten
%D 1998
%T The NeGra Export Format for Annotated Corpora
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 98
%8 April
%! The NeGra Export Format for Annotated Corpora
%2 Brants:1998:NEF.pdf Brants:1998:NEF.ps Brants:1998:NEF.dvi
%F Brants:1998:NEF
%X This paper describes the export format version 3 of corpora used in the NeGra project. We use a line-oriented and ASCII-based format that is both easy to read by humans and easy to parse by machines. It is intended for data exchange and for efficient processing with standard Unix tools and C programs.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus98.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus98.dvi


%0 Book Section
%A Brants, Thorsten
%D 1998
%T Estimating Hidden Markov Model Topologies
%E Ginzburg, J.
%E Khasidashvili, Z.
%E Vogel, C.
%E Lévy, J.-J.
%E Vallduví, E.
%B The Tbilisi Symposium on Logic, Language and Computation: Selected Papers. Studies in Logic, Language and Information
%C Stanford
%I CSLI Publications
%P 163-176
%! Estimating Hidden Markov Model Topologies
%2 Brants:1998:EHM.pdf Brants:1998:EHM.ps
%F Brants:1998:EHM
%U http://www.coli.uni-sb.de/~thorsten/publications/Brants-Tbilisi98.ps.gz


%0 Thesis
%A Brants, Thorsten
%D 1999
%T Tagging and Parsing with Cascaded Markov Models - Automation of Corpus Annotation. Saarbrücken Dissertations in Computational Linguistics and Language Technology, Volume 6.
%C Saarbrücken
%I Universität des Saarlandes
%! Tagging and Parsing with Cascaded Markov Models - Automation of Corpus Annotation. Saarbrücken Dissertations in Computational Linguistics and Language Technology, Volume 6.
%F Brants:1999:TPC
%X This thesis presents new techniques for parsing natural language. They are based on Markov Models, which are commonly used in part-of-speech tagging for sequential processing on the word level. We show that Markov Models can be successfully applied to other levels of syntactic processing. First, two classification tasks are handled: the assignment of grammatical functions and the labeling of non-terminal nodes. Then, Markov Models are used to recognize hierarchical syntactic structures. Each layer of a structure is represented by a separate Markov Model. The output of a lower layer is passed as input to a higher layer, hence the name: Cascaded Markov Models. Instead of simple symbols, the states emit partial context-free structures. The new techniques are applied to corpus annotation and partial parsing and are evaluated using corpora of different languages and domains.
%U http://www.dfki.de/lt/diss/diss_en.htm


%0 Conference Proceedings
%A Brants, Thorsten
%D 1999
%T Cascaded Markov Models
%B 9th Conference of the European Chapter of the Association for Computational Linguistics (EACL '99), June 8-12
%C Bergen
%! Cascaded Markov Models
%2 Brants:1999:CMM.pdf Brants:1999:CMM.ps
%F Brants:1999:CMM
%X This paper presents a new approach to partial parsing of context-free structures. The approach is based on Markov Models. Each layer of the resulting structure is represented by its own Markov Model, and output of a lower layer is passed as input to the next higher layer. An empirical evaluation of the method yields very good results for NP/PP chunking of German newspaper texts.
%U http://www.coli.uni-sb.de/~thorsten/publications/Brants-EACL99.ps.gz


%0 Conference Proceedings
%A Brants, Thorsten
%D 2000
%T Inter-Annotator Agreement for a German Newspaper Corpus
%B 2nd International Conference on Language Resources and Evaluation (LREC-2000), May 31 - June 2
%C Athens, Greece
%! Inter-Annotator Agreement for a German Newspaper Corpus
%2 Brants:2000:IAA.pdf Brants:2000:IAA.ps
%F Brants:2000:IAA
%X This paper presents the results of an investigation on inter-annotator agreement for the NEGRA corpus, consisting of German newspaper texts. The corpus is syntactically annotated with part-of-speech and structural information. Agreement for part-of-speech is 98.6%, the labeled F-score for structures is 92.4%. The two annotations are used to create a common final version by discussing differences and by several iterations of cleaning. Initial and final versions are compared. We identify categories causing large numbers of differences and categories that are handled inconsistently.
%U http://www.coli.uni-sb.de/~thorsten/publications/Brants-LREC00.ps.gz


%0 Conference Proceedings
%A Brants, Thorsten
%D 2000
%T TnT - A Statistical Part-of-Speech Tagger
%B 6th Applied Natural Language Processing (ANLP '00), April 29 - May 4
%C Seattle, USA
%I Association for Computational Lingusitics
%P 224-231
%! TnT - A Statistical Part-of-Speech Tagger
%2 Brants:2000:TSP.pdf Brants:2000:TSP.ps
%F Brants:2000:TSP
%X Trigrams'n'Tags (TnT) is an efficient statistical part-of-speech tagger. Contrary to claims found elsewhere in the literature, we argue that a tagger based on Markov models performs at least as well as other current approaches, including the Maximum Entropy framework. A recent comparison has even shown that TnT performs significantly better for the tested corpora. We describe the basic model of TnT, the techniques used for smoothing and for handling unknown words. Furthermore, we present evaluations on two corpora.
%U http://www.coli.uni-sb.de/~thorsten/publications/Brants-ANLP00.ps.gz


%0 Conference Proceedings
%A Brants, Thorsten
%A Crocker, Matthew
%D 2000
%T Probabilistic Parsing and Psychological Plausibility
%B 18th International Conference on Computational Linguistics (COLING '00), July 31 - August 4
%C Saarbrücken, Luxembourg, Nancy
%I Morgan Kaufmannn Publishers
%V 1
%P 111-117
%! Probabilistic Parsing and Psychological Plausibility
%2 Brants:2000:PPP.pdf Brants:2000:PPP.ps
%F Brants:2000:PPP
%X Given the recent evidence for probabilistic mechanisms in models of human ambiguity resolution, this paper investigates the plausibility of exploiting current wide-coverage, probabilistic parsing techniques to model human linguistic performance. In particular, we investigate the performance of standard stochastic parsers when they are revised to operate incrementally, and with reduced memory resources. We present techniques for ranking and filtering analyses, together with experimental results. Our results confirm that stochastic parsers which adhere to these psychologically motivated constraints achieve good performance. Memory can be reduced down to 1% (compared to exhausitve search) without reducing recall and precision. Additionally, these models exhibit substantially faster performance. Finally, we argue that this general result is likely to hold for more sophisticated, and psycholinguistically plausible, probabilistic parsing models.
%U http://www.coli.uni-sb.de/~thorsten/publications/Brants-Crocker-COLING00.ps.gz


%0 Report
%A Brants, Thorsten
%A Hendriks, Roland
%A Kramp, Sabine
%A Krenn, Brigitte
%A Preis, Cordula
%A Skut, Wojciech
%A Uszkoreit, Hans
%D 1997
%T Das NEGRA-Annotationsschema
%C Saarbrücken
%I Universität des Saarlandes
%S Negra Project Report
%! Das NEGRA-Annotationsschema
%3 j
%F Brants:1997:NA
%X Das vorliegende Annotierschema entstand während des Aufbaus des NEGRA-Korpus. Nach drei Jahren Arbeit (wobei der Aufbau des Korpus nur ein Teilaspekt des Projektes war) liegen 20,000 annotierte Sätze (ca. 350,000 Tokens) sowie diese mehrfach überarbeitete Version des Schemas vor.
%U http://www.coli.uni-sb.de/sfb378/negra-corpus/negra-corpus.html


%0 Conference Proceedings
%A Brants, Thorsten
%A Plaehn, Oliver
%D 2000
%T Interactive Corpus Annotation
%E Gavrilidou, M.
%E Carayannis, G.
%E Markantonatou, S.
%E Piperidis, S.
%E Steinhaouer, G.
%B 2nd International Conference on Language Resources and Evaluation (LREC'00), May 31 - June 2
%C Athens, Greece
%I European Language Resource Association (ELRA)
%! Interactive Corpus Annotation
%2 Brants:2000:ICA.pdf Brants:2000:ICA.ps
%F Brants:2000:ICA
%X We present an easy-to-use graphical tool for syntactic corpus annotation. This tool, Annotate, interacts with a part-of-speech tagger and a parser running in the background. The parser incrementally suggests single phrases bottom-up based on cascaded Markov models. A human annotator confirms or rejects the parser's suggestions. This semi-automatic process facilitates a very rapid and efficient annotation.
%U http://www.coli.uni-sb.de/~plaehn/papers/lrec2000.ps.gz http://www.coli.uni-sb.de/~plaehn/papers/lrec2000.pdf


%0 Conference Proceedings
%A Brants, Thorsten
%A Samuelsson, Christer
%D 1995
%T Tagging the Teleman Corpus
%B 10th Nordic Conference of Computational Linguistics, May 30-31
%C Helsinki, Finland
%! Tagging the Teleman Corpus
%2 Brants:1995:TTCa.pdf
%F Brants:1995:TTCa


%0 Report
%A Brants, Thorsten
%A Samuelsson, Christer
%D 1995
%T Tagging the Teleman Corpus
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 54
%8 April
%! Tagging the Teleman Corpus
%2 Brants:1995:TTCb.pdf Brants:1995:TTCb.ps
%F Brants:1995:TTCb
%X Experiments were carried out comparing the Swedish Teleman and the English Susanne corpora using an HMM-based and a novel reductionistic statistical part-of-speech tagger. They indicate that tagging the Teleman corpus is the more difficult task, and that the performance of the two different taggers is comparable.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus54.ps


%0 Conference Proceedings
%A Brants, Thorsten
%A Skut, Wojciech
%D 1998
%T Automation of Treebank Annotation
%B 3rd International Conference on New Methods in Language Processing (NeMLaP'98), January 11-24
%C Sydney, Australia
%! Automation of Treebank Annotation
%2 Brants:1998:ATA.pdf
%F Brants:1998:ATA
%X This paper describes applications of stochastic and symbolic NLP methods to treebank annotation. In particular we focus on (1) the automation of treebank annotation, (2) the comparison of conflicting annotations for the same sentence and (3) the automatic detection of inconsistencies. These techniques are currently employed for building a German treebank.
%U http://www.coli.uni-sb.de/~thorsten/nemlap98/


%0 Conference Proceedings
%A Brants, Thorsten
%A Skut, Wojciech
%A Krenn, Brigitte
%D 1997
%T Tagging Grammatical Functions
%B Conference on Empirical Methods in Natural Language Processing (EMNLP '97)
%C Providence, Rhode Island, USA
%! Tagging Grammatical Functions
%2 Brants:1997:TGF.pdf
%F Brants:1997:TGF
%X This paper addresses issues in automated treebank construction. We show how standard part-of-speech tagging techniques extend to the more general problem of structural annotation, especially for determining grammatical functions and syntactic categories. Annotation is viewed as an interactive process where manual and automatic processing alternate. Efficiency and accuracy results are presented. We also discuss further automation steps.
%U http://www.coli.uni-sb.de/~thorsten/emnlp97/


%0 Conference Proceedings
%A Brants, Thorsten
%A Skut, Wojciech
%A Uszkoreit, Hans
%D 1999
%T Syntactic Annotation of a German Newspaper Corpus
%E Abeillé, Anne
%B ATALA sur le Corpus Annotés pour la Syntaxe Treebanks, June 18-19
%C Paris, France
%P 69-76
%! Syntactic Annotation of a German Newspaper Corpus
%2 Brants:1999:SAG.pdf
%3 j
%F Brants:1999:SAG
%X We report on the syntactic annotation of a German newspaper corpus. The annotations consists of context-free structures, additionally allowing crossing branches, with labeled nodes (phrases) and edges (grammatical functions). Furthermore, we present a new, interactive semi-automatic annotation process that allows efficient and reliable annotations.
%U http://www.coli.uni-sb.de/~thorsten/publications/Brants-ea-ATALA99.pdf


%0 Conference Proceedings
%A Braun, Bettina
%A Koreman, Jacques
%A Trouvain, Jürgen
%D 2000
%T The Effect of Accentuation on Vowel Recognition
%B Prosody 2000 Workshop: Speech Recognition and Synthesis, October 2-5
%C Kraków, Poland
%! The Effect of Accentuation on Vowel Recognition
%2 Braun:2000:EAV.pdf Braun:2000:EAV.ps
%F Braun:2000:EAV
%U http://www.coli.uni-sb.de/~trouvain/braun_et_al_00.ps.gz


%0 Conference Proceedings
%A Brawer, Sascha
%D 1994
%T Mechanismen einer kontextfreien Grammatik für des Deutsche
%E Sehn, A.
%E Autexier, S.
%B Studentenprogramm der 18. Deutschen Jahrestagung für Künstliche Intelligenz (KI-94), September 21-23
%C Saarbrücken, Germany
%S DFKI-Document
%7 D-94-12
%! Mechanismen einer kontextfreien Grammatik für des Deutsche
%F Brawer:1994:MKG


%0 Conference Proceedings
%A Brawer, Sascha
%D 1995
%T Treating German with a Provable Context-Free Grammar.
Coping with Subcategorization, Unbound Dependencies and Partial Free-Word Order
%E Brawer, S.
%B 5. Tagung der Computerlingustik Studenten (TaCoS), 24.-28. Mai
%C Saarbrücken, Germany
%P 5-16
%! Treating German with a Provable Context-Free Grammar.
Coping with Subcategorization, Unbound Dependencies and Partial Free-Word Order
%F Brawer:1995:TGP


%0 Conference Proceedings
%A Bredenkamp, Andrew
%A Crysmann, Berthold
%A Petrea, Mirela
%D 2000
%T Building Multilingual Controlled Language Performance Checkers
%B Proceedings of the 3rd International Workshop on Controlled Language Applications (CLAW 2000), April 29-30
%C Seattle, Washington, USA
%P 83-89
%! Building Multilingual Controlled Language Performance Checkers
%3 j
%F Bredenkamp:2000:BMC


%0 Conference Proceedings
%A Bredenkamp, Andrew
%A Crysmann, Berthold
%A Petrea, Mirela
%D 2000
%T Looking for Errors: A Declarative Formalism for Resource-Adaptive Language Checking
%B Proceedings of the 2nd International Conference on Language Resources and Evaluation (LREC-2000), May 31 - June 2
%C Athens, Greece
%P 667-673
%! Looking for Errors: A Declarative Formalism for Resource-Adaptive Language Checking
%2 Bredenkamp:2000:LED.pdf
%3 j
%F Bredenkamp:2000:LED
%X The paper describes a phenomenonbased approach to grammar checking, which draws on the integration of different shallow NLP technologies, including morphological and POS taggers, as well as probabilistic and rulebased partial parsers. We present a declarative specification formalism for grammar checking and controlled language applications which greatly facilitates the development of checking components.
%U http://flag.dfki.de/pdf/LREC.pdf


%0 Conference Proceedings
%A Bredenkamp, Andrew
%A Declerck, Thierry
%A Fouvry, Frederik
%A Music, Bradley
%D 1996
%T Efficient Integrated Tagging of Word Constructs
%E Linguistics, Association for Computational
%B Proceedings of the 16th International Conference on Computational Linguistics (COLING'96), August 5-9
%C Copenhagen, Denmark
%I Morgan Kaufmann Publishers
%P 1028-1031
%! Efficient Integrated Tagging of Word Constructs
%2 Bredenkamp:1996:EIT.pdf Bredenkamp:1996:EIT.ps
%3 j
%F Bredenkamp:1996:EIT
%X We describe a robust texthandling component, which can deal with free text in a wide range of formats and can successfully identify a wide range of phenomena, including chemical formulae, dates, numbers and proper nouns. The set of regular expressions used to capture numbers in written form ("sechsundzwanzig") in German is given as an example. Proper noun "candidates" are identified by means of regular expressions, these being then rejected or accepted on the basis of runtime interaction with the user. This tagging component is integrated in a largescale grammar development environment, and provides direct input to the grammatical analysis component of the system by means of "lift" rules which convert tagged text into partial linguistic structures.


%0 Conference Proceedings
%A Bredenkamp, Andrew
%A Declerck, Thierry
%A Fouvry, Frederik
%A Music, Bradley
%A Theofilidis, Axel
%D 1997
%T Linguistic Engineering Using ALEP
%B Proceedings of Recent Advantages in Natural Language Processing (RANLP '97), September 11-13
%C Sofia, Bulgaria
%! Linguistic Engineering Using ALEP
%2 Bredenkamp:1997:LEU.pdf Bredenkamp:1997:LEU.ps
%3 j
%F Bredenkamp:1997:LEU
%X This paper focuses on the experiences of the LS-GRAM project and some post LS-GRAM activities with the ALEP platform. We see ALEP as an open and generic environment, providing a usable, programmable framework for the integration of various language engineering (LE) components into a powerful NLP environment. Well-defined interfaces ensure the flow of information between distinct phases of language processing.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/declerck97_ranlp.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/declerck97_ranlp.ps.gz


%0 Conference Proceedings
%A Bredenkamp, Andrew
%A Klein, Judith
%A Crysmann, Berthold
%D 1999
%T Annotation of Error Types for a German News Corpus
%B ATALA sur les Corpus Annotés pour la Syntaxe Treebanks, June 18-19
%C Paris, France
%! Annotation of Error Types for a German News Corpus
%2 Bredenkamp:1999:AET.pdf
%3 j
%F Bredenkamp:1999:AET
%X This paper will discuss the corpus annotation effort in the FLAG project and its application for assisting in the development of controlled language and grammar checking applications.
The main aim of theGerman government funded FLAGproject1 is to develop technologies for controlled language (CL) and grammar checking applications for German. The project work has therefore been divided into two separate but complementary streams of activity. Firstly, the aim was to develop an modular NLP software architecture for quickly developing different kinds of CL and grammar checking applications. Secondly, to validate the first activity, it was seen as important to build up an empirical base for testing and formally evaluating checking components. Given the lack of existing annotated corpora of errors for German (or indeed for any language as far as the authors know), the construction of such a corpus was a high priority task. This would enable us not only to perform quantitative tests, but also to derive an empirically based typology of errors which the project could use for orientation.
The corpus was particularly important given the approach which the FLAG project was taking to the task of grammar and controlled language checking, which relies on a phenomenonoriented approach to the problem of identifying errors, using shallow processing techniques. In order to finetune the heuristics which are central to such an approach, i.e. one based on identifying “candidate errors” of increasing probability, it is essential to have good test suites annotated with respect to the phenomena under investigation.
The annotation of the corpus was to be carried out in such a way that we could easily access and quantify snapshots of the data, for producing test suites for testing purposes and for producing statistics on the frequency of particular error types.
The research community not only lacked an annotated corpus of errors, there was no existing ontology of errors which could be easily translated into an annotation schema. The definition of such a schema based on traditional descriptions of errors (such as Luik, 1993a; Luik, 1993b) thus formed the first major workpackage. Fortunately, tools for the annotation of corpora, and the management thereof are becoming increasingly sophisticated; it was therefore necessary to evaluate a number of tools in the light of our specific needs.
%U http://flag.dfki.de/pdf/ErrAnnot.pdf


%0 Conference Proceedings
%A Bretan, Ivan
%A Engstedt, Maans
%A Gambäck, Björn
%D 1996
%T A Multimodal Environment for Telecommunication Specifications
%E Nicolov, N.
%E Mitkov, R.
%B Recent Advances in Natural Language Processing (RANLP '96). Current Issues in Linguistic Theory
%C Amsterdam
%I John Benjamins
%! A Multimodal Environment for Telecommunication Specifications
%2 Bretan:1996:MET.pdf Bretan:1996:MET.ps
%F Bretan:1996:MET
%U http://www.sics.se/~gamback/publications/ranlpbook.ps


%0 Conference Proceedings
%A Brinckmann, Caren
%A Benzmüller, Ralf
%D 1999
%T The Relationship Between Utterance Type and F0 Contour in German
%B Proceedings 6th European Conference on Speech Communication and Technology
  (EUROSPEECH '99)
%C Budapest, Hungary
%I ESCA
%V 1
%P 21-24
%8 September
%! The Relationship Between Utterance Type and F0 Contour in German
%2 Brinckmann:1999:RBU.pdf Brinckmann:1999:RBU.ps
%F Brinckmann:1999:RBU
%X In this study we investigate the intonational characteristics of the four
  utterance types statement, wh-question, yes/no-question and declarative
  question. Readings of two German scripted dialogues were examined to
  ascertain characteristic features of the F0 contour for each utterance type.
  Final boundary tone, nuclear pitch accent, F0 offset, F0 onset, F0 range, and
  the slopes of a topline and a bottomline were determined for each utterance
  and compared for the four utterance types. Results show that for an average
  speaker, the final boundary tone, the F0 range, and the slope of the topline
  can be used to distinguish between the four utterance types. However,
  speakers may deviate from this pattern and exploit other intonational means
  to distinguish certain utterance types or choose not to mark a syntactic
  difference at all.
%U http://www.coli.uni-sb.de/~cabr/Eurospeech99/



%0 Conference Proceedings
%A Brinckmann, Caren
%A Trouvain, Jürgen
%D 2001
%T On the Role of Duration Prediction and Symbolic Representation for the
  Evaluation of Synthetic Speech
%B Proceedings 4th ISCA Tutorial and Research Workshop on Speech Synthesis
%C Pitlochry, Scotland
%P 35--40
%! On the Role of Duration Prediction and Symbolic Representation for the
  Evaluation of Synthetic Speech
%2 Brinckmann:2001:RDP.pdf
  Brinckmann:2001:RDP.ps
%F Brinckmann:2001:RDP
%X In order to determine priorities for the improvement of timing in synthetic
  speech this study looks at the role of segmental duration prediction and the
  role of phonological symbolic representation in listeners' preferences. In
  perception experiments using German speech synthesis, two standard duration
  models (Klatt rules and CART) were tested. The input to these models
  consisted of symbolic strings which were either derived from a database or a
  text-to-speech system. Results of the perception experiments show that
  different duration models can only be distinguished when the symbolic string
  is appropriate. Considering the relative importance of the symbolic
  representation, ``post-lexical'' segmental rules were investigated with the
  outcome that listeners differ in their preferences regarding the degree of
  segmental reduction. As a conclusion, before fine-tuning the duration
  prediction, it is important to calculate an appropriate phonological symbolic
  representation in order to improve timing in synthetic speech.
%U http://www.coli.uni-sb.de/~cabr/ssw4


%0 Book Section
%A Bruder, Ilvio
%A Düsterhöft, Antje
%A Becker, Markus
%A Bedersdorfer, Jochen
%A Neumann, Günter
%D 2001
%T GETESS: Constructing a Linguistic Search Index for an Internet Search Engine
%E Bouzeghoub, Mokrane
%E Kedad, Zoubida
%E Métais, Elisabeth
%B Natural Language Processing and Information Systems
%C Berlin
%I Springer
%P 227-238
%Y LNCS
%! GETESS: Constructing a Linguistic Search Index for an Internet Search Engine
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nldb.entry
%2 Bruder:2001:GCL.pdf Bruder:2001:GCL.ps
%3 j
%F Bruder:2001:GCL
%X In this paper we illustrate how Internet documents can be automatically analyzed in order to capture the content of a document in a more detailed way than usually. The result of the document analysis is called abstract and will be used as a linguistic search index for the Internet search engine GETESS. We show how the linguistic analysis system SMES can be used for a Harvest based search engine for constructing a linguistic search index. Further, we denote how the linguistic index can be exploited for answering user search inqueries.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nldb.ps.gz


%0 Master's Thesis
%A Brunklaus, Thorsten
%D 2000
%T Der Oz Inspector - Browsen: Interaktiver, einfacher, effizienter
%C Saarbrücken
%I Universität des Saarlandes, Fachbereich 14 Informatik
%! Der Oz Inspector - Browsen: Interaktiver, einfacher, effizienter
%2 Brunklaus:2000:OIB.pdf Brunklaus:2000:OIB.ps
%F Brunklaus:2000:OIB
%X Diese Arbeit beschreibt Konzept, Entwurf und Implementierung des Inspectors. Der Inspector ist ein interaktives, grafisches Werkzeug zur Darstellung von Oz-Datenstrukturen. Oz-Datenstrukturen sind komplex und deren Darstellung erfordert ein grafisches Werkzeug. Aus Sicht des Benutzers muss ein solches vor allem sehr effizient, flexibel und interaktiv sein. In dieser Arbeit wird ein System vorgestellt, dass diese Anforderungen durch einen zweistufigen Ansatz erfüllt. Dieser besteht darin, neben effizienten Basisdiensten einen flexiblen Transformationsmechanismus einzusetzen. Die vorgestellte Implementierung ist hochmodular und sehr kompakt. Deren Effizienz wird schließlich durch Vergleich mit einemähnlichen System demonstriert.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/OzInspector.ps.gz


%0 Conference Proceedings
%A Buitelaar, Paul
%D 1998
%T The Acquisition of Defaults in Lexical Semantic Representations
%B Workshop on Lexical Semantic Systems (WLSS '98), April 6-7
%C Pisa, Italy
%! The Acquisition of Defaults in Lexical Semantic Representations
%2 Buitelaar:1998:ADL.pdf Buitelaar:1998:ADL.ps
%3 j
%F Buitelaar:1998:ADL
%X The paper defends the notion that semantic tagging should be viewed as more than disambiguation between senses. Instead, semantic tagging should be a first step in the interpretation process by assigning each lexical item a representation of all of its systematically related senses, from which further semantic processing steps can derive discourse dependent interpretations. This leads to a new type of semantic lexicon (CoreLex ) that supports underspecified semantic tagging through a design based on systematic polysemous classes and a class-based acquisition of lexical knowledge for specific domains.
%U http://dfki.de/~paulb/wlss98.ps.gz


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


%0 Conference Proceedings
%A Buitelaar, Paul
%D 1998
%T CoreLex: An Ontology of Systematic Polysemous Classes
%E Guarino, Nicola
%B Proceedings of the 1st International Conference on Formal Ontology in Information Systems (FOIS'98), June 6-8
%C Trento, Italy
%I IOS Press
%V 46
%P 221-235
%Y Breuker, J.
%E Lopez de Mantaras, R.
%E Ohsuga, S.
%E Swartout, W.
%S Frontiers in Artificial Intelligence and Applications
%! CoreLex: An Ontology of Systematic Polysemous Classes
%2 Buitelaar:1998:COS.pdf Buitelaar:1998:COS.ps
%3 j
%F Buitelaar:1998:COS
%X This paper is concerned with a unified approach to the systematic polysemy and underspecification of nouns. Systematic polysemy -- senses that are systematically related and therefore predictable over classes of lexical items -- is fundamentally different from homonymy -- senses that are unrelated, non-systematic and therefore not predictable. At the same time, studies in discourse analysis show that lexical items are often left underspecified for a number of related senses. Clearly, there is a correspondence between these phenomena, the investigation of which is the topic of this paper. Acknowledging the systematic nature of polysemy and its relation to underspecified representations, allows one to structure ontologies for lexical semantic processing more efficiently, generating more appropriate interpretations within context. In order to achieve this, one needs a thorough analysis of systematic polysemy and underspecification on a large and useful scale. The paper establishes an ontology and semantic database (CoreLex) of 126 semantic types, covering around 40,000 nouns and defining a large number of systematic polysemous classes that are derived by a careful analysis of sense distributions in WordNet. The semantic types are underspecified representations based on generative lexicon theory.
%U http://dfki.de/~paulb/fois98.ps.gz


%0 Conference Proceedings
%A Buitelaar, Paul
%D 1999
%T Ambiguity in Semantic Annotation Submitted
%B Standardizing Lexical Resources Workshop (SIGLEX '99), June 21-22
%C University of Maryland College Park, USA
%! Ambiguity in Semantic Annotation Submitted
%3 j
%F Buitelaar:1999:ASA


%0 Conference Proceedings
%A Buitelaar, Paul
%D 2000
%T Reducing Lexical Semantic Complexity with Systematic Polysemous Classes and Underspecification
%E Bagga, Amit
%E Pustejovsky, James
%E Zadrozny, Wlodek
%B Workshop on Syntactic and Semantic Complexity in Natural Language Processing Systems (ANLP-NAACL'00), April 29 - May 3
%C Seattle, Washington, USA
%! Reducing Lexical Semantic Complexity with Systematic Polysemous Classes and Underspecification
%2 Buitelaar:2000:RLS.pdf Buitelaar:2000:RLS.ps
%3 j
%F Buitelaar:2000:RLS
%X This paper presents an algorithm for finding systematic polysemous classes in WordNet and similar semantic databases, based on a definition in (Apresjan 1973). The introduction of systematic polysemous classes can reduce the amount of lexical semantic processing, because the number of disambiguation decisions can be restricted more clearly to those cases that involve real ambiguity (homonymy). In many applications, for instance in document categorization, information retrieval, and information extraction, it may be sufficient to know if a given word belongs to a certain class (underspecified sense) rather than to know which of its (related) senses exactly to pick. The approach for finding systematic polysemous classes is based on that of (Buitelaar 1998a, Buitelaar 1998b), while addressing some previous shortcomings.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/anlp00.ps. http://dfki.de/~paulb/anlp00.ps


%0 Conference Proceedings
%A Buitelaar, Paul
%D 2001
%T The SENSEVAL-II Panel on Domains, Topics and Senses
%B Proceedings of the 2nd International Workshop on Evaluating Word Sense Disambiguation Systems (SENSEVAL-II)
%C Toulouse
%! The SENSEVAL-II Panel on Domains, Topics and Senses
%2 Buitelaar:2001:SIP.pdf Buitelaar:2001:SIP.ps
%3 j
%F Buitelaar:2001:SIP
%X An important aspect of sense disambiguation is the wider semantic space (domain, topic) in which the ambiguous word occurs. This may be most clearly illustrated by some cross-lingual examples, as they would appear in (machine) translation. Consider for instance the English word housing. In a more general 'sense', this translates in German into "Wohnung". In an engineering setting however it translates into "Gehaeuse". Also verbs may be translated differently (i.e. have a different sense) according to the semantic space in which they occur. For instance, English "warming" up translates into "erhitzen" in a more general sense, but into "aufwaermen" in the sports domain. Because of the apparent relevance then of domains or topics on sense disambiguation, a panel was organized at SENSEVAL-2 to discuss some current and previous work in this area. The paper presents a more extended overview based on the relevant literature, besides giving a summary of the discussion that developed after the panel presentations.
%U http://dfki.de/~paulb/senseval2.ps


%0 Conference Proceedings
%A Buitelaar, Paul
%D 2002
%T Lexical Semantics in the Age of the Semantic Web – Invited Talk
%E Erjavec, Tomaz
%E Gros, Jerneja
%B Proceedings of the Conference of the Slovenian Society for Language Technologies, 14 - 15th October 2002
%C Ljubljana, Slovenia
%P 6 - 10
%! Lexical Semantics in the Age of the Semantic Web – Invited Talk
%2 Buitelaar:2002:LSA.pdf
%3 j
%F Buitelaar:2002:LSA
%X Lexical semantics is the study of word meaning. The semantic web is a vision of what the web could be if it would foremost consist of knowledge (structured data) rather than text or other unstructured data as it is today. This paper is about the future of word meaning if the semantic web becomes a reality. First, I will therefore briefly clarify what the semantic web vision consists of, followed by a sketch of lexical semantics. Finally, I will speculate on how the inherent semantic standardization process of the semantic web could have a dramatic influence on the study and use of word meaning.
%U http://dfki.de/~paulb/sdjt02.ps


%0 Conference Proceedings
%A Buitelaar, Paul
%A Alexandersson, Jan
%A Jaeger, Tilman
%A Lesch, Stephan
%A Pfleger, Norbert 
%A Raileanu, Diana
%A von den Berg, Tanja
%A Klöckner, Kerstin 
%A Neis, Holger 
%A Schlarb, Hubert
%D 2001
%T An Unsupervised Semantic Tagger Applied to German
%B Proceedings of the 3rd Conference on Recent Advances in Natural Language Processing (RANLP'01), September 5-7
%C Tzigov Chark, Bulgaria
%! An Unsupervised Semantic Tagger Applied to German
%2 Buitelaar:2001:UST.pdf Buitelaar:2001:UST.ps
%3 j
%F Buitelaar:2001:UST
%X We describe an unsupervised semantic tagger, applied to German, but which could be used with any language for which a corresponding "XNet" (WordNet, GermaNet, e tc.), POS tagger and morphological analyzer are available. Disambiguation is per formed by comparing co-occurrence weights on pairs of semantic classes (synsets from GermaNet). Precision is around 67% at a recall of around 65% (for all ambig uous words -- 81% for all words at a recall of 80%). Our results show the influe nce of context size and of semantic class frequency in the training corpus.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ranlp01.ps ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ranlp01.pdf http://dfki.de/~paulb/ranlp01.pdf


%0 Edited Proceedings
%A Buitelaar, Paul
%A Hasida, Koiti
%D 2000
%T Proceedings of the COLING '00 Workshop on Semantic Annotation and Intelligent Content, August 5-6
%C Luxembourg, Centre Universitaire
%! Proceedings of the COLING '00 Workshop on Semantic Annotation and Intelligent Content, August 5-6
%2 Buitelaar:2000:PCW.pdf
%3 j
%F Buitelaar:2000:PCW
%X SEMANTIC ANNOTATION is augmentation of data to facilitate automatic recognition of the underlying semantic structure. A common practice in this respect is labeling of documents with thesaurus classes for the sake of document classification and management. In the medical domain, for instance, there is a long-standing tradition in terminology maintenance and annotation/classification of documents using standard coding systems such as ICD, MeSH and the UMLS meta-thesaurus. Semantic annotation in a broader sense also addresses document structure (title, section, paragraph, etc.), linguistic structure (dependency, coordination, thematic role, co-reference, etc.), and so forth. In NLP, semantic annotation has been used in connection with machine-learning software trainable on annotated corpora for parsing, word-sense disambiguation, co-reference resolution, summarization, information extraction, and other tasks. A still unexplored but important potential of semantic annotation is that it can provide a common I/O format through which to integrate various component technologies in NLP and AI such as speech recognition, parsing, generation, inference, and so on.
INTELLIGENT CONTENT is semantically structured data that is used for a wide range of content-oriented applications such as classification, retrieval, extraction, translation, presentation, and question-answering, as the organization of such data provides machines with accurate semantic input to those technologies. Semantically annotated resources as described above are typical examples of intelligent content, whereas another major class includes electronic dictionaries and inter-lingual or knowledge-representation data. Some ongoing projects along these lines are GDA (Global Document Annotation), UNL (Universal Networking Language) and SHOE (Simple HTML Ontology Extension), all of which aim at motivating people to semantically organize electronic documents in machine-understandable formats, and at developing and spreading content-oriented application technologies aware of such formats. Along similar lines, MPEG-7 is a framework for semantically annotating audiovisual data for the sake of content-based retrieval and browsing, among others. Incorporation of linguistic annotation into MPEG-7 is in the agenda, because linguistic descriptions already constitute a main part of existing metadata. In short, semantic annotation is a central, basic technology for intelligent content, which in turn is a key notion in systematically coordinating various applications of semantic annotation. In the hope of fueling some of the developments mentioned above and thus promoting the linkage between basic researches and practical applications, the workshop invites researchers and practitioners from such fields as computational linguistics, document processing, terminology, information science, and multimedia content, among others, to discuss various aspects of semantic annotation and intelligent content in an interdisciplinary way.
%U http://dfki.de/~paulb/coling2000.proceedings.pdf


%0 Conference Proceedings
%A Buitelaar, Paul
%A Mineur, Anne-Marie
%D 1994
%T Coercion and Compositionality in Categorial Grammar
%E Dekker, P.
%E Stokhof, M.
%B 9th Amsterdam Colloquium
%C Amsterdam
%I Institute for Logic, Language and Computation
%P 175-188
%! Coercion and Compositionality in Categorial Grammar
%2 Buitelaar:1994:CCC.pdf Buitelaar:1994:CCC.ps
%3 j
%F Buitelaar:1994:CCC
%U Full text in postscript gzipped http://dfki.de/~paulb/ac93.ps.gz


%0 Conference Proceedings
%A Buitelaar, Paul
%A Netter, Klaus
%A Xu, Feiyu
%D 1998
%T Integrating Different Strategies in Cross-Language Information Retrieval in the MIETTA Project
%E Hiemstra, Djoerd
%E de Jong, Franciska
%E Netter, Klaus
%B Proceedings of the 14th Twente Workshop on Language Technology (TWLT 14). Language Technology in Multimedia Information Retrieval, December 7-8
%C Enschede, The Netherlands
%P 9-17
%! Integrating Different Strategies in Cross-Language Information Retrieval in the MIETTA Project
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kn-twlt14-98.entry http://dfki.de/~paulb/anlp00.html ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kn-twlt14-98.ps
%2 Buitelaar:1998:IDS.pdf
%3 j
%F Buitelaar:1998:IDS
%X In this paper we describe an integrated approach to cross-language retrieval within the MIETTA project, whose objective is to build a special purpose search engine in the tourism domain that covers information from a number of geographical regions. MIETTA is designed to enable users to search and retrievegeographical regions. 
MIETTA is designed to enable users to search and retrieve information on the regions covered in their own language preferably. In order to facilitate the user with such functionality, the system includes document translation, cross-language query translation, multilingual generation from information extraction templates and document classification. In addition, query expansion is offered to identify proper query translation and enable template matching for information extraction purposes.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kn-twlt14-98.pdf


%0 Conference Proceedings
%A Buitelaar, Paul
%A Sacaleanu, Bogdan
%D 2001
%T Ranking and Selecting Synsets by Domain Relevance
%B Proceedings of the WordNet and Other Lexical Resources: Applications, Extensions and Customizations. NAACL Workshop
%C Pittsburgh
%! Ranking and Selecting Synsets by Domain Relevance
%2 Buitelaar:2001:RSS.pdf
%3 j
%F Buitelaar:2001:RSS
%X The paper presents a novel method for domain specific sense assignment. The method determines the domain specific relevance of GermaNet synsets on the basis of the relevance of their constituent terms that co-occur within representative domain corpora. The approach is task independent and completely automatic. Experiments show results on three selected domains: business, soccer and medical.
%U http://dfki.de/~paulb/lexres.pdf


%0 Conference Proceedings
%A Buitelaar, Paul
%A Sacaleanu, Bogdan
%D 2002
%T Extending Synsets with Medical Terms
%B Proceedings of the 1st International WordNet Conference, January 21-25
%C Mysore, India
%! Extending Synsets with Medical Terms
%2 Buitelaar:2002:ESM.pdf
%3 j
%F Buitelaar:2002:ESM
%X An important problematic issue with general semantic lexicons like WordNet or GermaNet is that they do not cover many terms and concepts specific to certain domains. Therefore, these resources need to be tuned to a specific domain at hand. This involves selecting those senses that are most appropriate for the domain, as well as extending the sense inventory with novel terms and novel senses that are specific to the domain. In this paper we focus on extending GermaNet synsets with domain specific terms, taking into account the domain relevance of senses (i.e. synsets).
%U http://dfki.de/~paulb/gwa.pdf


%0 Report
%A Burheim, Tore
%D 1995
%T A Grammar Formalism and Cross-Serial Dependencies
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 53
%8 March
%! A Grammar Formalism and Cross-Serial Dependencies
%2 Burheim:1995:GFC.pdf Burheim:1995:GFC.ps
%F Burheim:1995:GFC
%X First we define a unification grammar formalism called the Tree HomomorphicFeature Structure Grammar. It is based on Lexical Functional Grammar (LFG), but has a strong restriction on the syntax of the equations. We then show that this grammar formalism defines a full abstract family of languages, and that it is capable of describing crossserial dependencies of the type found in Swiss German.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus53.ps


%0 Report
%A Burheim, Tore
%D 1995
%T Indexed Languages and Unification Grammars
%C Saarbrücken
%I Unversität des Saarlandes
%P 16
%S CLAUS-Report
%7 63
%8 May
%! Indexed Languages and Unification Grammars
%2 Burheim:1995:ILU.pdf Burheim:1995:ILU.ps
%F Burheim:1995:ILU
%X Indexed languages are interesting in computational linguistics because they are the least class of languages in the Chomsky hierarchy that has not been shown not to be adequate to describe the string set of natural language sentences. We here define a class of unification grammars that exactly describe the class of indexed languages.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus63.ps


%0 Book Section
%A Busemann, Stephan
%D 1988
%T Surface Transformations During the Generation of Written German Sentences
%E McDonald, D. D.
%E Bolc, L.
%B Natural Language Generation Systems
%C Berlin
%I Springer Verlag
%P 90-165
%S Symbolic computation
%! Surface Transformations During the Generation of Written German Sentences
%3 j
%F Busemann:1988:STD


%0 Thesis
%A Busemann, Stephan
%D 1990
%T Generierung natürlicher Sprache mit Generalisierten Phrasenstrukturgrammatiken
%C Saarbrücken
%I Universität des Saarlandes, Fachbereich Informatik
%! Generierung natürlicher Sprache mit Generalisierten Phrasenstrukturgrammatiken
%3 j
%F Busemann:1990:GNSa


%0 Thesis
%A Busemann, Stephan
%D 1990
%T Generierung natürlicher Sprache mit Generalisierten Phrasenstrukturgrammatiken
%C Berlin
%I Technische Universität Berlin, Fachbereich Informatik
%S KIT Report
%7 87
%! Generierung natürlicher Sprache mit Generalisierten Phrasenstrukturgrammatiken
%3 j
%F Busemann:1990:GNSb


%0 Report
%A Busemann, Stephan
%D 1990
%T Generalisierte Phrasenstruktur-Grammatiken und ihre Verwendung zur maschinellen Sprachverarbeitung
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-90-17
%! Generalisierte Phrasenstruktur-Grammatiken und ihre Verwendung zur maschinellen Sprachverarbeitung
%2 Busemann:1990:GPG.pdf
%3 j
%F Busemann:1990:GPG
%X Der vorliegende Artikel ist eine geringfügig überarbeitete Version des dritten und des vierten Kapitels der Dissertation des Autors [Busemann 1990]. Die zugrundeliegende Forschung wurde im Rahmen des vom Bundesminister für Forschung und Technologie unter dem Kennzeichen 1013211 geförderten Projekts KIT-FAST an der Technischen Universität Berlin durchgeführt. Die Arbeit wurde am DFKI im Projekt DISCO, das vom BMFT unter dem Kennzeichen ITW 9002 gefördert wird, fertiggestellt.
%U http://www.dfki.de/dfkibib/publications/docs/Busemann_1990_GPGVMS.pdf


%0 Conference Proceedings
%A Busemann, Stephan
%D 1991
%T Structure-Driven Generation From Seperate Semantic Representations
%B Proceedings of the 5th Conference of the European Chapter of the ACL (EACL'91)
%C Berlin, Germany
%P 113-118
%! Structure-Driven Generation From Seperate Semantic Representations
%2 Busemann:1991:SDG.pdf
%3 j
%F Busemann:1991:SDG
%X A new approach to structure-driven generation is presented that is based on a separate semantics as input structure. For the first time, a GPSGbased formalism is complemented with a system of pattern-action rules that relate the parts of a semantics to appropriate syntactic rules. This way a front end generator can be adapted to some application system (such as a machine translation system) more easily than would be possible with many previous generators based on modern grammar formalisms.
%U http://www.dfki.de/dfkibib/publications/docs/Busemann_1991_SDGFSSR.pdf


%0 Report
%A Busemann, Stephan
%D 1991
%T Using Pattern-Action Rules for the Generation of GPSG Structure from Separate Semantic Representations
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-91-16
%! Using Pattern-Action Rules for the Generation of GPSG Structure from Separate Semantic Representations
%2 Busemann:1991:UPAa.pdf
%3 j
%F Busemann:1991:UPAa
%X In many tactical NL generators the semantic input structure is taken for granted. In this paper, a new approach to multilingual, tactical generation is presented that keeps the syntax separate from the semantics. This allows for the system to be directly adapted to application-dependent representations. In the case at hand, the semantics is specifically designed for sentence-semantic transfer in a machine translation system. 
The syntax formalism used is Generalized Phrase Structure Grammar (GPSG). The mapping from semantic onto syntactic structures is performed by a set of pattern-action rules. Each rule matches a piece of the input structure and guides the GPSG structure-building process by telling it which syntax rule(s) to apply. The scope of each pattern-action rule is strictly local, the actions are primitive, and rules can not call each other. These restrictions render the production rule approach both highly modular and transparent.
%U http://www.dfki.de/dfkibib/publications/docs/Busemann_1991_UPARFTGOG_RR.pdf


%0 Conference Proceedings
%A Busemann, Stephan
%D 1991
%T Using Pattern-Action Rules for the Generation of GPSG Structures from MT-Oriented Semantics
%E Mylopoulos, John
%E Reiter, Raymond
%B Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI'91), August 24-30
%C Sydney, Australia
%I Morgan Kaufmann Publishers
%P 1003-1011
%! Using Pattern-Action Rules for the Generation of GPSG Structures from MT-Oriented Semantics
%2 Busemann:1991:UPAb.pdf
%3 j
%F Busemann:1991:UPAb
%X In many tactical NL generators the semantic input structure is taken for granted. In this paper, a new approach to multilingual, tactical generation is presented that keeps the syntax separate from the semantics. This allows for the system to be directly adapted to application-dependent representations. In the case at hand, the semantics is specifically designed for sentence-semantic transfer in a machine translation system. 
The syntax formalism used is Generalized Phrase Structure Grammar (GPSG). The mapping from semantic onto syntactic structures is performed by a set of pattern-action rules. Each rule matches a piece of the input structure and guides the GPSG structure-building process by telling it which syntax rule(s) to apply. The scope of each pattern-action rule is strictly local, the actions are primitive, and rules can not call each other. These restrictions render the production rule approach both highly modular and transparent.
%U http://www.dfki.de/dfkibib/publications/docs/Busemann_1991_UPARFTGOG.pdf


%0 Book
%A Busemann, Stephan
%D 1992
%T Generierung natürlicher Sprache mit generalisierten Phrasenstrukturgrammatiken
%B IFB
%C Berlin
%I Springer Verlag
%V Bd. 313
%! Generierung natürlicher Sprache mit generalisierten Phrasenstrukturgrammatiken
%3 j
%F Busemann:1992:GNSa


%0 Conference Proceedings
%A Busemann, Stephan
%D 1992
%T Lexical Choice and Knowledge Representation
%E Heinsohn, J.
%E Hollunder, B.
%B DFKI Workshop on Taxonomic Reasoning, February 26
%C Saarbrücken, Germany
%P 33-39
%S DFKI Document
%7 D-92-08
%! Lexical Choice and Knowledge Representation
%2 Busemann:1992:LCK.pdf
%3 j
%F Busemann:1992:LCK
%X Recently the problem of choosing communicatively adequate lexemes has attracted much interest in the NL generation community, in general, the task amounts to deciding for a given representation of an intended meaning, which words will most appropriately convey that meaning to the addressee.
Whether lexical choice must be exact in the sense that all and only the intended meaning is verbalized, depends on the respective communication situation. In a multimodal discourse, where language is supplemented by gestures or graphics, the linguistic device need not convey everything to the partner. In written discourse without a predefined context, as in DISCO, exact verbalization seems much more in order.
In all theories of lexical choice, the convergence problem has to be solved: there is always a decision for exactly one lexical item. We may distinguish the following subtasks of lexical choice:
Definite reference, proforms: Events and objects must often be described using words that allow for an unambiguous identification of the referent. The problem subdivides in finding appropriate words for the referents and in describing the relations between them, as deictic and intrinsic readings of "The ball is infront of the car" suggest.
Social jugdement: Some words carry social jugdements with them. German Putzfrau and Raumpflegerin mean both cleaning woman, but only the latter is now used officially.1 The former has a pejorative connotation. See [6].
Collocations: There are different kinds of cooccurrence restrictions between lexemes. Some words cannot be used together with others, some tend to be used together with others and some yield a different meaning when used with certain others (idioms).
Choice of open class words: Given a conceptual representation of the intended meaning, an appropriate word for each concept must be identified.
In this paper, we assume that for lexical selection the following kinds of knowledge are necessary:
• the concepts of the meaning representation language
• lexical entries (lemmata and/or phrasal items including semantic and syntactic in formation, among other things )
• knowledge about the reader (including the reader's goals ans beliefs)
• knowledge about the linguistic, situational, and social context
We will show that lexical choice requires a domain model based on linguistic considerations, and that standard KL-ONE techniques are insufficient for parts of the task at hand.
%U http://www.dfki.de/dfkibib/publications/docs/Busemann_1992_LCAKR.pdf


%0 Book Section
%A Busemann, Stephan
%D 1993
%T A Holistic View of Lexical Choice
%E Horacek, H.
%B New Concepts in Natural Language Generation: Planning, Realization and Systems
%C London
%I Frances Pinter
%P 302-308
%! A Holistic View of Lexical Choice
%2 Busemann:1993:HVL.pdf Busemann:1993:HVL.ps Busemann:1993:HVL.dvi
%3 j
%F Busemann:1993:HVL
%X Recently the problem of choosing communicatively adequate lexemes has attracted much interest in the NL generation community. The problem is so fascinating because it includes a variety of subproblems that relate to all parts of the generation process. Up to now, many of the subproblems have been identified, and solutions have been suggested for each. However, steps towards an integrating approach to lexical choice are still missing. This paper looks at dependencies between some of the subproblems.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/lex-choice.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/lex-choice.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/lex-choice.ps.Z


%0 Conference Proceedings
%A Busemann, Stephan
%D 1993
%T Implicit Relationships between Grammar and Control
%E Herweg, M.
%B 4. Fachtagung der Sektion Computerlinguistik der Deutschen Gesellschaft für Sprachwissenschaft. Deklarative und prozedurale Aspekte der Sprachverarbeitung, November 17-19
%C Hamburg, Germany
%P 12-17
%! Implicit Relationships between Grammar and Control
%3 j
%F Busemann:1993:IRB


%0 Conference Proceedings
%A Busemann, Stephan
%D 1993
%T Towards Configurable Generation Systems. Some Initial Ideas
%E Busemann, S.
%E Harbusch, K.
%B DFKI Workshop on Natural Language Systems: Re-Usability and Modularity, October 23
%C Saarbrücken, Germany
%I DFKI
%P 57-64
%S DFKI Document
%7 D-93-03
%! Towards Configurable Generation Systems. Some Initial Ideas
%2 Busemann:1993:TCG.pdf Busemann:1993:TCG.ps Busemann:1993:TCG.dvi
%3 j
%F Busemann:1993:TCG
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/config.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/config.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/config.ps.Z


%0 Conference Proceedings
%A Busemann, Stephan
%D 1993
%T Towards the Configuration of Generation Systems: Some Initial Ideas
%E Busemann, Stephan
%E Harbusch, Karin
%B DFKI Workshop on Natural Language Systems: Re-Usability and Modularity, October 23
%C Saarbrücken, Germany
%I DFKI
%P 57-64
%S DFKI Document
%7 D-93-03
%! Towards the Configuration of Generation Systems: Some Initial Ideas
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/config.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/config.entry
%2 Busemann:1993:TCGb.pdf
%3 j
%F Busemann:1993:TCGb
%X This paper gives some preliminary ideas about configurable generators. After discussing a generic application situation, the idea of configurable system architectures is presented. We then show how both static and dynamic (run-time) configuration can be achieved in the generator of DFKI's (\sc Cosma) system, which is involved in multi-agent e-mail dialogues about appointment scheduling.
%U http://www.dfki.de/dfkibib/publications/docs/Busemann_1992_DWNLSRM.pdf


%0 Conference Proceedings
%A Busemann, Stephan
%D 1995
%T Towards Classification of Generation Subtasks
%E Hoeppner, W.
%E Horacek, H.
%B Principles of Natural Language Generation. Papers from a Dagstuhl-Seminar
%C Duisburg, Germany
%P 25-32
%S Dagstuhl-Seminar-Report
%7 SI-12
%8 February
%! Towards Classification of Generation Subtasks
%2 Busemann:1995:TCG.pdf
%3 j
%F Busemann:1995:TCG
%U http://www.dfki.de/dfkibib/publications/docs/Busemann_1994_TSOGS.pdf


%0 Report
%A Busemann, Stephan
%D 1996
%T Best-First Surface Realization
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-96-05
%! Best-First Surface Realization
%2 Busemann:1996:BFSa.pdf
%3 j
%F Busemann:1996:BFSa
%X Current work in surface realization concentrates on the use of general, abstract algorithms that interpret large, reversible grammars. Only little attention has been paid so far to the many small and simple applications that require coverage of a small sublanguage at different degrees of sophistication. The system TG/2 described in this paper can be smoothly integrated with deep generation processes, it integrates canned text, templates, and context-free rules into a single formalism, it allows for both textual and tabular output, and it can be parameterized according to linguistic preferences. These features are based on suitably restricted production system techniques and on a generic backtracking regime.
%U http://arxiv.org/PS_cache/cmp-lg/pdf/9605/9605010.pdf


%0 Conference Proceedings
%A Busemann, Stephan
%D 1996
%T Best-First Surface Realization
%E Scott, Donia
%B Proceedings of the 8th International Natural Language Generation Workshop (INLG'96), June
%C Sussex, UK
%P 101-110
%! Best-First Surface Realization
%2 Busemann:1996:BFSb.pdf Busemann:1996:BFSb.ps
%3 j
%F Busemann:1996:BFSb
%X Current work in surface realization concentrates on the use of general, abstract algorithms that interpret large, reversible grammars. Only little attention has been paid so far to the many small and simple applications that require coverage of a small sublanguage at different degrees of sophistication. The system TG/2 described in this paper can be smoothly integrated with deep generation processes, it integrates canned text, templates, and context-free rules into a single formalism, it allows for both textual and tabular output, and it can be parameterized according to linguistic preferences. These features are based on suitably restricted production system techniques and on a generic backtracking regime.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/tg2.ps.Z http://arxiv.org/PS_cache/cmp-lg/pdf/9605/9605010.pdf


%0 Conference Proceedings
%A Busemann, Stephan
%D 1997
%T Putting Semantic-Head-Driven Generation to the Limits: Experiments with Multi-Purpose Semantic Representations
%E Becker, T.
%E Busemann, S.
%E Finkler, W.
%B DFKI Workshop on Natural Language Generation, April 1997
%C Saarbrücken, Germany
%I DFKI
%P 8-14
%S DFKI Document
%7 D-97-06
%! Putting Semantic-Head-Driven Generation to the Limits: Experiments with Multi-Purpose Semantic Representations
%2 Busemann:1997:PSH.pdf Busemann:1997:PSH.ps Busemann:1997:PSH.dvi
%3 j
%F Busemann:1997:PSH
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/busemann97.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/busemann97.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/busemann97.dvi.gz


%0 Conference Proceedings
%A Busemann, Stephan
%D 1998
%T Language Technology for Transnational Web Services
%B Proceedings of Advancing the Information Society - European Telematics Conference '98, February 4-6
%C Barcelona, Spain
%I European Commission DG XIII
%P 101--105
%! Language Technology for Transnational Web Services
%2 Busemann:1998:LTT.pdf Busemann:1998:LTT.ps
%3 j
%F Busemann:1998:LTT
%X The growing flood of information on the internet is mostly encoded in language. The increasing need to augment existing technology for searching, extracting, and summarizing information encoded in multiple languages can be met by employing advanced language technology. This paper concentrates on results achieved within the TEMSIS and ongoing MULINEX projects in meeting these needs, and presents key concepts for the exploitation of the web.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/busemann98.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/busemann98.entry


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


%0 Conference Proceedings
%A Busemann, Stephan
%D 1999
%T Constraint-Based Techniques for Interfacing Software Modules
%E Mellish, Chis
%E Scott, Donia
%B Proceedings of the AISB'99 Workshop on Reference Architectures and Data Standards for NLP, April 6-9
%C Edinburgh, Scotland
%I The Society for the Study of Artificial Intelligence and Simulation of Behaviour
%P 48-54
%! Constraint-Based Techniques for Interfacing Software Modules
%2 Busemann:1999:CBT.pdf Busemann:1999:CBT.ps
%3 j
%F Busemann:1999:CBT
%X The reuse of standardized software is among the primary goals of application builders. The vision of a building block scenario of pieces of software that can be configured to form a new application is becoming real. However, this vision places strong requirements on the interfaces. Practice dictates that it must be easy to combine building blocks. Hence the interfaces should be flexible and, ideally, adaptable to new tasks or domains. This paper presents a simple method to structurally relate interface languages and to check the syntactic correctness of expressions.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/busemann99.ps.gz


%0 Book Section
%A Busemann, Stephan
%D 2000
%T Generierung natürlichsprachlicher Texte
%E Görz, G.
%E Rollinger, C.-R. 
%E Schneeberger, J.
%B Handbuch der Künstlichen Intelligenz
%C Oldenbourg
%I Oldenbourg Wissenschaftsverlag
%P 783-814
%! Generierung natürlichsprachlicher Texte
%3 j
%F Busemann:2000:GNT
%X This short survey of the state of the art in natural language generation (NLG) in particular aims at readers interested in building practical systems. It defines language generation, identifies possible areas of application and describes the tasks a NLG system should fulfil. The interdependencies of the tasks are discussed and architecture models derived. The discussion of in-depth vs. shallow generation is based on the insight that different types of applications require different kinds of generators. A methodology for the design of NLG applications concludes the paper. (Note: The paper is written in German.


%0 Conference Proceedings
%A Busemann, Stephan
%D 2000
%T Interfacing Constraint-Based Grammars and Generation Algorithms
%B Workshop "Analysis for Generation". 1st International Conference on Natural Language Generation, June 12-16
%C Mitzpe Ramon, Israel
%! Interfacing Constraint-Based Grammars and Generation Algorithms
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/busemann00.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/busemann00.dvi.gz.
%2 Busemann:2000:ICB.pdf Busemann:2000:ICB.ps
%3 j
%F Busemann:2000:ICB
%X Constraint-based grammars can, in principle, serve as the major linguistic knowledge source for both parsing and generation. Surface generation starts from input semantics representations that may vary across grammars. For many declarative grammars, the concept of derivation implicitly built in is that of parsing. They may thus not be interpretable by a generation algorithm. We show that linguistically plausible semantic analyses can cause severe problems for semantic-head-driven approaches for generation (SHDG). We use SeReal, a variant of SHDG and the DISCO grammar of German as our source of examples. We propose a new, general approach that explicitly accounts for the interface between the grammar and the generation algorithm by adding a control-oriented layer to the linguistic knowledge base that reorganizes the semantics in a way suitable for generation.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/busemann00.ps.gz. http://arXiv.org/abs/cs.CL/0008003


%0 Conference Proceedings
%A Busemann, Stephan
%D 2001
%T Language Generation for Cross-Lingual Document Summarisation
%E Sheng, Hyanye
%B Proceedings of the International Workshop on Innovative Language Technology and Chinese Information Processing (ILT&CIP '01)
%C Shanghai
%I Science Press
%! Language Generation for Cross-Lingual Document Summarisation
%2 Busemann:2001:LGC.pdf
%3 j
%F Busemann:2001:LGC
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/musi-nlg.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/musi-nlg.pdf


%0 Conference Proceedings
%A Busemann, Stephan
%D 2002
%T Issues in Generating from Interlingua Representations
%E Tovar, Edmundo 
%E Gallardo, Carolina
%B Proceedings of the 1st International Workshop on UNL, other Interlinguas and their Applications
%C Las Palmas
%P 1-7
%! Issues in Generating from Interlingua Representations
%2 Busemann:2002:IGI.pdf
%3 j
%F Busemann:2002:IGI
%X Multi-lingual generation starts from non-linguistic content representations for generating texts in different languages that are equivalent in meaning. In contrast, cross-lingual generation is based on a language-neutral content representation which is the result of a linguistic analysis process. Non-linguistic representations do not reflect the structure of the text. Quite differently, language-neutral representations express functor-argument relationships and other semantic properties found by the underlying analysis process. These differences imply diverse generation tasks. In this contribution, we relate multi-lingual to cross-lingual generation and discuss emergent problems for the definition of an interlingua.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/interlingua.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/interlingua.pdf


%0 Edited Proceedings
%A Busemann, Stephan
%D 2002
%T Proceedings der 6. Konferenz zur Verarbeitung natürlicher Sprache (KONVENS 2002), 30. September - 2. Oktober
%C Saarbrücken, Germany
%I German Research Center for AI (DFKI)
%S DFKI Document
%7 D-02-01
%! Proceedings der 6. Konferenz zur Verarbeitung natürlicher Sprache (KONVENS 2002), 30. September - 2. Oktober
%3 j
%F Busemann:2002:PKV
%X Die "Konferenz zur Verarbeitung natürlicher Sprache" (KONVENS) wird seit 1992 in zweijährigem Turnus von den wissenschaftlichen Fachgesellschaften DEGA, DGfS, GI, GLDV, ITG und ÖGAI ausgerichtet. Die KONVENS stellt einen wichtigen Kristallisationspunkt für die Veröffentlichung wissenschaftlicher Ergebnisse in der Sprachverarbeitung dar. 

Im Jahr 2002 wird die nunmehr sechste KONVENS von der GI, Fachgruppe "Natürlichsprachliche Systeme", in Saarbrücken veranstaltet. Themen der wissenschaftlichen Konferenz sind alle Bereiche der maschinellen Verarbeitung von natürlicher Sprache in gesprochener als auch in geschriebener Form. Die Tagung verfolgt das Ziel, einen breiten Querschnitt durch die aktuelle Forschung und Entwicklung im Gebiet der Sprachverarbeitung zu bieten - unter Einschluss aller relevanten Disziplinen wie Computerlinguistik, Sprachtechnologie, Kognitions-Psychologie, Informatik, Akustik und Nachrichtentechnik. 

Beiträge aus der gesamten Bandbreite zwischen Forschung, Entwicklung, Anwendung und Evaluation von natürlichsprachlichen Ressourcen, Komponenten und Systemen waren in Form unveröffentlichter Forschungs- und Entwicklungsergebnisse oder innovativer industrieller Anwendungen willkommen. 44 Papiere wurden eingereicht und von je zwei Mitgliedern des Programmkomitees begutachtet, die teilweise weitere Gutachter hinzuzogen. In diesem Begutachtungsverfahren wählte das Programmkomitee 22 Beiträge als Vorträge und 11 als Poster zur Präsentation während der Tagung und zur Veröffentlichung aus. 

Zudem konnten zwei hochrangige Wissenschaftler gewonnen werden, ihre aktuellen Arbeiten in Form eingeladener Vorträge vorzustellen. Christiane Fellbaum (Princeton University und Berlin-Brandenburgische Akadamie der Wissenschaften) beschreibt Arbeiten zur Repräsentation idiomatischer Wendungen im Lexikon und lexikalischen Datenbanken (WordNet). Matthew Crocker (Universität des Saarlandes) zieht Verbindungen zwischen Psycholinguistik und statistischer Computerlinguistik. 
Der vorliegende Tagungsband enthält Kurzfassungen der eingeladenen Vorträge sowie die angenommenen Vorträge und Poster. 

Im Namen des Programmkomitees danke ich herzlich allen Autorinnen und Autoren, die durch ihre Einreichung ein interessantes und anspruchsvolles Tagungsprogramm ermöglichten. Besonders möchte ich den beiden eingeladenen Vortragenden, Christiane Fellbaum und Matthew Crocker, für ihre Beiträge danken. Dem Gastgeber der Konferenz, der DFKI GmbH, gebührt Dank für die Bereitstellung der Räumlichkeiten, der Infrastruktur sowie von Arbeitskraft. Bei der Erstellung der Webseite http://konvens2002.dfki.de und des vorliegenden Tagungsbandes haben Carmen Görl und Matthias Rinck wesentlich mitgewirkt. Das Konferenz-Sekretariat wurde von Corinna Johanns geleitet, die nicht nur die finanzielle Seite der Konferenz betreute, sondern sich auch um die lukullischen und touristischen Aspekte kümmerte: der halbtägige Ausflug nach Nennig und zur Villa Borg mit abendlichem Bankett führt uns in beiderlei Hinsicht auf römische Spuren im Saarland. 

Allen Mitwirkenden danke ich sehr herzlich für ihr besonderes Engangement, ohne das diese Tagung nicht möglich gewesen wäre. 

Ausdrücklich möchte ich allen Mitgliedern des Programmkomitees für die effiziente und reibungslose Zusammenarbeit beim Zustandekommen des Tagungsprogramms danken.
%U http://konvens2002.dfki.de/cd/inhalt/index.html


%0 Conference Proceedings
%A Busemann, Stephan
%A Declerck, Thierry
%A Diagne, Abdel Kader
%A Dini, Luca 
%A Klein, Judith
%A Schmeier, Sven
%D 1997
%T Natural Language Dialogue Service for Appointment Scheduling Agents
%E Jacobs, Paul
%B Proceedings of the 5th Conference on Applied Natural Language Processing (ANLP'97), March 31 - April 3
%C Washington D. C., USA
%I Morgan Kaufmann Publishers
%P 25-32
%! Natural Language Dialogue Service for Appointment Scheduling Agents
%2 Busemann:1997:NLDa.pdf Busemann:1997:NLDa.ps
%3 j
%F Busemann:1997:NLDa
%X Appointment scheduling is a problem faced daily by many people and organizations. Cooperating agent systems have been developed to automate this task partially. In order to extend the circle of participants as far as possible we advocate for the use of natural language transmitted by email. We describe Cosma, a fully implemented German language server for existing appointment scheduling agent systems. Cosma can cope with multiple dialogues in parallel, and accounts for differences in dialogue behaviour between human and machine agents. NL coverage of the sublanguage is achieved through both corpus-based grammar development and the use of message extraction techniques.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/anlp97-cosma.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/anlp97-cosma.entry http://arXiv.org/abs/cmp-lg/9702007


%0 Report
%A Busemann, Stephan
%A Declerck, Thierry
%A Diagne, Abdel Kader
%A Dini, Luca
%A Klein, Judith
%A Schmeier, Sven
%D 1997
%T Natural Language Dialogue Service for Appointment Scheduling Agents
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-97-02
%! Natural Language Dialogue Service for Appointment Scheduling Agents
%2 Busemann:1997:NLDb.pdf Busemann:1997:NLDb.ps
%3 j
%F Busemann:1997:NLDb
%X Appointment scheduling is a problem faced daily by many people and organizations. Cooperating agent systems have been developed to automate this task partially. In order to extend the circle of participants as far as possible we advocate for the use of natural language transmitted by email. We describe Cosma, a fully implemented German language server for existing appointment scheduling agent systems. Cosma can cope with multiple dialogues in parallel, and accounts for differences in dialogue behaviour between human and machine agents. NL coverage of the sublanguage is achieved through both corpus-based grammar development and the use of message extraction techniques.
%U ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1997/RR-97-02.ps.gz


%0 Report
%A Busemann, Stephan
%A Declerck, Thierry
%A Diagne, Abdel Kader
%A Hinkelman, Elizabeth
%A Uszkoreit, Hans
%D 1997
%T Cooperative Schedule Management Agent. Abschlussbericht COSMA
%C Saarbrücken
%I DFKI
%S DFKI-Report
%7 R:S97-216
%! Cooperative Schedule Management Agent. Abschlussbericht COSMA
%2 Busemann:1997:CSM.pdf
%3 j
%F Busemann:1997:CSM
%U http://www.dfki.de/dfkibib/publications/docs/cosma-abschluss.pdf


%0 Conference Proceedings
%A Busemann, Stephan
%A Harbusch, Karin
%D 1993
%T Re-Usability and Modularity
%E Busemann, S.
%E Harbusch, K.
%B DFKI Workshop on Natural Language Systems
%C Saarbrücken
%S DFKI Document
%7 D-93-03
%! Re-Usability and Modularity
%3 j
%F Busemann:1993:RUM


%0 Edited Proceedings
%A Busemann, Stephan
%A Harbusch, Karin
%D 1993
%T Re-Usability and Modularity. DFKI Workshop on Natural Language Systems, October 23
%C Saarbrücken
%S DFKI Document
%7 D-93-03
%! Re-Usability and Modularity. DFKI Workshop on Natural Language Systems, October 23
%2 Busemann:1993:RUMb.pdf
%3 j
%F Busemann:1993:RUMb
%X This document contains 10 working papers presented at the workshop held at Saarbrücken, October 23, 1992.
%U http://www.dfki.de/dfkibib/publications/docs/Busemann_1992_DWNLSRM.pdf


%0 Conference Proceedings
%A Busemann, Stephan
%A Harbusch, Karin
%A Wermter, Stefan
%D 1998
%T Hybride konnektionistische, statistische und regelbasierte Ansätze zur Verarbeitung natürlicher Sprache
%E Busemann, Stephan
%E Harbusch, Karin
%E Wermter, Stefan
%B Workshop auf der 21. Deutschen Jahrestagung für Künstliche Intelligenz, Freiburg, 9.-10. September 1997
%C Saarbrücken, Germany
%I DFKI
%S DFKI Document
%7 D-98-03
%! Hybride konnektionistische, statistische und regelbasierte Ansätze zur Verarbeitung natürlicher Sprache
%3 j
%F Busemann:1998:HKS


%0 Edited Proceedings
%A Busemann, Stephan
%A Harbusch, Karin
%A Wermter, Stefan
%D 1998
%T Workshop auf der 21. Deutschen Jahrestagung für Künstliche Intelligenz, Freiburg, 9.-10. September 1997
%C Saarbrücken, Germany
%I DFKI
%S DFKI Document
%7 D-98-03
%! Workshop auf der 21. Deutschen Jahrestagung für Künstliche Intelligenz, Freiburg, 9.-10. September 1997
%2 Busemann:1998:WDJ.pdf Busemann:1998:WDJ.ps
%3 j
%F Busemann:1998:WDJ
%X The present document includes the proceedings of a workshop on hybrid connectionist, statistical, and rule-based approaches to natural language processing. The workshop was held during the 21st Annual Conference for Artificial Intelligence, Freiburg, Germany, 1997. See http://www.dfki.uni-kl.de/dfkidok/publications/D/98/03/abstract.html.
%U ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1998/RR-98-03.ps.gz


%0 Book Section
%A Busemann, Stephan
%A Hauenschild, Christa
%D 1988
%T A Constructive Version of GPSG for Machine Translation
%E Steiner, E.
%E Schmidt, P.
%E Zelinsky-Wibbelt, C.
%B From Syntax to Semantics. Insights from Machine Translation
%I Frances Pinter
%P 216-238
%! A Constructive Version of GPSG for Machine Translation
%3 j
%F Busemann:1988:CVG


%0 Conference Proceedings
%A Busemann, Stephan
%A Hauenschild, Christa
%D 1989
%T From FAS Representations to GPSG Structures
%E Busemann, S.
%E Hauenschild, C.
%E Umbach, C.
%B Views of the Syntax/ Semantics Interface. Proceedings of the Workshop 'GPSG and Semantics', February 22-24
%C Berlin
%I TU Berlin
%P 17-43
%S KIT-Report
%7 74
%! From FAS Representations to GPSG Structures
%3 j
%F Busemann:1989:FRG


%0 Edited Proceedings
%A Busemann, Stephan
%A Hauenschild, Christa
%A Umbach, Carla
%D 1989
%T Views of the Syntax/ Semantics Interface. Proceedings of the Workshop 'GPSG and Semantics', February 22-24
%C Berlin
%I TU Berlin
%S KIT-Report
%7 74
%! Views of the Syntax/ Semantics Interface. Proceedings of the Workshop 'GPSG and Semantics', February 22-24
%3 j
%F Busemann:1989:VSS


%0 Conference Proceedings
%A Busemann, Stephan
%A Horacek, Helmut
%D 1997
%T Generating Air-Quality Reports from Environmental Data
%E Becker, Tilman
%E Busemann, Stephan
%E Finkler, Wolfgang
%B DFKI Workshop on Natural Language Generation
%C Saarbrücken, Germany
%I DFKI
%P 15-21
%S DFKI Document
%7 D-97-06
%! Generating Air-Quality Reports from Environmental Data
%2 Busemann:1997:GAQ.pdf Busemann:1997:GAQ.ps Busemann:1997:GAQ.dvi
%3 j
%F Busemann:1997:GAQ
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/bus-hor97.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/bus-hor97.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/bus-hor97.dvi.gz


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


%0 Report
%A Busemann, Stephan
%A Merget, Iris
%D 1995
%T Eine Untersuchung kommerzieller Terminverwaltungs-Software im Hinblick auf die Kopplung mit natürlichsprachlichen Systemen
%C Saarbrücken
%I DFKI
%S DFKI Document
%7 D-95-11
%! Eine Untersuchung kommerzieller Terminverwaltungs-Software im Hinblick auf die Kopplung mit natürlichsprachlichen Systemen
%2 Busemann:1995:UKT.pdf Busemann:1995:UKT.ps
%3 j
%F Busemann:1995:UKT
%U ftp://ftp.dfki.uni-kl.de/pub/Publications/Documents/1995/D-95-11.ps.gz


%0 Report
%A Busemann, Stephan
%A Novak, Hans-Joachim
%D 1992
%T Generierung natürlicher Sprache
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-92-50
%! Generierung natürlicher Sprache
%2 Busemann:1992:GNSb.pdf
%3 j
%F Busemann:1992:GNSb
%U http://www.dfki.de/dfkibib/publications/docs/Busemann_1992_GNS.pdf


%0 Book Section
%A Busemann, Stephan
%A Novak, Hans-Joachim
%D 1995
%T Generierung natürlicher Sprache
%E Görz, G.
%B Einführung in die Künstliche Intelligenz
%C Bonn
%I Addison-Wesley
%P 492-540
%! Generierung natürlicher Sprache
%2 Busemann:1995:GNS.pdf
%3 j
%F Busemann:1995:GNS
%O 2. Auflage
%U http://www.dfki.de/dfkibib/publications/docs/Busemann_1992_GNS.pdf


%0 Report
%A Busemann, Stephan
%A Oepen, Stefan
%A Hinkelman, Elizabeth
%A Neumann, Günter
%A Uszkoreit, Hans
%D 1994
%T COSMA - Multi-Participant NL Interaction for Appointment Scheduling
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-94-34
%! COSMA - Multi-Participant NL Interaction for Appointment Scheduling
%2 Busemann:1994:CMP.pdf Busemann:1994:CMP.ps Busemann:1994:CMP.dvi
%3 j
%F Busemann:1994:CMP
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-34.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-34.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-34.ps.Z http://www.dfki.uni-kl.de/~dfkidok/publications/RR/94/34/abstract.html


%0 Conference Proceedings
%A Busemann, Stephan
%A Schmeier, Sven
%A Arens, Roman G.
%D 2000
%T Message Classification in the Call Center
%E Nirenburg, Sergei
%E Appelt, Douglas
%E Ciravegna, Fabio
%E Dale, Robert
%B Proceedings of the 6th Applied Natural Language Processing Conference (ANLP'00), April 29 - May 4
%C Seattle, Washington, USA
%I ACL
%P 158-165
%! Message Classification in the Call Center
%2 Busemann:2000:MCC.pdf Busemann:2000:MCC.ps Busemann:2000:MCC.dvi
%3 j
%F Busemann:2000:MCC
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/bus:sch:are:00.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/bus:sch:are:00.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/bus:sch:are:00.dvi.gz.  http://arXiv.org/abs/cs.CL/0003060


%0 Conference Proceedings
%A Butz, Andreas
%D 1994
%T Betty: Planning and Generating Animations for the Visualization of Movements and Spatial Relations
%E Catarci, T.
%E Costabile, M. F.
%E Levialdi, S.
%E Santucci, G.
%B 2nd International Workshop on Advanced Visual Interfaces (AVI '94), June 1-4
%C Bari, Italy
%I ACM Press
%P 53-58
%! Betty: Planning and Generating Animations for the Visualization of Movements and Spatial Relations
%F Butz:1994:BPG
%X In the field of multimodal presentation of information on a computer screen normally the modes Text and (statical) Graphics are used [Feiner'89, Wahlster'90 + '93]. But especially the computer screen yields the possibility to present informations in the form of animated graphics, i.e. animations. [Badler'90, Karp'90]. One advantage of animations is, that the dimension Time (succession, duration) can immediately be expressed. Another advantage is, that in an animation it is much easier to (virtually) cross the border to the third spatial dimension than it is in statical graphics. The problem of synthesizing an animation was regarded in this work as a planning problem and the result is an animation planner that, starting from an visualization goal, plans the whole script for an animation including all low-level camera and object motions. The system takes all decisions about camera positions, zooms, moves and cuts considering the actual context as well as some fundamental filmmaking rules [Karp'90]. The script is then realized by a given animation system which computes the single frames and does the playback. BETTY is part of the multimodal user interface WIP (Knowledge-based Presentation of Information, [Wahlster'93]), that generates instructions for technical devices. At the moment BETTY is able to compute animations to demonstrate movements, to localize parts of a device and to explode constructive groups.
%U http://www.dfki.uni-sb.de/~butz/work/betty.ps.Z


%0 Report
%A Butz, Andreas
%D 1995
%T BETTY: Ein System zur Planung und Generierung informativer Animationssequenzen
%C Saarbrücken
%I DFKI
%S DFKI Document
%7 D-95-02
%! BETTY: Ein System zur Planung und Generierung informativer Animationssequenzen
%F Butz:1995:BSP


%0 Journal Article
%A Callmeier, Ulrich
%D 2000
%T PET. A Platform for Experimentation with Efficient HPSG Processing Techniques
%B Journal of Natural Language Engineering
%V 6
%N 1
%P 99-108
%! PET. A Platform for Experimentation with Efficient HPSG Processing Techniques
%2 Callmeier:2000:PPE.pdf Callmeier:2000:PPE.ps
%3 j
%F Callmeier:2000:PPE
%U http://www.coli.uni-sb.de/~uc/pubs/nle00.ps


%0 Master's Thesis
%A Callmeier, Ulrich
%D 2001
%T Efficient Parsing with Large-Scale Unification Grammars
%C Saarbrücken, Germany
%I Universität des Saarlandes, Informatik
%9 Diplomarbeit
%! Efficient Parsing with Large-Scale Unification Grammars
%3 j
%F Callmeier:2001:EPL


%0 Book Section
%A Callmeier, Ulrich
%D 2002
%T Preprocessing and Encoding Techniques in PET
%E Oepen, Stephan
%E Flickinger, Dan
%E Tsujii, Jun-ichi
%E Uszkoreit, Hans
%B Collaborative Language Engineering. A Case Study in Efficient Grammar-based 
Processing
%C Stanford
%I CSLI Publications
%! Preprocessing and Encoding Techniques in PET
%3 j
%F Callmeier:2002:PET


%0 Conference Proceedings
%A Capstick, Joanne
%A Declerck, Thierry
%A Erbach, Gregor
%A Jameson, Anthony
%A Jörg, Brigitte
%A Karger, Reinhard
%A Uszkoreit, Hans
%A Wahlster, Wolfgang
%A Wegst, Tillmann
%D 2002
%T COLLATE: Competence Center in Speech and Language Technology
%B Proceedings of the 3rd International Conference on Language Resources an Evaluation (LREC'02), May 28-31
%C Las Palmas, Canary Islands, Spain
%! COLLATE: Competence Center in Speech and Language Technology
%2 Capstick:2002:CCC.pdf
%3 j
%F Capstick:2002:CCC
%X 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).
%U http://www.coli.uni-sb.de/~erbach/pub/collate_lrec_2002.pdf


%0 Conference Proceedings
%A Capstick, Joanne
%A Diagne, Abdel Kader
%A Erbach, Gregor
%A Uszkoreit, Hans
%D 1998
%T MULINEX: Multilingual Web Search and Navigation
%B Proceedings of the 14th Twente Workshop on Language Technology (TWLT 14). Language Technology in Multimedia Information Retrieval, December 7-8
%C University of Twente, Enschede, The Netherlands
%! MULINEX: Multilingual Web Search and Navigation
%2 Capstick:1998:MMWa.pdf Capstick:1998:MMWa.ps
%3 j
%F Capstick:1998:MMWa
%X 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.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mulinex-nlpia98.ps.gz


%0 Conference Proceedings
%A Capstick, Joanne
%A Diagne, Abdel Kader
%A Erbach, Gregor
%A Uszkoreit, Hans
%A Cagno, Francesco
%A Gadaleta, Giovanni
%A Hernandez, Juan A.
%A Korte, René
%A Leisenberg, Anne
%A Leisenberg, Manfred
%A Christ, Oliver
%D 1998
%T MULINEX :Multilingual Web Search and Navigation
%B Proceedings of the International Conference on Natural Language Processing and Industrial Applications (NLP+IA'98), August 18-21
%C Moncton, New-Brunswick, Canada
%! MULINEX :Multilingual Web Search and Navigation
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mulinex-nlpia98.entry
%2 Capstick:1998:MMWd.pdf Capstick:1998:MMWd.ps
%3 j
%F Capstick:1998:MMWd
%X 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.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mulinex-nlpia98.ps.gz


%0 Journal Article
%A Capstick, Joanne
%A Diagne, Abdel Kader
%A Erbach, Gregor
%A Uszkoreit, Hans
%A Leisenberg, Anne
%A Leisenberg, Manfred
%D 1999
%T A System for Supporting Cross-Lingual Retrieval
%B Information Processing and Management. An International Journal
%V 36
%N 2
%P 275-289
%! A System for Supporting Cross-Lingual Retrieval
%2 Capstick:1999:SSC.pdf Capstick:1999:SSC.ps
%3 j
%F Capstick:1999:SSC
%U 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


%0 Conference Proceedings
%A Capstick, Joanne
%A Erbach, Gregor
%A Uszkoreit, Hans
%D 1998
%T Design and Evaluation of a Psychological Experiment on the Effectivness of Document Summarisation for the Retrieval of Multilingual WWW Documents
%E Hovy, Eduard
%E Radev, Dragomir
%B AAAI Spring Symposium Intelligent Text Summarization
%C Palo Alto
%I The AAAI Press
%P 134-136
%! Design and Evaluation of a Psychological Experiment on the Effectivness of Document Summarisation for the Retrieval of Multilingual WWW Documents
%2 Capstick:1998:DEP.pdf
%3 j
%F Capstick:1998:DEP
%X 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.
%U http://www.coli.uni-sb.de/~erbach/pub/aaai98/mulinex-aaai98.pdf


%0 Conference Proceedings
%A Carroll, John
%A Frank, Anette
%A Lin, Dekang
%A Prescher, Detlef
%A Uszkoreit, Hans
%D 2002
%T Introductory pages of the editors
%E Carroll, John
%E Frank, Anette
%E Lin, Dekang
%E Prescher, Detlef
%E Uszkoreit, Hans
%B Beyond PARSEVAL - Towards Improved Evaluation Measures for Parsing Systems. Workshop at the 3rd International Conference on Language Resources and Evaluation (LREC'02), May 28
%C Las Palmas, Gran Canaria, Spain
%! Introductory pages of the editors
%2 Carroll:2002:IPE.pdf Carroll:2002:IPE.ps
%3 j
%F Carroll:2002:IPE
%U http://www.dfki.de/dfkibib/publications/docs/intro.ps


%0 Edited Book
%A Carroll, John
%A Frank, Anette
%A Lin, Dekang
%A Prescher, Detlef
%A Uszkoreit, Hans
%D 2002
%T Beyond PARSEVAL - Towards Improved Evaluation Measures for Parsing Systems. Workshop at the 3rd International Conference on Language Resources and Evaluation (LREC-02)
%C Las Palmas, Gran Canaria, Spain
%! Beyond PARSEVAL - Towards Improved Evaluation Measures for Parsing Systems. Workshop at the 3rd International Conference on Language Resources and Evaluation (LREC-02)
%2 Carroll:2002:BPT.pdf
%3 j
%F Carroll:2002:BPT
%U http://www.cogs.susx.ac.uk/lab/nlp/carroll/papers/beyond-proceedings.pdf


%0 Edited Book
%A Cole, Ronald A.
%A Mariani, Joseph
%A Uszkoreit, Hans
%A Varile, Giovanni
%A Zaenen, Annie
%A Zue, Victor
%A Zampolli, Antonio
%D 1997
%T Survey of the State of the Art in Human Language Technology
%C Cambridge
%I Cambridge University Press and Giardini
%! Survey of the State of the Art in Human Language Technology
%2 Cole:1997:SSA.pdf
%3 j
%F Cole:1997:SSA
%U also as Web edition: http://www.dfki.de/~hansu/HLT-Survey.pdf


%0 Book
%A Conrath, Karl
%A Mangold, Max
%A Pützer, Manfred
%D 1994
%T Mettlacher Wörterbuch
%B Phonetica Saraviensia
%C Saarbrücken, Germany
%V 14
%P 275
%! Mettlacher Wörterbuch
%F Conrath:1994:MW
%O unter Mitarbeit von Manfred Pützer


%0 Conference Proceedings
%A Copestake, Ann
%A Carroll, John
%A Flickinger, Dan
%A Malouf, Robert
%A Oepen, Stephan
%D 2001
%T Using an Open-Source Unification-Based System for CL/ NLP Teaching
%B Proceedings of the EACL/ ACL Workshop on Sharing Tools and Resources for Research and Education
%C Toulouse, France
%! Using an Open-Source Unification-Based System for CL/ NLP Teaching
%2 Copestake:2001:UOS.pdf
%3 j
%F Copestake:2001:UOS
%X We demonstrate the opensource LKB system which has been used to teach the fundamentals of constraintbased grammar development to several groups of students.
%U http://www.cogs.susx.ac.uk/lab/nlp/carroll/papers/acl01-workshop-lkb.pdf


%0 Journal Article
%A Corley, Martin M. B.
%A Scheepers, Christoph
%D 2002
%T Syntactic Priming in English Sentence Production: Categorical and Latency Evidence from an Internet-Based Study
%B Psychonomic Bulletin and Review
%V 9
%N 1
%P 126-131
%! Syntactic Priming in English Sentence Production: Categorical and Latency Evidence from an Internet-Based Study
%F Corley:2002:SPE


%0 Journal Article
%A Corley, Steffan
%A Corley, Martin
%A Keller, Frank
%A Crocker, Matthew
%A Trewin, Shari
%D 2001
%T Finding Syntactic Structure in Unparsed Corpora: The GSEARCH Corpus Query System
%B Computers and the Humanities
%V 35
%P 81-94
%! Finding Syntactic Structure in Unparsed Corpora: The GSEARCH Corpus Query System
%F Corley:2001:FSS


%0 Book Section
%A Corley, Steffan
%A Crocker, Matthew
%D 2000
%T The Modular Statistical Hypothesis: Exploring Lexical Category Ambiguity
%E Crocker, M.
%E Pickering, M.
%E Clifton, C., Jr.
%B Architectures and Mechanisms for Language Processing
%C Cambridge
%I Cambridge University Press
%! The Modular Statistical Hypothesis: Exploring Lexical Category Ambiguity
%F Corley:2000:MSH


%0 Conference Proceedings
%A Cowie, Roddy
%A Douglas-Cowie, Ellen
%A Savvidou, Suzie
%A McMahon, Edelle
%A Sawey, Martin
%A Schröder, Marc
%D 2000
%T 'FEELTRACE': An Instrument for Recording Perceived Emotion in Real Time
%E Douglas-Cowie, Ellen
%E Cowie, Roddy
%E Schröder, Marc
%B Proceedings of the ISCA Workshop on Speech and Emotion: A Conceptual Framework for Research
%C Belfast
%I Textflow
%P 19-24
%! 'FEELTRACE': An Instrument for Recording Perceived Emotion in Real Time
%1 http://www.dfki.de/~schroed/
%2 Cowie:2000:FIR.pdf
%3 j
%F Cowie:2000:FIR
%X FEELTRACE is an instrument developed to let observers track the emotional content of a stimulus as they perceive it over time, allowing the emotional dynamics of speech episodes to be examined. It is based on activation-evaluation space, a representation derived from psychology. The activation dimension measures how dynamic the emotional state is; the evaluation dimension is a global measure of the positive or negative feeling associated with the state. Research suggests that the space is naturally circular, i.e. states which are at the limit of emotional intensity define a circle, with alert neutrality at the centre.
To turn those ideas into a recording tool, the space was represented by a circle on a computer screen, and observers described perceived emotional state by moving a pointer (in the form of a disc) to the appropriate point in the circle, using a mouse. Prototypes were tested, and in the light of results, refinements were made to ensure that outputs were as consistent and meaningful as possible. They include colour coding the pointer in a way that users readily associate with the relevant emotional state; presenting key emotion words as ‘landmarks’ at the strategic points in the space; and developing an induction procedure to introduce observers to the system.
An experiment assessed the reliability of the developed system. Stimuli were 16 clips from TV programs, two showing relatively strong emotions in each quadrant of activationevaluation space, each paired with one of the same person in a relatively neural state. 24 raters took part.
Differences between clips chosen to contrast were statistically robust. Results were plotted in activation-evaluation space as ellipses, each with its centre at the mean co-ordinates for the clip, and its width proportional to standard deviation across raters. The size of the ellipses meant that about 25 could be fitted into the space, i.e. FEELTRACE has resolving power comparable to an emotion vocabulary of 20 non-overlapping words, with the advantage of allowing intermediate ratings, and above all, the ability to track impressions continuously.
%U http://www.dfki.de/~schroed/articles/cowieetal2000.pdf


%0 Edited Proceedings
%A Cowie, Roddy
%A Douglas-Cowie, Ellen
%A Schröder, Marc
%D 2000
%T Proceedings of the ISCA Workshop on Speech and Emotion: A Conceptual Framework for Research
%C Belfast
%I Textflow
%! Proceedings of the ISCA Workshop on Speech and Emotion: A Conceptual Framework for Research
%1 http://www.dfki.de/~schroed/
%3 j
%F Cowie:2000:PIW
%U http://www.qub.ac.uk/en/isca/proceedings


%0 Conference Proceedings
%A Creary, Lewis G.
%A Gawron, Jean Mark
%A Nerbonne, John
%D 1989
%T Reference to Locations
%E ACL
%B 27th Annual Meeting of the Association for Computational Linguistics (ACL-ANNUAL '89), June 26-29
%C Vancouver, British Columbia, Canada
%P 42-50
%! Reference to Locations
%F Creary:1989:RL


%0 Book Section
%A Crocker, Matthew
%D 1999
%T Mechanisms for Sentence Processing
%E Garrod, S.
%E Pickering, M.
%B Language Processing
%C London
%I Psychology Press
%! Mechanisms for Sentence Processing
%F Crocker:1999:MSP


%0 Conference Proceedings
%A Crocker, Matthew
%A Brants, Thorsten
%D 1999
%T Incremental Probabilistic Models of Human Linguistic Performance
%B 5th Conference on Architectures and Mechanisms for Language Processing (AMLaP '99), September 23-26
%C Edinburgh, Scotland
%! Incremental Probabilistic Models of Human Linguistic Performance
%F Crocker:1999:IPM
%X Models of human language processing increasingly advocate probabilistic mechanisms for parsing and disambiguation (e.g. Jurafsky, 1996; MacDonald et al 1994; Crocker and Corley; to appear). These models resolve local syntactic and lexical ambiguity by promoting the analysis which has the greatest probability of being correct. In this talk we will outline a new probabilistic parsing model which is a generalisation of the Hidden Markov Models which have previously been defended as pschological models of lexical category disambiguation (Corley and Crocker, in press). The model uses layered, or cascaded, markov models (CMMs) to build up a syntactic analysis (Brants, 1999).

In contrast with many probabilisic parsing models, CMMs can easily be implemented to parse incrementally. Incremental CMMs have the property of generating partial structures including hypothetical continuations after receiving each new word in the input. New material is incorporated into the existing structure and ambiguities are resolved based on local context. Alternative hypotheses are assigned probabilities which are used for ranking, and only a bounded number of parallel alternatives are pursued. Simple bounds on the model straightforwardly predict the recency effects often attributed only to connectionist-based models (Stevenson, 1994; Macdonald et al, 1884; Kempen and Vosse, 1987).

In contrast with several current models, the combination of weights in CMMs is motivated directly by probability theory. The parameters of the model are acquired automatically from a corpus, and there are relatively few stipulations about how probabilities are combined (contra Jurafsky, 1996; Tanenhaus et al, in press). An important cognitive parameter concerns the number of analyses which are maintained in parallel. We will present results of experiments which evaluate the performance of the model for both general language processing, and on several critical ambiguities where human performance is well understood.

The model is a first step in exploring the role of optimal models of human linguistic performance, as motivated by Chater, Crocker, and Pickering (1998). Recently, Pickering, Traxler and Crocker (to appear) have provided experimental evidence which challenges a pure maximum likelihood model of syntactic ambiguity resolution. As an alternative, they propose a measure, termed Informativity, which they derive from a rational analysis of the parsing and interpretation problem. In the final part of the talk we will outline how the presented model can be adapted to implement Informativity, which combines probability with a newly proposed measure termed Specificity.


%0 Journal Article
%A Crocker, Matthew
%A Brants, Thorsten
%D 2000
%T Wide Coverage Probabilistic Sentence Processing
%B Journal of Psycholinguistic Research
%V 29
%N 6
%P 647-669
%! Wide Coverage Probabilistic Sentence Processing
%F Crocker:2000:WCP


%0 Conference Proceedings
%A Crocker, Matthew
%A Brants, Thorsten
%D 2000
%T Incremental Probabilistic Models of Human Linguistic Performance
%B 13th Annual CUNY Conference on Sentence Processing, March 30 - April 1
%C La Jolla, California, USA
%! Incremental Probabilistic Models of Human Linguistic Performance
%F Crocker:2000:IPM


%0 Book Section
%A Crocker, Matthew
%A Corley, Steffan
%D 2002
%T Modular Architectures and Statistical Mechanisms: The Case from Lexical Category Disambiguation
%E Merlo, Paola
%E Stevenson, Suzanne
%B The Lexical Basis of Sentence Processing
%C Amsterdam
%I John Benjamins
%! Modular Architectures and Statistical Mechanisms: The Case from Lexical Category Disambiguation
%F Crocker:2002:MAS


%0 Edited Book
%A Crocker, Matthew
%A Pickering, Martin
%A Clifton, Charles
%D 2000
%T Architectures and Mechanisms for Language Processing
%C Cambridge
%I Cambridge University Press
%! Architectures and Mechanisms for Language Processing
%F Crocker:2000:AML


%0 Book Section
%A Crouch, Richard
%A Frank, Anette
%A van Genabith, Josef
%D 2001
%T Glue, Underspecification and Translation
%E Bunt, Harry
%B Computing Meaning Volume 2
%I Kluwer Academic Publishers
%! Glue, Underspecification and Translation
%2 Crouch:2001:GUT.pdf
%F Crouch:2001:GUT
%X This paper sketches how one can construct Underspecified Discourse Representation Structures (UDRSs) (Reyle, 1993) via glue semantics (Dalrymple et al. 1999). In most cases, UDRSs are constructed in linear time, analogously to the linear time construction of skeleton-modifier representations presented in (Gupta and Lamping, 1998). We show how this encoding can be used in ambiguity preserving, transfer-based machine translation, where it reduces problems with structural misalignment, such as head-switching problem.
%U http://www2.parc.com/istl/members/crouch/iwcs3.pdf


%0 Conference Proceedings
%A Crouch, Richard
%A Frank, Anette
%A van Genabith, Josef
%D 2001
%T Linear Logic based Transfer and Structural Misalignment
%E Bunt, Harry
%E van der Sluis, Ielka
%E Thijsse, Elias
%B 4th International Workshop on Comutational Semantics (IWCS-4), January 10-12
%C Tilburg, The Netherlands
%! Linear Logic based Transfer and Structural Misalignment
%2 Crouch:2001:LLB.pdf Crouch:2001:LLB.ps
%F Crouch:2001:LLB
%X Genabith, Frank and Dorna, 1998) described an approach to ambiguity preserving machine translation, where transfer takes place on the glue language meaning constructors of (Dalrymple et al. 1996). Unfortunately, it did not deal with structural misalignment problems, such as embedded head switching, in a fully satisfactory way. This paper proposes the use of a fragment of linear logic as a transfer formalism, and shows how it provides a more general and satisfactory solution to the difficulties encountered by (Genabith, Frank and Dorna, 1998).
%U http://www.dfki.de/~frank/papers/iwcs4.ps


%0 Report
%A Crouch, Richard
%A Gaizauskas, Robert
%A Netter, Klaus
%D 1995
%T Report of the Study Group on Assessment and Evaluation
%C Saarbrücken
%I DFKI
%S Interim Report
%! Report of the Study Group on Assessment and Evaluation
%2 Crouch:1995:RSG.pdf Crouch:1995:RSG.ps Crouch:1995:RSG.dvi
%3 j
%F Crouch:1995:RSG
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knass95.dvi.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knass95.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knass95.ps.gz


%0 Conference Proceedings
%A Crysmann, Berthold
%D 1997
%T The Conspiracy of Quantification and Linear Precedence in European Portuguese Proclisis
%E Austin, J.
%E Lawson, A.
%B Eastern States Conference on Linguistics (ESCOL '97), November 21-23
%C Yale University, New Haven, USA
%I CLC Publications
%! The Conspiracy of Quantification and Linear Precedence in European Portuguese Proclisis
%3 j
%F Crysmann:1997:CQL
%X n this paper, I will address the interaction between quantification and lin-earisation in the grammar of European Portuguese (EP) clitic placement, and suggest that a licensing relation holds between a subset of the natural language quantifiers identified in Generalised Quantifier Theory (GQT) and the order in which the clitic and its host must surface. More specifically, I will argue that the class of proclisis licensors is best described in semantic terms (i.e. in terms of logical entailment), whereas the relation between proclisis licensor and licensee should be conceived of as entirely surface-syntactic. The order domain on which these linearisation constraints operate will be independently motivated by data from negative concord.
%U http://www.coli.uni-sb.de/~crysmann/papers/Conspire.html


%0 Conference Proceedings
%A Crysmann, Berthold
%D 1997
%T Cliticization in European Portuguese Using Parallel Morpho-Syntactic Constraints
%E Butt, M. 
%E Holloway King, T.
%B Lexical Functional Grammar Conference (LFG'97), June 19-21
%C University of California, San Diego, USA
%I CSLI Publications
%! Cliticization in European Portuguese Using Parallel Morpho-Syntactic Constraints
%1 http://www-csli.stanford.edu/publications/
%2 Crysmann:1997:CEP.pdf Crysmann:1997:CEP.ps
%3 j
%F Crysmann:1997:CEP
%U http://csli-publications.stanford.edu/LFG/2/crysmann-lfg97.pdf http://csli-publications.stanford.edu/LFG/2/crysmann-lfg97.ps


%0 Conference Proceedings
%A Crysmann, Berthold
%D 1998
%T Morphosyntactic Paradoxa in Fox: An Account in Linearization-Based Morphology
%E Bouma, G.
%E Kruijff, G.-J.
%E Oehrle, R.
%B Joint Conference on Formal Grammar, Head-Driven Phrase Structure Grammar and Categorial Grammar
%C Saarbrücken
%P 253-255
%! Morphosyntactic Paradoxa in Fox: An Account in Linearization-Based Morphology
%1 http://www.coli.uni-sb.de/~crysmann/papers/Fox.html
%2 Crysmann:1998:MPF.pdf Crysmann:1998:MPF.ps
%3 j
%F Crysmann:1998:MPF
%X Paper presented at the Joint Conference on Formal, Head-driven and Categorial Grammar (FHCG '98) August 14-16, Saarbrücken

in: Gosse Bouma, Richard Oehrle and Geert-Jan Kruijff, Proceedings of the Joint Conference on Formal Grammars, Head-driven Phrase Structure Grammar and Categorial Grammar (FHCG '98), in Proceedings of the Tenth European Summer School in Logic, Language and Information (ESSLLI 10).

A later version of this paper has been published in:
Gosse Bouma, Erhard Hinrichs, Geert-Jan Kruijff, and Richard Oehrle (eds.) (1999) ``Constraints and Resources in Natural Language Syntax and Semantics'', Studies in Constraint-Based Lexicalism, CSLI Publications, Stanford.

In this paper, I shall discuss an apparent paradox in the morphology and syntax of Fox (Mesquakie) complex verbs. In Fox, verbs can be modified by one or more of a variety of preverbs including modals, aspectuals, manner adverbials, numerals, quantifiers, as well as preverbs which increase the valence of the main verb (Dahlstrom, 1997a). While preverb and verb can be separated by words, phrases, or even embedded sentences, suggesting a status as syntactically independent words, in ection (cf. Dahlstrom, 1997a) and derivation (cf. Ackerman and LeSourd, 1994) appear to treat preverb-verb complexes as a single morphological unit.

Following the basic assumptions of lexicalist syntax, I claim that Fox preverb-verb combinations are indeed morphologically derived and that inflectional affixes are attached to complex morphological objects in the word-formation component already. In order to account for the syntactic effects, I propose an analysis in Linearisation HPSG (Reape, 1994, Kathol, 1995), which builds on the assumption that Fox preverb-verb complexes introduce more than one domain object into syntax (cf. Kathol, 1996 for German, Crysmann, 1997 for European Portuguese). Further morphological material will then be distributed across preverb and verb by imposing partial morphological (order) constraints on PHON-values.
%U http://www.coli.uni-sb.de/~crysmann/papers/ESSLLI-98.ps http://www.coli.uni-sb.de/~crysmann/papers/ESSLLI-98.pdf


%0 Conference Proceedings
%A Crysmann, Berthold
%D 1999
%T Licensing Proclisis in European Portuguese
%E Corblin, F.
%E Marandin, J.-M.
%E Dobrovie-Sorin, C.
%B Empirical Issues in Formal Syntax and Semantics. Selected papers from the Colloque de Syntaxe et de Sémantique de Paris (CSSP'97), October 16-18
%C Paris, France
%I Thesus
%P 255-276
%! Licensing Proclisis in European Portuguese
%1 http://www.coli.uni-sb.de/~crysmann/papers/License.html http://www.coli.uni-sb.de/~crysmann/
%3 j
%F Crysmann:1999:LPE
%X In this paper, I will address the interaction between quantification and linearisation in the grammar of European Portuguese (EP) clitic placement. In particular, I will suggest that a licensing relation holds between a subset of the natural language quantifiers identified in Generalised Quantifier Theory (GQT) and the order in which the clitic and its host must surface. More specifically, I will argue that the class of proclisis licensors is best described in semantic terms (i.e. in terms of logical entailment), whereas the relation between proclisis licensor and licensee should be conceived of as entirely surface-syntactic. It will be shown that approches which mediate the licensing relation by means of syntactic movement (Barbosa, 1996; Duarte, 1983; Madeira, 1992, cf. e.g.) are faced with both motivational and empirical problems. Instead, I claim that surface-syntactic linearisation constraints will relate clitic placement directly to a class of lexical items, which in turn is defined on the basis of semantic properties. Therefore, an integrated model of syntax and semantics is called for which builds on highly articulate lexical information. The analysis will, thus, be carried out in the framework of Head-driven Phrase Structure Grammar (HPSG) (Pollard and Sag, 1987; 1994), using multiple inheritance type hierarchies and linearisation constraints.

The paper is organised as follows: in the first section, I shall briefly describe the basic empirical observations regarding EP proclisis. In section two, I shall review the empirical problems faced by previous (mostly syntactic) approaches. Section three provides the details of the proposal, starting with a semantic typology of proclisis licensors. In the remainder of the section, I outline the surface-syntactic constraints which define the phenogrammatical relation between licensor and licensee, analysing EP proclisis in an essentially similar way to English negative polarity items (NPI) (cf. Ladusaw, 1996, and reference cited there).


%0 Book Section
%A Crysmann, Berthold
%D 1999
%T Morphosyntactic Paradoxa in Fox
%E Bouma, G.
%E Hinrichs, E.
%E Kruijff, G.-J.
%E Oehrle, R.
%B Constraints and Resources in Natural Language Syntax and Semantics
%C Stanford
%I CSLI Publications
%S Studies in Constraint-Based Lexicalism
%! Morphosyntactic Paradoxa in Fox
%3 j
%F Crysmann:1999:MPF
%X In this paper, I shall discuss an apparent paradox in the morphology and syntax of Fox (Mesquakie) complex verbs. In Fox, verbs can be modified by one or more of a variety of preverbs including modals, aspectuals, manner adverbials, numerals, quantifiers, as well as preverbs which increase the valence of the main verb (Dahlstrom, 1997a). While preverb and verb can be separated by words, phrases, or even embedded sentences, suggesting a status as syntactically independent words, in ection (cf. Dahlstrom, 1997a) and derivation (cf. Ackerman and LeSourd, 1994) appear to treat preverb-verb complexes as a single morphological unit. 

Following the basic assumptions of lexicalist syntax, I claim that Fox preverb-verb combinations are indeed morphologically derived and that inflectional affixes are attached to complex morphological objects in the word-formation component already. In order to account for the syntactic effects, I propose an analysis in Linearisation HPSG (Reape, 1994, Kathol, 1995), which builds on the assumption that Fox preverb-verb complexes introduce more than one domain object into syntax (cf. Kathol, 1996 for German, Crysmann, 1997 for European Portuguese). Further morphological material will then be distributed across preverb and verb by imposing partial morphological (order) constraints on PHON-values.
%U http://www.coli.uni-sb.de/~crysmann/


%0 Book Section
%A Crysmann, Berthold
%D 2001
%T Syntactic Transparency of Pronominal Affixes
%E Cann, R.
%E Grover, C.
%E Miller, P.
%B Grammatical Interfaces in HPSG
%C Stanford
%I CSLI Publications
%P 77-96
%! Syntactic Transparency of Pronominal Affixes
%3 j
%F Crysmann:2001:STP
%X Approaches to bound pronominals in HPSG reflect a strict dichotomy between postlexical clitics and lexical (or phrasal) affixes, a distinction already drawn in cliticisation theories developed by Miller (1992) or Halpern (1995). Motivated by the rigorous application of the diagnostic criteria suggested in Zwicky and Pullum (1983) and Miller (1992), clitics in Romance languages are treated as lexical afixes, whose morphological and morphosyntactic properties are derived entirely within the lexicon (Miller and Sag 1997; Monachesi (1996). Weak pronominals in Polish (Kupsc 1999) and second position clitics in Serbo-Croat (Penn 1999), however, enjoy a much higher degree of syntactic transparency, favouring an analysis in terms of linearisation approaches. In this paper, I will suggest that European Portuguese (EP) represents a transitional type, where clitics have already acquired the morphological properties of lexical affixes, yet, ``the rules governing clitic placement seem to relate more to syntax than to prosody or morphology'' (Spencer 1991, p. 365). I will argue that the distinction between constituent structure and order domains, as drawn in linearisation-based variants of HPSG, provides the necessary tools to model the syntax of transparent affixes, relating EP clitics to both their Romance and Slavic counterparts.
%U http://www.coli.uni-sb.de/~crysmann/papers/SynTran.html


%0 Book Section
%A Crysmann, Berthold
%D 2001
%T Clitics and Coordination in Linear Structure
%E Gerlach, B.
%E Grijzenhout, J.
%B Clitics in Phonology, Morphology, and Syntax
%C Amsterdam
%I John Benjamins
%V 36
%P 121-159
%S Linguistics Today
%! Clitics and Coordination in Linear Structure
%3 j
%F Crysmann:2001:CCL
%X In the context of lexicalist studies of Romance cliticisation, the development and rigorous application of diagnostic criteria (Zwicky and Pullum, 1983; Miller, 1992) as to their lexical or syntactic status has always enjoyed a central role. As a result, there is a vast body of evidence in French and Italian (Miller 1992; Miller and Sag, 1997; Monachesi, 1996) that weak pronominals in these languages resemble ordinary bound affixes much more than true postlexical clitics. In particular, syntactic, semantic, morphological, and phonological criteria jointly militate against the view of Romance clitics as proper inhabitants of the syntactic world. As a side effect, the distinction between lexical affixes and postlexical clitics (Halpern, 1995) is seen as a strict dichotomy, with little or no room for true morpho-syntactic hybrids.

I will argue in this paper that transitional types do indeed occur, which are characterised by the fact that one group of criteria (e.g. morphological criteria) positively suggest syntactic opacity, while almost all syntactic criteria demand a degree of transparency. Based on data from clitic placement and coordination, however, I will suggest that the syntactic transparency is highly superficial in nature, and thus favours an account in terms of word order variation. This perspective will also prove to make appropriate predictions in the context of semantic idiosyncrasies.
%U http://www.coli.uni-sb.de/~crysmann/papers/ClCoord.html


%0 Conference Proceedings
%A Crysmann, Berthold
%A Frank, Anette
%A Kiefer, Bernd
%A Krieger, Hans-Ulrich
%A Müller, Stefan
%A Neumann, Günter
%A Piskorski, Jakub
%A Schäfer, Ulrich
%A Siegel, Melanie
%A Uszkoreit, Hans
%A Xu, Feiyu
%D 2002
%T An Integrated Architecture for Shallow and Deep Processing
%B Proceedings of ACL-2002, Association for Computational Linguistics 40th Anniversary Meeting, July 7-12
%C Philadelphia, USA
%! An Integrated Architecture for Shallow and Deep Processing
%2 Crysmann:2002:IAS.pdf
%3 j
%F Crysmann:2002:IAS
%U http://www.dfki.de/~feiyu/wb-acl02.pdf http://www.dfki.de/~neumann/publications/new-ps/wb-acl02.pdf


%0 Conference Proceedings
%A Dale, Robert
%A Finkler, Wolfgang
%A Kittredge, Richard
%A Lenke, Nils
%A Neumann, Günter
%A Peters, Conny
%A Stede, Manfred
%D 1994
%T Report from Working Group 2: Lexicalization and Architecture
%E Hoeppner, Wolfgang
%E Horacek, Helmut
%E Moore, Johanna
%B Principles of Natural Language Generation
%C Schloß Dagstuhl
%P 30-39
%S Dagstuhl-Seminar-Report
%7 93
%! Report from Working Group 2: Lexicalization and Architecture
%2 Dale:1994:RWG.pdf
%3 j
%F Dale:1994:RWG
%X This report summarises the results of the discussions held in Working Group 2: The group discussions focussed around three reasonably independent topics, and we have organised the report to reflect this.
%U http://www.dfki.de/dfkibib/publications/docs/Dale_1995_LAA.pdf


%0 Conference Proceedings
%A Dalsgaard, Paul
%A Andersen, Ove
%A Barry, William J.
%D 1991
%T Multi-Lingual Label Alignment Using Acoustic-Phonetic Features Derived by Neural-Network Technique
%E IEEE
%B International Conference on Acoustics, Speech, and Signal Processing (ICASSP'91), May 14-17
%C Toronto, Canada
%! Multi-Lingual Label Alignment Using Acoustic-Phonetic Features Derived by Neural-Network Technique
%F Dalsgaard:1991:MLL


%0 Conference Proceedings
%A Dalsgaard, Paul
%A Andersen, Ove
%A Barry, William J.
%D 1991
%T The Cross-Language Validity of Acoustic-Phonetic Features in Label Alignment
%B 12th International Congress of Phonetic Sciences
%C Aix-en-Provence, France
%V 5
%P 382-385
%! The Cross-Language Validity of Acoustic-Phonetic Features in Label Alignment
%F Dalsgaard:1991:CLV


%0 Conference Proceedings
%A Dalsgaard, Paul
%A Andersen, Ove
%A Barry, William J.
%D 1998
%T Cross-Language Merged Speech Units and Their Descriptive Phonetic Correlates
%B 5th International Conference on Spoken Language Processsing (ICSLP '98), November 30 - December 4
%C Sydney, Australia
%P Paper 482
%! Cross-Language Merged Speech Units and Their Descriptive Phonetic Correlates
%F Dalsgaard:1998:CLM


%0 Conference Proceedings
%A Dalsgaard, Paul
%A Barry, William J.
%D 1990
%T Acoustic-Phonetic Features in the Framework of Neural-Network Multi-Lingual Label Alignment
%B International Conference on Spoken Language Processing, November 19-22
%C Kobe, Japan
%! Acoustic-Phonetic Features in the Framework of Neural-Network Multi-Lingual Label Alignment
%F Dalsgaard:1990:APF


%0 Conference Proceedings
%A de Jong, Franciska 
%A Gauvain, Jean-Luc 
%A den Hartog, Jurgen
%A Netter, Klaus
%D 1999
%T OLIVE: Speech-Based Video Retrieval
%B Proceedings of the European Workshop on Content-Based Multimedia Indexing (CBMI'99), October 25-27
%C Toulouse, France
%P 75-80
%! OLIVE: Speech-Based Video Retrieval
%2 Jong:1999:OSB.pdf Jong:1999:OSB.ps
%3 j
%F Jong:1999:OSB
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kn-cbmi99-final.ps ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kn-cbmi99-final.pdf


%0 Conference Proceedings
%A de Jong, Franciska
%A Gauvain, Jean-Luc
%A Hiemstra, D.
%A Netter, Klaus
%D 2000
%T Language-Based Multimedia Information Retrieval
%B Proceedings of the 6th Conference on "Content-Based Multimedia Information Access". Recherche d'Informations Assistee par Ordinateur (RIAO '00)
%C Paris, France
%! Language-Based Multimedia Information Retrieval
%2 Jong:2000:LBM.pdf Jong:2000:LBM.ps
%3 j
%F Jong:2000:LBM
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/riao_lbmir_final.ps.gz


%0 Conference Proceedings
%A de Jong, Franciska
%A Netter, Klaus
%D 1998
%T OLIVE: Speech-Based Video Retrieval
%E Hiemstra, Djoerd
%E de Jong, Franciska
%E Netter, Klaus
%B Proceedings of the 14th Twente Workshop on Language Technology (TWLT 14). Language Technology in Multimedia Information Retrieval, December 7-8
%C University of Twente, Enschede, The Netherlands
%P 187-188
%! OLIVE: Speech-Based Video Retrieval
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kn-fj-twlt14.entry
%2 Jong:1998:OSB.pdf Jong:1998:OSB.ps
%3 j
%F Jong:1998:OSB
%X This paper describes the Olive project which aims to support automated indexing of video material by use of human language technologies. Olive is making use of speech recognition to automatically derive transcriptions of the sound tracks, generating time-coded linguistic elements which serve as the basis for text-based retrieval functionality. The retrieval demonstrator builds on and extends the architecture from the Pop-Eye project, a system applying human language technology on subtitles for the disclosure of video fragments.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kn-fj-twlt14.ps


%0 Conference Proceedings
%A De Kuthy, Kordula
%D 1997
%T On the Extractibility from Subjects in German - An Example for Lexicalized Constraints on UDCs
%E Drewery, Alice
%E Kruijff, Geert-Jan
%E Zuber, Richard
%B Proceedings of the 2nd ESSLLI Student Session, August 11-22
%C Aix-en-Provence, France
%! On the Extractibility from Subjects in German - An Example for Lexicalized Constraints on UDCs
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/De_Kuthy97.entry
%2 Kuthy:1997:ESG.pdf Kuthy:1997:ESG.ps
%F Kuthy:1997:ESG
%X In current linguistic theory, subject-object asymmetries in German are a much discussed issue. One of the relevant test cases is the possibility of extraction from subjects. The traditional assumption is that German in this respect behaves parallel to English in the sense that extraction from subjects is be ungrammatical, while extraction out of objects is grammatical. In this paper we show that one can account for all those cases where extraction from subjects is ungrammatical without having to postulate subject-object asymmetries for German. Instead, we argue that mainly lexical properties of the governing head determine the possibility of extraction from its arguments. Finally, we show how lexical constraints in HPSG can capture the observed generalizations.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/De_Kuthy97.ps.gz


%0 Conference Proceedings
%A De Kuthy, Kordula
%D 1998
%T Splitting PP Arguments from NPs - An Argument Raising Approach and its Interaction with Lexical Semantics
%E Kiss, Tibor
%E Meurers, Detmar
%B Workshop of the 10th European Summer School in Logic, Language and Information (ESSLLI '98): Current Topics in Constraint-Based Germanic Syntax, August 17-28
%C Saarbrücken, Germany
%P 49-64
%! Splitting PP Arguments from NPs - An Argument Raising Approach and its Interaction with Lexical Semantics
%2 Kuthy:1998:SPA.pdf Kuthy:1998:SPA.ps
%F Kuthy:1998:SPA
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/De_Kuthy98c.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/De_Kuthy98c.entry


%0 Book Section
%A De Kuthy, Kordula
%D 1998
%T Linearization versus Movement: Evidence from German Pied-Piped Infinitives
%E Webelhuth, Gert
%E Koenig, Jean-Pierre
%E Kathol, Andreas
%B Lexical and Constructional Aspects of Linguistic Explanation
%C Stanford
%I CSLI Publications
%! Linearization versus Movement: Evidence from German Pied-Piped Infinitives
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/De_Kuthy98a.entry
%2 Kuthy:1998:LVM.pdf Kuthy:1998:LVM.ps
%F Kuthy:1998:LVM
%X The paper starts out with the question whether the pied-piping of infinitives in German relative clauses should be analyzed in a linearization-based account or as an unbounded dependency construction. It is then shown that there is clear empirical evidence for a UDC approach. Two different theories for the pied-piping construction are provided: one based on the relative clause analysis of Pollard and Sag (1994, chapter 5), the other on the new proposal for relative clauses by Sag (1997).
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/De_Kuthy98a.ps.gz


%0 Thesis
%A De Kuthy, Kordula
%D 2000
%T Discontinuous NPs in German
%C Saarbrücken
%I Universität des Saarlandes
%! Discontinuous NPs in German
%2 Kuthy:2000:DNG.pdf Kuthy:2000:DNG.ps
%F Kuthy:2000:DNG
%U http://www.dfki.de/dfkibib/publications/docs/dekuthy-thesis.ps.gz


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


%0 Conference Proceedings
%A De Kuthy, Kordula
%A Meurers, Detmar
%D 1999
%T Argument Raising Meets Adjuncts-as-Dependents and Traceless Extraction
%B 6th International Conference on HPSG, August 4-6
%C Edinburgh, Scotland
%P 45-50
%! Argument Raising Meets Adjuncts-as-Dependents and Traceless Extraction
%2 Kuthy:1999:ARM.pdf Kuthy:1999:ARM.ps
%F Kuthy:1999:ARM
%U http://ling.osu.edu/~dm/papers/dekuthy-meurers-hpsg99.ps.gz


%0 Conference Proceedings
%A Debusmann, Ralph
%D 2001
%T Topological Dependency Trees: A Constraint-based Account of Linear Precedence
%B Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics (ACL 2001), July 9-11
%C Toulouse, France
%I Morgan Kaufmann Publishers
%P 180-187
%! Topological Dependency Trees: A Constraint-based Account of Linear Precedence
%2 Debusmann:2001:TDT.pdf Debusmann:2001:TDT.ps
%F Debusmann:2001:TDT
%X Linear precedence in so-called free word order languages remains challenging for modern grammar formalisms. To address this issue, we describe a new framework for dependency grammar, with a modular decomposition of immediate dependency and linear precedence. Our approach distinguishes two orthogonal yet mutually constraining structures: a syntactic dependency tree (ID tree) and a topological dependency tree (LP tree). The ID tree is non-projective, and even non-ordered, and its edges are labeled by syntactic roles. The LP tree is projective, partially ordered, and its edges are labeled by topological fields. The shape of the LP tree is a flattening of the ID tree's obtained by allowing nodes to 'climb up'. Our theory of ID/LP trees is formulated in terms of (a) lexicalized constraints and (b) principles governing e.g. climbing conditions. We illustrate it with a detailed account of word order phenomena in the verbal complex of German verb final sentences.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/rade-acl2001.ps.gz


%0 Conference Proceedings
%A Debusmann, Ralph
%D 2001
%T Movement as well-formedness Conditions
%B Proceedings of the 13th ESSLLI Student Session, August 13-24
%C Helsinki, Finland
%! Movement as well-formedness Conditions
%2 Debusmann:2001:MWF.pdf
%F Debusmann:2001:MWF
%X We introduce a new formulation of dependency grammar recently suggested in (Duchier and Debusmann, 2001) (henceforth DD). DD shares with GB (Chomsky, 1986) a notion of movement. In GB, movement is carried out by tree transformations. In DD, it is the effect of well-formedness conditions on dependency trees and does not involve transformations. We illustrate both kinds of movement by showing how both theories analyze German verb-second clauses. Then, we point out the similarities between GB and DD, and raise the question whether GB's transformational notion of movement could be replaced by DD's constraint-based account of movement.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Debusmann-ESSLLI-01.pdf


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


%0 Conference Proceedings
%A Declerck, Thierry
%D 1996
%T Modeling Information-Passing within the LFG-Workbench
%B Proceedings of the 1st Annual Lexical-Functional Grammar Conference
%C Grenoble, France
%! Modeling Information-Passing within the LFG-Workbench
%2 Declerck:1996:MIP.pdf Declerck:1996:MIP.ps
%3 j
%F Declerck:1996:MIP
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/declerck96_lfg.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/declerck96_lfg.ps.gz


%0 Conference Proceedings
%A Declerck, Thierry
%D 1996
%T Dealing with Cross-Sentential Anaphora Resolution in ALEP
%B Proceedings of the 16th International Conference on Computational Linguistics (COLING'96), August 5-9
%C Copenhagen, Danmark
%V 1
%P 280-285
%! Dealing with Cross-Sentential Anaphora Resolution in ALEP
%2 Declerck:1996:DCS.pdf
%3 j
%F Declerck:1996:DCS
%X The experiments described here have been done in connection with the LSGRAM project, which is concerned with the development of large scale grammars and thus foreseen the coverage of "real life texts". But in order to deal with such texts, it is also necessary to process linguistic units which are larger than sentences. The resolution of crosssentential anaphora is one of the problems we have to deal with, when we switch towards the analysis of such larger linguistic units. In order to propose an analysis of the crosssentential anaphora, one has to be able to refer back to an antecedent, which is to be found in a preceding sentence. This will be done on the basis of an informationpassing framework. Using also the simple unification technique a resolution of the pronoun can then be tried out: parts of the content information of the pronoun are going to be compared (unified) with specific parts of the content information of the (possible) antecedent.
%U http://www.dfki.de/dfkibib/publications/docs/Declerck_1996_DCCSARA.pdf


%0 Conference Proceedings
%A Declerck, Thierry
%D 1997
%T Investigation on the Reusability of LFG-Based Grammar Resource
%B Proceedings of the 2nd Annual Lexical-Functional Grammar Conference
%C San Diego, USA
%! Investigation on the Reusability of LFG-Based Grammar Resource
%2 Declerck:1997:IRL.pdf Declerck:1997:IRL.ps
%3 j
%F Declerck:1997:IRL
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/declerck97_lfg.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/declerck97_lfg.ps.gz


%0 Conference Proceedings
%A Declerck, Thierry
%D 1997
%T An Interface between Text Structures and Linguistic Descriptions
%E Christoffersen, Ellen
%E Music, Bradley
%B Proceedings of the Datalingvistisk Forening (DALF'97), June 9-10
%C Kolding, Denmark
%P 8-22
%! An Interface between Text Structures and Linguistic Descriptions
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/declerck97_dalf.entry
%2 Declerck:1997:IBT.pdf Declerck:1997:IBT.ps
%3 j
%F Declerck:1997:IBT
%X This paper describes various uses of the Text Handling to Linguistic Structure (TH-LS) component of the Advanced Linguistic Engineering Platform (ALEP). Basically, the Text Handling (TH) subsystem of ALEP performs a conversion of the input string to a SGML text. The TH-LS component consists in a set of so-called 'tsls' rules defining a mapping between textual structures (TS) and (partial) linguistic descriptions (PLS). The instantiated PLS are the input for the linguistic parser, dealing with linguistic structures (LS). I show how an adequate use of the TH-LS interface permits the modularization of the lingware and the definition of subgrammars, from morpheme level to the whole text, taking into consideration both processing steps and levels of grammar descritpion. The TH subsystem of ALEP also foresees the +tag for user-supplied markup. An intensive use of this possibility and also the integration of information delivered by a PoS tagger into the TH component allowed both a substantial extension of the coverage and a significant improvement of the efficiency of the ALEP-based grammars, the parser getting as an input linguistically enriched PLS.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/declerck97_dalf.ps.gz


%0 Conference Proceedings
%A Declerck, Thierry
%D 2001
%T Extending NLP Tools Repositories for the Interaction with Language Data Resources Repositories
%B Proceedings of the ACL/ EACL Workshop on Sharing Tools and Resources, July 7
%C Toulouse, France
%! Extending NLP Tools Repositories for the Interaction with Language Data Resources Repositories
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/aclnlp01_dec.entry
%2 Declerck:2001:ENT.pdf Declerck:2001:ENT.ps
%3 j
%F Declerck:2001:ENT
%X This short paper presents some motivations behind the organization of the ACL/EACL01 "Workshop on Sharing Tools and Resources for Research and Education", concentrating o n the possible connection of Tools and Resources repositories. Taking some papers print ed in this volume and the ACL Natural Language Software Registry as a basis, we outline some of the steps to be done on the side of NLP tool repositories in order to achieve this goal.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/aclnlp01_dec.ps.gz


%0 Conference Proceedings
%A Declerck, Thierry
%A Jachmann, Alexander Werner
%A Uszkoreit, Hans
%D 2000
%T The New Edition of the Natural Language Software Registry (an Initiative of ACL hosted at DFKI)
%B Proceedings of the 2nd International Conference on Language Resources and Evaluation (LREC'00), May 31 - June 2
%C Athens, Greece
%I ELRA
%! The New Edition of the Natural Language Software Registry (an Initiative of ACL hosted at DFKI)
%2 Declerck:2000:NEN.pdf Declerck:2000:NEN.ps
%3 j
%F Declerck:2000:NEN
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/lrec00_reg.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/lrec00_reg.entry


%0 Conference Proceedings
%A Declerck, Thierry
%A Klein, Judith
%D 1997
%T Ein Email-Korpus zur Entwicklung und Evaluierung der Analysekomponente eines Terminvereinbarungssystems
%B 6. Fachtagung der Sektion Computerlinguistik der Deutschen Gesellschaft für Sprachwissenschaft (DGfS/CL 97): Integrative Ansätze in der Computerlinguistik, 08.-10. Oktober
%C Heidelberg, Germany
%! Ein Email-Korpus zur Entwicklung und Evaluierung der Analysekomponente eines Terminvereinbarungssystems
%2 Declerck:1997:EKE.pdf Declerck:1997:EKE.ps
%3 j
%F Declerck:1997:EKE
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/klein97_dgfs.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/klein97_dgfs.entry


%0 Conference Proceedings
%A Declerck, Thierry
%A Klein, Judith
%D 1997
%T Semantic Tagging and NLP Applications
%B Proceedings of the SIGLEX Workshop: Tagging Text with Lexical Semantics, April 4-5
%C Washington D. C., USA
%! Semantic Tagging and NLP Applications
%3 j
%F Declerck:1997:STN


%0 Conference Proceedings
%A Declerck, Thierry
%A Klein, Judith
%A Neumann, Günter
%D 1998
%T Evaluation of the NLP Components of an Information Extraction System for German
%E Rubio, Antonio
%E Gallardo, Natividad
%E Castro, Rosa
%E Tejada, Antonio
%B Proceedings of the 1st International Conference on Language Resources and Evaluation (LREC'98), May 28-30
%C Granada, Spain
%V 1
%P 293-297
%! Evaluation of the NLP Components of an Information Extraction System for German
%2 Declerck:1998:ENC.pdf Declerck:1998:ENC.ps
%3 j
%F Declerck:1998:ENC
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/lrec-conf98.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/lrec-conf98.entry


%0 Conference Proceedings
%A Declerck, Thierry
%A Maas, Heinz Dieter
%D 1997
%T The Integration of a Part-of-Speech Tagger into the ALEP Platform
%B Proceedings of the 3rd ALEP User Group Workshop, March 6-7
%C Saarbrücken, Germany
%! The Integration of a Part-of-Speech Tagger into the ALEP Platform
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dieter_aug_1997.entry
%2 Declerck:1997:IPS.pdf Declerck:1997:IPS.ps
%3 j
%F Declerck:1997:IPS
%X We describe how part-of-speech information delivered by a tagger (the Mpro tool) has been integrated into the ALEP (Advanced Language Engineering Platform) system. For this we extended an approach described within the LS-GRAM project, which consisted in defining the Text Handling component of ALEP in such a way that so-called "messy details" are handled within this subsystem, hence keeping the (linguistic) parser free from such tasks. We just extended the tagging strategy used for this purpose to normal words and modified the default tagging of words proposed by the ALEP system in order to incorporate information delivered by the part-of-speech tagger. The resulting tagging is converted by means of "lift" rules into partial linguistic descriptions, which provide the direct input to the grammatical analysis. We show that this procedure substantially reduces the parse times of the system.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dieter_aug_1997.ps.gz


%0 Conference Proceedings
%A Declerck, Thierry
%A Neumann, Günter
%D 2000
%T Using a Parameterizable and Domain-Adaptive Information Extraction System for Annotating Large-Scale Corpora?
%B Proceedings of the Pre-Conference Workshop "Information Extraction meets Corpus Linguistics", May 30
%C Athens, Greece
%! Using a Parameterizable and Domain-Adaptive Information Extraction System for Annotating Large-Scale Corpora?
%2 Declerck:2000:UPD.pdf Declerck:2000:UPD.ps
%3 j
%F Declerck:2000:UPD
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/IE-Corpus00_dec.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/IE-Corpus00_dec.entry


%0 Conference Proceedings
%A Declerck, Thierry
%A Neumann, Günter
%D 2001
%T A Cascaded Shallow Approach to Reference Resolution
%B Proceedings of the EuroConference on Recent Advances in NLP (RANLP'01), September 5-7
%C Tzigov Chark, Bulgaria
%! A Cascaded Shallow Approach to Reference Resolution
%2 Declerck:2001:CSA.pdf Declerck:2001:CSA.ps
%3 j
%F Declerck:2001:CSA
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/rrm-ranlp.ps.gz


%0 Conference Proceedings
%A Declerck, Thierry
%A Ramírez Bustamante, Flora
%A Sánchez León, Fernando
%D 1997
%T Grammar Checking and Preprocessing in ALEP
%B 3rd ALEP User Group Workshop, March 6-7
%C Saarbrücken, Germany
%! Grammar Checking and Preprocessing in ALEP
%3 j
%F Declerck:1997:GCP


%0 Conference Proceedings
%A Declerck, Thierry
%A Rieder, Sibylle
%A Schmidt, Paul
%A Theofilidis, Axel
%D 1995
%T Integration grammatischer Komponenten und Organisation des Lexikons in ALEP
%B Deutschen Gesellschaft für Sprachwissenschaft (DGfS/CL 95)
%C Düsseldorf, Germany
%! Integration grammatischer Komponenten und Organisation des Lexikons in ALEP
%3 j
%F Declerck:1995:IGK


%0 Conference Proceedings
%A Declerck, Thierry
%A Schmidt, Paul
%A Rieder, Sibylle
%A Theofilidis, Axel
%D 1996
%T Lean Formalism, Linguistic Theory, and Applications. Grammar Development in ALEP
%B Proceedings of the 16th International Conference on Computational Linguistics (COLING'96), August 5-9
%C Copenhagen, Danmark
%P 286-291
%! Lean Formalism, Linguistic Theory, and Applications. Grammar Development in ALEP
%2 Declerck:1996:LFL.pdf Declerck:1996:LFL.ps
%3 j
%F Declerck:1996:LFL
%X This paper describes results achieved in a project which addresses the issue of how the gap between unificationbased grammars as a scientific concept and real world applications can be narrowed down 1 . Applicationoriented grammar development has to take into account the following parameters: 
Efficiency: The project chose a so called 'lean' formalism, a termencodable language providing efficient term unification, ALEP. 
Coverage: The project adopted a corpusbased approach. 
Completeness: All modules needed from text handling to semantics must be there. 
The paper reports on a text handling component, Two Level morphology, word structure, phrase structure, semantics and the interfaces between these components. Mainstream approach: The approach claims to be mainstream, very much indebted to HPSG, thus based on the currently most prominent and recent linguistic theory. The relation (and tension) between these parameters are described in this paper.
%U http://www.iai.uni-sb.de/LS-GRAM/coling.ps.gz http://www.dfki.de/dfkibib/publications/docs/Declerck_1996_LFLTA.pdf


%0 Conference Proceedings
%A Declerck, Thierry
%A Theofilidis, Axel
%A Schmidt, Paul
%D 1997
%T Grammar Modularization for Efficient Processing: Language Engineering Devices and their Instantiation
%B Proceedings of the 6. Fachtagung der Sektion Computerlinguistik der Deutschen Gesellschaft für Sprachwissenschaft (DGfS/CL 97): Integrative Ansätze in der Computerlinguistik, 8.-10. Oktober
%C Heidelberg, Germany
%! Grammar Modularization for Efficient Processing: Language Engineering Devices and their Instantiation
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dgfs_alep_1997.entry
%2 Declerck:1997:GME.pdf Declerck:1997:GME.ps
%3 j
%F Declerck:1997:GME
%X This paper describes how unification-based grammar development benefits from a modularization methodology resulting in significant efficiency gains without giving up recognized advantages of unification grammars. Gains in efficiency are of such a scale that an industrial deployment of unification grammars seems to become realistic. We introduce a number of devices provided by the ALEP system which support grammar modularization at an operational level, and we illustrate how these devices have been instantiated in the grammatical resources developed in the LS-GRAM project. We conclude with drawing a prospective scenario of modular grammars serving industrial applications.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dgfs_alep_1997.ps.gz


%0 Conference Proceedings
%A Declerck, Thierry
%A Wittenburg, Peter
%D 2001
%T XML and NLP: Their Interaction and their Role for HLT Applications
%B Proceedings of the 1st NLP and XML Workshop, November 30
%C Tokyo, Japan
%! XML and NLP: Their Interaction and their Role for HLT Applications
%2 Declerck:2001:XNT.pdf Declerck:2001:XNT.ps
%3 j
%F Declerck:2001:XNT
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nlprs01_dec.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nlprs01_dec.entry


%0 Conference Proceedings
%A Declerck, Thierry
%A Wittenburg, Peter
%D 2001
%T MUMIS - A Multimedia Indexing and Searching Environment
%B 1st International Workshop on MultiMedia Annotation (MMA '01), January 30-31
%C Tokyo, Japan
%! MUMIS - A Multimedia Indexing and Searching Environment
%2 Declerck:2001:MMI.pdf Declerck:2001:MMI.ps
%3 j
%F Declerck:2001:MMI
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mma01_dec.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mma01_dec.entry


%0 Conference Proceedings
%A Declerck, Thierry
%A Wittenburg, Peter
%A Cunningham, Hamish
%D 2001
%T The Automatic Generation of Formal Annotations in a Multimedia Indexing and Searching Environment
%B Proceedings of the ACL/ EACL Workshop on Human Language Technology and Knowledge Management, July 6-7
%C Toulouse, France
%! The Automatic Generation of Formal Annotations in a Multimedia Indexing and Searching Environment
%2 Declerck:2001:AGF.pdf Declerck:2001:AGF.ps
%3 j
%F Declerck:2001:AGF
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/aclhlt01_dec.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/aclhlt01_dec.entry


%0 Conference Proceedings
%A Dent, Lisa
%A Boticario, Jesus
%A McDermott, John
%A Mitchell, Tom
%A Zabowski, David
%D 1992
%T A Personal Learning Apprentice
%B 10th National Conference on Artificial Intelligence, July 12-16
%C San Jose, USA
%I AAAI Press
%P 96-103
%! A Personal Learning Apprentice
%F Dent:1992:PLA


%0 Journal Article
%A Devienne, Philippe 
%A Lebegue, Patrick
%A Parrain, Anne
%A Routier, Jean-Christophe
%A Würtz, Jörg
%D 1996
%T Smallest Horn Clause Programs
%B Journal of Logic Programming
%V 27
%N 3
%P 227-267
%! Smallest Horn Clause Programs
%2 Devienne:1996:SHC.pdf Devienne:1996:SHC.ps
%F Devienne:1996:SHC
%X The simplest non-trivial program pattern in logic programming is the following one : $$\left\{\begin{array}{l} p(\textit{fact})\leftarrow\\ p(\textit{left})\leftarrow p(\textit{right}).\\ \leftarrow p(\textit{goal}). \end{array}\right.\def\globble#1{}\gobble\}$$ where \textit{fact}, \textit{goal}, \textit{left} and \textit{right} are arbitrary terms. Because the well known \textit{append} program matches this pattern, we will denote such programs "\textit{append}-like". In spite of their simple appearance, we prove in this paper that termination and satisfiability (i.e the existence of answer-substitutions, called the \textit{emptiness problem}) for are undecidable. We also study some subcases depending on the number of occurrences of variables in \textit{fact}, \textit{goal}, \textit{left} or \textit{right}. Moreover, we prove that the computational power of \textit{append}-like programs is equivalent to the one of Turing machines ; we show that there exists an \textit{append}-like universal program. Thus, we propose an equivalent of the Böhm-Jacopini theorem for logic programming. This result confirms the expressiveness of logic programming. The proofs are based on program transformations and encoding of problems, unpredictable iterations within number theory defined by J.H. Conway or the Post correspondence problem.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/JLP96.ps.gz


%0 Report
%A Diagne, Abdel Kader
%A Kasper, Walter
%A Krieger, Hans-Ulrich
%D 1995
%T Distributed Parsing with HPSG Grammars
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-95-19
%! Distributed Parsing with HPSG Grammars
%3 j
%F Diagne:1995:DPH


%0 Conference Proceedings
%A Diagne, Abdel Kader
%A Nerbonne, John
%D 1992
%T Flexible Semantics Communication in Integrated Speech/ Language Architectures
%E Görz, G.
%B 1. Konferenz Verarbeitung natürlicher Sprache (KONVENS '92), 7.-9. Oktober
%C Nürnberg, Germany
%I Springer
%P 348-352
%! Flexible Semantics Communication in Integrated Speech/ Language Architectures
%F Diagne:1992:FSC


%0 Conference Proceedings
%A Dipper, Stefanie
%A Brants, Thorsten
%A Lezius, Wolfgang
%A Plaehn, Oliver
%A Smith, George
%D 2001
%T The TIGER Treebank
%B 3rd Workshop on Linguistically Interpreted Corpora (LINC '01), August 29
%C Leuven, Belgium
%! The TIGER Treebank
%2 Dipper:2001:TT.pdf Dipper:2001:TT.ps
%F Dipper:2001:TT
%U http://www.ims.uni-stuttgart.de/projekte/TIGER/paper/linc2001-abstract-tiger.ps.gz http://www.ims.uni-stuttgart.de/projekte/TIGER/paper/linc2001-abstract-tiger.pdf


%0 Conference Proceedings
%A Dörre, Jochen
%A Erbach, Gregor
%A Manandhar, Suresh
%A Skut, Wojciech
%A Uszkoreit, Hans
%D 1996
%T A Report on the Draft EAGLES Encoding Standard for HPSG
%B Proceedings of the 3rd International Conference on HPSG and Traitement Automatique du Langage Naturel (TALN'96), May 22-24
%C Marseille, France
%P 161-168
%! A Report on the Draft EAGLES Encoding Standard for HPSG
%2 Dorre:1996:RDE.pdf Dorre:1996:RDE.ps
%3 j
%F Dorre:1996:RDE
%U 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


%0 Conference Proceedings
%A Douglas-Cowie, Ellen
%A Cowie, Roddy
%A Schröder, Marc
%D 2000
%T A New Emotion Database: Considerations, Sources and Scope
%E Douglas-Cowie, Ellen
%E Cowie, Roddy
%E Schröder, Marc
%B Proceedings of the ISCA Workshop on Speech and Emotion: A Conceptual Framework for Research
%C Belfast
%I Textflow
%P 39-44
%! A New Emotion Database: Considerations, Sources and Scope
%1 http://www.dfki.de/~schroed/
%2 Douglas-Cowie:2000:NED.pdf
%3 j
%F Douglas-Cowie:2000:NED
%X Research on the expression of emotion is underpinned by databases. Reviewing available resources persuaded us of the need to develop one that prioritised ecological validity. The basic unit of the database is a clip, which is an audiovisual recording of an episode that appears to be reasonably selfcontained. Clips range from 10 -- 60 secs, and are captured as MPEG files. They were drawn from two main sources. People were recorded discussing emotive subjects either with each other, or with one of the research team. We also recorded extracts from television programs where members of the public interact in a way that at least appears essentially spontaneous. Associated with each clip are two additional types of file. An audio file (.wav format) contains speech alone, edited to remove sounds other than the main speaker. An interpretation file describes the emotional state that observers attribute to the main speaker, using the FEELTRACE system to provide a continuous record of the perceived ebb and flow of emotion. Clips have been extracted for 100 speakers, with at least two for each speaker (one relatively neutral and others showing marked emotions of different kinds).
%U http://www.dfki.de/~schroed/articles/douglascowieetal2000.pdf


%0 Conference Proceedings
%A Duchier, Denys
%D 1999
%T Axiomatizing Dependency Parsing using Set Constraints
%B 6th Meeting on Mathematics of Language (MOL6), July 23-25
%C Orlando, Florida, USA
%P 115-126
%! Axiomatizing Dependency Parsing using Set Constraints
%2 Duchier:1999:ADP.pdf Duchier:1999:ADP.ps
%F Duchier:1999:ADP
%X We propose a new formulation of dependency grammar and develop a corresponding axiomatization of syntactic well-formedness with a natural reading as a concurrent constraint program. We demonstrate the expressivity and effectiveness of set constraints, and describe a treatment of ambiguity with wide applicability. Further, we provide a constraint programming account of dependent disjunctions that is both simple and efficient and additionally provides the benefits of constructive disjunctions. Our approach was implemented in Oz and yields parsers with very good performance for our currently middle scale grammars. Constraint propagation can be observed to be remarkably effective in pruning the search space.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/duchier-mol6.ps.gz


%0 Conference Proceedings
%A Duchier, Denys
%D 1999
%T Set Constraints in Computational Linguistics - Solving Tree Descriptions
%B Workshop on Declarative Programming with Sets (DPS '99), September 28
%C Paris, France
%P 91-98
%! Set Constraints in Computational Linguistics - Solving Tree Descriptions
%2 Duchier:1999:SCC.pdf Duchier:1999:SCC.ps
%F Duchier:1999:SCC
%X We describe our application of set constraints to the problem of finding solutions of tree descriptions. The encoding that turns a description into a CSP is given here in full in an axiomatic style.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/duchier-wdps99.ps.gz


%0 Conference Proceedings
%A Duchier, Denys
%D 2000
%T A Model-Eliminative Treatment of Quantifier-Free Tree Descriptions
%E Heylen, D.
%E Nijholt, A.
%E Scollo, G.
%B Algebraic Methods in Language Processing (AMILP '00). 16th Twente Workshop on Language Technology (TWLT 16) and 2nd AMAST Workshop, May 20-22
%C Iowa City, Iowa, USA
%P 55-66
%! A Model-Eliminative Treatment of Quantifier-Free Tree Descriptions
%2 Duchier:2000:MET.pdf Duchier:2000:MET.ps
%F Duchier:2000:MET
%X Tree descriptions are widely used in computational linguistics for talking and reasoning about trees. For practical applications, it is essential to be able to decide satisfiability and enumerate solutions efficiently. This challenge cannot realistically be met by brute force enumeration. However it can be addressed very effectively by constraint propagation as provided by modern constraint technology. Previously, we studied the conjunctive fragment of tree descriptions and showed how the problem of finding minimal models of a conjunctive tree description could be transformed into a constraint satisfaction problem (CSP) on finite set variables. In this paper, we extend our account to the fragment that admits both negation and disjunction, but still leaves out quantification. Again we provide a reduction to a CSP. While our previous encoding introduced the reader to set constraints and disjunctive propagators, we now extend our arsenal with selection propagators.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/duchier-amilp.ps.gz


%0 Conference Proceedings
%A Duchier, Denys
%D 2000
%T Constraint Programming for Natural Language Processing
%B European Summer School in Logic, Language, and Information (ESSLLI '00), August 6-18
%C Birmingham, England
%! Constraint Programming for Natural Language Processing
%2 Duchier:2000:CPN.pdf Duchier:2000:CPN.ps
%F Duchier:2000:CPN
%X This course demonstrates how constraint programming can be used effectively in practice, for linguistic applications. It shows how many forms of ambiguity arising in linguistic can be represented compactly and elegantly, and processed efficiently with constraints. A key idea to derive the most benefit from constraint propagation is that intended models should be characterized as solutions of \emph{Constraint Satisfaction Problems} (CSPs) rather than defined inductively or in a generative fashion. We examine several topics in detail: encodings of finite domains, tree descriptions using dominance constraints, and parsing with dependency grammars. In each case, we present a formal characterization of the problem as a CSP and illustrate how to derive a corresponding constraint program. The course includes 4 complete interactive applications written in Oz, with full code supplied. Through these programmatic vignettes the reader is exposed to the practice of constraint programming with \emph{finite domain} and \emph{finite set} variables, and introduced to some of the more powerful types of constraints available today, such as reified constraints, disjunctive propagators, and selection constraints.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/duchier-esslli2000.ps.gz


%0 Journal Article
%A Duchier, Denys
%D 2002
%T Dominance Constraints with Boolean Connectives: A Model-Eliminative Treatment
%B Journal of Theoretical Computer Science
%V 293
%N 2
%P 321-343
%! Dominance Constraints with Boolean Connectives: A Model-Eliminative Treatment
%2 Duchier:2002:DCB.pdf Duchier:2002:DCB.ps
%F Duchier:2002:DCB
%X Dominance constraints are a language of tree descriptions. Tree descriptions are widely used in computational linguistics for talking and reasoning about trees. While previous research has focused on the conjunctive fragment, we now extend the account to all Boolean connectives and propose a new formalism that combines dominance constraints with a feature tree logic. Although the satisfiability problem in the conjunctive fragment is known to be NP-complete, we have previously demonstrated that it can be addressed very effectively by constraint propagation: we developed an encoding that transforms a dominance constraint into a constraint satisfaction problem on finite sets solvable by constraint programming. We present a generalization of this encoding for our more expressive formalism, and prove soundness and completeness. Our main contribution is a treatment of disjunction suitable for constraint propagation.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/duchier-dcbc2000.ps.gz


%0 Report
%A Duchier, Denys
%A Gardent, Claire
%D 1998
%T A constraint-based treatment of descriptions
%C Saarbrücken
%I Universität des Saarlandes
%P 15
%S CLAUS-Report
%7 105
%8 November
%! A constraint-based treatment of descriptions
%2 Duchier:1998:CBT.pdf Duchier:1998:CBT.ps
%F Duchier:1998:CBT
%X Both in computational linguistics and in formal semantics, descriptions have been used which are stated in terms of dominance . Yet the issue of how such descriptions are processed has been little explored. In this paper, we present a constraint-based treatment of descriptions and apply it to the description-based treatment of discourse advocated in Gardent and Webber 1998.
%U ftp://ftp.coli.uni-sb.de/pub/people/claire/constraints.ps


%0 Conference Proceedings
%A Duchier, Denys
%A Gardent, Claire
%D 1999
%T A Constraint-Based Treatment of Descriptions
%E Bunt, H.
%E Thijsse, E.
%B 3rd International Workshop on Computational Semantics (IWCS 3), January 13-15
%C Tilburg, The Netherlands
%P 71-85
%! A Constraint-Based Treatment of Descriptions
%2 Duchier:1999:CBT.pdf Duchier:1999:CBT.ps
%F Duchier:1999:CBT
%X Both in computational linguistics and in formal semantics, tree (or graph) descriptions stated in terms of <i>dominance</i> have become common. Yet the issue of how such descriptions are processed has been little explored. In this paper, we present a constraint-based treatment of descriptions: we develop a formulation in terms of sets, which is simple and declarative, and, at the same time, constitutes an efficient implementation. We further show how the treatement of tree descriptions can be extended to DAG descriptions and apply it to a description-based account of discourse.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/iwcs99.ps.gz


%0 Book Section
%A Duchier, Denys
%A Gardent, Claire
%D 2001
%T Tree Descriptions, Constraints and Incrementality
%E Bunt, H.
%E Muskens, R.
%E Thijsse, E.
%B Computing Meaning, Volume 2
%C Dordrecht
%I Kluwer Academic Publishers
%V 77
%P 205-227
%S Studies In Linguistics And Philosophy
%! Tree Descriptions, Constraints and Incrementality
%2 Duchier:2001:TDC.pdf Duchier:2001:TDC.ps
%F Duchier:2001:TDC
%X In \textit{A Constraint-Based Treatment of Descriptions}, we presented a constraint-based method for enumerating the models satisfying a given tree description and described its application to the underspecified semantic representation of discourse advocated by Gardent \\& Webber (1998). In this paper, we indicate how the approach may be further extended to support discourse level \textit{incremental} processing. \textbf{Keywords:} incremental processing, underspecified representations, tree descriptions, dominance constraints, constraint programming, discourse semantics.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/iwcs3-book.ps.gz


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


%0 Conference Proceedings
%A Duchier, Denys
%A Niehren, Joachim
%D 2000
%T Dominance Constraints with Set Operators
%E Lloyd, J.
%E Dahl, V.
%B 1st International Conference on Computational Logic (CL '00), July 24-28
%C Imperial College, London, UK
%I Springer
%P 326-341
%S Lecture Notes in Computer Science
%7 1861
%! Dominance Constraints with Set Operators
%2 Duchier:2000:DCS.pdf Duchier:2000:DCS.ps
%F Duchier:2000:DCS
%X Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by admitting set operators. Set operators contribute a controlled form of disjunction that is emminently well-suited for constraint propagation. We present a solver for dominance constraints with set operators as a system of abstract propagation and distribution rules, and prove its soundness and completeness. We then derive an efficient implementation in a constraint programming language with finite sets and prove its faithfullness to the abstract inference rules.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/dombool.ps.gz


%0 Conference Proceedings
%A Duchier, Denys
%A Thater, Stefan
%D 1999
%T Parsing with Tree Descriptions: A Constraint-Based Approach
%B 6th International Workshop on Natural Language Understanding and Logic Programming (NLULP '99), December 3-4
%C Las Cruces, New Mexico, USA
%P 17-32
%! Parsing with Tree Descriptions: A Constraint-Based Approach
%2 Duchier:1999:PTD.pdf Duchier:1999:PTD.ps
%F Duchier:1999:PTD
%X We describe a grammatical formalism based on tree descriptions and develop a constraint-based treatment of parsing in that framework. We introduce the language of electrostatic tree descriptions to write lexical entries: these are tree descriptions using neutral, as well as positively and negatively charged variables. We develop an appropriate notion of model. We then extend the framework to disjunctive systems of electrostatic descriptions, and we correspondingly extend the notion of model. Then we show how the search for minimal models can be realized by reduction to a CSP solvable by constraint programming and we provide the full encoding in an axiomatic style.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/duchier-thater-nlulp99.ps.gz


%0 Conference Proceedings
%A Dünges, Petra
%D 1998
%T Eventualities in Time
%E Kudlek, M.
%B 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS '98). Workshop on Mathematical Linguistics, August 24-28
%C Brno, Czech Republic
%P 51-60
%! Eventualities in Time
%1 copyright/duenges:1998b.ps
%F Dunges:1998:ETa
%X This paper addresses the general question of how eventualities should be localized in time. The answer given here is mainly inspired by the model theory of Discourse Representation Theory (DRT) as presented in From Discourse to Logic by Kamp and Reyle. We show that there is a mathematical problem concerning the localization function used in that book. And we propose a remedy for this problem. The general picture that emerges should be interesting not only for DRT but for other theories using an eventuality-based semantics as well.


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


%0 Journal Article
%A Dünges, Petra
%D 2001
%T Eventualities in Time - The Localization of Eventualities in the Platonist and the Reductionist Picture of Time
%B Grammars
%V 4
%N 1
%P 69-83
%! Eventualities in Time - The Localization of Eventualities in the Platonist and the Reductionist Picture of Time
%1 copyright/duenges:2001a.ps
%F Dunges:2001:ETL
%X This paper addresses the general question of how eventualities should be localized in time. The answer given here is mainly inspired by the model theory of Discourse Representation Theory (DRT) as presented in From Discourse to Logic by Kamp and Reyle. We show that there is a mathematical problem concerning the localization function used in that book. And we propose a remedy for this problem. The general picture that emerges should be interesting not only for DRT but for other theories using an eventuality-based semantics as well. For related questions see the CLAUS report 104 Eventualities in Time at http://www.coli.uni-sb.de/.
%O This paper has been printed before in Grammars 3(1):21-35, 2000. It was incorrectly printed, however, and so a corrected reprint took place


%0 Conference Proceedings
%A Düsterhöft, Antje
%A Neumann, Günter
%A Becker, Markus
%A Bedersdorfer, Jochen
%A Bruder, Ilvio
%D 2000
%T GETESS: Constructing a Linguistic Search Index for an Internet Search Engine
%B Proceedings of the 5th International Conference on Applications of Natural Language to Information Systems (NLDB'00), June
%C Versailles, France
%! GETESS: Constructing a Linguistic Search Index for an Internet Search Engine
%2 Dusterhoft:2000:GCL.pdf Dusterhoft:2000:GCL.ps
%3 j
%F Dusterhoft:2000:GCL
%X In this paper we illustrate how Internet documents can be automatically analyzed in order to capture the content of a document in a more detailed way than usually. The result of the document analysis is called abstract and will be used as a linguistic search index for the Internet search engine GETESS. We show how the linguistic analysis system SMES can be used for a Harvest based search engine for constructing a linguistic search index. Further, we denote how the linguistic index can be exploited for answeringuser search inqueries.
%U http://www.dfki.de/~neumann/publications/new-ps/nldb-ohne.ps.gz


%0 Conference Proceedings
%A Eberle, Kurt
%A Kasper, Walter
%D 1989
%T Tenses as Anaphora
%E ACL
%B 4th Conference of the European Chapter of the Association for Computational Linguistics, April 10-12
%C University of Manchester Institute of Science and Technology, Manchester, UK
%P 43-50
%! Tenses as Anaphora
%3 j
%F Eberle:1989:TA


%0 Book
%A Eckert, Hartwig
%A Barry, William J.
%D 2002
%T The Phonetics and Phonology of English Pronunciation. A Coursebook with CD-Rom
%C Trier
%I Wissenschaftlicher Verlag Trier (WVT)
%P 289
%! The Phonetics and Phonology of English Pronunciation. A Coursebook with CD-Rom
%F Eckert:2002:PPE
%X This self-study book takes the reader on a journey of discovery into the areas of pronunciation, phonetics, and phonology; places where students have often lost their way – and their motivation. The book is structured in the way people learn: Examples and immediate practice in the spoken and written medium illustrate and consolidate newly acquired linguistic knowledge, improving and strengthening listening and pronunciation skills, and raising language awareness. Since hard work without motivating support is difficult to sustain, the relative importance and usefulness of the different phonetic phenomena are explained, and pictures, cartoons, jokes, old and new limericks and dialogues are used to raise and maintain students' interest and help them to remember important distinctions in a complex subject matter which is not always immediately accessible to the uninitiated. As the table of contents reveals, the book has a highly modularized structure, which is suited to selective remedial practice, and helps in the revision of particular problem areas. There is a great variety of exercises – ear-training, discrimination exercises, problem solving, phonetic transcription, etc. – for beginners and advanced students. Solutions are provided at the end of the book, and there is an index for quick reference to technical terms. The file structure of the CD-ROM facilitates quick access to any exercise in any order.


%0 Conference Proceedings
%A Egg, Markus
%D 1996
%T Aspect and Quantification: An Iterative Approach
%E Dekker, P.
%E Stokhof, M.
%B 10th Amsterdam Colloquium
%C Amsterdam, The Netherlands
%P 203-221
%! Aspect and Quantification: An Iterative Approach
%F Egg:1996:AQI


%0 Conference Proceedings
%A Egg, Markus
%D 1996
%T Conditions on Reinterpretations of aktionsart
%E Kolb, J.
%E v. Stechow, A.
%E Hamm, F.
%B Workshop on Recent Developments in the Theory of Natural Language Semantics
%C Tübingen, Germany
%S SfS-Report
%7 08-95
%! Conditions on Reinterpretations of aktionsart
%F Egg:1996:CRA


%0 Journal Article
%A Egg, Markus
%D 1998
%T Wh-Questions in Underspecified Minimal Recursion Semantics
%B Journal of Semantics
%V 15
%P 37-82
%! Wh-Questions in Underspecified Minimal Recursion Semantics
%F Egg:1998:WQU
%X In this paper, I present Underspecified Minimal Recursion Semantics (UMRS), a representation language that represents structural ambiguities in terms of underspecification. It is argued that this kind of approach allows for transparent semantic representations and a straightforward syntax-semantics interface. UMRS is a semantic metalanguage, whose expressions describe expressions of an object language and (possibly underspecified) dependences between them. The potential of UMRS will be illustrated by employing it as the semantic component of an HPSG description of wh-questions.


%0 Conference Proceedings
%A Egg, Markus
%D 1999
%T Derivation and Resolution of Ambiguities in Wieder-Sentences
%E Dekker, P.
%B 12th Amsterdam Colloquium
%C Amsterdam, The Netherlands
%I ILLC
%P 109-114
%! Derivation and Resolution of Ambiguities in Wieder-Sentences
%F Egg:1999:DRA


%0 Thesis
%A Egg, Markus
%D 2000
%T Flexible Semantic Construction: The Case of Reinterpretation
%C Saarbrücken
%I Universität des Saarlandes,  Department of Computational Linguistics
%! Flexible Semantic Construction: The Case of Reinterpretation
%F Egg:2000:FSC


%0 Book Section
%A Egg, Markus
%D 2000
%T Reinterpretation from a Synchronic and Diachronic Point of View
%E Eckardt, R.
%E von Heusinger, K.
%B Meaning Change - Meaning Variation, vol.2. Arbeitspapier Nr. 106
%C Konstanz
%I FG Sprachwissenschaft, Universität Konstanz
%! Reinterpretation from a Synchronic and Diachronic Point of View
%2 Egg:2000:RSD.pdf Egg:2000:RSD.ps
%F Egg:2000:RSD
%X Frequently an utterance can only be understood if one integrates additional material into its meaning, which mediates between semantically conflicting parts of the utterance. This process is known as reinterpretation. From a synchronic viewpoint, it is a 'creative' or 'dynamic' aspect of natural language, to be described and integrated in a formal description of natural language semantics. But reinterpretation phenomena can also be regarded as a gateway for linguistic change, since they may get conventionalized and thus enlarge the domain of compositional semantics. Analyzing reinterpretation will therefore also provide insights into mechanisms of linguistic change. The proposed account of reinterpretation goes as follows. Semantic construction yields ambiguous structures for reinterpretation cases, which are then monotonically enriched with information from extralinguistic sources (e.g. world knowledge). Semantic ambiguities are described in the framework of underspecification. This account of reinterpretation allows a straightforward modelling of its synchronic and diachronic aspects.
%U http://www.coli.uni-sb.de/cl/projects/chorus/papers/egg99.ps.gz


%0 Book Section
%A Egg, Markus
%D 2002
%T Beginning Novels and Finishing Hamburgers - Remarks on the Semantics of to begin
%E Dölling, Johannes
%E Zybatow, Tatjana
%B Ereignisstrukturen
%C Leipzig
%I Universität Leipzig
%V 76
%S Linguistische Arbeitsberichte
%! Beginning Novels and Finishing Hamburgers - Remarks on the Semantics of to begin
%F Egg:2002:BNF
%X Verbs like begin may take either a VP or an NP complement, but their meaning is pretty similar in both cases, e.g., for begin, the start of an eventuality is at stake. Pustejovsky's approach captures this similarity in terms of an invariant meaning of the verb, which entails a process of reinterpretation for the transitive variant of the verb. I will show that while the intuitions of this proposal are on the right track, its actual implementation suffers from a number of shortcomings. I will offer an analysis that preserves Pustejovsky's intuition but avoids these shortcomings. My analysis is based on an appropriate underspecifcation formalism.
%O Sumitted


%0 Journal Article
%A Egg, Markus
%D 2002
%T Semantic Construction for Reinterpretation Phenomena
%B Linguistics
%V 40
%P 579-609
%! Semantic Construction for Reinterpretation Phenomena
%F Egg:2002:SCR


%0 Conference Proceedings
%A Egg, Markus
%A Erk, Katrin
%D 2002
%T A Compositional Account of VP Ellipsis
%E Van Eynde, Frank 
%E Hellan, Lars
%E Beermann, Dorothee
%B Proceedings of the 8th International Conference on Head-Driven Phrase Structure Grammar, August 3-5
%C Stanford
%I CSLI Publications
%P 162-179
%! A Compositional Account of VP Ellipsis
%2 Egg:2002:CAV.pdf Egg:2002:CAV.ps
%F Egg:2002:CAV
%X We present an approach to VP ellipsis that allows the direct derivation of source and target sentences (the former need not be unique) during semantic construction.  Specific syntactic constituent structures are associated with ellipsis potential, which can then be discharged by pro-verbs like 'did (too)'. The determination of source and target sentence, which is done with semantic features in an HPSG framework, is coupled with a comprehensive analysis of ellipsis, which also handles its interaction with scope and anaphora.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/ellhpsg01.ps.gz


%0 Journal Article
%A Egg, Markus
%A Gardent, Claire
%A Kohlhase, Michael
%D 1998
%T Steuerung der Inferenz in der Diskursverarbeitung
%B Kognitionswissenschaft
%V 7
%P 106-110
%! Steuerung der Inferenz in der Diskursverarbeitung
%F Egg:1998:SID
%X Semantic interpretation is an essential component of natural language understanding which draws on extremely efficient language-based inference techniques. Such techniques are still lacking in computational systems for natural language processing. We have investigated specialized representation formalisms and suitable inference techniques that meet some of these desiderata. We have developed higher-order inference procedures to accurately represent linguistic ambiguities in terms of underspecification, and show how these procedures can be guided by information from other linguistic strata.


%0 Conference Proceedings
%A Egg, Markus
%A Kohlhase, Michael
%D 1997
%T Underspecification of Quantifier Scope
%B 6. Fachtagung der Sektion Computerlinguistik der Deutschen Gesellschaft für Sprachwissenschaft, 08.-10. Oktober
%C Heidelberg, Germany
%! Underspecification of Quantifier Scope
%F Egg:1997:UQS


%0 Conference Proceedings
%A Egg, Markus
%A Kohlhase, Michael
%D 1997
%T Dynamic Control of Quantifier Scope
%E Dekker, P.
%B 11th Amsterdam Colloquium
%C Amsterdam, The Netherlands
%I ILLC
%! Dynamic Control of Quantifier Scope
%F Egg:1997:DCQ


%0 Journal Article
%A Egg, Markus
%A Koller, Alexander
%A Niehren, Joachim
%D 2001
%T The Constraint Language for Lambda Structures
%B Journal of Logic, Language, and Information
%V 10
%N 4
%P 457-485
%! The Constraint Language for Lambda Structures
%2 Egg:2001:CLL.pdf Egg:2001:CLL.ps
%F Egg:2001:CLL
%U http://www.coli.uni-sb.de/~koller/papers/clls.ps.gz


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


%0 Conference Proceedings
%A Egg, Markus
%A Niehren, Joachim
%A Ruhrberg, Peter
%A Xu, Feiyu
%D 1998
%T Constraints over Lambda-Structures in Semantic Underspecification
%E ACL
%B 17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association for Computational Linguistics (COLING-ACL'98), August 10-14
%C Montréal, Québec, Canada
%I Morgan Kaufmann Publishers
%V 1
%P 353-359
%! Constraints over Lambda-Structures in Semantic Underspecification
%2 Egg:1998:CLSb.pdf Egg:1998:CLSb.ps
%3 j
%F Egg:1998:CLSb
%X We introduce a first-order language for semantic underspecification that we call Constraint Language for Lambda-Structures (CLLS). A lambda-structure can be considered as a lambda-term up to consistent renaming of bound variables (alpha-equality); a constraint of CLLS is an underspecified description of a $\lambda$-structure. CLLS solves a capturing problem omnipresent in underspecified scope representations. CLLS features constraints for dominance, lambda binding, parallelism, and anaphoric links. Based on CLLS we present a simple, integrated, and underspecified treatment of scope, parallelism, and anaphora.
%U http://www.dfki.de/~feiyu/CLLS-98.pdf ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/COLING-feiyu-98.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/COLING-feiyu-98.entry


%0 Journal Article
%A Egg, Markus
%A Pinkal, Manfred
%A Pustejovsky, James
%D 2001
%T Editorial
%B Journal of Logic, Language and Information (Special Issue on Underspecification)
%V 10
%N 4
%P 411-416
%! Editorial
%F Egg:2001:E


%0 Conference Proceedings
%A Eineborg, Martin
%A Gambäck, Björn
%D 1993
%T Back-Propagation Based Lexical Acquisition Experiments
%B 6th Workshop on Neural Networks and their Applications
%C Nimes, France
%P 169-178
%! Back-Propagation Based Lexical Acquisition Experiments
%F Eineborg:1993:BPB


%0 Conference Proceedings
%A Eineborg, Martin
%A Gambäck, Björn
%D 1993
%T Tagging Experiments using Neural Networks
%E Eklund, R.
%B 9th Scandinavian Conference on Computational Linguistics, June
%C Stockholm, Sweden
%P 71-81
%! Tagging Experiments using Neural Networks
%2 Eineborg:1993:TEU.pdf Eineborg:1993:TEU.ps
%F Eineborg:1993:TEU
%U www.sics.se/humle/papers/nodalida93_nn_abs.ps


%0 Report
%A Eineborg, Martin
%A Gambäck, Björn
%D 1994
%T Neural Networks for Wordform Recognition
%C Stockholm
%I SICS
%S Research Report
%7 R94:05
%8 February
%! Neural Networks for Wordform Recognition
%2 Eineborg:1994:NNW.pdf
%F Eineborg:1994:NNW
%U www.sics.se/libabstracts.html#R94-05


%0 Conference Proceedings
%A Eisele, Andreas
%A Ziegler-Eisele, Dorothea
%D 2001
%T Towards a Road Map on Human Language Technology: Natural Language Processing. Report on the Second Elsnet Roadmap Workshop
%! Towards a Road Map on Human Language Technology: Natural Language Processing. Report on the Second Elsnet Roadmap Workshop
%2 Eisele:2001:TRM.pdf
%3 j
%F Eisele:2001:TRM
%X This document summarizes contributions and discussions from two workshops that took place in November 2000 and July 2001. It presents some visions of NLP-related applications that may become reality within ten years from now. It investigates the technological requirements that must be met in order to make these visions realistic and sketches milestones that may help to measure our progress towards these goals.
%U http://utrecht.elsnet.org/roadmap/docs/rm-eisele-v2.pdf


%0 Report
%A Engelkamp, Judith
%A Erbach, Gregor
%A Uszkoreit, Hans
%D 1992
%T Handling Linear Precedence Constraints by Unification
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 19
%8 January
%! Handling Linear Precedence Constraints by Unification
%2 Engelkamp:1992:HLPa.pdf
%3 j
%F Engelkamp:1992:HLPa
%X 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.
%U http://www.coli.uni-sb.de/~erbach/pub/acl92/eeu-ACL92.pdf


%0 Conference Proceedings
%A Engelkamp, Judith
%A Erbach, Gregor
%A Uszkoreit, Hans
%D 1992
%T Handling Linear Precedence Constraints by Unification
%B Proceedings of the 30th Annual Meeting of the Association of Computational Linguistics, June 28 - July 2
%C Delaware, USA
%I ACL
%P 201-208
%! Handling Linear Precedence Constraints by Unification
%2 Engelkamp:1992:HLPb.pdf
%3 j
%F Engelkamp:1992:HLPb
%U http://www.coli.uni-sb.de/~erbach/pub/acl92/eeu-ACL92.pdf


%0 Book
%A Erbach, Gregor
%D 1986
%T Textverarbeitungsprogramme - heute und morgen
%B KMI Bürowirtschaft Lehre und Praxis
%C Darmstadt
%I Winklers Verlag
%! Textverarbeitungsprogramme - heute und morgen
%3 j
%F Erbach:1986:THM


%0 Master's Thesis
%A Erbach, Gregor
%D 1987
%T Maschinelle Syntaxanalyse des Deutschen, Englischen und Französischen auf Grundlage verschiedener Grammatikformalismen
%C Mainz
%I Johannes-Gutenberg Universität
%! Maschinelle Syntaxanalyse des Deutschen, Englischen und Französischen auf Grundlage verschiedener Grammatikformalismen
%3 j
%F Erbach:1987:MSD


%0 Report
%A Erbach, Gregor
%D 1990
%T Syntactic Processing of Unknown Words
%C Stuttgart
%I IBM
%S IWBS Report
%7 131
%! Syntactic Processing of Unknown Words
%3 j
%F Erbach:1990:SPUa


%0 Conference Proceedings
%A Erbach, Gregor
%D 1990
%T Syntactic Processing of Unknown Words
%E Jorrand, P.
%E Sgurev, V.
%B Artificial Intelligence IV - Methodology, Systems, Applications (AIMSA '90)
%C Amsterdam, The Netherlands
%P 371-382
%! Syntactic Processing of Unknown Words
%2 Erbach:1990:SPUb.pdf
%3 j
%F Erbach:1990:SPUb


%0 Report
%A Erbach, Gregor
%D 1990
%T Natural Language Understanding in LILOG: An Intermediate Overview
%C Stuttgart
%I IBM Deutschland GmbH
%P 43-47
%S IWBS Report
%7 137
%! Natural Language Understanding in LILOG: An Intermediate Overview
%3 j
%F Erbach:1990:NLU


%0 Report
%A Erbach, Gregor
%D 1990
%T Parsing
%E Geurts, B.
%B Natural Language Understanding in LILOG: An Intermediate Overview
%C Stuttgart
%I IBM Deutschland GmbH
%7 IWBS Report 137
%! Parsing
%3 j
%F Erbach:1990:P


%0 Report
%A Erbach, Gregor
%D 1990
%T Syntactic Processing of Unknown Words
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 3
%8 September
%! Syntactic Processing of Unknown Words
%3 j
%F Erbach:1990:SPUc
%X 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.


%0 Report
%A Erbach, Gregor
%D 1991
%T A Flexible Parser for a Linguistic Development Environment
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 9
%8 May
%! A Flexible Parser for a Linguistic Development Environment
%2 Erbach:1991:FPLa.pdf
%3 j
%F Erbach:1991:FPLa
%X 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.


%0 Report
%A Erbach, Gregor
%D 1991
%T An Environment for Experimenting with Parsing Strategies
%C Stuttgart
%I IBM Deutschland GmbH
%S IWBS Report
%7 167
%! An Environment for Experimenting with Parsing Strategies
%3 j
%F Erbach:1991:EEPa


%0 Book Section
%A Erbach, Gregor
%D 1991
%T A Flexible Parser for a Linguistic Development Environment
%E Herzog, O.
%E Rollinger, C.-R.
%B Textunderstanding in LILOG. Integrating Computational Linguistics and Artificial Intelligence.
%C Berlin
%I Springer Verlag
%P 74-87
%Y Siekmann, J.
%S Lecture Notes in Artificial Intelligence
%! A Flexible Parser for a Linguistic Development Environment
%2 Erbach:1991:FPLb.pdf
%3 j
%F Erbach:1991:FPLb


%0 Conference Proceedings
%A Erbach, Gregor
%D 1991
%T An Environment for Experimenting with Parsing Strategies
%E Mylopoulos, J.
%E Reiter, R.
%B 12th International Joint Conference on Artificial Intelligence (IJCAI '91), August 24-30
%C Sydney, Australia
%I Morgan Kaufmann
%V 2
%P 931-936
%! An Environment for Experimenting with Parsing Strategies
%2 Erbach:1991:EEPb.pdf
%3 j
%F Erbach:1991:EEPb


%0 Report
%A Erbach, Gregor
%D 1991
%T Lexical Representation of Idioms
%C Stuttgart
%I IBM Deutschland GmbH
%S IWBS-Report
%7 169
%! Lexical Representation of Idioms
%3 j
%F Erbach:1991:LRI


%0 Report
%A Erbach, Gregor
%D 1991
%T A Bottom-Up Algorithm for Parsing and Generation
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 5
%8 February
%! A Bottom-Up Algorithm for Parsing and Generation
%2 Erbach:1991:BAP.pdf
%3 j
%F Erbach:1991:BAP
%X 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.
%U http://www.coli.uni-sb.de/~erbach/pub/claus5/erbach-claus5-92.pdf


%0 Report
%A Erbach, Gregor
%D 1991
%T An Environment for Experimenting with Parsing Strategies
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 8
%8 April
%! An Environment for Experimenting with Parsing Strategies
%3 j
%F Erbach:1991:EEPc
%X 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.


%0 Conference Proceedings
%A Erbach, Gregor
%D 1992
%T Ambiguity and Linguistic Preferences
%E Trost, H.
%E Backofen, R.
%B Workshop of the 10th European Conference on Artificial Intelligence W2 (ECAI '92). Coping with Ambiguity in Typed Feature Formalisms, August 3-7
%C Vienna, Austria
%I John Wiley and Sons
%! Ambiguity and Linguistic Preferences
%2 Erbach:1992:ALPa.pdf
%3 j
%F Erbach:1992:ALPa
%U http://www.coli.uni-sb.de/~erbach/pub/ecai92/erbach-ecai92.pdf


%0 Conference Proceedings
%A Erbach, Gregor
%D 1992
%T Head-Driven Lexical Representation of Idioms in HPSG
%E Everaert, M.
%E van der Linden, E.-J.
%E Schenk, A.
%E Schreuder, R.
%B International Conference on Idioms, September
%C Tilburg, The Netherlands
%P 11-24
%! Head-Driven Lexical Representation of Idioms in HPSG
%2 Erbach:1992:HDLa.pdf
%3 j
%F Erbach:1992:HDLa


%0 Journal Article
%A Erbach, Gregor
%D 1992
%T Rezension von "Wissensbasierte Systeme im Büro". In: Künstliche Intelligenz 6(1)
%! Rezension von "Wissensbasierte Systeme im Büro". In: Künstliche Intelligenz 6(1)
%3 j
%F Erbach:1992:RWS


%0 Conference Proceedings
%A Erbach, Gregor
%D 1992
%T Tools for Grammar Engineering
%E ACL
%B 3rd Conference on Applied Natural Language Processing, April 1-3
%C Trento, Italy
%I ACL
%! Tools for Grammar Engineering
%2 Erbach:1992:TGE.pdf
%3 j
%F Erbach:1992:TGE
%O Poster


%0 Report
%A Erbach, Gregor
%D 1992
%T Ambiguity and Linguistic Preferences
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 23
%8 June
%! Ambiguity and Linguistic Preferences
%2 Erbach:1992:ALPb.pdf Erbach:1992:ALPb.ps Erbach:1992:ALPb.dvi
%3 j
%F Erbach:1992:ALPb
%X 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.
%O URL is a revised version
%U http://www.coli.uni-sb.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


%0 Report
%A Erbach, Gregor
%D 1992
%T Head-Driven Lexical Representation of Idioms in HPSG
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 22
%8 May
%! Head-Driven Lexical Representation of Idioms in HPSG
%3 j
%F Erbach:1992:HDLb
%X 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".


%0 Book Section
%A Erbach, Gregor
%D 1993
%T Preference Values in Typed Feature Structures
%E Trost, H.
%B Feature Formalisms and Linguistic Ambiguity
%C Chichester
%I Ellis Horwood
%! Preference Values in Typed Feature Structures
%3 j
%F Erbach:1993:PVT


%0 Conference Proceedings
%A Erbach, Gregor
%D 1993
%T Toward a Theory of Degrees of Grammaticality
%E Martin-Vide, C.
%B 1st International Conference on Mathematical Linguistics
%C Tarragona, Spain
%P 15-16
%! Toward a Theory of Degrees of Grammaticality
%3 j
%F Erbach:1993:TTDa


%0 Report
%A Erbach, Gregor
%D 1993
%T Towards a Theory of Degrees of Grammaticality
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 34
%8 November
%! Towards a Theory of Degrees of Grammaticality
%3 j
%F Erbach:1993:TTDb
%X 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.


%0 Conference Proceedings
%A Erbach, Gregor
%D 1994
%T Bottom-Up Earley Deduction
%E Linguistics, Association for Computational
%B 15th International Conference on Computational Linguistics (COLING '94), August 5-9
%C Kyoto, Japan
%I ACL
%V 2
%P 796-802
%! Bottom-Up Earley Deduction
%3 j
%F Erbach:1994:BEDa


%0 Conference Proceedings
%A Erbach, Gregor
%D 1994
%T Multi-Dimensional Inheritance
%E Trost, H.
%B 2. Konferenz Verarbeitung Natürlicher Sprache (KONVENS '94), 28.-30. September
%C Vienna, Austria
%I Springer Verlag
%P 102-111
%! Multi-Dimensional Inheritance
%3 j
%F Erbach:1994:MDIa


%0 Book Section
%A Erbach, Gregor
%D 1994
%T Specification of Datatypes for LFG
%E Erbach, G.
%E van der Kraan, M.
%E Manandhar, S.
%E Moshier, M. A.
%E Ruessink, H.
%E Thiersch, C.
%B The Reusability of Grammatical Resources. Deliverable B: Specification of Datatypes
%C Edinburgh, Saarbrücken, Tilburg, Utrecht
%! Specification of Datatypes for LFG
%3 j
%F Erbach:1994:SDL


%0 Report
%A Erbach, Gregor
%D 1994
%T ProFit - Prolog with Features, Inheritance, and Templates
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 42
%8 July
%! ProFit - Prolog with Features, Inheritance, and Templates
%2 Erbach:1994:PPF.pdf Erbach:1994:PPF.ps Erbach:1994:PPF.dvi
%3 j
%F Erbach:1994:PPF
%X 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.
%U ftp://ftp.coli.uni-sb.de/pub/claus/claus42.ps ftp://ftp.coli.uni-sb.de/pub/claus/claus42.dvi http://www.coli.uni-sb.de/~erbach/pub/claus42.pdf


%0 Report
%A Erbach, Gregor
%D 1994
%T Bottom-Up Earley Deduction
%C Saarbrücken
%I Universität des Saarlandes
%P 7
%S CLAUS-Report
%7 39
%8 April
%! Bottom-Up Earley Deduction
%2 Erbach:1994:BEDb.pdf Erbach:1994:BEDb.ps Erbach:1994:BEDb.dvi
%3 j
%F Erbach:1994:BEDb
%X 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.
%U ftp://ftp.coli.uni-sb.de/pub/claus/claus39.ps ftp://ftp.coli.uni-sb.de/pub/claus/claus39.dvi


%0 Report
%A Erbach, Gregor
%D 1994
%T Multi-Dimensional Inheritance
%C Saarbrücken
%I Universität des Saarlandes
%P 10
%S CLAUS-Report
%7 40
%8 December
%! Multi-Dimensional Inheritance
%2 Erbach:1994:MDIb.pdf Erbach:1994:MDIb.ps
%3 j
%F Erbach:1994:MDIb
%X 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.
%U ftp://ftp.coli.uni-sb.de/pub/claus/claus40.ps


%0 Conference Proceedings
%A Erbach, Gregor
%D 1995
%T Why NLP needs Oz
%B Proceedings of the 1st Workshop on Oz Programming (WOz'95), November 29 - December 1
%C Martigny, Switzerland
%P 51-54
%! Why NLP needs Oz
%2 Erbach:1995:WNN.pdf
%3 j
%F Erbach:1995:WNN
%X 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.
%U http://www.coli.uni-sb.de/~erbach/pub/woz/woz-erbach.pdf


%0 Conference Proceedings
%A Erbach, Gregor
%D 1995
%T ProFit - Prolog with Features, Inheritance, and Templates
%B Proceedings of the 7th Conference of the European Chapter of the Association for Computational Linguistics (EACL'95), March 27-31
%C University College Dublin, Ireland
%P 180-187
%! ProFit - Prolog with Features, Inheritance, and Templates
%3 j
%F Erbach:1995:PPF
%X 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.


%0 Thesis
%A Erbach, Gregor
%D 1997
%T Bottom-Up Earley Deduction for Preference-Driven Natural Language Processing
%C Saarbrücken
%I Universität des Saarlandes, Department of Computational Linguistics
%! Bottom-Up Earley Deduction for Preference-Driven Natural Language Processing
%2 Erbach:1997:BED.pdf
%3 j
%F Erbach:1997:BED
%X 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.
%U http://www.coli.uni-sb.de/~erbach/pub/diss/erbach-diss.pdf


%0 Conference Proceedings
%A Erbach, Gregor
%A Arens, Roman G.
%D 1991
%T Evaluation von Grammatiken für die Analyse natürlicher Sprache durch Generierung einer repräsentstiven Satzmenge
%E Christaller, T.
%B 15. Fachtagung für Künstliche Intelligenz (GWAI '91), 16.-20. September
%C Bonn, Germany
%I Springer Verlag
%V 285
%P 126-129
%! Evaluation von Grammatiken für die Analyse natürlicher Sprache durch Generierung einer repräsentstiven Satzmenge
%3 j
%F Erbach:1991:EGA


%0 Report
%A Erbach, Gregor
%A Krenn, Brigitte
%D 1993
%T Idioms and Support Verb Constructions in HPSG
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 28
%8 February
%! Idioms and Support Verb Constructions in HPSG
%2 Erbach:1993:ISV.pdf Erbach:1993:ISV.ps Erbach:1993:ISV.dvi
%3 j
%F Erbach:1993:ISV
%X 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).
%U ftp://ftp.coli.uni-sb.de/pub/claus/claus28.ps ftp://ftp.coli.uni-sb.de/pub/claus/claus28.dvi http://www.coli.uni-sb.de/~erbach/pub/claus28.pdf


%0 Book Section
%A Erbach, Gregor
%A Krenn, Brigitte
%D 1994
%T Idioms and Support Verb Constructions in HPSG
%E Nerbonne, John
%E Netter, Klaus
%E Pollard, Carl J.
%B Grammar in HPSG CSLI Lecture Notes
%C Stanford
%I Center for the Study of Language and Information
%P 365-396
%! Idioms and Support Verb Constructions in HPSG
%3 j
%F Erbach:1994:ISV


%0 Conference Proceedings
%A Erbach, Gregor
%A Manandhar, Suresh
%D 1995
%T Visions for the Future of Logic-Based Natural Language Processing
%B Proceedings of the ILPS'95 Workshop "Visions for the Future of Logic Programming - Laying the Foundations for a Modern Successor to Prolog", December 8
%C Portland, USA
%! Visions for the Future of Logic-Based Natural Language Processing
%2 Erbach:1995:VFL.pdf Erbach:1995:VFL.ps
%3 j
%F Erbach:1995:VFL
%U 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


%0 Journal Article
%A Erbach, Gregor
%A Moshier, M. Andrew
%A Manandhar, Suresh
%A Ruessink, Herbert
%A van der Kraan, Mark
%A Thiersch, Craig
%D 1994
%T The Reusability of Grammatical Resources
%B AUG News: The Newsletter of the ALEP User Group
%V 1
%N 1
%P 8-12
%! The Reusability of Grammatical Resources
%3 j
%F Erbach:1994:RGRb


%0 Report
%A Erbach, Gregor
%A Moshier, M. Andrew
%A Manandhar, Suresh
%A Ruessink, Herbert
%A van der Kraan, Mark
%A Thiersch, Craig
%D 1994
%T The Reusability of Grammatical Resources
%C Brighton, Sussex
%I European Network in Language and Speech
%P 5-7
%S ELSNews
%7 3(2)
%! The Reusability of Grammatical Resources
%3 j
%F Erbach:1994:RGR


%0 Report
%A Erbach, Gregor
%A Moshier, M. Andrew
%A Uszkoreit, Hans
%D 1994
%T Multiple Inheritance for ALEP
%! Multiple Inheritance for ALEP
%S ET 9.2 Deliverable
%3 j
%F Erbach:1994:MIA


%0 Conference Proceedings
%A Erbach, Gregor
%A Neumann, Günter
%A Uszkoreit, Hans
%D 1997
%T MULINEX - Multilingual Indexing, Navigation and Editing Extensions for the World Wide Web
%B Proceedings of the 3rd DELOS Workshop - Cross-Language Information Retrieval, March 5-7
%C Zurich, Switzerland
%I European Research Consortium for Informatics and Mathematics
%P 17-24
%! MULINEX - Multilingual Indexing, Navigation and Editing Extensions for the World Wide Web
%2 Erbach:1997:MMIa.pdf Erbach:1997:MMIa.ps
%3 j
%F Erbach:1997:MMIa
%U 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


%0 Conference Proceedings
%A Erbach, Gregor
%A Neumann, Günter
%A Uszkoreit, Hans
%D 1997
%T MULINEX - Multilingual Indexing, Navigation and Editing Extensions for the World Wide Web
%E Ginzburg, J.
%E Khasidashvili, Y.
%E Vogel, K.
%E Lévy, J.-J.
%E Vallduví, E.
%B 2nd Tbilisi Symposium in Language, Logic and Computation
%I CSLI Publications
%! MULINEX - Multilingual Indexing, Navigation and Editing Extensions for the World Wide Web
%2 Erbach:1997:MMIb.pdf
%3 j
%F Erbach:1997:MMIb


%0 Conference Proceedings
%A Erbach, Gregor
%A Neumann, Günter
%A Uszkoreit, Hans
%D 1997
%T MULINEX - Multilingual Indexing, Navigation and Editing Extensions for the World Wide Web
%E Hull, David
%E Oard, Doug
%B Cross-Language Text and Speech Retrieval - Papers from the 1997 AAAI Spring Symposium
%C Menlo Park
%I AAAI Press
%P 22-28
%! MULINEX - Multilingual Indexing, Navigation and Editing Extensions for the World Wide Web
%2 Erbach:1997:MMIc.pdf Erbach:1997:MMIc.ps
%3 j
%F Erbach:1997:MMIc
%U 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


%0 Conference Proceedings
%A Erbach, Gregor
%A Neumann, Günter
%A Uszkoreit, Hans
%D 1997
%T MULINEX: Design and Evaluation of a Psychological Experiment on the Effectiveness of Document Summarisation for the Retrieval of Multilingual WWW Documents
%B Proceedings of the AAAI Spring Symposium "Intelligent Text Summarisation"
%C Stanford
%I AAAI Press
%S Cross-Language Text and Speech Retrieval
%! MULINEX: Design and Evaluation of a Psychological Experiment on the Effectiveness of Document Summarisation for the Retrieval of Multilingual WWW Documents
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mulinex-aaai98.entry
%2 Erbach:1997:MDE.pdf Erbach:1997:MDE.ps
%3 j
%F Erbach:1997:MDE
%X 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.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mulinex-aaai98.ps.gz


%0 Journal Article
%A Erbach, Gregor
%A Saurer, Werner
%D 2000
%T Review of "Handbook of Logic in Artificial Intelligence and Logic Programming"
%B Artificial Intelligence Review
%V 14
%N 6
%P 615-617
%! Review of "Handbook of Logic in Artificial Intelligence and Logic Programming"
%2 Erbach:2000:RHL.pdf Erbach:2000:RHL.ps
%3 j
%F Erbach:2000:RHL
%O 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
%U http://purl.org/net/gregor/pub/gabbay.txt


%0 Report
%A Erbach, Gregor
%A Skut, Wojciech
%A Uszkoreit, Hans
%D 1994
%T Linear Precedence Constraints in Lean Formalisms (Part II)
%! Linear Precedence Constraints in Lean Formalisms (Part II)
%S ET 9.2 Deliverable
%2 Erbach:1994:LPCa.pdf
%3 j
%F Erbach:1994:LPCa
%X 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.
%U http://www.dfki.de/dfkibib/publications/docs/Uszkoreit_1994_LPCLFP2.pdf


%0 Report
%A Erbach, Gregor
%A Skut, Wojciech
%A Uszkoreit, Hans
%D 1995
%T Linear Precedence Constraints in Lean Formalisms (I und II)
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 55
%! Linear Precedence Constraints in Lean Formalisms (I und II)
%2 Erbach:1995:LPC1.pdf Erbach:1995:LPC2.pdf Erbach:1995:LPC.zip
%3 j
%F Erbach:1995:LPC
%X 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
%U http://www.dfki.de/dfkibib/publications/docs/Uszkoreit_1994_LPCLFP1.pdf http://www.dfki.de/dfkibib/publications/docs/Uszkoreit_1994_LPCLFP2.pdf


%0 Book Section
%A Erbach, Gregor
%A Thompson, Henry
%D 1993
%T Datatypes for LFG
%E Erbach, G.
%E van der Kraan, M.
%E Manandhar, S.
%E Moshier, M. A.
%E Ruessink, H.
%E Thiersch, C.
%E Thompson, H.
%B The Reusability of Grammatical Resources. Deliverable A: Selection of Datatypes
%C Edinburgh
%! Datatypes for LFG
%3 j
%F Erbach:1993:DL


%0 Book Section
%A Erbach, Gregor
%A Unz, Dagmar
%A Capstick, Joanne
%D 1999
%T Interface-Design zur Unterstützung von Selektionsentscheidungen
%E Wirth, Werner
%E Schweiger, Wolfgang
%B Selektion im Internet
%I Westdeutscher Verlag
%! Interface-Design zur Unterstützung von Selektionsentscheidungen
%2 Erbach:1999:IDU.pdf
%3 j
%F Erbach:1999:IDU
%U http://www.coli.uni-sb.de/~erbach/pub/mulinex-mefis/unz-et-al.pdf


%0 Report
%A Erbach, Gregor
%A Uszkoreit, Hans
%D 1990
%T Grammar Engineering: Problems and Prospects - Report of the Saarbrücken Workshop on Grammar Engineering
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 1
%8 July
%! Grammar Engineering: Problems and Prospects - Report of the Saarbrücken Workshop on Grammar Engineering
%2 Erbach:1990:GEP.pdf
%3 j
%F Erbach:1990:GEP
%X The"Saarbrücken Workshop on Grammar Engineering"took 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.
%U http://www.coli.uni-sb.de/~erbach/pub/claus1/ge-claus1.pdf


%0 Report
%A Erbach, Gregor
%A Uszkoreit, Hans
%D 1994
%T Linear Precedence Constraints in Lean Formalisms (Part I)
%! Linear Precedence Constraints in Lean Formalisms (Part I)
%S ET 9.2 Deliverable
%2 Erbach:1994:LPCb.pdf
%3 j
%F Erbach:1994:LPCb
%X 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.
%U http://www.dfki.de/dfkibib/publications/docs/Uszkoreit_1994_LPCLFP1.pdf


%0 Book
%A Erbach, Gregor
%A van der Kraan, Mark
%A Manandhar, Suresh
%A Moshier, M. Andrew
%A Ruessink, Herbert
%A Thiersch, Craig
%D 1993
%T The Reusability of Grammatical Resources. Deliverable A: Selection of Datatypes
%C Edinburgh, Saarbrücken, Tilburg, Utrecht
%! The Reusability of Grammatical Resources. Deliverable A: Selection of Datatypes
%3 j
%F Erbach:1993:RGR


%0 Edited Book
%A Erbach, Gregor 
%A van der Kraan, Mark
%A Manandhar, Suresh
%A Moshier, M. Andrew
%A Ruessink, Herbert
%A Thiersch, Craig
%D 1994
%T The Reusability of Grammatical Resources. Deliverable C
%C Edinburgh, Saarbrücken, Tilburg, Utrecht
%! The Reusability of Grammatical Resources. Deliverable C
%3 j
%F Erbach:1994:RGRa


%0 Edited Book
%A Erbach, Gregor
%A van der Kraan, Mark
%A Manandhar, Suresh
%A Moshier, M. Andrew
%A Ruessink, Herbert
%A Thiersch, Craig
%D 1994
%T The Reusability of Grammatical Resources. Deliverable B: Specification of Datatypes
%C Edinburgh, Saarbrücken, Tilburg, Utrecht
%! The Reusability of Grammatical Resources. Deliverable B: Specification of Datatypes
%3 j
%F Erbach:1994:RGRc


%0 Edited Book
%A Erbach, Gregor
%A van der Kraan, Mark
%A Manandhar, Suresh
%A Moshier, M. Andrew
%A Ruessink, Herbert
%A Thiersch, Craig
%D 1995
%T The Reusability of Grammatical Resources. Deliverable D
%C Edinburgh, Saarbrücken, Tilburg, Utrecht
%! The Reusability of Grammatical Resources. Deliverable D
%3 j
%F Erbach:1995:RGR


%0 Conference Proceedings
%A Erbach, Gregor
%A van der Kraan, Mark
%A Manandhar, Suresh
%A Ruessink, Herbert
%A Thiersch, Craig
%A Skut, Wojciech
%D 1995
%T Extending Unification Formalisms
%B Proceedings of the 2nd Language Engineering Convention, October 16-18
%C London, UK
%! Extending Unification Formalisms
%2 Erbach:1995:EUFa.pdf
%3 j
%F Erbach:1995:EUFa
%X 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.


%0 Report
%A Erbach, Gregor
%A van der Kraan, Mark
%A Manandhar, Suresh
%A Ruessink, Herbert
%A Thiersch, Craig
%A Skut, Wojciech
%D 1995
%T Extending Unification Formalisms
%C Saarbrücken
%I Universität des Saarlandes
%P 8
%S CLAUS-Report
%7 62
%8 May
%! Extending Unification Formalisms
%2 Erbach:1995:EUFb.pdf Erbach:1995:EUFb.ps
%3 j
%F Erbach:1995:EUFb
%X 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.
%U http://www.coli.uni-sb.de/claus/claus62.ps


%0 Report
%A Ericsson, Stinaand
%A Lewin, Ian
%A Rupp, C. J.
%A Cooper, Robin
%D 2000
%T Dialogue Moves in Negotiative Dialogues
%C Göteborg
%I Göteborg University, Department of Linguistics
%S Siridus Report
%7 1.2
%8 September
%! Dialogue Moves in Negotiative Dialogues
%2 Ericsson:2000:DMN.pdf Ericsson:2000:DMN.ps
%F Ericsson:2000:DMN
%U http://www.ling.gu.se/projekt/siridus/Publications/deliv1-2.ps.gz


%0 Conference Proceedings
%A Erk, Katrin
%D 1999
%T Simulating Boolean Circuits by Finite Splicing
%B Congress on Evolutionary Computation (CEC '99), July 16-19
%C La Jolla Marriott, San Diego, USA
%P 1279-1285
%! Simulating Boolean Circuits by Finite Splicing
%2 Erk:1999:SBC.pdf Erk:1999:SBC.ps
%F Erk:1999:SBC
%X As a computational model to be simulated in a DNA computing context, Boolean circuits are especially interesting because of their parallelism. Simulations in concrete biochemical computing settings have been given by [Ogihara/Ray 96] and [Amos/Dunne97]. In this paper, we show how to simulate Boolean circuits by finite splicing systems, an abstract model of enzymatic recombination. We argue that using an abstract model of DNA computation as a basis leads to simulations of greater clarity and generality. In our construction, the running time of the simulating system is proportional to the depth, and the use of material is proportional to the size of the Boolean circuit simulated. However, the rules of the simulating splicing system depend on the size of the Boolean circuit, but not on the connectives used.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/ErkBoolCirc99.ps.gz


%0 Conference Proceedings
%A Erk, Katrin
%D 2000
%T Die Verarbeitung von Parallelismus-Constraints
%E Mehlhorn, K.
%E Snelting, G.
%B Informatik 2000 - 30. Jahrestagung der Gesellschaft für Informatik, 19.-22. September
%C Berlin, Germany
%I Springer
%S Informatik Aktuell
%! Die Verarbeitung von Parallelismus-Constraints
%2 Erk:2000:VPC.pdf Erk:2000:VPC.ps
%F Erk:2000:VPC
%X Parallelismus-Constraints sind partielle Beschreibungen von Bäumen. Wir verwenden sie als Repräsentationsformalismus in der unterspezifizierten natürlichsprachlichen Semantik. Parallelismus-Constraints sind gleichmächtig wie Kontext-Unifikation, deren Entscheidbarkeit ein bekanntes offenes Problem ist. Dieser Text beschreibt ein Semi-Entscheidungs-Verfahren für Parallelismus-Constraints und eine erste Implementierung. Anders als alle bekannten Verfahren für Kontext-Unifikation terminiert diese Prozedur für Dominanz-Constraints, eine für die linguistische Anwendung wichtige Teilklasse.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/GI00.ps.gz


%0 Conference Proceedings
%A Erk, Katrin
%A Koller, Alexander
%D 2001
%T VP Ellipsis by Tree Surgery
%B Proceedings of the 13th Amsterdam Colloquium, December 17-19
%C Amsterdam
%! VP Ellipsis by Tree Surgery
%2 Erk:2001:VET.pdf Erk:2001:VET.ps
%F Erk:2001:VET
%X We present jigsaw parallelism constraints, a flexible formal tool for replacing parts of trees with other trees. Jigsaw constraints extend the Constraint Language for Lambda Structures, a language used in underspecified semantics to declaratively describe scope, ellipsis, and their interaction, and can be used to improve the coverage of ellipses represented by CLLS.
%U http://www.coli.uni-sb.de/~koller/papers/jigsaw.ps.gz


%0 Journal Article
%A Erk, Katrin
%A Koller, Alexander
%A Niehren, Joachim
%D 2003
%T Processing Underspecified Semantic Descriptions in the Constraint Language
  for Lambda Structures
%B Research on Language and Computation
%V 1
%P 127--169
%! Processing Underspecified Semantic Descriptions in the Constraint Language
  for Lambda Structures
%2 Erk:2002:PUS.pdf
  Erk:2002:PUS.ps
%F Erk:2003:PUS
%X The constraint language for lambda structures (CLLS) is an expressive
  language of tree descriptions which combines dominance constraints with
  powerful parallelism and binding constraints. CLLS was introduced as a
  uniform framework for defining underspecified semantics representations of
  natural language sentences, covering scope, ellipsis, and anaphora. This
  article presents saturation-based algorithms for processing the complete
  language of CLLS and gives an overview of previous results on questions of
  processing and complexity.
%U http://www.coli.uni-sb.de/~koller/papers/cllsproc.ps.gz


%0 Conference Proceedings
%A Erk, Katrin
%A Kruijff, Geert-Jan M.
%D 2002
%T A Constraint-Programming Approach to Parsing with Resource-Sensitive Categorial Grammar
%E Wintner, Shuly
%B Proceedings of the 7th International Workshop on Natural Language Understanding and Logic Programming (NLULP'02), July 28
%C Copenhagen, Denmark
%I Computer Science Department, Roskilde University
%! A Constraint-Programming Approach to Parsing with Resource-Sensitive Categorial Grammar
%2 Erk:2002:CPA.pdf
%F Erk:2002:CPA
%X Parsing with resource-sensitive categorial grammars (up to the Lambek-Van Benthem calculus LP) is an NP-complete problem. The traditional approach to parsing with such grammars is based on generate & test and cannot avoid this high worst-case complexity. This paper proposes an alternative approach, based on constraint programming: Given a grammar, constraints formulated on an abstract interpretation of the grammar's logical structure are used to prune the search space during parsing. The approach is provably sound and complete, and reduces the search space in steps that are mostly linear or low-polynomial.
%U http://www.cs.haifa.ac.il/~shuly/nlulp02/papers/ErkKruijff.pdf


%0 Conference Proceedings
%A Erk, Katrin
%A Niehren, Joachim
%D 2000
%T Parallelism Constraints
%E Bachmair, L.
%B 11th International Conference on Rewriting Techniques and Applications (RTA '00), July 10-12
%C University of East Anglia, Norwich, UK
%I Springer
%S LNCS
%! Parallelism Constraints
%2 Erk:2000:PC.ps
%F Erk:2000:PC
%X Parallelism constraints are logical desciptions of trees. They are as expressive as context unification, i.e. second-order linear unification. We present a semi-decision procedure enumerating all most general unifiers of a parallelism constraint and prove it sound and complete. In contrast to all known procedures for context unification, the presented procedure terminates for the important fragment of dominance constraints and performs reasonably well in a recent application to underspecified natural language semantics.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/parallelism.ps.gz


%0 Book
%A Erk, Katrin
%A Priese, Lutz
%D 2000
%T Theoretische Informatik. Eine umfassende Einführung
%C Berlin
%I Springer
%! Theoretische Informatik. Eine umfassende Einführung
%F Erk:2000:TIU


%0 Edited Book
%A Falkenberg, Gabriel
%D 1989
%T Wissen, Wahrnehmen, Glauben. Epistemische Ausdrücke und propositionale Einstellungen
%C Tübingen
%I Niemeyer
%! Wissen, Wahrnehmen, Glauben. Epistemische Ausdrücke und propositionale Einstellungen
%F Falkenberg:1989:WWG


%0 Journal Article
%A Fass, Dan
%A Martin, James
%A Hinkelman, Elizabeth
%D 1992
%T Introduction to the Special Issue on Non-Literal Language
%B Computational Intelligence: An International Journal
%V 8
%N 3
%P 411-415
%! Introduction to the Special Issue on Non-Literal Language
%3 j
%F Fass:1992:ISI


%0 Conference Proceedings
%A Fiedler, Armin 
%A Gabsdil, Malte
%D 2002
%T Supporting Progressive Refinement of Wizard-of-Oz Experiments
%E Rose, Carolyn Penstein
%E Aleven, Vincent
%B 6th International Conference on Intelligent Tutoring Systems (ITS '02). Workshop on Empirical Methods for Tutorial Dialogue, June 4
%C San Sebastian, Spain
%P 62-69
%! Supporting Progressive Refinement of Wizard-of-Oz Experiments
%2 Fiedler:2002:SPR.pdf Fiedler:2002:SPR.ps
%F Fiedler:2002:SPR
%X We present the architecture of DiaWoZ, a system supporting the design and execution of Wizard-of-Oz experiments to collect data from tutorial dialogues. The architecture is highly modular and allows for the progressive refinement of the experiments by both designing increasingly sophisticated dialogues and successively replacing simulated components of the tutoring system by actual implementations. The dialogues to be examined are specified in a language that combines finite-state approaches with information states, thereby allowing for great flexibility. Therefore, the architecture should also be appropriate for examining dialogues in general.
%U http://www.ags.uni-sb.de/~afiedler/pubs/papers/its-02-ws.ps.gz http://www.ags.uni-sb.de/~afiedler/pubs/papers/its-02-ws.pdf http://www.ags.uni-sb.de/~afiedler/pubs/papers/its-02-ws.bib


%0 Conference Proceedings
%A Finkler, Wolfgang
%A Neumann, Günter
%D 1989
%T POPEL-HOW: A Distributed Parallel Model for Incremental Natural Language Production with Feedback
%E Sridharan, N. S.
%B 11th International Joint Conference on Artificial Intelligence (IJCAI '89), August
%C Detroit, Michigan, USA
%I Morgan Kaufmann Publishers
%V 2
%P 1518-1523
%! POPEL-HOW: A Distributed Parallel Model for Incremental Natural Language Production with Feedback
%3 j
%F Finkler:1989:PHD


%0 Report
%A Flickinger, Dan
%A Nerbonne, John
%D 1991
%T Inheritance and Complementation: A Case Study of Easy Adjectives and Related Nouns
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-91-30
%! Inheritance and Complementation: A Case Study of Easy Adjectives and Related Nouns
%2 Flickinger:1991:ICC.pdf Flickinger:1991:ICC.ps Flickinger:1991:ICC.dvi
%F Flickinger:1991:ICC
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-91-30.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-91-30.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-91-30.ps.Z


%0 Journal Article
%A Flickinger, Dan
%A Nerbonne, John
%D 1992
%T Inheritance and Complementation: A Case Study of Easy Adjectives and Related Nouns
%B Computational Linguistics
%V 19
%N 3
%P 269-309
%! Inheritance and Complementation: A Case Study of Easy Adjectives and Related Nouns
%F Flickinger:1992:ICC


%0 Journal Article
%A Flickinger, D.
%A Oepen, S.
%A Uszkoreit, H.
%A Tsujii, J.
%D 2000
%T Introduction
%B Journal of Natural Language Engineering
%V 6
%N 1
%P 1-14
%! Introduction
%3 j
%F Flickinger:2000:I


%0 Edited Book
%A Flickinger, Dan
%A Oepen, Stefan
%A Uszkoreit, Hans
%A Tsujii, Jun-ichi
%D 2000
%T Journal of Natural Language Engineering. Special Issue on Efficient processing with HPSG: Methods, Systems, Evaluation.
%C Cambridge
%I Cambridge University Press
%V 6
%! Journal of Natural Language Engineering. Special Issue on Efficient processing with HPSG: Methods, Systems, Evaluation.
%2 Flickinger:2000:JNL.pdf
%3 j
%F Flickinger:2000:JNL
%U http://www.dfki.de/dfkibib/publications/docs/Flickinger_2000_JNLE.pdf


%0 Journal Article
%A Flickinger, Dan
%A Oepen, Stephan
%A Uszkoreit, Hans
%A Tsujii, Jun-ichi
%D 2000
%T Introduction
%B Journal of Natural Language Engineering
%V 6
%N 1
%P 1-14
%! Introduction
%2 Flickinger:2000:IB.pdf
%3 j
%F Flickinger:2000:Ib
%X This issue of Natural Language Engineering journal reports on recent achievements in the domain of hpsg-based parsing. Research groups at Saarbrücken, CSLI Stanford and the University of Tokyo have worked on grammar development and processing systems that allow the use of hpsg-based processing in practical application contexts. Much of the research reported here has been collaborative, and all of the work shares a commitment to producing comparable results on wide-coverage grammars with substantial test suites. The focus of this special issue is deliberately narrow, to allow detailed technical reports on the results obtained among the collaborating groups. Thus, the volume cannot aim at providing a complete survey on the current state of the field. This introduction summarizes the research background for the work reported in the issue, and puts the major new approaches and results into perspective. Relationships to similar efforts pursued elsewhere are included, along with a brief summary of the research and development efforts reflected in the volume, the joint reference grammar, and the common sets of reference data.
%U http://www.dfki.de/dfkibib/publications/docs/Flickinger_2000_JNLE.pdf


%0 Book Section
%A Fliedner, Gerhard
%D 2001
%T Korrekturprogramme
%E Carstensen, K.-U.
%E Ebert, C.
%E Endriss, C.
%E Jekat, S.
%E Klabunde, R.
%E Langer, H.
%B Computerlinguistik und Sprachtechnologie. Eine Einführung
%C Heidelberg
%I Spektrum Akademischer Verlag
%P 411-417
%! Korrekturprogramme
%F Fliedner:2001:K


%0 Conference Proceedings
%A Fliedner, Gerhard
%D 2002
%T A System for Checking NP Agreement in German Texts
%B Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL'02), July 6-12. Companion Volume of the Conference Proceedings. Proceedings of the Student Workshop, Demonstration Abstracts and Tutorial Abstracts
%C University of Pennsylvania, Philadelphia
%P 12-17
%8 July 6-12
%! A System for Checking NP Agreement in German Texts
%F Fliedner:2002:SCN
%X In this paper, we describe the design, implementation, and evalutation of a system for checking NP agreement in German texts. We use shallow parsing based on finite state automata in combination with constraint relaxation and a method for parse ranking based on optimality theory. The system's grammar was developed and tested over a reference corpus of about 800,000 words to ensure robustness and broad coverage. When evaluated against a corpus of approximately 200,000 words, the system reached recall and precision values around the 67% mark.
%U http://acl.ldc.upenn.edu/acl2002/STUDENT/pdfs/Student887.pdf



%0 Thesis
%A Fouvry, Frederik
%D 2003
%T Robust Processing for Constraint-based Grammar Formalisms
%I Department of Language and Linguistics, University of Essex
%8 April
%! Robust Processing for Constraint-based Grammar Formalisms
%F Fouvry:2003:RPC
%X This thesis addresses the issue of how Natural Language Processing (NLP) systems using "constraint-based" grammar formalisms can be made robust, i.e. able to deal with input which is in some way ill-formed or extragrammatical. In NLP systems which use constraint-based grammars the operation of unification typically plays a central role. Accordingly, the central concern of this thesis is to propose an approach to robust unification.

The first part of the thesis underlines the importance of robustness in NLP, provides an overview of the sort of phenomena that require it, and reviews the state of the art. From this, it appears that no methods currently exist for robust processing with grammars of any real linguistic sophistication.

The class of constraint-based grammars studied here is that based on Typed Feature Logic (TFL), of which Head-Driven Phrase Structure Grammar is the instance chosen for exemplification. The formalism is described in the second part of the thesis.

Grammars based on TFL involve the notion of a signature, which defines the kinds of objects (types) assumed to exist in the grammar. Processing typically involves combining information about pieces of the input by unification. From this perspective, the need for robustness can be seen as arising because pieces of the input provide information which is inconsistent with information from other pieces of the input and/or from the grammar. The first inconsistency is tolerated --- it does not violate the grammar --- and processed using "robust types" which are created by extending the signature to a lattice. Inconsistency with the grammar on the other hand is punished by stripping away the offending information. Weights, added to it on the basis of the grammar, also disappear, thus making the ungrammaticality measurable. The conceptual and formal apparatus for this is developed and exemplified in the third part of the dissertation.


%0 Conference Proceedings
%A Frank, Anette
%D 2001
%T Treebank Conversion. Converting the NEGRA Treebank to an LTAG Grammar
%B Proceedings of the Workshop on Multi-layer Corpus-based Analysis. Workshop held as part of the EUROLAN 2001 Summer Institute on Creation and Exploitation of Annotated Language Resources, July 30 - August 11
%C Iasi, Romania
%! Treebank Conversion. Converting the NEGRA Treebank to an LTAG Grammar
%2 Frank:2001:TCC.pdf
%F Frank:2001:TCC
%X We present a method for rule-based structure conversion of existing treebanks, which aims at the extraction of linguistically sound, corpus-based grammars in a specific grammatical framework. We apply this method to the NEGRA treebank to derive an LTAG grammar of German. We describe the methodology and tools for structure conversion and LTAG extraction. The conversion and grammar extraction process imports linguistic generalisations that are missing the in original treebank. This supports the extraction of a linguistically sound grammar with maximal generalisation, as well as grammar induction techniques to capture unseen data in stochastic parsing. We further illustrate the flexibility of our conversion method by deriving an alternative representation in terms of topological field marking from the NEGRA treebank, which can be used as input for stochastic topological parsing approaches. On a broader perspective our approach contributes to a better understanding on where corpuslinguistics and theoretical linguistics can meet and enrich each other.
%U http://www.dfki.de/~frank/papers/tbc-eurolan01.pdf


%0 Conference Proceedings
%A Frank, Anette
%D 2002
%T A (Discourse) Functional Analysis of Asymmetric Coordination
%B Proceedings of the 7th International Lexical Functional Grammar Conference (LFG'02), July 3-5
%C Athens, Greece
%! A (Discourse) Functional Analysis of Asymmetric Coordination
%F Frank:2002:DFA
%X A long-standing puzzle in coordination is the so-called SGF-coordination (Subject Gap in Finite/Fronted constructions) in German (1), first discussed b y (Hoehle 1983). Its syntactic analysis is challenging, since the subject (Jaeger, man) is realised in the middle field in the left conjunct, and is thus - under standard analyses of constituent coordination - not accessible from within the second conjunct, which is missing a subject (hence "subject gap").
(1) a. In den Wald ging der Jaeger und fing einen Hasen. 
Into the forest went the hunter and caught a rabbit 
The hunter went into the forest and caught a rabbit 

(1) b. Nimmt man den Deckel ab und ruehrt die Fuellung um, steigen Daempfe auf. 
Takes one the cover off and stirrs the stuffing, steam rises. 
If one takes the cover off and stirrs the stuffing, steam will rise. 

SGF constructions have been analysed in terms of asymmetrically embedded conjuncts (Wunderlich 1988, Hoehle 1990, Heycock and Kroch 1993, Buering und Hartmann 1998) or symmetric conjuncts (Steedman 
1990, Kathol 1995,1999). Asymmetric embedding is problematic as it involves extraction asymmetries, or a doubtful analysis of coordination as adjunction. Symmetric analyses assume special licensing conditions which are not independently motivated. Especially the word order conditions of Kathol's analysis lack any independent syntactic motivation, and fail to account for related asymmetric coordinations of verb-last and verb-fronted (VL/VF) sentences (2). 

(2) Wenn Du in ein Kaufhaus kommst und (Du) hast kein Geld, kannst Du nichts kaufen. 
if you in a shop come and you have no money can you nothing buy 
If you enter a shop and (you) don't have any money, you can't buy anything. 

We present a multi-factorial LFG analysis of asymmetric constructions (1) and (2), which relies on independently motivated principles of the correspondences between c-structure, f-structure, and i-structure (information structure). 
SGF coordination is analysed as symmetric coordination in c-structure. Binding of the (prima facie) inaccessible subject of the first conjunct is enabled, at the level of f-structure, by asymmetric projection of a "grammaticalised discourse function GDF", a topic or subject function (Bresnan, 2001). "Asymmetric GDF projection" is motivated by relating the semantic and discourse-functional properties of asymmetric coordination to well-known discourse subordination effects of modal subordination. In conjunction with 
word order constraints in the optimality model of (Choi 1999, 2001), our analysis explains some mysterious word order constraints as well as some puzzling scoping properties.
%O in October


%0 Conference Proceedings
%A Frank, Anette
%A van Genabith, Josef
%D 2001
%T LL-based Semantics for LTAG - and what it teaches us about LFG and LTAG
%E Butt, Miriam 
%E Holloway King, Tracy
%B Proceedings of the 6th International Lexical Functional Grammar Conference (LFG'01), June 25-27
%C Hong Kong
%I CSLI Online Publications
%! LL-based Semantics for LTAG - and what it teaches us about LFG and LTAG
%2 Frank:2001:LBS.pdf
%F Frank:2001:LBS
%X We review existing appoaches to semantics construction in LTAG (Lexicalised Tree Adjoining
Grammar) based on the notion of derivation (tree)s. We argue that derivation structures in
LTAG are not appropriate to guide semantic composition, due to a non-isomorphism, in LTAG,
between the syntactic operation of adjunction on the one hand, and the semantic operations of complementation and modifcation, on the other.
Linear Logic based "glue semantics", as developed within the LFG framework (cf. Dalrymple
(1999)), allows for flexible coupling of syntactic and semantic structure. We investigate application of glue semantics to LTAG syntax, using as underlying structure the derived tree, which is more appropriate for principle-based semantics construction. We show how Linear Logic based semantics construction helps to bridge the non-isomorphism between syntactic and semantic operations in LTAG. The glue approach captures non-tree local dependencies in control and modifcation structures, and extends to the treatment of scope ambiguity with quantified NPs and VP modifers. Finally, glue semantics applies successfully to the adjunction-based analysis of long-distance dependencies in LTAG, which differs signifcantly from the f-structure based analysis in LFG.
%U http://csli-publications.stanford.edu/LFG/6/lfg01frankgenabith.pdf


%0 Book Section
%A Frank, Anette
%A Zaenen, Annie
%D 2002
%T Tense in LFG: Syntax and Morphology
%E Kamp, Hans
%E Reyle, Uwe
%B How we say WHEN it happens. Contributions to the theory of temporal reference in natural language
%C Tübingen
%I Max Niemeyer Verlag
%! Tense in LFG: Syntax and Morphology
%2 Frank:2002:TLS.pdf
%F Frank:2002:TLS
%U http://www.dfki.de/~frank/papers/tensemorph-final.ps.gz


%0 Master's Thesis
%A Gabsdil, Malte
%D 2001
%T Interpreting Questions and Answers in a Prototype Dialogue System
%C Saarbrücken
%I Universität des Saarlandes, Computerlinguistik
%! Interpreting Questions and Answers in a Prototype Dialogue System
%2 Gabsdil:2001:IQA.pdf Gabsdil:2001:IQA.ps
%F Gabsdil:2001:IQA
%U http://www.coli.uni-sb.de/~gabsdil/papers/msc01.ps.gz


%0 Conference Proceedings
%A Gabsdil, Malte
%A Koller, Alexander
%A Striegnitz, Kristina
%D 2001
%T Building a Text Adventure on Description Logic
%E Görz, G.
%E Haarslev, V.
%E Lutz, C.
%E Möller, R.
%B KI-2001 Workshop on Applications of Description Logics, September 18
%C Vienna, Austria
%I CEUR Workshop Proceedings
%V 44
%! Building a Text Adventure on Description Logic
%2 Gabsdil:2001:BTA.pdf Gabsdil:2001:BTA.ps
%F Gabsdil:2001:BTA
%X We describe an engine for a computer game which employs techniques from computational linguistics and theorem proving based on description logic. We show how we represent a world model as a DL knowledge base and then illustrate how we use it in the computational linguistics modules with the examples of analyzing and generating referring expressions.
%U http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-44/Gabsdil-et-al.ps.gz


%0 Conference Proceedings
%A Gabsdil, Malte
%A Koller, Alexander
%A Striegnitz, Kristina
%D 2001
%T Playing with Description Logic
%B 2nd Workshop on Methods for Modalities (M4M). Application Description, November 29-30
%C University of Amsterdam, The Netherlands
%! Playing with Description Logic
%2 Gabsdil:2001:PDL.pdf Gabsdil:2001:PDL.ps
%F Gabsdil:2001:PDL
%X We describe an engine for a computer game which has at its core a description logic knowledge base and employs techniques from computational linguistics for its natural language user interface. We show how we represent the state of the game as a DL knowledge base, how we model changes in the world, and how the computational linguistics modules access the knowledge base to analyze the input wrt. the context and produce contextually appropriate output.
%U http://www.coli.uni-sb.de/~kris/papers/m4m2.ps.gz


%0 Conference Proceedings
%A Gabsdil, Malte 
%A Koller, Alexander 
%A Striegnitz, Kristina
%D 2002
%T Natural Language and Inference in a Computer Game
%B 19th International Conference on Computational Linguistics (COLING '02), August 24 - September 1
%C Taipei, Taiwan
%! Natural Language and Inference in a Computer Game
%1 http://www.coli.uni-sb.de/cl/projects/indigen/papers/coling02.ps.gz
%2 Gabsdil:2002:NLI.pdf Gabsdil:2002:NLI.ps
%F Gabsdil:2002:NLI
%X We present an engine for text adventures -- computer games with which the player interacts using natural language. The system employs current methods from computational linguistics and an efficient inference system for description logic to make the interaction more natural. The inference system is especially useful in the linguistic modules dealing with reference resolution and generation and we show how we use it to rank different readings in the case of referential and syntactic ambiguities.  It turns out that the player's utterances are naturally restricted in the game scenario, which simplifies the language processing task.
%U http://www.coli.uni-sb.de/~koller/papers/game-nl.ps.gz


%0 Conference Proceedings
%A Gabsdil, Malte
%A Striegnitz, Kristina
%D 1999
%T Classifying Scope Ambiguities
%E Monz, C.
%E de Rijke, M.
%B 1st Workshop on Inference in Computational Semantics (ICoS-1), August 15
%C Amsterdam, The Netherlands
%P 125-131
%! Classifying Scope Ambiguities
%2 Gabsdil:1999:CSA.pdf Gabsdil:1999:CSA.ps
%F Gabsdil:1999:CSA
%X We describe the architecture and implementation of a system which compares semantic representations of natural language input w.r.t. equivalence of logical content and context change potential. Giving a clear graphical representation of the relationship between different readings, the stand-alone version of the system can be used as a classroom tool. Furthermore the core system can be incorporated into other discourse processing systems (e.g. Johan Bos' DORIS system (Bos 1998) where one might want to ignore logically equivalent readings in order to keep the number of readings small and thus improve efficiency.
The system relies heavily on existing implementations and code available via the internet. These are integrated and put to the desired use by a Prolog interface. By illustrating the architecture of this system, we want to argue that it is possible to build rather complex systems involving multiple levels of linguistic processing without having to spend an unreasonably large amount of time on the implementation of basic functionalities.
%U http://www.coli.uni-sb.de/~kris/papers/icos99.ps.gz


%0 Journal Article
%A Gabsdil, Malte
%A Striegnitz, Kristina
%D 2000
%T Classifying Scope Ambiguities
%B Journal of Language and Computation
%V 1
%N 2
%P 291-297
%! Classifying Scope Ambiguities
%2 Gabsdil:2000:CSA.pdf Gabsdil:2000:CSA.ps
%F Gabsdil:2000:CSA
%X We describe the architecture and implementation of a system which compares semantic representations of natural language input w.r.t. equivalence of logical content and context change potential. By using automated theorem proving we compute a graph-like structure which represents the relationships that hold between different readings of a given sentence.
The information encoded in the graph-structure can be useful for discourse processing systems where knowledge about the relative logical strength of readings might be used to reduce the number of readings that have to be considered during processing.
The system relies heavily on existing implementations and code available via the internet. These are integrated and put to the desired use by a Prolog interface. By illustrating the architecture of this system, we want to argue that it is possible to build rather complex systems involving multiple levels of linguistic processing without having to spend an unreasonably large amount of time on the implementation of basic functionalities.
%U http://www.coli.uni-sb.de/~kris/papers/jlac2000.ps.gz


%0 Master's Thesis
%A Gambäck, Björn
%D 1991
%T A Micro-World for Reasoning about Communicating Agents: the Bidding Phase of Contract Bridge
%B Dept. of Telecommunication and Computer Systems
%C Stockholm
%I The Royal Institute of Technology, Dept. of Telecommunication and Computer
Systems
%! A Micro-World for Reasoning about Communicating Agents: the Bidding Phase of Contract Bridge
%F Gamback:1991:MWR


%0 Conference Proceedings
%A Gambäck, Björn
%D 1992
%T Lexical Acquisition: the Swedish VEX System
%B Papers from the 3rd Nordic Conference on Text Comprehension in Man and Machine
%C Linköping, Sweden
%P 59-70
%! Lexical Acquisition: the Swedish VEX System
%F Gamback:1992:LASa
%U ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--92-12--SE.ps.Z


%0 Report
%A Gambäck, Björn
%D 1992
%T Lexical Acquisition: the Swedish VEX System
%C Stockholm
%I Swedish Institute of Computer Science
%S SICS Research Report
%7 R92012
%! Lexical Acquisition: the Swedish VEX System
%F Gamback:1992:LASb


%0 Conference Proceedings
%A Gambäck, Björn
%D 1992
%T Developer Oriented NL-System Evaluation: Two Experiments
%B Record of the Workshop on the Strategic Rule of Evaluation in Natural Language Processing and Speech Technology
%C Edinburgh, Scotland
%P 109-116
%! Developer Oriented NL-System Evaluation: Two Experiments
%2 Gamback:1992:DON.pdf Gamback:1992:DON.ps
%F Gamback:1992:DON
%U http://www.sics.se/~gamback/publications/evaluation.ps


%0 Conference Proceedings
%A Gambäck, Björn
%D 1993
%T On Implementing Swedish Tense and Aspect
%B 1st Nordic Doctoral Symposium on Computational Linguistics, March
%C Copenhagen, Denmark
%P 145-146
%! On Implementing Swedish Tense and Aspect
%F Gamback:1993:ISTa


%0 Conference Proceedings
%A Gambäck, Björn
%D 1993
%T On Implementing Swedish Tense and Aspect
%E Eklund, R.
%B 9th Scandinavian Conference on Computational Linguistics
%C Stockholm University, Stockholm, Sweden
%P 97-109
%! On Implementing Swedish Tense and Aspect
%2 Gamback:1993:ISTb.pdf Gamback:1993:ISTb.ps
%F Gamback:1993:ISTb
%U www.sics.se/humle/papers/nodalida93_ta_full.ps


%0 Conference Proceedings
%A Gambäck, Björn
%D 1993
%T Towards a Uniform Treatment of Swedish Verb Syntax and Semantics
%B 14th Scandinavian Conference of Linguistics and the 8th Conference of Nordic and General Linguistics, August
%C Göteborg University, Gothenburg, Sweden
%V 1
%P 123-134
%! Towards a Uniform Treatment of Swedish Verb Syntax and Semantics
%2 Gamback:1993:TUT.pdf Gamback:1993:TUT.ps
%F Gamback:1993:TUT
%U http://www.sics.se/~gamback/publications/scl93.ps


%0 Conference Proceedings
%A Gambäck, Björn
%D 1995
%T Swedish Language Processing in the Spoken Language Translator
%E Koskenniemi, K.
%B 10th Nordic Conference of Computational Linguistics, May 30-31
%C Helsinki, Finland
%I Department of General Linguistics, University of Helsinki
%P 37-49
%! Swedish Language Processing in the Spoken Language Translator
%2 Gamback:1995:SLP.pdf Gamback:1995:SLP.ps
%F Gamback:1995:SLP
%U www.sics.se/humle/papers/nodalida95_slt.ps


%0 Conference Proceedings
%A Gambäck, Björn
%A Alshawi, Hiyan
%A Carter, David M.
%A Rayner, Manny
%D 1991
%T Measuring Compositionality of Transfer
%E Falkedal, K.
%B Evaluators' Forum, April 21-24
%C Les Rasses, Switzerland
%I ISSCO Publications
%P 181-184
%! Measuring Compositionality of Transfer
%F Gamback:1991:MCTb


%0 Conference Proceedings
%A Gambäck, Björn
%A Alshawi, Hiyan
%A Carter, David M.
%A Rayner, Manny
%D 1991
%T Measuring Compositionality in Transfer-Based Machine Translation Systems
%E Neal, J. G.
%E Walter, S. M.
%B Natural Language Processing Systems Evaluation Workshop, June
%C University of California, Berkeley, California
%I ACL
%P 141-145
%S Technical Report
%7 RL-TR-91-362
%! Measuring Compositionality in Transfer-Based Machine Translation Systems
%2 Gamback:1991:MCTa.pdf Gamback:1991:MCTa.ps
%F Gamback:1991:MCTa
%U http://www.sics.se/~gamback/publications/nlp_eval91.ps


%0 Conference Proceedings
%A Gambäck, Björn
%A Eineborg, Martin
%A Eriksson, Michael
%A Ekholm, Barbro
%A Lyberg, Bertil
%A Svensson, Tomas
%D 1995
%T A Language Interface to a Polyphone-Based Speech Synthesizer
%B 4th European Conference on Speech Communication and Technology, September
%C Madrid, Spain
%V 2
%P 1219-1222
%! A Language Interface to a Polyphone-Based Speech Synthesizer
%2 Gamback:1995:LIP.pdf Gamback:1995:LIP.ps
%F Gamback:1995:LIP
%U http://www.sics.se/~gamback/publications/eurospeech95.ps


%0 Conference Proceedings
%A Gambäck, Björn
%A Rayner, Manny
%D 1990
%T A Micro-World for Reasoning about Communicating Agents
%B 9th Annual Workshop and Meeting of the Swedish Artificial Intelligence Society, April
%C Stockholm, Sweden
%P 35-39
%! A Micro-World for Reasoning about Communicating Agents
%F Gamback:1990:MWR


%0 Report
%A Gambäck, Björn
%A Rayner, Manny
%D 1990
%T Contract Bridge as a Micro-World for Reasoning about Communicating Agents
%C Stockholm
%I Swedish Institute for Computer Science
%S Research Report
%7 R90011
%8 November
%! Contract Bridge as a Micro-World for Reasoning about Communicating Agents
%F Gamback:1990:CBM
%U ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--90-11--SE.ps.Z


%0 Conference Proceedings
%A Gambäck, Björn
%A Rayner, Manny
%A Pell, Barney
%D 1990
%T Heuristic Programming in Artificial Intelligence
%E Levy, D. N. L.
%E Beal, D. F.
%B 2nd London Conference on Computer Games
%C London, England
%I Ellis Horwood
%P 87-107
%! Heuristic Programming in Artificial Intelligence
%F Gamback:1990:HPA


%0 Report
%A Gambäck, Björn
%A Rayner, Manny
%A Pell, Barney
%D 1993
%T Pragmatic Reasoning in Bridge
%C Cambridge
%I University of Cambridge, Computer Laboratory
%S Technical Report
%7 299
%8 April
%! Pragmatic Reasoning in Bridge
%2 Gamback:1993:PRBa.pdf Gamback:1993:PRBa.ps
%F Gamback:1993:PRBa
%U http://www.sics.se/~gamback/publications/pragma.ps


%0 Report
%A Gambäck, Björn
%A Rayner, Manny
%A Pell, Barney
%D 1993
%T Pragmatic Reasoning in Bridge
%C Cambridge
%S SRI International Technical Report
%7 CRC-030
%! Pragmatic Reasoning in Bridge
%F Gamback:1993:PRBb


%0 Report
%A Gardent, Claire
%D 1994
%T Discourse Multiple Dependencies
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 45
%8 October
%! Discourse Multiple Dependencies
%2 Gardent:1994:DMD.pdf Gardent:1994:DMD.ps Gardent:1994:DMD.dvi
%F Gardent:1994:DMD
%X It is sometimes claimed (cf. [Mann/Thompson 1988, Scha/Polanyi 1988, Webber 1991, Gardent 1991, Pruest 1992]) that discourse has a tree structure which reflects the semantic structure of discourse. In this paper, I argue that this claim is problematic in cases of discourse multiple dependencies i.e. cases where one discourse segment is semantically related to two discourse segments. I develop a discourse framework which is based on [Scha/Polanyi 1988] but integrates ideas from Feature-based Tree Adjoining Grammars (FTAGs). I then show that this new framework adequately captures multiple dependencies whilst retaining the precise linguistic predictions made by the discourse grammar. In particular, I show how it permits a simple modelling of discourse semantics, discourse coherence and discourse based constraints on anaphora resolution.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus45.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus45.dvi


%0 Report
%A Gardent, Claire
%D 1995
%T Generating with Discourse Grammar
%C Saarbrücken
%I Universität des Saarlandes
%P 21
%S CLAUS-Report
%7 58
%8 May
%! Generating with Discourse Grammar
%2 Gardent:1995:GDG.pdf Gardent:1995:GDG.ps
%F Gardent:1995:GDG
%X In this paper, we show how typed unification based formalisms extended with arbitrary relations can be used to generate discourse. We start by presenting the specific framework being used (discourse grammar), and we argue that it provides a natural setting for a computational analysis of intersentential phenomena such as ellipsis, anaphora and focus. We then show that it is possible for a discourse grammar to be neither monotonic nor declarative and further, that a discourse grammar is not guaranteed to terminate even when the set of solutions to be found is finite. Finally, we argue that despite these non properties, a generator can be developed which both preserves the intended meaning of the grammar and terminates.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus58.ps


%0 Conference Proceedings
%A Gardent, Claire
%D 1996
%T Ellipses, Pronouns and Parallelism
%B 1st International Conference on Logical Aspects of Computational Linguistics (LACL '96), April 23-25
%C Nancy, France
%! Ellipses, Pronouns and Parallelism
%F Gardent:1996:EPP


%0 Journal Article
%A Gardent, Claire
%D 1996
%T Anaphores parallèles et techniques de résolution
%B Langages
%V 123
%P 75-98
%! Anaphores parallèles et techniques de résolution
%F Gardent:1996:APT


%0 Book Section
%A Gardent, Claire
%D 1997
%T Sloopy Identity
%E Retoré, C.
%B Logical Aspects of Computational Linguistics
%C Berlin
%I Springer
%V 1328
%P 188-207
%S LNAI
%! Sloopy Identity
%F Gardent:1997:SI
%X Although sloppy interpretation is usually accounted for by theories of ellipsis, it often arises in non-elliptical contexts. In this paper, a theory of sloppy interpretation is provided which captures this fact. The underlying idea is that sloppy interpretation results from a semantic constraint on parallel structures and the theory is shown to predict sloppy readings for deaccented and paycheck sentences as well as relational-, event-, and one-anaphora. It is further shown to capture the interaction of sloppy/strict ambiguity with quantification and binding.


%0 Report
%A Gardent, Claire
%D 1997
%T Parallelism, HOU and Deaccenting
%C Saarbrücken
%I Universität des Saarlandes
%P 29
%S CLAUS-Report
%7 85
%8 January
%! Parallelism, HOU and Deaccenting
%2 Gardent:1997:PHD.pdf Gardent:1997:PHD.ps
%F Gardent:1997:PHD
%X We generalise (Dalrymple, Shieber and Pereira 1991)'s treatment of ellipsis to deaccenting and show that the resulting account has three main advantages. First, it predicts the interpretive similarities between ellipsis and deaccenting. Second, it captures the interaction of deaccenting and anaphora. Third, it yields a uniform treatment of sloppy identity and of its interaction with both ellipsis and deaccenting.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus85.ps


%0 Report
%A Gardent, Claire
%D 1997
%T Sloppy Identity
%C Saarbrücken
%I Universität des Saarlandes
%P 20
%S CLAUS-Report
%7 88
%8 March
%! Sloppy Identity
%2 Gardent:1997:SIB.pdf Gardent:1997:SIB.ps
%F Gardent:1997:SIb
%X Although sloppy interpretation is usually accounted for by theories of ellipsis, it often arises in non-elliptical contexts. In this paper, a theory of sloppy interpretation is provided which captures this fact. The underlying idea is that sloppy interpretation results from a semantic constraint on parallel structures and the theory is shown to predict sloppy readings for deaccented and paycheck sentences as well as relational-, event-, and one-anaphora. It is further shown to capture the interaction of sloppy/strict ambiguity with quantification and binding. Finally, it is compared with other approaches to sloppy identity, in particular (Dalrymple, Shieber and Pereira 1991, Hardt 1996) and (Fiengo and May 1994).
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus88.ps


%0 Report
%A Gardent, Claire
%D 1997
%T Discourse Tree Adjoining Grammar
%C Saarbrücken
%I Universität des Saarlandes
%P 23
%S CLAUS Report
%7 89
%8 April
%! Discourse Tree Adjoining Grammar
%2 Gardent:1997:DTA.pdf Gardent:1997:DTA.ps
%F Gardent:1997:DTA
%X It is generally agreed that discourse has a recursive structure and that this structure affects the semantic interpretation of discourse. Despite this consensus however, relatively few proposals give a precise specification of how the syntax of discourse relates to its semantics. In this paper, we use a variant of Feature-Based Tree Adjoining Grammars to construct discourse structure. We then show that it provides a natural account of the relation between discourse syntax and discourse semantics, and in particular that it captures some interesting cases of semantic ambiguity in discourse.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus89.ps


%0 Report
%A Gardent, Claire
%D 1999
%T Deaccenting and Higher-Order Unification
%C Saarbrücken
%I Universität des Saarlandes
%P 26
%S CLAUS-Report
%7 112
%8 October
%! Deaccenting and Higher-Order Unification
%2 Gardent:1999:DHO.pdf Gardent:1999:DHO.ps
%F Gardent:1999:DHO
%X The HOU based analysis of ellipsis presented in (Dalrymple, Shieber and Pereira 1991) was shown to correctly capture the complex interaction of VP-ellipsis, scope and anaphora and claimed to extend to further related phenomena. When applied to deaccenting, the analysis makes a strong prediction, namely that all anaphors occurring in the deaccented part of a deaccented utterance are parallel anaphors that is, anaphors that resolve to their parallel counterpart in the source. I argue that this prediction is supported by the data and show that it correctly captures the interaction of deaccenting with anaphora, (in)definiteness and focus.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus112.ps


%0 Conference Proceedings
%A Gardent, Claire
%A Dorrepaal, Joke
%D 1994
%T Reversible Discourse Processing
%B International Workshop on Computational Semantics (IWCS-1), December 19-21
%C Tilburg, The Netherlands
%! Reversible Discourse Processing
%F Gardent:1994:RDP


%0 Report
%A Gardent, Claire
%A Dorrepaal, Joke
%D 1995
%T Reversible Discourse Processing
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 59
%8 May
%! Reversible Discourse Processing
%2 Gardent:1995:RDP.pdf Gardent:1995:RDP.ps Gardent:1995:RDP.dvi
%F Gardent:1995:RDP
%X In this paper we describe a reversible framework for discourse processing, a framework in which contextual constraints can be specified independently of the processing algorithm. We take as a starting point Scha and Polanyi's discourse grammar ([Scha/Polanyi 1988]) which is in essence a unification based grammar extended with arbitrary relations. Although such a framework can be shown to have many non properties (e.g. non monotonicity and non declarativity), we argue that it is inherently finitely reversible in the sense of [Dymetman 1991] - that is, there is a parsing/generation program for this grammar such that for any string/semantics, the program enumerates all associated semantics/strings and terminates. We show by means of examples that one and the same specification can be used both for analysis and for generation.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus59.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus59.dvi


%0 Conference Proceedings
%A Gardent, Claire
%A Kohlhase, Michael
%D 1996
%T Higher-Order Coloured Unification and Natural Language Semantics
%E ACL
%B 34th Annual Meeting of the Association for Computational Linguistics, June 24-27
%C Santa Cruz, California, USA
%! Higher-Order Coloured Unification and Natural Language Semantics
%F Gardent:1996:HOCa


%0 Conference Proceedings
%A Gardent, Claire
%A Kohlhase, Michael
%D 1996
%T Focus and Higher-Order Unification
%E ACL
%B 16th International Conference on Computational Linguistics (COLING '96), August 5-9
%C Copenhagen, Denmark
%V 1
%P 430-435
%! Focus and Higher-Order Unification
%F Gardent:1996:FHOa


%0 Report
%A Gardent, Claire
%A Kohlhase, Michael
%D 1996
%T Focus and Higher-Order Unification
%C Saarbrücken
%I Universität des Saarlandes
%P 6
%S CLAUS-Report
%7 75
%8 April
%! Focus and Higher-Order Unification
%2 Gardent:1996:FHOb.pdf Gardent:1996:FHOb.ps
%F Gardent:1996:FHOb
%X Pulman has shown that Higher-Order Unification (HOU) can be used to model the interpretation of focus. In this paper, we extend the unification-based approach to cases which are often seen as a test-bed for focus theory: utterances with multiple focus operators and second occurrence expressions. We then show that the resulting analysis favourably compares with two prominent theories of focus (namely, Rooth's Alternative Semantics and Krifka's Structured Meanings theory) in that it correctly generates interpretations which these alternative theories cannot yield. Finally, we discuss the formal properties of the approach and argue that even though HOU need not terminate, for the class of unification-problems dealt with in this paper, HOU avoids this shortcoming and is in fact computationally tractable.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus75.ps


%0 Report
%A Gardent, Claire
%A Kohlhase, Michael
%D 1996
%T Higher-Order Coloured Unification and Natural Language Semantics
%C Saarbrücken
%I Universität des Saarlandes
%P 9
%S CLAUS-Report
%7 76
%8 April
%! Higher-Order Coloured Unification and Natural Language Semantics
%2 Gardent:1996:HOCb.pdf Gardent:1996:HOCb.ps
%F Gardent:1996:HOCb
%X In this paper, we show that Higher--Order Coloured Unification -- a form of unification developed for automated theorem proving -- provides a general theory for modeling the interface between the interpretation process and other sources of linguistic, non semantic information. In particular, it provides the general theory for the Primary Occurrence Restriction which (Dalrymple et al. 1991)'s analysis called for.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus76.ps


%0 Conference Proceedings
%A Gardent, Claire
%A Kohlhase, Michael
%D 1997
%T Computing Parallelism in Discourse
%B 15th International Joint Conference on Artificial Intelligence (IJCAI '97), August 23-29
%C Nagoya, Japan
%I Morgan Kaufmann Publishers
%V 2
%P 1016-1021
%! Computing Parallelism in Discourse
%F Gardent:1997:CPD
%X Although much has been said about parallelism in discourse, a formal, computational theory of parallelism structure is still outstanding. In this paper, we present a theory which given two parallel utterances predicts which are the parallel elements. The theory consists of a sorted, higher-order abductive calculus and we show that it reconciles the insights of discourse theories of parallelism with those of Higher-Order Unification approaches to discourse semantics, thereby providing a natural framework in which to capture the effect of parallelism on discourse semantics.


%0 Report
%A Gardent, Claire
%A Kohlhase, Michael
%A Konrad, Karsten
%D 1998
%T Higher-Order Coloured Unification: a linguistic application
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 101
%8 November
%! Higher-Order Coloured Unification: a linguistic application
%2 Gardent:1998:HOC.pdf Gardent:1998:HOC.ps
%F Gardent:1998:HOC
%X During the last decade, Higher-Order unification (HOU) has become a popular tool for constructing the semantic representation of natural language expressions. But there is a well-known problem with this approach: it over-generates that is, it produces solutions which although they are mathematically valid, are linguistically incorrect because they do not represent possible meanings of the expression being analysed. In this paper, we argue that Higher-Order Colored Unification (HOCU) can help prevent over-generation and we describe the linguistic, logical and computational aspects of an HOCU--based approach to semantic construction.
%U ftp://ftp.coli.uni-sb.de/pub/people/claire/tsi.ps.gz


%0 Journal Article
%A Gardent, Claire
%A Kohlhase, Michael
%A Konrad, Karsten
%D 1999
%T Higher-Order Coloured Unification: a Linguistic Application
%B Technique et Science Informatiques
%V 18
%N 2
%P 181-209
%! Higher-Order Coloured Unification: a Linguistic Application
%F Gardent:1999:HOC


%0 Conference Proceedings
%A Gardent, Claire
%A Kohlhase, Michael
%A van Leusen, Noor
%D 1996
%T Corrections and Higher-Order Unification
%B 3. Konferenz Verarbeitung natürlicher Sprache (KONVENS '96), 7.-9. Oktober
%C Bielefeld, Germany
%I de Gruyter
%P 268-279
%! Corrections and Higher-Order Unification
%F Gardent:1996:CHOa
%X We propose an analysis of corrections which models some of the requirements corrections place on context. We then show that this analysis naturally extends to the interaction of corrections with pronominal anaphora on the one hand, and (in)definiteness on the other. The analysis builds on previous unification--based approaches to NL semantics and relies on Higher--Order Unification with Equivalences, a form of unification which takes into account not only syntactic beta-eta-identity but also denotational equivalence.


%0 Report
%A Gardent, Claire
%A Kohlhase, Michael
%A van Leusen, Noor
%D 1996
%T Corrections and Higher-Order Unification
%C Saarbrücken
%I Universität des Saarlandes
%P 12
%S CLAUS-Report
%7 77
%8 May
%! Corrections and Higher-Order Unification
%2 Gardent:1996:CHOb.pdf Gardent:1996:CHOb.ps
%F Gardent:1996:CHOb
%X We propose an analysis of corrections which models some of the requirements corrections place on context. We then show that this analysis naturally extends to the interaction of corrections with pronominal anaphora on the one hand, and (in)definiteness on the other. The analysis builds on previous unification--based approaches to NL semantics and relies on Higher--Order Unification with Equivalences, a form of unification which takes into account not only syntactic beta-eta-identity but also denotational equivalence. Wir schlagen eine Analyse vor, die einige der Anforderungen von Korrekturen an den Kontext modelliert und sich natuerlich auf die Interaktion von Korrekturen mit Pronominalanaphern und Undefiniertheit erweitern laesst. Die Analyse basiert auf bekannten unifikationsbasierten Ansaetzen fuer die Semantik natuerlicher Sprache und benutzt eine Erweiterung der Unifikation hoeherer Stufe. Diese beruecksichtigt nicht nur strukturelle beta-eta-Gleichheit, sondern auch logische Aequivalenz.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus77.ps


%0 Report
%A Gardent, Claire
%A Konrad, Karsten
%D 1999
%T Definites or the proper treatment of rabbits
%C Saarbrücken
%I Universität des Saarlandes
%P 12
%S CLAUS-Report
%7 111
%8 June
%! Definites or the proper treatment of rabbits
%2 Gardent:1999:DPT.pdf Gardent:1999:DPT.ps
%F Gardent:1999:DPT
%X We argue that model generation programs, i.e., deduction systems that automatically compute the interpretations satisfying a given formula, can provide a procedural interpretation for semantic theories of natural language. We illustrate this claim by describing how the higher-order model generator {\kimba} interprets definite descriptions.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus111.ps


%0 Conference Proceedings
%A Gardent, Claire
%A Striegnitz, Kristina
%D 2001
%T Generating Indirect Anaphora
%B 4th International Workshop on Computational Semantics (IWCS-4), January 10-12
%C Tilburg, The Netherlands
%! Generating Indirect Anaphora
%2 Gardent:2001:GIA.pdf Gardent:2001:GIA.ps
%F Gardent:2001:GIA
%X Much information in natural language can be left implicit. From the generation perspective, this raises the problem of how to model the processes and in particular, the reasoning,  underlying such implicitness. In this paper, we concentrate on the generation of one of the many natural language constructs supporting implicitness namely, indirect anaphora. We first summarize the inferences governing the use of indirect anaphors. We then show how indirect anaphors can be generated within a generation architecture which interleaves sentence realization with contextual reasoning.
%U http://www.coli.uni-sb.de/cl/projects/indigen/papers/iwcs4.ps.gz


%0 Conference Proceedings
%A Gardent, Claire
%A Thater, Stefan
%D 2001
%T Generating with a Grammar Based on Tree Descriptions: a Constraint-Based Approach
%E Bird, Steven
%B Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics (ACL'01), July 9-11
%C Toulouse, France
%! Generating with a Grammar Based on Tree Descriptions: a Constraint-Based Approach
%2 Gardent:2001:GGB.pdf Gardent:2001:GGB.ps
%F Gardent:2001:GGB
%X While the generative view of language processing builds bigger units out of smaller ones by means of rewriting steps, the axiomatic view eliminates in-valid linguistic structures out of a set of possible structures by means of well-formedness principles. We present a generator based on the axiomatic view and argue that when combined with a TAG-like grammar and a flat seman-tics, this axiomatic view permits avoiding drawbacks known to hold either of top-down or of bottom-up generators.
%U ftp://ftp.coli.uni-sb.de/pub/people/claire/eacl01.ps


%0 Conference Proceedings
%A Gardent, Claire
%A Webber, Bonnie
%D 1998
%T Describing Discourse Semantics
%B 4th International Workshop on Tree-Adjoining Grammars and Related Frameworks (TAG+), August 1-3
%C Philadelphia, USA
%! Describing Discourse Semantics
%F Gardent:1998:DDS


%0 Report
%A Gardent, Claire
%A Webber, Bonnie
%D 2000
%T Automated Reasoning and Discourse Disambiguation
%C Saarbrücken
%I Universität des Saarlandes
%P 24
%S CLAUS-Report
%7 113
%8 January
%! Automated Reasoning and Discourse Disambiguation
%2 Gardent:2000:ARD.pdf Gardent:2000:ARD.ps
%F Gardent:2000:ARD
%X The performance of first-order automated reasoning systems has been steadily improving, stimulated in part by the availability of test suites of mathematical problems on which the systems can be tested, tuned and compared. But discourse understanding in Natural Language poses different inference problems than mathematics. In order to tailor automated reasoning systems to the needs of Natural Language understanding, similar test suites need to be developed. In this paper, we claim that several kinds of ambiguity in discourse can be resolved through automated reasoning checks for consistency, informativity and minimality. Future test suites should therefore include problems of these sorts. The overall goal then is to characterise the range of inference problems that discourse understanding gives rise to and that test suites should include.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus113.ps


%0 Journal Article
%A Görz, Günther
%A Habel, Christopher
%A von Hahn, Walther
%A Pinkal, Manfred
%D 1990
%T Computerlinguistik als Studienfach - Zur Diskussion gestellt
%B Informatik-Spektrum
%V 13
%N 5
%P 276-279
%8 Oktober
%! Computerlinguistik als Studienfach - Zur Diskussion gestellt
%F Gorz:1990:CSD


%0 Conference Proceedings
%A Graf, Winfried
%A Krieger, Hans-Ulrich
%D 1990
%T Bedeutung multimodaler Benutzerschnittstellen am Beispiel eines Expertensystems in der MRI-Diagnostik
%E Giani, G.
%E Repges, R.
%B Biometrie und Informatik - Neue Wege zur Erkenntnisgewinnung in der Medizin. 34. Jahrestagung der GMDS, September 1989
%C Aachen, Germany
%I Springer
%V 71
%P 257-260
%S Medizinische Informatik, Biometrie und Epidemiologie
%! Bedeutung multimodaler Benutzerschnittstellen am Beispiel eines Expertensystems in der MRI-Diagnostik
%3 j
%F Graf:1990:BMB


%0 Book
%A Grice, Martine
%D 1995
%T The Intonation of Palermo Italian; Implications for Intonation Theory
%B Linguistische Arbeiten
%C Tübingen
%I Max Niemeyer Verlag
%V 334
%! The Intonation of Palermo Italian; Implications for Intonation Theory
%F Grice:1995:IPI


%0 Journal Article
%A Grice, Martine
%D 1995
%T Leading Tones and Downstep in English
%B Phonology
%V 12
%N 2
%P 183-233
%! Leading Tones and Downstep in English
%F Grice:1995:LTD


%0 Journal Article
%A Grice, Martine
%D 2001
%T Review of: Hirst, Di Cristo (eds.): Intonation Systems: A Survey of Twenty Languages
%B Journal of Linguistics
%V 37
%P 593-625
%! Review of: Hirst, Di Cristo (eds.): Intonation Systems: A Survey of Twenty Languages
%F Grice:2001:RHC


%0 Journal Article
%A Grice, Martine
%D 2002
%T Discussion paper: Dainora : An Empirically Based Probabilistic Model of Intonation in American English
%B Glot International
%! Discussion paper: Dainora : An Empirically Based Probabilistic Model of Intonation in American English
%F Grice:2002:DPD


%0 Journal Article
%A Grice, Martine
%D 2002
%T Review of: Botinis (ed): Intonation: Analysis, Modelling and Technology
%B Computational Linguistics
%V 28
%N 1
%P 87-89
%! Review of: Botinis (ed): Intonation: Analysis, Modelling and Technology
%F Grice:2002:RBE


%0 Conference Proceedings
%A Grice, Martine
%A Barry, William J.
%D 1991
%T Problems of Transcription and Labelling in the Specification of Segmental and Prosodic Structure
%B 12th International Congress of Phonetic Sciences
%C Aix-en-Provence, France
%V 5
%P 66-69
%! Problems of Transcription and Labelling in the Specification of Segmental and Prosodic Structure
%F Grice:1991:PTL


%0 Journal Article
%A Grice, Martine
%A Baumann, Stefan
%D 2002
%T Deutsche Intonation und GToBI
%B Linguistische Berichte
%V 191
%P 267-298
%! Deutsche Intonation und GToBI
%2 Grice:2002:DIG.pdf
%F Grice:2002:DIG
%X In this paper we provide an overview of work carried out on the intonation of Standard German,
both in auditory phonetic studies and in the instrumentally-based phonological accounts
within the autosegmental-metrical framework. We examine how far the different accounts
shed light on controversial issues such as leading tones, levels of phrasing, and phrase accents,
and propose a surface-oriented annotation framework, GToBI, which aims to capture all empirically
observed distinctive intonation patterns. For illustration purposes, the contours which
are reported to occur most commonly are given in schematic form, along with their GToBI
transcription and examples of their usage.
%U http://www.coli.uni-sb.de/phonetik/projects/Tobi/lingber-gtobi-2.pdf


%0 Book Section
%A Grice, Martine
%A Baumann, Stefan
%A Benzmüller, Ralf
%D to appear
%T German Intonation in Autosegmental-Metrical Phonology
%E Jun, S.-A.
%B Prosodic Typology and Transcription: A Unified Approach
%I Oxford University Press
%! German Intonation in Autosegmental-Metrical Phonology
%2 Grice:19xx:GIA.pdf
%F Grice:19xx:GIA


%0 Conference Proceedings
%A Grice, Martine
%A Benzmüller, Ralf
%A Savino, Michelina
%A Andreeva, Bistra
%D 1995
%T The Intonation of Queries and Checks across Languages: Data from Map Task Dialogues
%B 13th International Congress of Phonetic Sciences
%C Stockholm, Sweden
%P 648-651
%! The Intonation of Queries and Checks across Languages: Data from Map Task Dialogues
%F Grice:1995:IQC


%0 Book Section
%A Grice, Martine
%A D'Imperio, Mariapaola
%A Savino, Michelina
%A Avesani, Cinzia
%D 2001
%T Towards a Strategy for ToBI Labeling Varieties of Italian
%E Jun, S.-A.
%B Prosodic Typology and Transcription: A Unified Approach. Papers presented at the 1999 ICPhS satellite workshop on "Intonation: Models and ToBI Labeling"
%I Oxford University Press
%! Towards a Strategy for ToBI Labeling Varieties of Italian
%F Grice:2001:TST


%0 Journal Article
%A Grice, Martine
%A Ladd, D. Robert
%A Arvaniti, Amalia
%D 2000
%T On the Place of Phrase Accents in Intonational Phonology
%B Phonology
%V 17
%N 2
%P 143-185
%! On the Place of Phrase Accents in Intonational Phonology
%F Grice:2000:PPA


%0 Book Section
%A Grice, Martine
%A Leech, Geoffrey
%A Weisser, Martin
%A Wilson, Andrew
%D 2000
%T Representation and Annotation of Dialogue
%E Gibbon, D.
%E Mertins, I.
%E Moore, R.
%B Handbook of Multimodal and Spoken Dialogue Systems. Resources, Terminology and Product Evaluation
%C Dordrecht
%I Kluwer Academic Publishers
%P 1-101
%! Representation and Annotation of Dialogue
%F Grice:2000:RAD


%0 Conference Proceedings
%A Grice, Martine
%A Reyelt, Matthias
%A Benzmüller, Ralf
%A Mayer, Jörg
%A Batliner, Anton
%D 1996
%T Consistency in Transcription and Labelling of German Intonation with GToBI
%B 4th International Conference on Spoken Language Processing (ICSLP '96), October 3-6
%C Philadelphia, USA
%P 1716-1719
%! Consistency in Transcription and Labelling of German Intonation with GToBI
%F Grice:1996:CTL


%0 Conference Proceedings
%A Grice, Martine
%A Savino, Michelina
%D 1995
%T Low Tone versus 'sag' in Bari Italian Intonation; A Perceptual Experiment
%B 13th International Congress of Phonetic Sciences (ICPhS '95), August 13-19
%C Stockholm, Sweden
%P 658-661
%! Low Tone versus 'sag' in Bari Italian Intonation; A Perceptual Experiment
%F Grice:1995:LTV


%0 Conference Proceedings
%A Grice, Martine
%A Savino, Michelina
%D 1995
%T Intonation and Communicative Function in a Regional Variety of Italian
%B 4th International Society of Applied Psycholinguistics Congress "Psycholinguistics as a Multi-Disciplinarily Connected Science"
%C Bologna
%! Intonation and Communicative Function in a Regional Variety of Italian
%F Grice:1995:ICFa


%0 Journal Article
%A Grice, Martine
%A Savino, Michelina
%D 1995
%T Intonation and Communicative Function in a Regional Variety of Italian
%B PHONUS
%C Universität des Saarlandes, Phonetik, Saarbrücken
%V 1
%P 19-32
%! Intonation and Communicative Function in a Regional Variety of Italian
%2 Grice:1995:ICFb.pdf
%F Grice:1995:ICFb
%X This paper looks at a number of types of yes-no questions in Bari Italian: QUERIES, CHECKS and ALIGNS, as discussed in Carletta et al (1995), and another move referred to as OBJECT, which is both a response to what has just been said and a demand for clarification. The 'questioning' pitch accent identified in Grice and Savino (1995) is found in QUERIES, most ALIGNS, tentative and reasonably confident CHECKS, and OBJECTS. It is absent from very confident CHECKS or ALIGNS, in which cases the intonation pattern used is indistinguishable from that used in statements. A tripartite subcategorisation of CHECKS, according to the degree of confidence of the speaker, is reflected in the intonation by differences not only in accent type, but also in phrasing, and presence  or  absence  of  deaccenting.
%U http://www.coli.uni-sb.de/Phonetics/Research/PHONUS_research_reports/Phonus1/GriceSavino_PHONUS1.ps.gz


%0 Conference Proceedings
%A Grice, Martine
%A Savino, Michelina
%A Refice, Mario
%D 1997
%T Can Pitch Accent Type Convey Information-Status in yes-no Questions
%B 35th Annual Meeting of the Association for Computational Linguistics (ACL '97). Workshop on Concept to Speech Generation Systems, July 7-12
%C Madrid, Spain
%P 29-38
%! Can Pitch Accent Type Convey Information-Status in yes-no Questions
%F Grice:1997:CPA


%0 Journal Article
%A Grice, Martine
%A Savino, Michelina
%A Refice, Mario
%D 1997
%T The Intonation of Questions in Bari Italian: Do Speakers Replicate their Spontaneous Speech when Reading?
%B PHONUS
%C Universität des Saarlandes, Phonetik, Saarbrücken
%V 3
%P 1-7
%! The Intonation of Questions in Bari Italian: Do Speakers Replicate their Spontaneous Speech when Reading?
%2 Grice:1997:IQB.pdf
%F Grice:1997:IQB
%X In this paper we investigate the intonation of yes-no questions in Bari Italian across two speech styles. We compare the intonation of tokens produced in task-oriented dialogues with those read aloud, both from sentence-lists and from paragraph-length texts in which the target question was integrated. Results show that although all questions have a rising pitch accent, L+H* (already shown to be the marker of interrogation in Bari Italian by Grice and Savino 1995), they differ in their phrase-final F0 contour. A final rise to a high endpoint was found in 78% of read but only in 13% of spontaneous tokens. These data indicate that care should be taken when extending results from reading intonation to that of spontaneous speech.
%U http://www.coli.uni-sb.de/Phonetics/Research/PHONUS_research_reports/Phonus3/Grice_PHONUS3.ps.gz


%0 Conference Proceedings
%A Grigorova, Evelina
%A Filipov, Vladimir
%A Andreeva, Bistra
%D 1999
%T A Contrastive Investigation of Discourse Intonational Characteristic Features of Sofia Bulgarian and Hamburg German in MAP Task Dialogues
%B Proceedings of the 6th European Conference on Speech Communication and Technology (EUROSPEECH 99), September 5-9
%C Budapest
%V 1
%P 25-28
%! A Contrastive Investigation of Discourse Intonational Characteristic Features of Sofia Bulgarian and Hamburg German in MAP Task Dialogues
%2 Grigorova:1999:CID.pdf
%F Grigorova:1999:CID
%X Ten MAP Task dialogues for Sofia Bulgarian (SB) and six for Hamburg German (HG) are recorded and analyzed by means of X-Waves Software Package. The discourse intonation features focused on are denial and convergence. It has been observed that for German denial can be integrated into discourse-listing through intonation: Ja-acknowledge and Nein-/Ne-denial moves are both manifested by intonation rises. For Bulgarian, intonation rises in answering moves occur only in the acknowledge subtype: rises in denials (Ne-) are associated with uncertainty and surprise. The HG Ne- and SB Ne-moves are resynthesized by means of PSOLA, twelve stimuli being obtained for SB and sixteen for HG. Two appropriate contexts marked for discourse-listing and follow-up moves are excerpted from the MAP Task and are included in perceptual tests whereby native speakers are asked to determine the appropriateness of each stimulus in relation to each context. 'The results for Bulgarian contradict our preliminary observations. 
Convergence is defined as the matching of corresponding movements in pitch ranges and signals sympathetic agreement with the other speaker’s point of view. The check: answer move sequence can be viewed as instantiating convergence and exemplifies both lexical and Fo movement repetition, especially where ellipted moves are concerned. The two resynthesized sequences for HG and SB respectively are ”Im Westen” and ”Pravo nagore” as manifested in check and answering contexts. As above, native speakers are expected to determine the appropriateness of each stimulus in relation to each context. It has been observed that the differences between checks and answering moves for both HG and SB are phonetically manifested and are also established as being relevant by the perceptual tests, yet they cannot be accounted for phonologically by tone alignment: convergence seems to attenuate the phonological differentiation between checks and answering moves.
%U http://www.telecom.tuc.gr/paperdb/eurospeech99/PAPERS/S1O2/G002.PDF


%0 Edited Book
%A Haider, Hubert
%A Netter, Klaus
%D 1991
%T Representation and Derivation in the Theory of Grammar
%B Studies in Natural Language and Linguistic Theory
%C Dordrecht
%I Kluwer Academic Publishers
%V 22
%! Representation and Derivation in the Theory of Grammar
%3 j
%F Haider:1991:RDT


%0 Book Section
%A Hajicová, Eva
%A Kruijff-Korbayová, Ivana
%D 1997
%T On the Notion of Topic
%E Hajicová, Eva
%E Hoskovec, Tomás
%E Leška, Oldrich
%E Sgall, Petr 
%E Skoumalová, Zdena
%B Prague Linguistic Circle Papers
%C Amsterdam
%I John Benjamins Publishers
%V 3
%P 225-236
%! On the Notion of Topic
%F Hajicova:1997:NT


%0 Conference Proceedings
%A Hajicová, Eva
%A Kruijff-Korbayová, Ivana
%A Kruijff, Geert-Jan M.
%D 1998
%T Salience in Dialogues
%E Cmejrková, S.
%E Hoffmannová, J.
%E Müllerová, O.
%E Svetlá, J.
%B 5th International Congress of the International Association of Dialogue Analysis, April 17-20
%C Prague, Czech Republic
%I Max Niemeyer Verlag
%V 1
%P 381-393
%! Salience in Dialogues
%1 Hajicova:1998:SD.pdf Hajicova:1998:SD.ps
%F Hajicova:1998:SD
%U http://www.coli.uni-sb.de/~korbay/Publications/dialog.ps.gz


%0 Book Section
%A Hajicová, Eva
%A Kruijff-Korbayová, Ivana
%A Sgall, Petr
%D 1999
%T Prague Dependency Treebank: Restoration of Deletions
%E Matousek, Václav
%E Mautner, Pavel
%E Ocelíková, Jana
%E Sojka, Petr
%B Text, Speech and Dialogue - Second International Workshop, TSD'99, Plzen, Czech Republic, September 1999
%C Berlin
%I Springer
%V 1692
%P 44-49
%! Prague Dependency Treebank: Restoration of Deletions
%2 Hajicova:1999:PDT.pdf
%F Hajicova:1999:PDT
%U http://shadow.ms.mff.cuni.cz/pdt/Corpora/PDT_1.0/References/tsd99-deletion.pdf


%0 Thesis
%A Hansen, Silvia
%D 2002
%T The Nature of Translated Text - An Interdisciplinary Methodology for the Investigation of the Specific Properties of Translations
%C Saarbrücken, Germany
%I Institute for Applied Linguistics - Translation and Interpreting, Saarland University
%! The Nature of Translated Text - An Interdisciplinary Methodology for the Investigation of the Specific Properties of Translations
%F Hansen:2002:NTT


%0 Conference Proceedings
%D 2004
%T Proceedings of the 5th International Workshop on Linguistically Interpreted Corpora (LINC-04)
%E Hansen-Schirra, Silvia
%E Oepen, Stephan
%E Uszkoreit, Hans
%C Geneva
%! Proceedings of the 5th International Workshop on Linguistically Interpreted Corpora (LINC-04)
%F Hansen-Schirra:2004:PIW


%0 Conference Proceedings
%A Hansen, Silvia
%A Teich, Elke
%D 2002
%T The creation and exploitation of a translation reference corpus
%B Proceedings of the First International Workshop on Language Resources for Translation Work and Research (3rd International Conference on Language Resources and Evaluation (LREC-2002)), May 28
%C Las Palmas de Gran Canaria, Spain
%! The creation and exploitation of a translation reference corpus
%F Hansen:2002:CET
%X While in many branches of linguistics monolingual reference corpora are widely used, e.g., in lexicography, in the construction of grammars and generally in empirical linguistic studies, in translation research as well as translation practice the concept of a parallel refernce corpus has not yet assumed a similarly important role. In our view, this is partly due to a lack of interaction of researchers involved in the development of corpus tools (computational linguistics, humanities computing) and the potential users of such tools in the area of translation (translatology, translation practice). The goal of the present paper is to initiate such an interaction. We present the design of an German-English and French-English translation corpus and explore its use as a reference corpus for translatologists as well as translators. First, we introduce the the basic computational techniques needed to build such a translation reference corpus. These techniques cover the preparation of the corpus as well as its linguistic annotation. In the preparatory step the corpus has to be aligned and encoded. To enrich the corpus with linguistic information, part-of-speech tagging and syntactic parsing have to be carried out for the different languages. Furthermore, to make the parallel reference corpus usable for translation scholars and translators, it has to be searchable, i.e., appropriate query facilities must be provided. We show how to extract instances of linguistic phenomena that are of interest from a translation point of view using a multilingual English-German-French corpus. We explain possible translation procedures for perfect aspect, reduced relative clauses and cleft constructions from English into German and French on the basis of parallel concordances extracted from the translation reference corpus. Finally, we specify some additional requirements to improve the usability of translation corpora in both translation studies and translation practice.
%U http://www.coli.uni-sb.de/~hansen/hansen-teich.zip


%0 Journal Article
%A Hardcastle, William J.
%A Barry, William J.
%D 1989
%T Articulatory and Perceptual Factors in /l/ Vocalisations in English
%B Journal of the International Phonetics Association
%V 15
%N 2
%P 3-17
%! Articulatory and Perceptual Factors in /l/ Vocalisations in English
%F Hardcastle:1989:APF


%0 Journal Article
%A Haridi, Seif
%A Van Roy, Peter
%A Brand, Per
%A Mehl, Michael
%A Scheidhauer, Ralf
%A Smolka, Gert
%D 1999
%T Efficient Logic Variables for Distributed Computing
%B ACM Transactions on Programming Languages and Systems
%V 21
%N 3
%P 569-626
%! Efficient Logic Variables for Distributed Computing
%2 Haridi:1999:ELV.pdf Haridi:1999:ELV.ps
%F Haridi:1999:ELV
%X We define a practical algorithm for distributed rational tree unification and prove its correctness in both the off-line and on-line cases. We derive the distributed algorithm from a centralized one, showing clearly the trade-offs between local and distributed execution. The algorithm is used to realize logic variables in the Mozart Programming System, which implements the Oz language (see http://www.mozart-oz.org/). Oz appears to the programmer as a concurrent object-oriented language with dataflow synchronization. Logic variables implement the dataflow behavior. We show that logic variables can easily be added to the more restricted models of Java and ML, thus providing an alternative way to do concurrent programming in these languages. We present common distributed programming idioms in a network-transparent way using logic variables. We show that in common cases the algorithm maintains the same message latency as explicit message passing. In addition, it is able to handle uncommon cases that arise from the properties of latency tolerance and third-party independence. This is evidence that using logic variables in distributed computing is beneficial at both the system and language levels. At the system level, they improve latency tolerance and third-party independence. At the language level, they help make network-transparent distribution practical.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/TOPLAS99.ps.gz


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


%0 Conference Proceedings
%A Haridi, Seif
%A Van Roy, Peter
%A Smolka, Gert
%D 1997
%T An Overview of the Design of Distributed Oz
%B 2nd International Symposium on Parallel Symbolic Computation (PASCO '97), July 20-22
%C Maui, Hawaii, USA
%I ACM Press
%P 176-187
%! An Overview of the Design of Distributed Oz
%2 Haridi:1997:ODD.pdf Haridi:1997:ODD.ps
%F Haridi:1997:ODD
%X We present a design for a distributed programming system, Distributed Oz, that abstracts away the network. This means that all network operations are invoked implicitly by the system as an incidental result of using particular language constructs. However, since network operations are expensive, the programmer must retain control over network communication patterns. This control is provided through the language constructs. While retaining their centralized semantics, they are extended with a distributed semantics. Distributed Oz is an extension of Oz, a concurrent state-aware language with first-class procedures. Distributed Oz extends Oz with just two concepts: mobility control and asynchronous ordered communication. Mobility control provides for truly mobile objects in a simple and clean way. Asynchronous ordered communication allows to conveniently build servers. These two concepts give the programmer a control over network communications that is both simple and predictable. We give scenarios to show how common distributed programming tasks can be implemented efficiently. There are two reasons for the simplicity of Distributed Oz. First, Oz has a simple formal semantics. Second, the distributed extension is built using network protocols that are natural extensions to the centralized language operations. We discuss the operational semantics of Oz and Distributed Oz and the architecture of the distributed implementation. We give an overview of the basic network protocols for communication and mobility.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/PASCO97.ps.gz


%0 Conference Proceedings
%A Heine, Julia
%D 1998
%T Definiteness Predictions for Japanese Noun Phrases
%E ACL
%B 17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association for Computational Linguistics (COLING-ACL '98), August 10-14
%C Montreal, Canada
%I Morgan Kaufmann Publishers
%! Definiteness Predictions for Japanese Noun Phrases
%2 Heine:1998:DPJ.pdf
%F Heine:1998:DPJ
%U http://acl.ldc.upenn.edu/P/P98/P98-1085.pdf


%0 Conference Proceedings
%A Heinecke, Johannes
%A Worm, Karsten
%D 1996
%T A Lexical Semantic Database for Verbmobil
%E Kiefer, F.
%E Kiss, G.
%E Pajzs, J.
%B 4th Conference on Computational Lexicography and Text Research (COMPLEX '96), September 18-21
%C Budapest, Hungary
%! A Lexical Semantic Database for Verbmobil
%2 Heinecke:1996:LSD.pdf
%F Heinecke:1996:LSD


%0 Edited Proceedings
%A Heinsohn, Jochen
%A Hollunder, Bernhard
%D 1992
%T Proceedings of the DFKI Workshop on Taxonomic Reasoning
%C Saarbrücken
%I DFKI
%S DFKI Document
%7 D-92-08
%! Proceedings of the DFKI Workshop on Taxonomic Reasoning
%F Heinsohn:1992:PDW


%0 Book Section
%A Hemforth, Barbara
%A Konieczny, Lars
%A Scheepers, Christoph
%D 2000
%T Modifier Attachment: Relative Clauses and Coordinations
%E Hemforth, B.
%E Konieczny, L.
%B German Sentence Processing
%C Dodrecht
%I Kluwer Academic Publishers
%P 159-183
%! Modifier Attachment: Relative Clauses and Coordinations
%F Hemforth:2000:MAR


%0 Book Section
%A Hemforth, Barbara
%A Konieczny, Lars
%A Scheepers, Christoph
%D 2000
%T Syntactic Attachment and Anaphor Resolution: The two Sides of Relative Clause Attachment
%E Crocker, M. W.
%E Pickering, M. J.
%E Clifton, C. Jr.
%B Architectures and Mechanisms for Language Processing
%C Cambridge, UK
%I Cambridge University Press
%P 259-281
%! Syntactic Attachment and Anaphor Resolution: The two Sides of Relative Clause Attachment
%F Hemforth:2000:SAA


%0 Book Section
%A Hemforth, Barbara
%A Konieczny, Lars
%A Scheepers, Christoph
%A Strube, Gerhard
%D 1998
%T Syntactic Ambiguity Resolution in German
%E Hillert, D.
%B Syntax and Semantics: A Cross-Linguistic Perspective
%C San Diego
%I Academic Press
%! Syntactic Ambiguity Resolution in German
%F Hemforth:1998:SAR


%0 Conference Proceedings
%A Henz, Martin
%D 1996
%T Don't Be Puzzled!
%B Workshop on Constraint Programming Applications: An Inventory and Taxonomy. In conjunction with the 2nd International Conference on Principles and Practice of Constraint Programming (CP '96), August 19
%C Cambridge, Massachusetts, USA
%! Don't Be Puzzled!
%2 Henz:1996:DP.pdf Henz:1996:DP.ps
%F Henz:1996:DP
%X This paper is about how to solve a class of puzzles, called self-referential quizzes (\textit{srq}), with constraint programming. An \textit{srq} is a sequence of multiple choice questions that are about the puzzle itself. \textit{srq}s are an attractive pastime, when they provide the possibility of drawing non-trivial conclusions on the way to the solution. We introduce a typical \textit{srq}, and represent it as a propositional satisfiability problem. Its straightforward clausal representation is too big for effective treatment using standard methods. Instead, we solve it with finite domain constraint programming. For this application of constraint programming, support of logic connectives such as conjunction and disjunction is crucial. With their small problem descriptions, \textit{srq}s are ideal candidates for benchmarks covering the implementation of 0/1 variables in constraint programming languages.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/puzzle96.ps.gz


%0 Thesis
%A Henz, Martin
%D 1997
%T Objects in Oz
%C Saarbrücken
%I Universität des Saarlandes, Fachbereich Informatik
%! Objects in Oz
%F Henz:1997:OO
%X The programming language Oz integrates the paradigms of imperative, functional and concurrent constraint programming in a computational framework of unprecedented breadth, featuring stateful programming through cells, lexically scoped higher-order programming, and explicit concurrency synchronized by logic variables. Object-oriented programming is another paradigm that provides a set of concepts useful in software practice. In this thesis we address the question how object-oriented programming can be suitably supported in Oz. As a lexically scoped higher-order language, Oz can express a wide range of object-oriented concepts. We present a simple yet expressive object system, demonstrate its usability and outline an efficient implementation. A central aspect of Oz is its support for concurrent computation. We examine the impact of concurrency on the design of an object system and explore the use of objects in concurrent programming.


%0 Book
%A Henz, Martin
%D 1997
%T Objects for Concurrent Constraint Programming
%B The Kluwer International Series in Engineering and Computer Science
%C Boston
%I Kluwer Acdemic Publishers
%V 426
%! Objects for Concurrent Constraint Programming
%2 Henz:1997:OCC.pdf Henz:1997:OCC.ps
%F Henz:1997:OCC
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Diss-Henz.ps.gz


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


%0 Conference Proceedings
%A Henz, Martin
%A Lauer, Stefan
%A Zimmermann, Detlev
%D 1996
%T COMPOzE - Intention-Based Music Composition through Constraint Programming
%E Society, IEEE Computer
%B 8th IEEE International Conference on Tools with Artificial Intelligence (ICTAI '96), November 16-19
%C Toulouse, France
%P 118-121
%! COMPOzE - Intention-Based Music Composition through Constraint Programming
%2 Henz:1996:CIB.pdf Henz:1996:CIB.ps
%F Henz:1996:CIB
%X The goal of this work is to derive four-voice music pieces from given musical plans, which describe the harmonic flow and the intentions of a desired composition. We developed the experimentation platform COMPOzE for intention-based composition. COMPOzE is based on constraint programming over finite domains of integers. We argue that constraint programming provides a suitable technology for this task and that the libraries and tools available for the constraint programming system Oz effectively support the implementation of COMPOzE. This work links the research areas of of automatic music composition on one hand and finite domain constraint programming on the other, and contributes the tool COMPOzE, which practically demonstrates the potential of constraint programming to open up new areas of application for automatic music composition.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/COMPOzE96.ps.gz


%0 Conference Proceedings
%A Henz, Martin
%A Müller, Tobias
%D 2000
%T An Overview of Finite Domain Constraint Programming
%B 5th Conference of the Association of Asia-Pacific Operations Research Societies (APORS '00), July 5-7
%C Singapore, Republic of Singapore
%! An Overview of Finite Domain Constraint Programming
%2 Henz:2000:OFD.pdf Henz:2000:OFD.ps
%F Henz:2000:OFD
%X In recent years, the repertoire of available techniques for solving combinatorial problems has seen a significant addition: constraint programming. Constraint programming is best seen as a framework for combining software components to achieve problem-specific solvers. The strength of constraint programming depends on the synergy that can be achieved between these components. In this tutorial introduction, we give an overview of constraint programming for solving combinatorial problems.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/amai2000.ps.gz


%0 Conference Proceedings
%A Henz, Martin
%A Müller, Tobias
%A Boon Ng, Ka
%D 1999
%T Figaro: Yet another Constraint Programming Library
%B Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages, December 1
%C Las Cruces, New Mexico, USA
%! Figaro: Yet another Constraint Programming Library
%2 Henz:1999:FYA.ps
%F Henz:1999:FYA
%X Existing libraries and languages for finite domain constraint programming usually have depth-first search (with branch and bound) built-in as the only search algorithm. Exceptions are the languages CLAIRE and Oz, which support the programming of different search algorithms through special purpose programming language constructs. The goal of this work is to make abstractions for programming search algorithms available in a language-independent setting by using the concept of a room. Figaro is an experimentation platform being designed to study non-standard search algorithms, different memory policies for search (trailing vs copying), consistency algorithms, failure handling and support for modeling. Figaro is conceived as a C++ library providing abstractions based on the concept of a room. This paper focuses on the use and implementation of such abstractions for investigating programmable search algorithms and memory policies in a C++ constraint programming library.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/figaro-parimplws99.ps.gz


%0 Journal Article
%A Henz, Martin
%A Würtz, Jörg
%D 1996
%T Constraint-Based Time Tabling - A Case Study
%B Applied Artificial Intelligence
%V 10
%N 5
%P 439-453
%! Constraint-Based Time Tabling - A Case Study
%1 http://www.ps.uni-sb.de/Papers/abstracts/AAI96.html
%F Henz:1996:CBT
%X In this paper, we concentrate on a typical scheduling problem: the computation of a time table for a German college. Like many other scheduling problems, this problem contains a variety of complex constraints and necessitates special-purpose search strategies. Techniques from Operations Research and traditional constraint logic programming are not able to express these constraints and search strategies on a sufficiently high level of abstraction. We show that the higher-order concurrent constraint language Oz provides this high-level expressivity, and can serve as a useful programming tool for college time tabling.


%0 Edited Proceedings
%A Hiemstra, Djoerd
%A de Jong, Franciska
%A Netter, Klaus
%D 1998
%T Language Technology in Multimedia Information Retrieval. Proceedings of the 14th Twente Workshop on Language Technology (TWLT-14), December 7-8
%C Enschede, The Netherlands
%! Language Technology in Multimedia Information Retrieval. Proceedings of the 14th Twente Workshop on Language Technology (TWLT-14), December 7-8
%3 j
%F Hiemstra:1998:LTM


%0 Conference Proceedings
%A Hinkelman, Elizabeth
%D 1992
%T Abuction, Beliefs and Context
%B Proceedings of the 2nd ESPRIT PLUS Workshop in Computational Pragmatics, September 14-18
%C Alghero, Sardaigne
%! Abuction, Beliefs and Context
%3 j
%F Hinkelman:1992:ABC


%0 Conference Proceedings
%A Hinkelman, Elizabeth
%D 1992
%T Intonation and the Request/ Question Distinction
%B 2nd International Conference on Spoken-Language Processing, October
%C Banff, Alberta, Canada
%! Intonation and the Request/ Question Distinction
%3 j
%F Hinkelman:1992:IRQ


%0 Conference Proceedings
%A Hinkelman, Elizabeth
%A Allen, James F.
%D 1989
%T Two Constraints on Speech Act Ambiguity
%E ACL
%B 27th Annual Meeting of the Association for Computational Linguistics (ACL '89), June 26-29
%C University of British Columbia, Vancouver, BC, Canada
%P 212-219
%! Two Constraints on Speech Act Ambiguity
%3 j
%F Hinkelman:1989:TCS


%0 Journal Article
%A Hinkelman, Elizabeth
%A Fass, Dan
%A Martin, James
%D 1992
%T Special Issue on Non-Literal Language
%B Computational Intelligence. An International Journal
%V 8
%N 3
%P 411-599
%! Special Issue on Non-Literal Language
%3 j
%F Hinkelman:1992:SIN


%0 Conference Proceedings
%A Hinkelman, Elizabeth
%A Spackman, Stephen P.
%D 1992
%T Abductive Speech Act Recognition, Corporate Agents and the COSMA System
%E Black, William
%E Sabah, Gérard
%E Wachtel, Tom
%B Proceedings of the 2nd ESPRIT PLUS Workshop on Computational Pragmatics: Abduction, Beliefs and Context
%C Alghero, Sardaigne
%! Abductive Speech Act Recognition, Corporate Agents and the COSMA System
%2 Hinkelman:1992:ASA.pdf Hinkelman:1992:ASA.ps
%3 j
%F Hinkelman:1992:ASA
%X This chapter presents an overview of the DISCO project's solutions to several problems in natural language pragmatics. Its central focus is on relating utterances to intentions through speech act recognition. Subproblems include the incorporation of linguistic cues into the speech act recognition process, precise and efficient multiagent belief attribution models (Corporate Agents), and speech act representation and processing using Corporate Agents. These ideas are being tested within the COSMA appointment scheduling system, one application of the DISCO natural language interface. Abductive speech act processing in this environment is not far from realizing its potential for fully bidirectional implementation.
%U http://www.cs.tufts.edu/~elizh/sard.ps


%0 Report
%A Hinkelman, Elizabeth
%A Spackman, Stephen P.
%D 1993
%T Abductive Speech Act Recognition, Corporate Agents and the COSMA System
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-93-31
%! Abductive Speech Act Recognition, Corporate Agents and the COSMA System
%2 Hinkelman:1993:ASA.pdf Hinkelman:1993:ASA.ps
%3 j
%F Hinkelman:1993:ASA
%X This chapter presents an overview of the DISCO project's solutions to several problems in natural language pragmatics. Its central focus is on relating utterances to intentions through speech act recognition. Subproblems include the incorporation of linguistic cues into the speech act recognition process, precise and efficient multiagent belief attribution models (Corporate Agents), and speech act representation and processing using Corporate Agents. These ideas are being tested within the COSMA appointment scheduling system, one application of the DISCO natural language interface. Abductive speech act processing in this environment is not far from realizing its potential for fully bidirectional implementation.
%U http://www.cs.tufts.edu/~elizh/sard.ps


%0 Conference Proceedings
%A Hinkelman, Elizabeth
%A Spackman, Stephen P.
%D 1994
%T Communicating with Multiple Agents
%B Proceedings of the 15th International Conference on Computational Linguistics (COLING'94), August 5-9
%C Kyoto, Japan
%V 2
%P 1191-1197
%! Communicating with Multiple Agents
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/Hin_Spa_Coling94.entry
%2 Hinkelman:1994:CMA.pdf Hinkelman:1994:CMA.ps
%3 j
%F Hinkelman:1994:CMA
%X Previous dialogue systems have focussed on dialogues between two agents. Many applications, however, require conversations between several participants. This paper extends speech act definitions to handle multi-agent conversations, based on a model of multi-agent belief attribution with some unique properties. Our approach has the advantage of capturing a number of interesting phenomena in a straightforward way.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/Hin_Spa_Coling94.ps.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/Hin_Spa_Coling94.entry


%0 Report
%A Hinkelman, Elizabeth
%A Vonerden, Markus
%A Jung, Christoph
%D 1993
%T Natural Language Software Registry
%C Saarbrücken
%I DFKI
%S DFKI Document
%7 D-93-10
%! Natural Language Software Registry
%2 Hinkelman:1993:NLS.pdf Hinkelman:1993:NLS.ps
%3 j
%F Hinkelman:1993:NLS
%U http://www.umich.edu/~archive/linguistics/software/nl.software.registry/DFKI-D-93-10.ps.Z


%0 Conference Proceedings
%A Holloway King, Tracy
%A Dipper, Stefanie
%A Frank, Anette
%A Kuhn, Jonas
%A Maxwell, John
%D 2000
%T Ambiguity Management in Grammar Writing
%E Hinrichs, Erhard
%E Meurers, Detmar
%E Wintner, Shuly
%B Proceedings of the Workshop on Linguistic Theory and Grammar Implementation (ESSLLI-2000)
%C Birmingham, UK
%P 5-19
%! Ambiguity Management in Grammar Writing
%2 King:2000:AMG.pdf King:2000:AMG.ps
%F King:2000:AMG
%X When lingusitically motivated grammars are implemented on a larger scale, and applied toreal-life corpora, keeping track of ambiguity sources becomes a difficult task. Yet it is of great importance, since unintended ambiguities arising from underrestricted rules or interactions haveto be distinguished from linguistically warranted ambiguities. In this paper we report on various tools in the XLE grammar development platform which can be used for ambiguity managementin grammar writing. In particular, we look at packed representations of ambiguities that allow the grammar writer to view sorted descriptions of ambiguity sources. Also discussed are tools forspecifying desired tree structures and for cutting down the solution space prior to parsing.
%O Revised and extended version to appear 2002 in: Special issue of the Journal of Language and Computation
%U http://www.dfki.de/~frank/papers/ESSLLI00-Dipperetal.ps.gz


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


%0 Conference Proceedings
%A Huckvale, Mark A.
%A Howard, I. S.
%A Barry, William J.
%D 1989
%T Automatic Phonetic Feature Labelling of Continuous Speech
%E Tubach, J. P.
%E Mariani, J. J.
%B European Conference on Speech Communication and Technology (EUROSPEECH '89)
%C Edinburgh, Scotland
%V 2
%P 565-568
%! Automatic Phonetic Feature Labelling of Continuous Speech
%F Huckvale:1989:APF


%0 Conference Proceedings
%A Hutter, Dieter
%A Kohlhase, Michael
%D 1997
%T A Coloured Version of the Lambda-Calculus
%E McCune, W.
%B 14th International Conference on Automated Deduction (CADE-14), July 13-17
%C James Cook University, Townsville, Australia
%I Springer
%P 291-305
%S Lecture Notes in Artificial Intelligence
%7 1249
%! A Coloured Version of the Lambda-Calculus
%F Hutter:1997:CVL


%0 Journal Article
%A Hutter, Dieter
%A Kohlhase, Michael
%D 2000
%T Managing Structural Information by Higher-Order Colored Unification
%B Journal of Automated Reasoning
%V 25
%P 123-164
%! Managing Structural Information by Higher-Order Colored Unification
%F Hutter:2000:MSI


%0 Conference Proceedings
%A Iida, Masayo
%A Nerbonne, John
%A Proudian, Derek
%A Roberts, Diana
%D 1989
%T Accommodating Complex Applications
%E Zernik, U.
%B 11th International Joint Conference on Artificial Intelligence (IJCAI '89). 1st International Workshop on Lexical Acquisition, August
%C Detroit, Michigan, USA
%I Morgan Kaufmann Publishers
%! Accommodating Complex Applications
%F Iida:1989:ACA


%0 Report
%A Jaspars, Jan
%D 1997
%T Minimal Logics for Reasoning with Ambiguous Expressions
%C Saarbrücken
%I Universität des Saarlandes
%P 27
%S CLAUS-Report
%7 94
%8 December
%! Minimal Logics for Reasoning with Ambiguous Expressions
%2 Jaspars:1997:MLR.pdf Jaspars:1997:MLR.ps
%F Jaspars:1997:MLR
%X Alshawi and Crouch defined a simple multi-valued truth-conditional semantics for quasi logical form, a representation language for underspecified expressions. We incorporate this so-called monotonic semantics within the setting of plain propositional logic, and investigate the underlying calculi. It turns out that evaluation of ambiguous expressions with respect to a partial disambiguation, that is, possible readings maybe excluded on the moment of interpretation, yields the most attractive notion of validity in this setting. Besides the fact that it satisfies characteristic criteria of 'ambiguous reasoning', the underlying logic is also a suitable candidate as a minimal calculus for this task. Natural extensions of the calculus correspond to intuitive constraints on partial disambiguations. The paper presents this calculus and different extensions in a special Gentzen format, well-equipped for reasoning with 'multiple readings'. Two technical appendices contain the completeness proofs for the various calculi.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus94.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus94.dvi


%0 Conference Proceedings
%A Jaspars, Jan
%A Koller, Alexander
%D 1999
%T A Calculus for Direct Deduction with Dominance Constraints
%B 12th Amsterdam Colloquium (AC '99)
%C Amsterdam, The Netherlands
%! A Calculus for Direct Deduction with Dominance Constraints
%2 Jaspars:1999:CDD.pdf Jaspars:1999:CDD.ps
%F Jaspars:1999:CDD
%X Underspecification has recently been a popular approach to dealing with ambiguity. An important operation in this context is direct deduction, deduction on underspecified descriptions which is justified by the meaning of the described formulae. Here we instantiate an abstract approach to direct deduction to dominance constraints, a concrete underspecification formalism, and obtain a sound and complete calculus for this formalism.
%U http://www.coli.uni-sb.de/~koller/papers/domded.ps.gz


%0 Edited Book
%A Kamp, Hans
%D 1991
%T Tense and Aspect in English and French
%B Dyana-Deliverable
%C Edinburgh
%I Center for Cognitive Science
%V R2.3.B
%! Tense and Aspect in English and French
%F Kamp:1991:TAE


%0 Conference Proceedings
%A Kaplan, Ronald
%A Netter, Klaus
%A Wedekind, Jürgen
%A Zaenen, Annie
%D 1989
%T Translation by Structural Correspondences
%E ACL
%B 4th Conference of the European Chapter of the Association for Computational Linguistics (ACLEUROPE '89)
%C Manchester, England
%P 272-281
%! Translation by Structural Correspondences
%3 j
%F Kaplan:1989:TSC


%0 Book Section
%A Kaplan, Ronald M.
%A Netter, Klaus
%A Wedekind, Jürgen
%A Zaenen, Annie
%D 1995
%T Translation by Structural Correspondences
%E Dalrymple, Mary
%E Kaplan, Ronald M.
%E Maxwell, John
%E Zaenen, Annie
%B Formal Issues in Lexical Functional Grammar
%C Stanford
%I CSLI
%P 311-329
%! Translation by Structural Correspondences
%2 Kaplan:1995:TSC.pdf Kaplan:1995:TSC.ps
%3 j
%F Kaplan:1995:TSC
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knwzEACL89.ps.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knwzEACL89.entry


%0 Conference Proceedings
%A Karagjosova, Elena
%D 2000
%T A Unified Approach to the Meaning and Function of Modal Particles in Dialogue
%E Pilire, Catherine
%B Proceedings of the ESSLLI 2000 Student Session, August 6-18
%C University of Birmingham, UK
%! A Unified Approach to the Meaning and Function of Modal Particles in Dialogue
%2 Karagjosova:2000:UAM.pdf Karagjosova:2000:UAM.ps
%F Karagjosova:2000:UAM
%U http://www.coli.uni-sb.de/~elka/Papers/karagjosova.ps


%0 Conference Proceedings
%A Karagjosova, Elena
%D 2001
%T Interpreting Utterances with Modal Particles
%B Proceedings of the 4th International Workshop on Computational Semantics (IWCS-4), January 10-12
%C Tilburg, The Netherlands
%! Interpreting Utterances with Modal Particles
%2 Karagjosova:2001:IUM.pdf Karagjosova:2001:IUM.ps
%F Karagjosova:2001:IUM
%U http://coli.uni-sb.de/~elka/Papers/Tilburg_final.ps


%0 Conference Proceedings
%A Karagjosova, Elena
%D 2001
%T Modal Particles and the Common Ground: Meaning and Functions of German ja, doch, eben/halt and auch
%E Kühnlein, Peter
%E Rieser, Hannes
%E Zeevat, Henk
%B Proceedings 5th Workshop on Formal Semantics and Pragmatics of Dialogue (BI-DIALOG), June 14-16
%C Bielefeld, Germany
%! Modal Particles and the Common Ground: Meaning and Functions of German ja, doch, eben/halt and auch
%2 Karagjosova:2001:MPC.pdf Karagjosova:2001:MPC.ps
%F Karagjosova:2001:MPC
%U http://coli.uni-sb.de/~elka/Papers/bi-dial-final.ps


%0 Conference Proceedings
%A Karagjosova, Elena
%D 2001
%T Towards a Comprehensive Meaning of German doch
%B Proceedings of the ESSLLI 2001 Student Session, August 13-24
%C Helsinki, Finland
%! Towards a Comprehensive Meaning of German doch
%2 Karagjosova:2001:TCM.pdf Karagjosova:2001:TCM.ps
%F Karagjosova:2001:TCM
%U http://coli.uni-sb.de/~elka/Papers/elena_karagjosova.ps


%0 Conference Proceedings
%A Karagjosova, Elena
%A Kruijff-Korbayová, Ivana
%D 2002
%T An Analysis of Conditional Responses in Dialogue
%E Sojka, Petr
%E Kopecek, Ivan
%E Pala, Karel
%B 5th International Conference on TEXT, SPEECH and DIALOGUE (TSD 2002), September 9-12
%C Brno, Czech Republic
%I Springer Verlag
%P 317-320
%S Lecture Notes in Artificial Intelligence LNCS/LNAI 2448
%! An Analysis of Conditional Responses in Dialogue
%2 Karagjosova:2002:ACR.pdf Karagjosova:2002:ACR.ps
%F Karagjosova:2002:ACR
%O forthcoming
%U http://coli.uni-sb.de/~elka/Papers/tsd02-final.ps


%0 Conference Proceedings
%A Karagjosova, Elena
%A Kruijff-Korbayová, Ivana
%D 2002
%T Conditional Responses in Information Seeking Dialogues
%E Jokinen, Kristiina 
%E McRoy, Susan
%B 3rd SIGdial Workshop on Discourse and Dialogue, July 11-12
%C ACL, Philadelphia, Pennsylvania, USA
%P 84-87
%! Conditional Responses in Information Seeking Dialogues
%2 Karagjosova:2002:CRI.pdf Karagjosova:2002:CRI.ps
%F Karagjosova:2002:CRI
%O forthcoming
%U http://coli.uni-sb.de/~elka/Papers/sigdial-final.ps


%0 Report
%A Karger, Reinhard
%D 1991
%T Der morphologische Komparativ in der Nominalphrase
%C Saarbrücken
%I Universität des Saarlandes
%S Technical Report
%! Der morphologische Komparativ in der Nominalphrase
%F Karger:1991:MKN


%0 Report
%A Karger, Reinhard
%D 1992
%T Phrasal comparatives in HPSG
%C Saarbrücken
%I Universität des Saarlandes
%S Technical Report
%! Phrasal comparatives in HPSG
%F Karger:1992:PCH


%0 Report
%A Karger, Reinhard
%A Lerner, Jean-Yves
%A Pinkal, Manfred
%D 1993
%T Zur syntaktisch-semantischen Analyse attributiver Komparative
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 30
%8 March
%! Zur syntaktisch-semantischen Analyse attributiver Komparative
%F Karger:1993:SSA


%0 Conference Proceedings
%A Karlgren, Jussi
%A Gambäck, Björn
%A Samuelsson, Christer
%D 1993
%T Clustering Sentences
%B 9th Scandinavian Conference on Computational Linguistics
%C Stockholm University, Stockholm, Sweden
%P 143-154
%! Clustering Sentences
%2 Kalgren:1993:CS.pdf Kalgren:1993:CS.ps
%F Karlgren:1993:CS
%U www.sics.se/humle/papers/nodalida93_cluster.ps


%0 Conference Proceedings
%A Kasper, Robert
%A Kiefer, Bernd
%A Netter, Klaus
%A Shanker, Vijay K.
%D 1995
%T Compilation of HPSG to TAG
%B Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics (ACL-ANNUAL'95), June 26-30
%C Cambridge, Massachusetts, USA
%P 92-99
%! Compilation of HPSG to TAG
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knacl95.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knacl95.dvi.Z
%2 Kasper:1995:CHTa.pdf Kasper:1995:CHTa.ps
%3 j
%F Kasper:1995:CHTa
%X We present an implemented compilation algorithm that translates HPSG into lexicalized feature-based TAG, relating concepts of the two theories. While HPSG has a more elaborated principle-based theory of possible phrase structures, TAG provides the means to represent lexicalized structures more explicitly. Our objectives are met by giving clear definitions that determine the projection of structures from the lexicon, and identify maximal projections, auxiliary trees and foot nodes.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knacl95.ps.Z


%0 Conference Proceedings
%A Kasper, Robert
%A Kiefer, Bernd
%A Netter, Klaus
%A Vijay-Shanker, Krishnamurti
%D 1995
%T Compilation of HPSG to TAG
%E ACL
%B 33rd Annual Meeting of the Association for Computational Linguistics (ACL-ANNUAL '95), June 26-30
%C Cambridge, Massachusetts, USA
%P 92-99
%! Compilation of HPSG to TAG
%2 Kasper:1995:CHT.pdf Kasper:1995:CHT.ps Kasper:1995:CHT.dvi
%3 j
%F Kasper:1995:CHT
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knacl95.ps.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knacl95.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knacl95.dvi.Z


%0 Book Section
%A Kasper, Walter
%D 1989
%T Situationen und Einstellungen
%E Falkenberg, G.
%B Wissen, Wahrnehmen, Glauben. Epistemische Ausdrücke und propositionale Einstellungen
%C Tübingen
%I Niemeyer
%P 97-121
%! Situationen und Einstellungen
%3 j
%F Kasper:1989:SE


%0 Report
%A Kasper, Walter
%D 1992
%T Semantische Repräsentation
%C Stuttgart
%I Institut für Maschinelle Sprachverarbeitung (IMS)
%S Arbeitspapiere des SFB 340 Sprachtheoretische Grundlagen für die Computerlinguistik
%7 10
%! Semantische Repräsentation
%3 j
%F Kasper:1992:SR


%0 Journal Article
%A Kasper, Walter
%D 1992
%T Presuppositions, Composition, and Simple Subjunctives
%B Journal of Semantics
%V 9
%P 197-221
%! Presuppositions, Composition, and Simple Subjunctives
%3 j
%F Kasper:1992:PCS


%0 Book Section
%A Kasper, Walter
%D 1992
%T The Construction of Semantic Representations from F-Structures
%E Bes, G. G.
%E Guillotin, T.
%B A Natural Language and Graphics Interface. Results and Perspectives from the ACORD Project
%C Berlin
%I Springer
%P 6-22
%S Research Reports ESPRIT
%! The Construction of Semantic Representations from F-Structures
%3 j
%F Kasper:1992:CSR


%0 Conference Proceedings
%A Kasper, Walter
%D 1993
%T Integration of Syntax and Semantics in Feature Structures
%E Busemann, S.
%E Harbusch, K.
%B Proceedings of the DFKI Workshop on Natural Language Systems: Re-Usability and Modularity, October 23
%C Saarbrücken, Germany
%I DFKI Saarbrücken
%S DFKI Document
%7 D-93-03
%! Integration of Syntax and Semantics in Feature Structures
%2 Kasper:1993:ISS.pdf
%3 j
%F Kasper:1993:ISS
%U http://www.dfki.de/dfkibib/publications/docs/Busemann_1992_DWNLSRM.pdf


%0 Book Section
%A Kasper, Walter
%D 1994
%T "Flache" Sprechhandlungsanalyse
%E Maier, Elisabeth
%B Dialogmodellierung in VERBMOBIL - Festlegung der Sprechhandlungen für den Demonstrator
%C Saarbrücken
%I DFKI
%S VM-Memo
%7 31
%! "Flache" Sprechhandlungsanalyse
%3 j
%F Kasper:1994:FS


%0 Book Section
%A Kasper, Walter
%D 2000
%T Multilingual Semantic Databases
%E Wahlster, W.
%B Verbmobil: Foundations of Speech-to-Speech Translation
%C Berlin
%I Springer
%P 348-358
%S Artificial Intelligence
%! Multilingual Semantic Databases
%3 j
%F Kasper:2000:MSD
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/284.entry


%0 Book Section
%A Kasper, Walter
%A Eberle, Kurt
%D 1991
%T Tense, Aspect, and Temporal Structure in French
%E Kamp, H.
%B Tense and Aspects in English and French, DYANA-Deliverable R2.3.B
%C Edinburgh
%I Center for Cognitive Science
%P 4-40
%! Tense, Aspect, and Temporal Structure in French
%3 j
%F Kasper:1991:TAT


%0 Book Section
%A Kasper, Walter
%A Eberle, Kurt
%D 1994
%T French Past Tenses and Temporal Structure
%E Thieroff, Rolf 
%E Ballweg, Joachim
%B Tense Systems in European Languages
%C Tübingen
%I Niemeyer
%P 149-171
%! French Past Tenses and Temporal Structure
%3 j
%F Kasper:1994:FPT


%0 Conference Proceedings
%A Kasper, Walter
%A Eberle, Kurt
%A Rohrer, Christian
%D 1992
%T Contextual Constraints for MT
%B Proceedings of the 4th International Conference on Theoretical and Methodological Issues in Machine Translation (TMI'92)
%C Montreal, Canada
%P 213-224
%! Contextual Constraints for MT
%2 Kasper:1992:CCM.pdf
%3 j
%F Kasper:1992:CCM
%X We outline an experimental machine translation system currently under development at the Institute for Computational Linguistics which aims at flexibility with respect to the level of transfer. The core of the system is a bidirectional transfer system using LFG-grammars for source and target languages. If translation is not possible on the basis of the linguistic information provided by the core system, i.e. in the case of translation mismatches, the system makes selective use of contextual and background knowledge. To this end we developed the concept of contextual constraints which are the interface between the core system and a module that we call the contextual resolver which deals among other things with the contextual information provided by the preceding text using Discourse Representation Theory. We concentrate on problems such as the translation of tense and anaphoric expressions between German and French.
%U http://www.dfki.de/dfkibib/publications/docs/Kasper_1992_CCM.pdf


%0 Conference Proceedings
%A Kasper, Walter
%A Kiefer, Bernd 
%A Krieger, Hans-Ulrich
%A Rupp, C. J.
%A Worm, Karsten
%D 1999
%T Charting the Depths of Robust Speech Parsing
%E ACL
%B 37th Annual Meeting of the Association for Computational Linguistics (ACLANNUAL '99), June 20-26
%C University of Maryland, College Park, USA
%P 405-412
%! Charting the Depths of Robust Speech Parsing
%3 j
%F Kasper:1999:CDR
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/131.entry


%0 Conference Proceedings
%A Kasper, Walter
%A Kiefer, Bernd
%A Krieger, Hans-Ulrich
%A Rupp, Christopher J.
%A Worm, Karsten L.
%D 1999
%T Charting the Depths of Robust Speech Parsing
%B Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics (ACL'99), June 20-26
%C University of Maryland, College Park, USA
%P 405-412
%! Charting the Depths of Robust Speech Parsing
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/131.entry
%2 Kasper:1999:CDRb.pdf
%3 j
%F Kasper:1999:CDRb
%X 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.
%U http://acl.ldc.upenn.edu/P/P99/P99-1052.pdf


%0 Conference Proceedings
%A Kasper, Walter
%A Krieger, Hans-Ulrich
%D 1996
%T Modularizing Codescriptive Grammars for Efficient Parsing
%E ACL
%B Proceedings of the 16th International Conference on Computational Linguistics (COLING'96), August 5-9
%C Copenhagen, Danmark
%P 628-633
%! Modularizing Codescriptive Grammars for Efficient Parsing
%2 Kasper:1996:MCGa.pdf Kasper:1996:MCGa.ps
%3 j
%F Kasper:1996:MCGa
%X 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.
%U 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


%0 Report
%A Kasper, Walter
%A Krieger, Hans-Ulrich
%D 1996
%T Modularizing Codescriptive Grammars for Efficient Parsing
%C Saarbrücken
%I DFKI
%S Verbmobil-Report
%7 140
%! Modularizing Codescriptive Grammars for Efficient Parsing
%2 Kasper:1996:MCGb.pdf Kasper:1996:MCGb.ps
%3 j
%F Kasper:1996:MCGb
%X 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.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/coling96.ps.gz


%0 Conference Proceedings
%A Kasper, Walter
%A Krieger, Hans-Ulrich
%D 1996
%T Integration of Prosodic and Grammatical Information in the Analysis of Dialogs
%E Görz, Günther
%E Hölldobler, Steffen
%B Proceedings of the 20th Annual German Conference on Artificial Intelligence. KI-96: Advances in Artificial Intelligence, September 17-19
%C Dresden, Germany
%I Springer Verlag
%P 163-174
%S Lecture Notes in Artificial Intelligence
%7 1137
%! Integration of Prosodic and Grammatical Information in the Analysis of Dialogs
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ki96.entry
%2 Kasper:1996:IPGa.pdf Kasper:1996:IPGa.ps
%3 j
%F Kasper:1996:IPGa
%X 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.
%U 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


%0 Report
%A Kasper, Walter
%A Krieger, Hans-Ulrich
%D 1996
%T Integration of Prosodic and Grammatical Information in the Analysis of Dialogs
%C Saarbrücken
%I DFKI
%S Verbmobil-Report
%7 141
%! Integration of Prosodic and Grammatical Information in the Analysis of Dialogs
%2 Kasper:1996:IPGb.pdf Kasper:1996:IPGb.ps
%3 j
%F Kasper:1996:IPGb
%X 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.
%U http://www.dfki.de/cgi-bin/verbmobil/htbin/decode.cgi/share/VM-depot/FTP-SERVER/vm-reports/report-141-96.ps.gz


%0 Conference Proceedings
%A Kasper, Walter
%A Krieger, Hans-Ulrich
%A Diagne, Abdel Kader
%D 1995
%T Distributed Parsing with HPSG Grammars
%B Proceedings of the 4th International Workshop on Parsing Technologies (IWPT'95), September 20-24
%C Prague and Karlovy Vary, Czech Republic
%P 79-86
%! Distributed Parsing with HPSG Grammars
%2 Kasper:1995:DPH.pdf Kasper:1995:DPH.ps
%3 j
%F Kasper:1995:DPH
%U 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


%0 Report
%A Kasper, Walter
%A Krieger, Hans-Ulrich
%A Spilker, Jörg
%A Weber, Hans
%D 1996
%T From Word Hypotheses to Logical Form: An Efficient Interleaved Approach
%C Saarbrücken
%I DFKI
%S Verbmobil-Report
%7 142
%! From Word Hypotheses to Logical Form: An Efficient Interleaved Approach
%2 Kasper:1996:WHLb.pdf Kasper:1996:WHLb.ps
%3 j
%F Kasper:1996:WHLb
%X 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.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/konvens96.ps.gz


%0 Conference Proceedings
%A Kasper, Walter
%A Krieger, Hans-Ulrich
%A Spilker, Jörg
%A Weber, Hans
%D 1996
%T From Word Hypotheses to Logical Form: An Efficient Interleaved Approach
%E Gibbon, Dafydd
%B Proceedings of the Natural Language Processing and Speech Technology: Results of the 3rd KONVENS Conference, October 7-9
%C Bielefeld, Germany
%I Mouton de Gruyter
%P 77-88
%! From Word Hypotheses to Logical Form: An Efficient Interleaved Approach
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/konvens96.entry
%2 Kasper:1996:WHLa.pdf Kasper:1996:WHLa.ps
%3 j
%F Kasper:1996:WHLa
%X 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.
%U 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


%0 Book Section
%A Kasper, Walter
%A Moens, Marc
%A Zeevat, Henk
%D 1992
%T Anaphora Resolution
%E Bes, Gabriel G.
%E Guillotin, Thierry
%B A Natural Language and Graphics Interface. Results and Perspectives from the Acord Project.
%C Berlin
%I Springer Verlag
%P 65-93
%! Anaphora Resolution
%3 j
%F Kasper:1992:AR


%0 Conference Proceedings
%A Kasper, Walter
%A Steffen, Jörg
%D 2002
%T Multilingual flexible and robust summarization
%E Busemann, Stephan
%B Proceedings der 6. Konferenz zur Verarbeitung natürlicher Sprache (KONVENS 2002), 30. September - 2. Oktober
%C Saarbrücken, Germany
%I German Research Center for AI (DFKI)
%P 215-218
%S DFKI Document D-02-01
%! Multilingual flexible and robust summarization
%2 Kasper:2002:MFR.pdf
%3 j
%F Kasper:2002:MFR
%X SumEx is multilingual, flexible and robust system for automatic text summarization following a sentence extraction approach. The paper presents an overview of this system.
%U http://konvens2002.dfki.de/cd/pdf/44P-steffen.pdf


%0 Conference Proceedings
%A Keller, Frank
%A Corley, Martin
%A Corley, Steffan
%A Crocker, Matthew
%A Trewin, Shari
%D 1999
%T GSEARCH: A Tool for Syntactic Investigation of Unparsed Corpora
%B The EACL Workshop on Linguistically Interpreted Corpora (LINC '99), June 12
%C Bergen, Norway
%! GSEARCH: A Tool for Syntactic Investigation of Unparsed Corpora
%F Keller:1999:GTS


%0 Conference Proceedings
%A Keller, Frank
%A Lapata, Maria
%A Ourioupina, Olga
%D 2002
%T Using the Web to Overcome Data Sparseness
%E Hajic, Jan
%E Matsumoto, Yuji
%B Proceedings of the Conference on Empirical Methods in Natural Language Processing
%C Philadelphia, USA
%P 230-237
%! Using the Web to Overcome Data Sparseness
%2 Keller:2002:UWO.pdf
%F Keller:2002:UWO
%X This paper shows that the web can be employed to obtain frequencies for bigrams that are unseen in a given corpus. We describe a method for retrieving counts for adjective-noun, noun-noun, and verb-object bigrams from the web by querying a search engine. We evaluate this method by demonstrating that web frequencies and correlate with frequencies obtained from a carefully edited, balanced corpus. We also perform a task-based evaluation, showing that web frequencies can reliably predict human plausibility judgments.
%U http://www.iccs.informatics.ed.ac.uk/~keller/papers/emnlp02.pdf


%0 Conference Proceedings
%A Kemke, Christel
%D 1992
%T Modelling Neural Networks by Networks of Finite Automata
%E Rogers, S. K.
%E Ruck, D. W.
%B Proceedings of SPIE: Applications and Science of Artificial Neural Networks, April 21-24
%C Orlando, Florida, USA
%P 116-122
%! Modelling Neural Networks by Networks of Finite Automata
%F Kemke:1992:MNN


%0 Conference Proceedings
%A Kemke, Christel
%A Kone, Habibatou
%D 1993
%T INCOPA - An Incremental Connectionist Parser
%B World Congress on Neural Networks (WCNN '93), 1993 Annual Meeting of the International Neural Network Society (INNS), July 11-15
%C Portland, Oregon, USA
%V 3
%P 41-44
%! INCOPA - An Incremental Connectionist Parser
%F Kemke:1993:IIC


%0 Conference Proceedings
%A Kemke, Christel
%A Schommer, Christoph
%D 1993
%T PAPADEUS - Parallel Parsing of Ambiguous Sentences
%B World Congress on Neural Networks (WCNN '93), 1993 Annual Meeting of the International Neural Network Society (INNS), July 11-15
%C Portland, Oregon, USA
%V 3
%P 79-82
%! PAPADEUS - Parallel Parsing of Ambiguous Sentences
%F Kemke:1993:PPP


%0 Conference Proceedings
%A Kemke, Christel
%A Wiechert, Andreas
%D 1993
%T Hierarchical Self-Organizing Feature Maps for Speech Recognition
%B World Congress on Neural Networks (WCNN '93), 1993 Annual Meeting of the International Neural Network Society (INNS), July 11-15
%C Portland, Oregon, USA
%V 3
%P 45-47
%! Hierarchical Self-Organizing Feature Maps for Speech Recognition
%F Kemke:1993:HSO


%0 Conference Proceedings
%A Kerber, Manfred
%A Kohlhase, Michael
%D 1996
%T A Resolution Calculus for Presuppositions
%E Wahlster, W.
%B 12th European Conference on Artificial Intelligence  (ECAI '96), August 12-16
%C Budapest, Hungary
%I John Wiley & Sons
%P 375-379
%! A Resolution Calculus for Presuppositions
%F Kerber:1996:RCP
%X The semantics of everyday language and the semantics of its naive translation into classical first-order language considerably differ. An important discrepancy that is addressed in this paper is about the implicit assumption what exists. For instance, in the case of universal quantification natural language uses restrictions and presupposes that these restrictions are non-empty, while in classical logic it is only assumed that the whole universe is non-empty. On the other hand, all constants mentioned in classical logic are presupposed to exist, while it makes no problems to speak about hypothetical objects in everyday language. These problems have been discussed in philosophical logic and some adequate many-valued logics were developed to model these phenomena much better than classical first-order logic can do. An adequate calculus, however, has not yet been given. Recent years have seen a thorough investigation of the framework of many-valued truth-functional logics. Unfortunately, restricted quantifications are not truth-functional, hence they do not fit the framework directly. We solve this problem by applying recent methods from sorted logics.


%0 Journal Article
%A Kerber, Manfred
%A Kohlhase, Michael
%D 1996
%T A Tableau Calculus for Partial Functions
%B Collegium logicum: Annals of the Kurt-Gödel-Society
%V 2
%P 21-49
%! A Tableau Calculus for Partial Functions
%F Kerber:1996:TCP


%0 Report
%A Kerber, Manfred
%A Kohlhase, Michael
%D 1997
%T Reasoning without Believing: On the Mechanization of Presuppositions and Partiality
%C Birmingham
%I University of Birmingham, School of Computer Science
%S Technical Report
%7 CSRP-97-23
%8 September
%! Reasoning without Believing: On the Mechanization of Presuppositions and Partiality
%2 Kerber:1997:RBM.pdf Kerber:1997:RBM.ps
%F Kerber:1997:RBM
%X It is well-known that many relevant aspects of everyday reasoning based on natural language cannot be adequately expressed in classical first-order logic. In this paper we address two of the problems, firstly that of so-called presuppositions, expressions from which it is possible to draw implicit conclusion, which classical logic normally does not warrant, and secondly the related problem of partiality and the adequate treatment of undefined expressions. In natural language, presuppositions are quite common, they can, however, only insufficiently be modeled in classical first-order logic. For instance, in the case of universal quantification one normally uses restrictions in natural language and presupposes that these restrictions are non-empty, while in classical logic it is only assumed that the whole universe is non-empty. On the other hand, all constants mentioned in classical logic are presupposed to exist, while it makes no problems to speak about hypothetical objects in everyday language. Similarly, undefined expressions can be handled in natural language discourses and utterances are not only classified into the two categories 'true' and 'false'. This has led to the development of various better-suited many-valued logics. By combining different approaches we can now give a static description of presuppositions and undefinedness within the same framework. Additionally, we have developed an efficient mechanization of the induced consequence relation (which has been missing in the literature) by combining methods from many-valued truth-functional logics and sort techniques developed for search control in automated theorem proving.
%U ftp://ftp.cs.bham.ac.uk/pub/tech-reports/1997/CSRP-97-23.ps.gz


%0 Report
%A Kiefer, Bernd
%A Fettig, Thomas
%D 1995
%T FEGRAMED - An Interactive Graphics Editor for Feature Structures
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-95-06
%! FEGRAMED - An Interactive Graphics Editor for Feature Structures
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/fegramed.dvi.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/fegramed.entry
%2 Kiefer:1995:FIG.pdf Kiefer:1995:FIG.ps
%3 j
%F Kiefer:1995:FIG
%X This paper describes a tool for supporting grammar development in those linguistic frameworks which employ some constraint-based formalism, such as LFG (Lexical Functional Grammar), HPSG (Head-Driven Phrase Structure Grammar), FUG (Functional Unification Grammar) and CUG (Categorial Unification Grammar). These approaches have in common that all or at least a substantial part of the grammar (such as rules, lexical entries, node labels etc.) is represented as sets of attribute-value pairs. 
In LISP or Prolog the structures can be internally represented as lists, but it is much more convenient and sometimes even indispensable to use graphical representations when developing grammars. During grammar processing, feature structures can become quite large (up to several thousand nodes), such that a customized view of the feature structure, which allows to selectively focus on relevant parts, becomes essential. Fegramed provides a fully interactive editor for developing, maintaining and viewing feature structures. It is a tool that is built to cope with the complexity of feature structures in grammar development and use.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/fegramed.ps.gz ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1995/RR-95-06.ps.gz


%0 Conference Proceedings
%A Kiefer, Bernd
%A Krieger, Hans-Ulrich
%D 2000
%T A Context-Free Approximation of Head-Driven Phrase Structure Grammar
%B Proceedings of the 6th International Workshop on Parsing Technologies (IWPT'00), February 23-25
%C Trento, Italy
%P 135-146
%! A Context-Free Approximation of Head-Driven Phrase Structure Grammar
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/133.entry
%3 j
%F Kiefer:2000:CFA
%X 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.


%0 Book Section
%A Kiefer, Bernd
%A Krieger, Hans-Ulrich
%D 2001
%T A Context-Free Approximation of Head-Driven Phrase Structure Grammar
%B Efficiency in Unification-Based Processing
%I CSLI Lecture Notes
%! A Context-Free Approximation of Head-Driven Phrase Structure Grammar
%3 j
%F Kiefer:2001:CFA
%X 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.


%0 Book Section
%A Kiefer, Bernd
%A Krieger, Hans-Ulrich
%D 2002
%T A Context-Free Approximation of Head-Driven Phrase Structure Grammar
%E Oepen, Stephan
%E Flickinger, Dan
%E Tsujii, Jun-ichi
%E Uszkoreit, Hans
%B Collaborative Language Engineering. A Case Study in Efficient Grammar-Based Processing
%C Stanford
%I CSLI Publications
%! A Context-Free Approximation of Head-Driven Phrase Structure Grammar
%3 j
%F Kiefer:2002:CFA
%X 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.


%0 Conference Proceedings
%A Kiefer, Bernd
%A Krieger, Hans-Ulrich
%A Carroll, John
%A Malouf, Robert
%D 1999
%T A Bag of Useful Techniques for Efficient and Robust Parsing
%B Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics (ACL-ANNUAL'99), June 20 - 26
%C College Park, Maryland, USA
%I ACL
%P 473-480
%! A Bag of Useful Techniques for Efficient and Robust Parsing
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/132.entry
%2 Kiefer:1999:BUT.pdf
%3 j
%F Kiefer:1999:BUT
%X 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.
%U http://www.cogs.susx.ac.uk/lab/nlp/carroll/papers/acl99.pdf


%0 Book Section
%A Kiefer, Bernd
%A Krieger, Hans-Ulrich
%A Nederhof, Mark-Jan
%D 2000
%T Efficient and Robust Parsing of Word Hypotheses Graphs
%E Wahlster, Wolfgang
%B Verbmobil: Foundations of Speech-to-Speech Translation
%C Berlin
%I Springer
%P 280-295
%! Efficient and Robust Parsing of Word Hypotheses Graphs
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/1.entry
%3 j
%F Kiefer:2000:ERP
%X 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.


%0 Conference Proceedings
%A Kiefer, Bernd
%A Krieger, Hans-Ulrich
%A Prescher, Detlef
%D 2002
%T A Novel Disambiguation Method For Unification-Based Grammars Using Probabilistic Context-Free Approximations
%B Proceedings of the 19th International Conference on Computational Linguistics (COLING'02), August 24 - September 1
%C Taipei, Taiwan
%! A Novel Disambiguation Method For Unification-Based Grammars Using Probabilistic Context-Free Approximations
%2 Kiefer:2002:NDM.pdf Kiefer:2002:NDM.ps
%3 j
%F Kiefer:2002:NDM
%X 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.
%U http://www.dfki.de/dfkibib/publications/docs/paper-alternative-font2


%0 Conference Proceedings
%A Kiefer, Bernd
%A Krieger, Hans-Ulrich
%A Siegel, Melanie
%D 2000
%T An HPSG-to-CFG Approximation of Japanese
%B Proceedings of the 18th International Conference on Computational Linguistics (COLING'00), July 31 - August 4
%C Saarbrücken, Deutschland
%I Morgan Kaufmann Publishers
%V 2
%P 1046-1050
%! An HPSG-to-CFG Approximation of Japanese
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/2.entry
%2 Kiefer:2000:HCA.pdf Kiefer:2000:HCA.ps
%3 j
%F Kiefer:2000:HCA
%X 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.
%U http://www.dfki.de/~siegel/coling00.ps.gz


%0 Report
%A Kiefer, B.
%A Netter, K.
%A Neumann, G.
%A Uszkoreit, H.
%D 1997
%T PARADICE - Parameterizable Discourse Core Engine
%C Saarbrücken
%I DFKI
%S DFKI-Report
%7 R:S97-223
%! PARADICE - Parameterizable Discourse Core Engine
%2 Kiefer:1997:PPD.pdf
%3 j
%F Kiefer:1997:PPD
%U http://www.dfki.de/dfkibib/publications/docs/Kiefer_1997_PPDCE.pdf


%0 Report
%A Kipper, Bernhard
%A Brants, Thorsten
%A Plach, Marcus
%A Schäfer, Ralph
%D 1995
%T Bayessche Netze: Ein einführendes Beispiel
%C Saarbrücken
%I Universität des Saarlandes
%S Bericht des Graduiertenkolleg Kognitionswissenschaft
%7 Nr. 4
%! Bayessche Netze: Ein einführendes Beispiel
%2 Kipper:1995:BNE.pdf
%F Kipper:1995:BNE
%X Bayessche Netze stellen einen vielbeachteten Formalismus zur Repräsentation und Verarbeitung von unsicherem Wissen dar. Zum Formalismus der Bayesschen Netze existieren zwar einige einführende Arbeiten; was diesen Einführungen jedoch fehlt, ist eine Illustration der innerhalb von Bayesschen Netzen verwendeten Mechanismen an Hand konkreter (Zahlen-)Beispiele. Mit der vorliegenden Arbeit soll genau diese Lücke geschlossen werden: Die grundlegende Struktur Bayesscher Netze wird durch die Modellierung eines Beispielszenarios erläutert. In dem daraus resultierenden Beispielnetz werden ferner die probabilistischen Methoden, die bei Bayesschen Netzen Anwendung finden, mit konkreten Zahlenwerten durchgerechnet.
%U http://www.coli.uni-sb.de/~thorsten/publications/Kipper-ea-GKK4.pdf


%0 Edited Proceedings
%A Klavans, Judith L. 
%A Resnik, Philip
%D 1994
%T The Balancing Act. Combining Symbolic and Statistical Approaches to Language. Proceedings of the Workshop
%C Cambridge
%I MIT Press
%! The Balancing Act. Combining Symbolic and Statistical Approaches to Language. Proceedings of the Workshop
%F Klavans:1994:BAC


%0 Conference Proceedings
%A Klein, Judith
%A Busemann, Stephan
%A Declerck, Thierry
%D 1997
%T Diagnostic Evaluation of Shallow Parsing Through an Annotated Reference Corpus
%B Proceedings of the Workshop on Evaluation in Speech and Language Technology (SALT) on Evaluation in Speech and Language Technology, June 17-18
%C University of Sheffield, Sheffield, UK
%P 121-128
%! Diagnostic Evaluation of Shallow Parsing Through an Annotated Reference Corpus
%2 Klein:1997:DES.pdf Klein:1997:DES.ps
%3 j
%F Klein:1997:DES
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/declerck97_salt.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/declerck97_salt.ps.gz


%0 Conference Proceedings
%A Klein, Judith
%A Declerck, Thierry
%D 1998
%T Annotating German Language Data for Shallow Processing
%B Proceedings of the 10th European Summer School in Logic, Language and Information (ESSLLI '98), August 17-28
%C Saarbrücken, Germany
%! Annotating German Language Data for Shallow Processing
%2 Klein:1998:AGL.pdf Klein:1998:AGL.ps
%3 j
%F Klein:1998:AGL
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/esslli98_klein.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/esslli98_klein.entry


%0 Conference Proceedings
%A Klein, Judith
%A Declerck, Thierry
%A Neumann, Günter
%D 1998
%T Evaluation of the Syntactic Analysis Component of an Information  Extraction System for German
%B Proceedings of the 1st International Conference on Language Resources and Evaluation (LREC '98). Workshop on Evaluation of Parsing Systems, May 28-30
%C Granada, Spain
%! Evaluation of the Syntactic Analysis Component of an Information  Extraction System for German
%2 Klein:1998:ESA.pdf Klein:1998:ESA.ps
%3 j
%F Klein:1998:ESA
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/lrec-ws98.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/lrec-ws98.entry


%0 Report
%A Klein, Judith
%A Dickmann, Ludwig
%D 1992
%T DiTo-Datenbank. Dokumentation zu Verbrektion und Koordination
%C Saarbrücken
%I DFKI
%S DFKI Document
%7 D-92-04
%! DiTo-Datenbank. Dokumentation zu Verbrektion und Koordination
%3 j
%F Klein:1992:DDDa


%0 Conference Proceedings
%A Klein, Judith
%A Dickmann, Ludwig
%A Diagne, Abdel Kader
%A Nerbonne, John
%A Netter, Klaus
%D 1992
%T DiTo - Ein Diagnostikwerkzeug für die deutsche Syntax
%E Görz, G.
%B 1. Konferenz Verarbeitung natürlicher Sprache (KONVENS '92), 7.-9. Oktober
%C Nürnberg, Germany
%I Springer Verlag
%P 380-384
%S Informatik Aktuell
%! DiTo - Ein Diagnostikwerkzeug für die deutsche Syntax
%3 j
%F Klein:1992:DDDb


%0 Conference Proceedings
%A Klein, Judith
%A Dickmann, Ludwig
%A Diagne, Abdel Kader
%A Nerbonne, John
%A Netter, Klaus
%D 1992
%T DiTo - Ein Diagnostik-Werkzeug für die syntaktische Analyse
%E Görz, Günther
%B Proceedings of the 1. Konferenz Verarbeitung natürlicher Sprache (KONVENS'92), 7.-9. Oktober
%C Nürnberg, Germany
%I Springer Verlag
%P 380-384
%S Informatik Aktuell
%! DiTo - Ein Diagnostik-Werkzeug für die syntaktische Analyse
%2 Klein:1992:DDWa.pdf
%3 j
%F Klein:1992:DDWa
%X In this paper we present a testing tool for the diagnosis of errors in NLP Systems. We discuss briefly the relevance of testing tools for NLP Systems and advocate the idea of modular testing tools. liere we present an approach for the syntax component of NLP Systems. Our diagnostic tool for German syntax is an effort to construct a catalogue of syntactic data exemplifying the major syntactic patterns of German that Supports the diagnosis of errors. Up to now, the catalogue contains the areas verbal government, coordination and - although not yet completed - fixed verbal structures.We cooperate with other groups2 that work on further syntactic phenomena according to the ideas of DiTo. To allow systematic testing of specific areas of syntax the data are organised into a relational database.
%U http://www.dfki.de/dfkibib/publications/docs/Klein_1992_DEDDS.pdf


%0 Conference Proceedings
%A Klein, Judith
%A Dickmann, Ludwig
%A Diagne, Abdel Kader
%A Nerbonne, John
%A Netter, Klaus
%D 1993
%T A Diagnostic Tool for German Syntax
%E Busemann, Stephan
%E Harbusch, Karin
%B Proceedings of the DFKI Workshop on Natural Language Systems: Re-Usability and Modularity, October 23
%C Saarbrücken, Germany
%I DFKI
%S DFKI Document
%7 D-93-03
%! A Diagnostic Tool for German Syntax
%2 Klein:1993:DTG.pdf
%3 j
%F Klein:1993:DTG
%X In this paper we describe an effort to construct a catalogue of syntactic data, exemplifying the major syntactic patterns of German. The purpose of the corpus is to support the diagnosis of errors in the syntactic components of natural language processing (NLP) systems. Two secondary aims are the evaluation of NLP systems components and the support of theoretical and empirical work on German syntax. The data consist of artificially and systematically constructed expressions, including also negative (ungrammatical) examples. The data are organized into a relational data base and annotated with some basic information about the phenomena illustrated and the internal structure of the sample sentences. The organization of the data supports selected systematic testing of specific areas of syntax, but also serves the purpose of a linguistic data base. The paper first gives some general motivation for the necessity of syntactic precision in some areas of NLP and discusses the potential contribution of a syntactic data base to the field of component evaluation. The second part of the paper describes the set up and control methods applied in the construction of the sentence suite and annotations to the examples. We illustrate the approach with the example of verbal government. The section also contains a description of the abstract data model, the design of the data base and the query language used to access the data. The final sections compare our work to existing approaches and sketch some future extensions. We invite other research groups to participate in our effort, so that the diagnostics tool can eventually become public domain.
%U http://www.dfki.de/dfkibib/publications/docs/Busemann_1992_DWNLSRM.pdf


%0 Conference Proceedings
%A Klein, Judith
%A Lehmann, Sabine
%A Netter, Klaus
%A Wegst, Tillmann
%D 1998
%T DiET in the Context of MT Evaluation
%E Nübel, R.
%E Seewald-Heeg, U.
%B Evaluation of the Linguistic Performance of Machine Translation Systems. Proceedings of the KONVENS '98 Workshop in Bonn, October 5-7
%C Universität Bonn
%I Gardez!-Verlag
%P 107-126
%! DiET in the Context of MT Evaluation
%2 Klein:1998:DCM.pdf Klein:1998:DCM.ps
%3 j
%F Klein:1998:DCM
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/diet-konvens98.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/diet-konvens98.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/diet-konvens98.pdf


%0 Conference Proceedings
%A Klein, Judith
%A Netter, Klaus
%D 1992
%T DiTo - Ein Diagnostik-Werkzeug für die syntaktische Analyse
%E Raasch, A.
%B 23. Jahrestagung der Gesellschaft für Angewandte Linguistik (GAL), 1. Oktober
%C Saarbrücken, Germany
%! DiTo - Ein Diagnostik-Werkzeug für die syntaktische Analyse
%2 Klein:1992:DDW.pdf
%3 j
%F Klein:1992:DDW
%U http://www.dfki.de/dfkibib/publications/docs/Klein_1992_DDWSA.pdf


%0 Journal Article
%A Klettke, Meike
%A Bietz, Mathias
%A Bruder, Ilvio
%A Heuer, Andreas
%A Priebe, Denny
%A Neumann, Günter
%A Becker, Markus
%A Bedersdorfer, Jochen
%A Uszkoreit, Hans
%A Maedche, Alexander
%A Staab, Steffen
%A Studer, Rudi
%D 2001
%T GETESS-Ontologien, objektrelationale Datenbanken und Textanalyse als Bausteine einer semantischen Suchmaschine
%B Datenbank-Spektrum
%V 1
%N 1
%P 14-24
%! GETESS-Ontologien, objektrelationale Datenbanken und Textanalyse als Bausteine einer semantischen Suchmaschine
%2 Klettke:2001:GOO.pdf
%3 j
%F Klettke:2001:GOO
%X In diesem Artikel wird dargestellt, wie Verfahren aus der Wissensrepräsentation, der Computerlinguistik, dem Information Retrieval und aus dem Bereich Datenbanken eingesetzt werden können, um für Suchmaschinen und in Dokumentenserver neue Funktionalitäten bereitzustellen.
%U http://www.dfki.de/~neumann/publications/new-ps/getess-db-spektrum.pdf


%0 Conference Proceedings
%A Kohlhase, Michael
%A Koller, Alexander
%D 2000
%T Towards a Tableaux Machine for Language Understanding (ICoS '00)
%B 2nd Workshop on Inference in Computational Semantics (ICoS-2), July 30
%C Schloss Dagstuhl, Germany
%! Towards a Tableaux Machine for Language Understanding (ICoS '00)
%2 Kohlhase:2000:TTM.pdf Kohlhase:2000:TTM.ps
%F Kohlhase:2000:TTM
%X We outline an abstract inference machine for producing discourse models in natural language understanding. This machine has tableaux as its central data structure and can operate in model generation and theorem proving modes. Search spaces are controlled by keeping track of NP saliences and equipping proof rules with costs.
%U http://www.coli.uni-sb.de/~koller/papers/txm.ps.gz


%0 Journal Article
%A Kohlhase, Michael
%A Koller, Alexander
%D 2003
%T Resource-Adaptive Model Generation as a Performance Model
%B Logic Journal of the IGPL
%V 11
%N 4
%P 435--456
%! Resource-Adaptive Model Generation as a Performance Model
%2 Kohlhase:19xx:RAM.pdf
  Kohlhase:19xx:RAM.ps
%F Kohlhase:2003:RAM
%X Model generation calculi, close relatives of tableau calculi for theorem
  proving, can be used as competence models for semantic natural language
  understanding. Unfortunately, existing model generation calculi are not yet
  plausible as performance models of actual human processing, since they fail
  to capture computational aspects of human language processing. We outline an
  extended model generation calculus that solves the most unpleasant
  computational inadequacy; In the extended calculus, tableau expansion rules
  are equipped with costs, and model construction is a process that optimizes
  model quality under resource constraints with respect to these costs. We
  embed the new calculus into an abstract inference machine and illustrate the
  possibilities of this approach by presenting a partial theory of definites in
  this setting. In this case study, the constants in the universe are given
  saliences, that are maintained across the model generation process. This
  additional data serves as one important source of information for model
  quality and resource cost estimation.
%U http://www.coli.uni-sb.de/~koller/papers/mgperf.ps.gz

%0 Conference Proceedings
%A Kohlhase, Michael
%A Kuschert, Susanna
%D 1997
%T Dynamic Lambda Calculus
%B 5th Meeting on Mathematics of Language (MOL5), August 25-28
%C Schloss Dagstuhl, Germany
%P 85-92
%! Dynamic Lambda Calculus
%2 Kohlhase:1997:DLC.pdf Kohlhase:1997:DLC.ps
%F Kohlhase:1997:DLC
%U http://www.dfki.de/events/mol/papers/kuschert.ps


%0 Report
%A Kohlhase, Michael
%A Kuschert, Susanna
%D 1997
%T Dynamic Lambda Calculus
%C Saarbrücken
%I Universität des Saarlandes
%P 29
%S CLAUS Report
%7 91
%8 September
%! Dynamic Lambda Calculus
%2 Kohlhase:1997:DLCb.pdf
%F Kohlhase:1997:DLCb
%X The goal of this paper is to lay a logical foundation for discourse theories by providing an algebraic foundation of compositional formalisms for discourse semantics as an analogon to the simply typed Lambda-calculus. Just as that can be specialized to type theory by simply providing a special type for truth values and postulating the quantifiers and connectives as constants with fixed semantics, the proposed dynamic Lambda-calculus DLC can be specialized to Lambda-DRT by essentially the same measures, yielding a much more principled and modular treatment of Lambda-DRT than before, which is also expected to provide a conceptually simple basis for studying higher-order unification for compositional discourse theories. N.B.: After printing we realised that alpha-conversion as defined here is not yet correct; we will publish an improved version soon.
%U http://ftp.coli.uni-sb.de/claus91.ps http://ftp.coli.uni-sb.de/claus91.dvi


%0 Conference Proceedings
%A Kohlhase, Michael
%A Kuschert, Susanna
%A Pinkal, Manfred
%D 1996
%T A Type-Theoretic Semantics for Lambda-DRT
%E Dekker, P.
%E Stokhof, M.
%B 10th Amsterdam Colloquium
%C Amsterdam, The Netherlands
%I De Gruyter
%P 479-498
%! A Type-Theoretic Semantics for Lambda-DRT
%F Kohlhase:1996:TTS
%2 Kohlhase:1996:TTS.ps


%0 Conference Proceedings
%A Koller, Alexander
%D 1998
%T Evaluating Context Unification for Semantic Underspecification
%E Kruijff-Korbayova, I.
%B 3rd ESSLLI Student Session (ESSLLI '98), August 17-28
%C Saarbrücken, Germany
%P 188-199
%! Evaluating Context Unification for Semantic Underspecification
%2 Koller:1998:ECU.pdf
%F Koller:1998:ECU
%X Context unification has been proposed as a powerful formalism for the uniform and underspecified treatment of scope ambiguities and parallelism. We develop an algorithm for context unification that alleviates the enormous computational and overgeneration problems of earlier algorithms. It is incomplete for full context unification, but finds all linguistically relevant solutions. We apply an implementation of the new algorithm to evaluate context unification as a tool for semantic analysis.


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


%0 Edited Proceedings
%A Koller, Alexander
%A Mann, Gideon
%D 2002
%T Proceedings of the Student Research Workshop at ACL-02, July 7-12
%C Philadelphia, Pennsylvania, USA
%! Proceedings of the Student Research Workshop at ACL-02, July 7-12
%F Koller:2002:PSR


%0 Conference Proceedings
%A Koller, Alexander
%A Mehlhorn, Kurt
%A Niehren, Joachim
%D 2000
%T A Polynomial-Time Fragment of Dominance Constraints
%B 38th Annual Meeting of the Association of Computational Linguistics (ACL '00), October 1-8
%C Hong Kong
%! A Polynomial-Time Fragment of Dominance Constraints
%2 Koller:2000:PTF.pdf Koller:2000:PTF.ps
%F Koller:2000:PTF
%X Dominance constraints are a logical language for describing trees that is widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we identify \emph{normal} dominance constraints, a natural fragment whose satisfiability problem we show to be in polynomial time. We present a quadratic satisfiability algorithm and use it in another algorithm that enumerates solutions efficiently. Our result is useful for various applications of dominance constraints and related formalisms.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/poly-dom.ps.gz


%0 Report
%A Koller, Alexander
%A Niehren, Joachim
%D 1999
%T Scope Underspecification and Processing
%S Reader for the ESSLLI summer school
%! Scope Underspecification and Processing
%2 Koller:1999:SUP.pdf Koller:1999:SUP.ps
%F Koller:1999:SUP
%X This reader contains material for the ESSLLI '99 course, "Scope Underspecification and Processing''. The reader and course are aimed at a pretty broad audience; we have tried to only presuppose a very general idea of natural language processing and of first-order logic. Underspecification is a general approach to dealing with ambiguity. In the course, we'll be particularly concerned with scope underspecification, which deals with scope ambiguity, a structural ambiguity of the semantics of a sentence. As scope underspecification is at least partially motivated by computational issues, we will pay particular attention to processing aspects. We're going to show how dominance constraints can be used for scope underspecification and how they can be processed efficiently by using concurrent constraint programming technology.
%U http://www.ps.uni-sb.de/~niehren/ESSLLI99/ ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/ESSLLI:99.ps.gz


%0 Conference Proceedings
%A Koller, Alexander
%A Niehren, Joachim
%D 2000
%T Constraint Programming in Computational Linguistics
%E Barker-Plummer, D.
%E Beaver, D.
%E van Benthem, J.
%E Scotto di Luzio, P.
%B 8th CSLI Workshop on Logic Language and Computation, May 30
%C Stanford
%I CSLI
%! Constraint Programming in Computational Linguistics
%2 Koller:2000:CPC.pdf Koller:2000:CPC.ps
%F Koller:2000:CPC
%X Constraint programming is a programming paradigm that was originally invented in computer science to deal with hard combinatorial problems. Recently, constraint programming has evolved into a technology which permits to solve hard industrial scheduling and optimization problems. We argue that existing constraint programming technology can be useful for applications in natural language processing. Some problems whose treatment with traditional methods requires great care to avoid combinatorial explosion of (potential) readings seem to be solvable in an efficient and elegant manner using constraint programming. We illustrate our claim by two recent examples, one from the area of underspecified semantics and one from parsing.
%U http://www.ps.uni-sb.de/Papers/abstracts/CP-NL.html ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/CP-NL.ps.gz


%0 Conference Proceedings
%A Koller, Alexander
%A Niehren, Joachim
%D 2000
%T On Underspecified Processing of Dynamic Semantics
%B 18th International Conference on Computational Linguistics (COLING '00), July 31 - August 4
%C Saarbrücken, Germany
%I Morgan Kaufmann
%P 460-466
%! On Underspecified Processing of Dynamic Semantics
%2 Koller:2000:UPD.pdf Koller:2000:UPD.ps
%F Koller:2000:UPD
%X We propose a new inference system which operates on underspecified semantic representations of scope and anaphora. This inference system exploits anaphoric accessibility conditions known from dynamic semantics to decide scope ambiguities if possible. The main feature of the system is that it deals with underspecified descriptions directly, i.e. without enumerating readings.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/dynamic.ps.gz


%0 Book Section
%A Koller, Alexander
%A Niehren, Joachim
%D 2002
%T Constraint Programming in Computational Linguistics
%E Barker-Plummer, Dave
%E Beaver, David I. 
%E van Benthem, Johan 
%E di Luzio, Patrick Scotto
%B Words, Proofs, and Diagrams
%C Stanford
%I CSLI Press
%! Constraint Programming in Computational Linguistics
%2 Koller:2002:CPC.pdf Koller:2002:CPC.ps
%F Koller:2002:CPC
%X Constraint programming is a programming paradigm that was originally invented in computer science to deal with hard combinatorial problems. Recently, constraint programming has evolved into a technology which permits to solve hard industrial scheduling and optimization problems. We argue that existing constraint programming technology can be useful for applications in natural language processing. Some problems whose treatment with traditional methods requires great care to avoid combinatorial explosion of (potential) readings seem to be solvable in an efficient and elegant manner using constraint programming. We illustrate our claim by two recent examples, one from the area of underspecified semantics and one from parsing.
%O Extended version of a paper at the 8th Stanford Workshop on Logic, Language, and Computation (1999)
%U http://www.ps.uni-sb.de/Papers/abstracts/CP-NL.html ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/CP-NL.ps.gz


%0 Conference Proceedings
%A Koller, Alexander
%A Niehren, Joachim
%A Striegnitz, Kristina
%D 1999
%T Relaxing Underspecified Semantic Representations for Reinterpretation
%B 6th Meeting on Mathematics of Language (MOL6), July 23-25
%C Orlando, Florida, USA
%P 74-87
%! Relaxing Underspecified Semantic Representations for Reinterpretation
%2 Koller:1999:RUS.pdf Koller:1999:RUS.ps
%F Koller:1999:RUS
%X Type and sort conflicts in semantics are usually resolved by a process of reinterpretation. Recently, Egg (1999) has proposed an alternative account in which conflicts are avoided by underspecification. The main idea is to derive sufficiently relaxed underspecified semantic representations; addition of reinterpretation operators then simply is further specialization. But in principle, relaxing underspecified representations bears the danger of overgeneration. In this paper, we investigate this problem in the framework of CLLS, where underspecified representations are expressed by tree descriptions subsuming dominance constraints. We introduce some novel properties of dominance constraints and present a safety criterion that ensures that an underspecified description can be relaxed without adding unwanted readings. We then apply this criterion systematically to Egg's analysis and show why its relaxation operation does not lead to overgeneration.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Relax99.ps.gz


%0 Journal Article
%A Koller, Alexander
%A Niehren, Joachim
%A Striegnitz, Kristina
%D 2000
%T Relaxing Underspecified Semantic Representations for Reinterpretation
%B Grammars
%V 3
%N 2-3
%! Relaxing Underspecified Semantic Representations for Reinterpretation
%2 Koller:2000:RUS.pdf Koller:2000:RUS.ps
%F Koller:2000:RUS
%X Type and sort conflicts in semantics are usually resolved by a process of reinterpretation, which introduces an operator into the semantic representation. We elaborate on the foundations of a recent approach to reinterpretation within a framework for semantic underspecification. In this approach, relaxed underspecified semantic representations are inferred from the syntactic structure, leaving space for subsequent addition of reinterpretation operators. Unfortunately, a structural danger of overgeneration is inherent to the relaxation of underspecified semantic representations. We identify the problem and distinguish structural properties that avoid it. We furthermore develop techniques for proving these properties and apply them to prove the safety of relaxation in a prototypical syntax/semantics interface. In doing so, we present some novel properties of tree descriptions in the constraint language over lambda structures (CLLS).
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/relax2000.ps.gz


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


%0 Conference Proceedings
%A Koller, Alexander
%A Striegnitz, Kristina
%D 2002
%T Generation as Dependency Parsing
%B Proceedings of the 40th Anniversary Meeting of the Association of Computational Linguistics (ACL2002), July 6-12
%C University of Pennsylvania, Philadelphia
%! Generation as Dependency Parsing
%2 Koller:2002:GDP.pdf Koller:2002:GDP.ps
%F Koller:2002:GDP
%X Natural-Language Generation from flat semantics is an NP-complete problem. This makes it necessary to develop algorithms that run with reasonable efficiency in practice despite the high worst-case complexity. We show how to convert TAG generation problems into dependency parsing problems, which is useful because  optimizations in recent dependency parsers based on constraint programming tackle exactly the combinatorics that make generation hard. Indeed, initial experiments display promising runtimes.
%U http://www.coli.uni-sb.de/cl/projects/indigen/papers/acl2002.ps.gz http://www.coli.uni-sb.de/~koller/papers/gen-dg.ps.gz


%0 Book Section
%A Konieczny, Lars
%A Hemforth, Barbara
%A Scheepers, Christoph
%D 2000
%T Head Position and Clause Boundary Effects in Reanalysis German Sentence Processing
%E Hemforth, B. 
%E Konieczny, L.
%B German Sentence Processing
%C Dodrecht
%I Kluwer Academic Publishers
%P 247-278
%! Head Position and Clause Boundary Effects in Reanalysis German Sentence Processing
%F Konieczny:2000:HPC


%0 Book Section
%A Konieczny, Lars
%A Hemforth, Barbara
%A Scheepers, Christoph
%A Strube, Gerhard
%D 1995
%T PP-Attachment in German: Results from Eye Movement Studies
%E Findlay, J. M.
%E Walker, R.
%E Kentridge, R. W.
%B Eye Movement Research: Mechanisms, Processes and Applications
%C Amsterdam
%I North Holland
%P 405-420
%! PP-Attachment in German: Results from Eye Movement Studies
%F Konieczny:1995:PAG


%0 Book Section
%A Konieczny, Lars
%A Hemforth, Barbara
%A Scheepers, Christoph
%A Strube, Gerhard
%D 1996
%T Reanalysen vs. interne Reparaturen beim Sprachverstehen
%E Habel, C.
%E Kanngießer, S.
%E Rickheit, G.
%B Perspektiven der kognitiven Linguistik: Modelle und Methoden
%C Opladen
%I Westdeutscher Westdeutscher Verlag
%P 161-183
%! Reanalysen vs. interne Reparaturen beim Sprachverstehen
%F Konieczny:1996:RVI


%0 Journal Article
%A Konieczny, Lars
%A Hemforth, Barbara
%A Scheepers, Christoph
%A Strube, Gerhard
%D 1997
%T The Role of Lexical Heads in Parsing: Evidence from German
%B Language and Cognitive Processes
%V 12
%P 307-348
%! The Role of Lexical Heads in Parsing: Evidence from German
%F Konieczny:1997:RLH


%0 Book Section
%A Konieczny, Lars
%A Scheepers, Christoph
%A Hemforth, Barbara
%A Strube, Gerhard
%D 1994
%T Semantikorientierte Syntaxverarbeitung
%E Felix, S.
%E Habel, C.
%E Rickheit, G.
%B Kognitive Linguistik: Repräsentationen und Prozesse
%C Opladen
%I Westdeutscher Verlag
%! Semantikorientierte Syntaxverarbeitung
%F Konieczny:1994:SS


%0 Master's Thesis
%A Konrad, Karsten
%D 1994
%T Abstrakte Syntaxtransformation mit getypten Merkmalstermen
%C Saarbrücken
%I Universität des Saarlandes, Department of Computer Science
%! Abstrakte Syntaxtransformation mit getypten Merkmalstermen
%F Konrad:1994:ASG


%0 Conference Proceedings
%A Konrad, Karsten
%A Maier, Holger
%A Milward, David
%A Pinkal, Manfred
%D 1996
%T An Education and Research Tool for Computational Linguistics
%E ACL
%B 16th International Conference on Computational Linguistics (COLING '96), August 5-9
%C Copenhagen, Denmark
%V 2
%P 1098-1101
%! An Education and Research Tool for Computational Linguistics
%F Konrad:1996:ERT
%2 Konrad:1996:ERT.ps


%0 Conference Proceedings
%A Kordoni, Valia
%D 2001
%T Linking Experiencer-Subject Psych Verb Constructions in Modern Greek
%E Flickinger, Dan
%E Kathol, Andreas
%B Proceedings of the 7th International Conference on Head-Driven Phrase Structure Grammar (HPSG'00), July 22-23
%C University of California, Berkeley, USA
%I CSLI Publications
%P 198-213
%! Linking Experiencer-Subject Psych Verb Constructions in Modern Greek
%2 Kordoni:2001:LES.pdf
%3 j
%F Kordoni:2001:LES
%X This paper focuses on the semantic properties and the syntactic behaviour of Modern Greek (hence MG) Experiencer-Subject Psych Verb Constructions (hence ESPVCs).
MG ESPVCs include verbs like miso (hate), agapo (love), or latrevo (adore), which feature a nominative experiencer in agreement with the verb and an accusative theme (see examples (1)-(3)). MG ESPVCs include also predicates like fovame (fear), which feature an experiencer-subject in agreement with the verb and either an accusative theme (example (4)), or a theme as the object of a prepositional phrase (example (5)). We should underline here that examples (4) and (5) below convey the same meaning. That is, they do NOT differ semantically.
1. O   Gianis   misi    to  sholio.
2. the Gianis.N hate.3S the school.A
3. "John hates school."
4. 
5. O   Gianis   agapa    tin Maria.
6. the Gianis.N loves.3S the Maria.A
7. "John loves Mary."
8. 
9. O   Gianis   latrevi  tin musiki.
10. the Gianis.N adore.3S the music.A
11. "John adores music."
12. 
13. I   Maria   fovate  tis kategides.
14. the Maria.N fear.3S the storms.A
15. "Mary is afraid of the storms."
16. 
17. I   Maria   fovate  me   tis kategides.
18. the Maria.N fear.3S with the storms.A
19. "Mary is afraid of the storms."
20. 
The challenge that constructions like the ones in (4) and (5) pose lies on the split syntactic realization of the "experienced" (hence EXPD) semantic role (i.e., the theme), which in constructions like (4) is syntactically realized as the object of the sentence, while in constructions like (5) it is syntactically realized as the object of a prepositional phrase.
Our aim is to propose a unified linking account of the MG ESPVCs. This unified account 
1. is based on the assumption that the individual denoted by the object NP (or PP) of the MG ESPVCs is entailed to be semantically underspecified, and 
2. makes use of Wechsler's (1995) Notion Rule, Davis and Koenig's (2000) linking theory, as well as Markantonatou and Sadler's (1996) proposal for the linking of indirect arguments.
%U http://cslipublications.stanford.edu/HPSG/HPSG00/hpsg00kordoni.pdf


%0 Conference Proceedings
%A Kordoni, Valia
%D 2001
%T Optimal Linking for Modern Greek Psych Verb Constructions
%E Butt, Miriam 
%E Holloway King, Tracy
%B Proceedings of the 6th International Lexical Functional Grammar Conference (LFG'01), June 25-27
%C Hong Kong
%I CSLI Publications
%P 184-200
%! Optimal Linking for Modern Greek Psych Verb Constructions
%2 Kordoni:2001:OLM.pdf
%3 j
%F Kordoni:2001:OLM
%X This paper focuses on the semantic properties and the syntactic behaviour of MG ESPVCs like the following:

I   Maria   fovate  tis kategides.
the Maria.N fear.3S the storms.A
"Mary is afraid of the storms."

I   Maria   fovate  me   tis kategides.
the Maria.N fear.3S with the storms
"Mary is afraid of the storms."

I   Maria.N fovate  ton Giani.
the Maria.N fear.3S the John.A
"Mary is afraid of John."

I   Maria.N fovate  me   ton Giani.
the Maria.N fear.3S with the John.A
"Mary is afraid of John."

We account for the semantic and syntactic properties of the constructions in (1)-(4) by relying on the linking architecture that Butt, Dalrymple, and Frank (1997) have proposed as an alternative to the fully deterministic principles of standard LMT. We show that the "optimal linking" theory makes the correct predictions for the linking of the EXPR ("experiencer") and the EXPD ("experienced") semantic arguments of Modern Greek (MG) Experiencer-Subject Psych Verb Constructions (ESPVCs) and predicts that the variant of MG ESPVCs which realizes syntactically the EXPD ("experienced") semantic argument as an accusative NP (examples (1) and (3)) ranks higher (is "more optimal") than the variant which realizes syntactically the EXPD ("experienced") semantic argument as the complement of a PP phrase (examples (2) and (4)). This ranking reflects in a way the fact that in order to express the meaning Mary is afraid of the storms native speakers prefer the construction in (1), rather than the one in (2), which is also mirrored in the rate of the marked variant of MG ESPVCs ((2) and (4)) in the Greek ECI corpus (5,568%).
%U http://cslipublications.stanford.edu/LFG/6/lfg01kordoni.pdf


%0 Conference Proceedings
%A Kordoni, Valia
%D 2003
%T Valence Alternations in Modern Greek: an MRS Analysis
%E Kim, Jong-Bok
%E Wechsler, Stephen
%B Proceedings of the 9th International Conference on Head-Driven Phrase
  Structure Grammar (HPSG 2002), August 8-9
%C Kyung Hee University, Seoul, South Korea
%I CSLI Publications. Stanford (ISSN 1535-1793)
%! Valence Alternations in Modern Greek: an MRS Analysis
%2 Kordoni:2002:VAM.pdf
%3 j
%F Kordoni:2003:VAM
%U http://www.coli.uni-sb.de/~kordoni/papers/HPSG02Kordoni_main.ps


%0 Conference Proceedings
%A Kordoni, Valia
%D 2002
%T Participle-Adjective Formation in Modern Greek
%E Butt, Miriam
%E King, Tracy Holloway
%B Proceedings of the 7th International Lexical-Functional Grammar Conference
  (LFG'02), July 3-5
%C National Technical University of Athens, Athens, Greece
%I CSLI Publications. Stanford (ISSN 1098-6782)
%P 220-238
%! Participle-Adjective Formation in Modern Greek
%2 Kordoni:2002:PAF.pdf
%3 j
%F Kordoni:2002:PAF
%U http://www.coli.uni-sb.de/~kordoni/papers/lfg02kordoni-num.pdf


%0 Journal Article
%A Kordoni, Valia
%D 2002
%T Modern Greek Psych Verb Constructions
%B Recherches en linguistique grecque
%V Tome 2
%! Modern Greek Psych Verb Constructions
%2 Kordoni:2002:MGP.pdf
%3 j
%F Kordoni:2002:MGP
%X This paper presents a semantic analysis for Psych Verb Constructions in
  Modern Greek.
%U http://www.coli.uni-sb.de/~kordoni/papers/valia-kordoni.doc


%0 Journal Article
%A Koreman, Jacques
%D 1995
%T The Effects of Stress and F0 on the Voice Source
%B PHONUS
%C Universität des Saarlandes, Phonetik, Saarbrücken
%V 1
%P 105-120
%! The Effects of Stress and F0 on the Voice Source
%2 Koreman:1995:ESF.pdf
%F Koreman:1995:ESF
%X In this paper, we present data on the qualitative difference in the voice source characteristics in stressed versus unstressed syllables; for the unstressed syllables, we will further point out the qualitative differences dependent on high versus low F0 (fundamental frequency of the vocal fold vibrations). The voice source characteristics will be described in terms of a set of parameters extracted from the inverse filtered signal, consisting of the parameters OQ (open quotient), rk (pulse skewing), Ee (excitation strength), AC (peak-to-peak airflow) and DC offset (leak flow). We attempt to give a physiological explanation for our findings by comparing our data with those from other experiments, discussed in the literature. We also compare our findings with the predictions from modelling studies, and suggest some improvements of the phonation models to obtain a better correspondence between their predictions and our results. The physiological interpretation of our findings remains tentative, since no direct physiological measurements were made. Nevertheless we are able to propose a consistent explanation for the behaviour of the glottal parameter values that were observed.
%U http://www.coli.uni-sb.de/Phonetics/Research/PHONUS_research_reports/Phonus1/Koreman_PHONUS1.ps.gz


%0 Thesis
%A Koreman, Jacques
%D 1996
%T Decoding Linguistic Information in the Glottal Airflow
%C Nijmegen
%I University of Nijmegen, Department of Language and Speech
%! Decoding Linguistic Information in the Glottal Airflow
%F Koreman:1996:DLI


%0 Conference Proceedings
%A Koreman, Jacques
%A Andreeva, Bistra
%D 2000
%T Phonetic features in ASR: A linguistic solution to acoustic variation?
%B Proceedings of the 7th Conference on Laboratory Phonology (LabPhon7), June 29 -July 1
%C Nijmegen, Netherlands
%! Phonetic features in ASR: A linguistic solution to acoustic variation?
%F Koreman:19xx:PFA
%X In most phonological theories, phonemes are considered as a set (or hierarchy) of (possibly underspecified) phonetic features, which are the minimal number of formal properties needed to distinguish the phonemes in the language system from each other. 

In most state-of-the-art automatic speech recognition (ASR) systems, however, phonetic features do not play any role. The statistical models for each phone or phoneme are based on a spectral parameterisation of the signals, like mel-frequency cepstral coefficients (MFCC's) and energy. 

Three questions are dealt with in this paper: 


Can we successfully bridge this gap between phonological theory and ASR by using phonetic features in ASR? 
Which phonetic feature set is most appropriate for ASR? 
Can we attain the same result by using more complex non-linguistic modelling? 
1. PHONETIC FEATURES IN ASR
To bridge the gap between phonologists' formal representation of the phoneme and the almost purely acoustic description of the signal used in ASR systems, we have used phonetic features to create statistical phone models for automatic speech recognition. The phonetic features were derived from the spectral representation of the signal used in most standard ASR systems (MFCC's + energy) by means of a neural network. 
Not only do we find a clear increase in the phoneme identification rate (see under 2 below) [1], the confusions between phonemes are also much easier to interpret, since phonemes which are confused are usually very similar in terms of the phonetic features they are made up of. This is not the case when acoustic parameters are used to create phoneme models [2]. 

2. DIFFERENT PHONETIC FEATURE SETS
It is not self-evident which set of phonetic features is most appropriate to describe phonological categories and the processes that operate on them, since the various feature theories have different phonological implications. To evaluate how appropriate the different feature sets are for application in an ASR system, we have used several different feature sets, both articulatory-phonetic (IPA) and phonological (SPE) [3]. We have so far compared the phoneme identification results for both underspecified and fully specified SPE features with those for the set of features used in the IPA to distinguish all phonemes. In addition, the results were compared to those in a standard ASR system using acoustic parameters (MFCC's) directly to create phone models. We found a clear improvement in the phoneme identification rate when phonetic features were used to model the phones, in comparison to directly using acoustic parameters. Underspecified SPE features led to the best performance (for multi-language Eurom0 data, without the use of a lexicon or language model) of all: 
acoustic parameters: 15.6% 
IPA features: 42.6% 
SPE features: 36.2% 
Underspecified SPE features: 46.1% 


In addition to the features sets reported so far, the phoneme identification results for articulatory features [4] will be reported and their relative merits will be discussed. 

3. VARIATION MODELLING VERSUS LINGUISTIC MODELLING
The acoustic-phonetic mapping in a neural network combines two advantages, namely 
1) variation modelling: different acoustic realisations of the same phoneme (e.g. allophonic variants) can be discerned by the neural network 

2) linguistic modelling: these different realisations are mapped onto more homogeneous, distinctive features 

Even if the neural network can reduce the variation in the input parameters for statistical modelling by mapping different acoustic realisations of a phoneme onto phonetic features, the question remains whether the same result can be reached by using a non-linguistic approach. Variation modelling can also be achieved by using more complex acoustic phoneme models (multiple mixtures per state in HMM), so that we do not necessarily have to make a mapping onto phonetic features to achieve this goal. A comparison of the performance of a standard system which does not use phonetic features with the performance of a system in which phonetic features are used to train the phoneme models shows the merits of using a signal representation derived from phonological theory.


%0 Journal Article
%A Koreman, Jacques
%A Andreeva, Bistra
%A Barry, William J.
%D 1997
%T Relational Phonetic Features for Consonant Identification in a Hybrid ASR System
%B PHONUS
%C Universität des Saarlandes, Phonetik, Saarbrücken
%V 3
%P 83-110
%! Relational Phonetic Features for Consonant Identification in a Hybrid ASR System
%2 Koreman:1997:RPF.pdf
%F Koreman:1997:RPF
%X In this article we discuss implementation of some fundamental phonetic ideas related to what we shall call "relational processing" in a cross-language consonant identification system. The term relational processing refers to the way vowel transitions play a role in the identification of neighbouring consonants. Two experiments are described: first, consonant identification results from a hidden Markov modelling experiment are presented for consonants plus the preceding and following vowel transitions, if present. The results are compared to a baseline experiment, in which the vowel transitions are not used in the identification of the consonants. In the second experiment, the acoustic parameters are first mapped onto phonetic features; this mapping is performed by a Kohonen network1. Since vowel transitions are considered to be particularly important for identification of the place of articulation of the neighbouring consonant, only the place features (and not the consonants' manner features or the phonetic features of the vowel to which the transitions belong) are derived for the vowel transitions. Separate hidden Markov models are trained for the consonants, for the vowel offset and vowel onset transitions which share all consonantal place-of-articulation features. Concatenations of these models form the phone-like recognition units (comparable to the concatenation of phone models for the recognition of words in a conventional ASR system) which are later used for consonant identification. The results are compared with a baseline experiment in which no acoustic-phonetic mapping is performed. The experiments show that relational processing improves the consonant identification results.
%U http://www.coli.uni-sb.de/Phonetics/Research/PHONUS_research_reports/Phonus3/Koreman_PHONUS3.ps.gz


%0 Conference Proceedings
%A Koreman, Jacques
%A Andreeva, Bistra
%A Barry, William J.
%D 1998
%T Die Abbildung Akustischer Parameter auf phonetische Merkmale in der automatischen Spracherkennung
%E Schröder, Bernhard
%E Lenders, Winfried
%E Hess, Wolfgang
%E Portele, Thomas
%B Computer, Linguistik und Phonetik zwischen Sprache und Sprechen : Tagungsband der 4. Konferenz zur Verarbeitung natürlicher Sprache (KONVENS 98), 5. - 7. Oktober
%C Universität Bonn, Germany
%I Lang, Peter
%V 1
%P 153-158
%S Sprache, Sprechen und Computer
%! Die Abbildung Akustischer Parameter auf phonetische Merkmale in der automatischen Spracherkennung
%F Koreman:1998:AAP


%0 Conference Proceedings
%A Koreman, Jacques
%A Andreeva, Bistra
%A Barry, William J.
%D 1998
%T Do Phonetic Features Help to Improve Consonant Identification in ASR?
%B 5th International Conference on Spoken Language Processing (ICSLP '98), November 30 - December 4
%C Sydney, Australia
%P paper 549
%! Do Phonetic Features Help to Improve Consonant Identification in ASR?
%F Koreman:1998:DPF


%0 Conference Proceedings
%A Koreman, Jacques
%A Andreeva, Bistra
%A Barry, William J.
%D 1998
%T Exploiting Transitions and Focussing on Linguistic Properties for ASR
%B 5th International Conference on Spoken Language Processing (ICSLP '98), November 30 - December 4
%C Sydney, Australia
%P paper 548
%! Exploiting Transitions and Focussing on Linguistic Properties for ASR
%F Koreman:1998:ETF


%0 Journal Article
%A Koreman, Jacques
%A Andreeva, Bistra
%A Erriquez, Attilio
%A Barry, William J.
%D 2000
%T Can we use the linguistic information in the signal?
%B PHONUS
%C Universität des Saarlandes, Phonetik, Saarbrücken
%V 5
%P 47-58
%! Can we use the linguistic information in the signal?
%2 Koreman:2000:CWU.pdf
%F Koreman:2000:CWU
%X This article discusses the use of phonetic features in automatic speech recognition. The phonetic features are derived from acoustic parameters by means of Kohonen networks. Behind the use of phonetic features instead of standard acoustic parameters lies the assumption that it is useful to help the system to focus on linguistically relevant signal properties. Previous experiments using very simple hidden Markov models to represent the phones (with only one mixture for each state and without a lexicon or language model) have indeed shown that the phoneme identification rates on the basis of phonetic features were considerably higher than on the basis of acoustic parameters. When eight mixtures per state are used in hidden Markov modelling, the phoneme identification rates for three different sets of phonetic features were found to be lower than those obtained from a system in which the acoustic parameters are modelled directly. It is suggested that the results are still good enough, however, to further explore the use of phonetic features in a complete automatic speech recognition system: if each phone sequence representing a word in the lexicon is replaced by a sequence of underspecified phonetic feature vectors, the use of phonetic features in the acoustic decoding may have certain advantages.
%U http://www.coli.uni-sb.de/Phonetics/Research/PHONUS_research_reports/Phonus5/Koreman_PHONUS5.pdf


%0 Conference Proceedings
%A Koreman, Jacques
%A Andreeva, Bistra
%A Strik, Helmer
%D 1999
%T Acoustic Parameters Versus Phonetic Features in ASR
%B Proceedings of the 14th International Congress of Phonetic Sciences (ICPhS'99), August 1-7
%C San Francisco, USA
%! Acoustic Parameters Versus Phonetic Features in ASR
%2 Koreman:1999:APV.pdf Koreman:1999:APV.ps
%F Koreman:1999:APV
%X By mapping acoustic parameters onto phonetic features, it is possible to explicitly address the linguistic information in the signal. For the experiments presented in this paper, we mapped cepstral parameters onto two sets of phonetic features, one based on the IPA chart and the other on SPE. As a result, the phoneme identification rates in a hidden Markov modelling framework increase from 15.6% for the cepstral parameters to 42.3% and 31.7% for the IPA and SPE features, respectively. Furthermore, for phonetic features the resulting confusions between phonemes are often less severe from a phonetic point of view. The theoretical implications of the differences are addressed.
%U http://lands.let.kun.nl/literature/strik.1999.2.ps


%0 Journal Article
%A Koreman, Jacques
%A Pützer, Manfred
%D 1997
%T Finding Correlates of Vocal Fold Adduction Deficiencies
%E Barry, William J.
%E Koreman, Jacques
%B PHONUS
%C Universität des Saarlandes, Phonetik, Saarbrücken
%V 3
%P 155-178
%! Finding Correlates of Vocal Fold Adduction Deficiencies
%2 Koreman:1997:FCV.pdf
%F Koreman:1997:FCV
%X This paper presents first results from a pilot study in which a set of voice parameters are computed from the EGG and microphone signals. It is investigated which of the voice parameters can distinguish between 5 speaker groups. The speaker groups are divided into normal speakers, breathy speakers and speakers with an organic pathology. Some of the parameters can distinguish between (some of) the 5 groups regardless of speaker sex, whereas other parameter do so only for male or female voices. The results of this study can be useful for the derivation of parameters which can be used for instance for the evaluation of voice therapy; the results can also indicate parameters which should be given special attention in a pre-screening of speakers with a high risk of developing a voice pathology, since a change in these parameters between consultations at the ENT clinic may indicate a development towards a pathological voice. The main goal of this pilot study is not so much the derivation of these parameters, though, as the development of a methodology to find parameters which distinguish between the 5 speaker groups. The method is immediately applicable to the investigation of distinctions between other pathological groups.
%U http://www.coli.uni-sb.de/Phonetics/Research/PHONUS_research_reports/Phonus3/KoremanPuetzer_PHONUS3.ps.gz


%0 Conference Proceedings
%A Koreman, Jacques
%A Pützer, Manfred
%A Just, Manfred
%D 1999
%T Acoustic, Electroglottographic and Perceptual Correlates of Vocal Fold Adduction Deficiensies. Poster Presentation
%B Workshop on Non-Modal Vocal-Fold Vibration and Voice Quality, Satellite Meeting of the 14th International Congress of Phonetic Sciences (ICPhS '99). July 31
%C UC Berkeley, San Francisco, USA
%! Acoustic, Electroglottographic and Perceptual Correlates of Vocal Fold Adduction Deficiensies. Poster Presentation
%F Koreman:1999:AEP


%0 Journal Article
%A Koreman, Jacques
%A Pützer, Manfred
%A Just, Manfred
%D 2004
%T Acoustic, Electroglottographic and Perceptual Correlates of Vocal Fold
  Adduction Deficiencies in Patients with Paralysis of the Recurrent Nerve
%B Folia Phoniatr. Logop.
%! Acoustic, Electroglottographic and Perceptual Correlates of Vocal Fold
  Adduction Deficiencies in Patients with Paralysis of the Recurrent Nerve
%F Koreman:2004:AEP
%O accepted


%0 Master's Thesis
%A Kornstaedt, Leif
%D 1996
%T Definition und Implementierung eines Front-End-Generators für Oz
%C Kaiserslautern
%I Universität Kaiserslautern, FB Informatik
%P 115
%! Definition und Implementierung eines Front-End-Generators für Oz
%2 Kornstaedt:1996:DIF.pdf Kornstaedt:1996:DIF.ps
%F Kornstaedt:1996:DIF
%X In der vorliegenden Diplomarbeit wird ein Front-End-Generator entwickelt, der die multiparadigmatische Sprache Oz als Zielsprache verwendet. Damit wird die Eignung von Oz als Implementierungssprache für Compiler demonstriert und die Reimplementierung des Oz-Compilers in Oz vorbereitet. Das Werkzeug ist besonders auf die Übersetzung vollkompositionaler Sprachen ausgelegt. Das bedeutet, dass neben der lexikalischen und syntaktischen Analyse, bei der über sogenannte /Produktionsschemata/ auch eigene EBNF-Operatoren definiert werden können, auch die Reduktion in eine Kernsprache von dem Werkzeug abgedeckt wird. Um letztere mächtig zu machen und die Implementierung von Baumtransformationen zu vereinfachen, bei denen keine Konflikte der Variablennamen auftreten dürfen, wird weiterhin eine automatisch durchgeführte Bindungsanalyse mit Umbenennung aller gebundenen Bezeichner von dem Werkzeug angeboten.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/DA-Kornstaedt.ps.gz


%0 Conference Proceedings
%A Korthals, Christian
%D 2001
%T Self Embedded Relative Clauses in a Corpus of German Newspaper Texts
%E Striegnitz, K.
%B 6th ESSLLI Student Session, August 13-24
%C Helsinki, Finland
%P 179-190
%! Self Embedded Relative Clauses in a Corpus of German Newspaper Texts
%1 http://www.coli.uni-sb.de/~kris/esslli/program.html http://www.helsinki.fi/esslli
%2 Korthals:2001:SER.pdf Korthals:2001:SER.ps
%F Korthals:2001:SER
%X The distribution of center self-embeddings and extrapositions in German is assumed to minimize memory load during parsing. Self-embedded relative clauses were semi-automatically analysed in a treebank of German newspaper texts. Clause length and especially extraposition distance are found as the main distinctive parameters.
%U http://www.coli.uni-sb.de/~kris/esslli/proc.ps.gz


%0 Conference Proceedings
%A Korthals, Christian
%A Debusmann, Ralph
%D 2002
%T Linking Syntactic and Semantic Arguments in a Dependency-based formalism
%B Proceedings of the 19th International Conference on Computational Linguistics (COLING'02), August 24 - September 1
%C Taipei, Taiwan
%! Linking Syntactic and Semantic Arguments in a Dependency-based formalism
%2 Korthals:2002:LSS.pdf
%F Korthals:2002:LSS
%U http://www.ps.uni-sb.de/~rade/papers/coling02.pdf


%0 Edited Proceedings
%A Krauwer, Steven
%A Arnold, Doug
%A Kasper, Walter
%A Rayner, Manny
%A Somers, Harold
%D 1997
%T Spoken Language Translation. Proceedings of a Workshop sponsored by the Association of Computational Linguistics and by the European Network in Language and Speech (ELSNET)
%C Madrid
%! Spoken Language Translation. Proceedings of a Workshop sponsored by the Association of Computational Linguistics and by the European Network in Language and Speech (ELSNET)
%3 j
%F Krauwer:1997:SLT


%0 Conference Proceedings
%A Krenn, Brigitte
%D 1998
%T A Representation Scheme and Database for German Support-Verb Constructions
%E Schroeder, Bernhard 
%E Lenders, Winfried 
%E Hess, Wolfgang 
%E Portele, Thomas
%B 4. Konferenz Verarbeitung natürlicher Sprache (KONVENS '98), 5.-7. Oktober
%C Bonn, Germany
%I Peter Lang
%P 33-42
%! A Representation Scheme and Database for German Support-Verb Constructions
%F Krenn:1998:RSD


%0 Conference Proceedings
%A Krenn, Brigitte
%D 1998
%T Acquisition of Phraseological Units from Linguistically Interpreted Corpora. A Case Study on German PP-Verb Collocations
%B Industrielle Software Produktion (ISP '98), 12.-13. November
%C Stuttgart, Germany
%! Acquisition of Phraseological Units from Linguistically Interpreted Corpora. A Case Study on German PP-Verb Collocations
%F Krenn:1998:APU


%0 Thesis
%A Krenn, Brigitte
%D 1999
%T The Usual Suspects: Data-Oriented Models for Identification and Representation of Lexical Collocations
%C Saarbrücken
%I Universität des Saarlandes
%! The Usual Suspects: Data-Oriented Models for Identification and Representation of Lexical Collocations
%F Krenn:1999:USD


%0 Conference Proceedings
%A Krenn, Brigitte
%D 2000
%T Empirical Implications on Lexical Association Measures
%B 9th EURALEX International Conference, August 8-12
%C Stuttgart, Germany
%! Empirical Implications on Lexical Association Measures
%F Krenn:2000:EIL


%0 Conference Proceedings
%A Krenn, Brigitte
%D 2000
%T CDB - A Database of Lexical Collocations
%B 2nd International Conference on Language Resources & Evaluation (LREC '00), May 31 - June 2
%C Athens, Greece
%I ELRA
%! CDB - A Database of Lexical Collocations
%F Krenn:2000:CDL


%0 Conference Proceedings
%A Krenn, Brigitte
%D 2000
%T Collocation Mining: Exploiting Corpora for Collocation Identification and Representation
%B 5. Konferenz zur Verarbeitung natürlicher Sprache (KONVENS '00), 9.-10. Oktober
%C Ilmenau, Germany
%! Collocation Mining: Exploiting Corpora for Collocation Identification and Representation
%F Krenn:2000:CME


%0 Thesis
%A Krenn, Brigitte
%D 2000
%T The Usual Suspects: Data-Oriented Models for Identification and Representation of Lexical Collocations. Saarbrücken Dissertations in Computational Linguistics and Language Technology, Volume 7
%C Saarbrücken
%I Universität des Saarlandes, Department of Computational Linguistics
%! The Usual Suspects: Data-Oriented Models for Identification and Representation of Lexical Collocations. Saarbrücken Dissertations in Computational Linguistics and Language Technology, Volume 7
%F Krenn:2000:USD


%0 Conference Proceedings
%A Krenn, Brigitte
%A Brants, Thorsten
%A Skut, Wojciech
%A Uszkoreit, Hans
%D 1998
%T Recent Advances in Corpus Annotation
%B Proceedings of the 10th European Summer School in Logic, Language and Information (ESSLLI'98). Workshop on Automated Acquisition of Syntax and Parsing, August 17-28
%C Saarbrücken, Germany
%! Recent Advances in Corpus Annotation
%2 Krenn:1998:RAC.pdf
%3 j
%F Krenn:1998:RAC
%U http://www.dfki.de/dfkibib/publications/docs/Krenn_1998_RACA.pdf


%0 Conference Proceedings
%A Krenn, Brigitte
%A Grice, Martine
%A Piwek, Paul
%A Schröder, Marc
%A Klesen, Martin
%A Baumann, Stefan
%A Pirker, Hannes
%A van Deemter, Kees
%A Gstrein, Erich
%D 2002
%T Generation of Multi-Modal Dialogue for Net Environments
%E Busemann, Stephan
%B Proceedings der 6. Konferenz zur Verarbeitung natürlicher Sprache (KONVENS 2002), 30. September - 2. Oktober
%C Saarbrücken, Germany
%I German Research Center for AI (DFKI)
%P 91-98
%S DFKI Document D-02-01
%! Generation of Multi-Modal Dialogue for Net Environments
%3 j
%F Krenn:2002:GMM


%0 Conference Proceedings
%A Krenn, Brigitte
%A Gstrein, Erich
%A Neumayr, Barbara
%A Grice, Martine
%D 2002
%T What Can We Learn from Users of Avatars in Net Environments?
%B Proceedings of AAMAS 2002 Workshop:"Embodied Conversational Agents - Let's Specify and Evaluate Them!",  July 15-16
%C Bologna, Italy
%! What Can We Learn from Users of Avatars in Net Environments?
%2 Krenn:2002:WCW.pdf
%F Krenn:2002:WCW
%X In this paper we describe a commercial application of a net environment, and present the user data we have collected so far from three launches of this application. A net environment in our definition is a virtual space inhabited by avatars which have been created and are subsequently visited and instructed by users via the internet. Net environments are a useful means for studying user behaviour in general, and they are particularly well suited for presentation of multimedia content and systematic gathering of user responses on the appropriateness or effectiveness of the different presentations.
%U http://www.vhml.org/workshops/AAMAS/papers/krenn.pdf


%0 Book
%A Krenn, Brigitte
%A Samuelsson, Christer
%D 1994
%T The Linguist's Guide to Statistics. Compendium for a Course in Statistical Approaches in Computational Linguistics
%C Saarbrücken
%I Universität des Saarlandes
%! The Linguist's Guide to Statistics. Compendium for a Course in Statistical Approaches in Computational Linguistics
%F Krenn:1994:LGS


%0 Book Section
%A Krieger, Hans-Ulrich
%D 1991
%T Derivation Without Lexical Rules
%E Rupp, C. J.
%E Rosner, M. A.
%E Johnson, R. L.
%B Constraints, Language and Computation
%C London
%I Academic Press
%P 277-313
%! Derivation Without Lexical Rules
%2 Krieger:1991:DLRa.pdf Krieger:1991:DLRa.ps
%3 j
%F Krieger:1991:DLRa
%U 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


%0 Conference Proceedings
%A Krieger, Hans-Ulrich
%D 1991
%T Derivation Without Lexical Rules
%B Proceedings of the Workshop on Constraint Propagation, Linguistic Description, and Computation, November
%C Lugano, Switzerland
%S IDSIA Working Paper
%7 5
%! Derivation Without Lexical Rules
%2 Krieger:1991:DLRb.pdf Krieger:1991:DLRb.ps
%3 j
%F Krieger:1991:DLRb
%U 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


%0 Conference Proceedings
%A Krieger, Hans-Ulrich
%D 1991
%T Feature-Based Inheritance Networks for Computational Lexicons
%E Briscoe, T.
%E Copestake, A.
%E de Paiva, V.
%B ACQUILEX Workshop on Default Inheritance in the Lexicon, April 15
%C Cambridge, England
%S Technical Report
%7 238
%! Feature-Based Inheritance Networks for Computational Lexicons
%3 j
%F Krieger:1991:FBIa


%0 Report
%A Krieger, Hans-Ulrich
%D 1993
%T Derivation Without Lexical Rules
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-93-27
%8 June
%! Derivation Without Lexical Rules
%2 Krieger:1993:DLR.pdf Krieger:1993:DLR.ps
%3 j
%F Krieger:1993:DLR
%U 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


%0 Report
%A Krieger, Hans-Ulrich
%D 1994
%T Typed Feature Formalisms as a Common Basis for Linguistic Specification
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-94-39
%! Typed Feature Formalisms as a Common Basis for Linguistic Specification
%2 Krieger:1994:TFF.pdf Krieger:1994:TFF.ps Krieger:1994:TFF.dvi
%3 j
%F Krieger:1994:TFF
%U 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


%0 Book Section
%A Krieger, Hans-Ulrich
%D 1994
%T Derivation Without Lexical Rules
%E Rupp, Christopher J.
%E Rosner, Michael
%E Johnson, Roderick
%B Constraints, Language and Computation
%C London
%I Academic Press
%P 277-313
%! Derivation Without Lexical Rules
%2 Krieger:1994:DLR.pdf Krieger:1994:DLR.ps
%3 j
%F Krieger:1994:DLR
%U 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


%0 Thesis
%A Krieger, Hans-Ulrich
%D 1995
%T TDL - A Type Description Language for Constraint-Based Grammars. Foundation, Implementation, and Application
%C Saarbrücken
%I Universität des Saarlandes, Department of Computer Science
%! TDL - A Type Description Language for Constraint-Based Grammars. Foundation, Implementation, and Application
%3 j
%F Krieger:1995:TTD
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/diss.entry


%0 Conference Proceedings
%A Krieger, Hans-Ulrich
%D 1995
%T Typed Feature Structures, Definite Equivalences, Greatest Model Semantics, and Nonmonotonicity
%B Proceedings of the 4th Meeting on Mathematics of Language (MOL4), October 26-28
%C Philadelphia, USA
%! Typed Feature Structures, Definite Equivalences, Greatest Model Semantics, and Nonmonotonicity
%2 Krieger:1995:TFSa.pdf Krieger:1995:TFSa.ps
%3 j
%F Krieger:1995:TFSa
%U 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


%0 Report
%A Krieger, Hans-Ulrich
%D 1995
%T Typed Feature Structures, Definite Equivalences, Greatest Model Semantics, and Nonmonotonicity
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-95-20
%! Typed Feature Structures, Definite Equivalences, Greatest Model Semantics, and Nonmonotonicity
%2 Krieger:1995:TFSb.pdf Krieger:1995:TFSb.ps
%3 j
%F Krieger:1995:TFSb
%U 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


%0 Conference Proceedings
%A Krieger, Hans-Ulrich
%D 1995
%T Classification and Representation of Types in TDL
%B Proceedings of the International KRUSE Symposium, Knowledge Retrieval, Use, and Storage for Efficiency, August 11-13
%C University of California, Santa Cruz, USA
%P 74-85
%! Classification and Representation of Types in TDL
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kruse-llncs.entry
%2 Krieger:1995:CRTb.pdf Krieger:1995:CRTb.ps
%3 j
%F Krieger:1995:CRTb
%X 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.
%U 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


%0 Conference Proceedings
%A Krieger, Hans-Ulrich
%D 1995
%T Typed Feature Formalisms as a Common Basis for Linguistic Specification
%E Steffens, Petra
%B Proceedings of the 3rd International EAMT Workshop, April 26-28
%C Heidelberg, Germany
%I Springer Verlag
%P 101-119
%S Machine Translation and the Lexicon
%! Typed Feature Formalisms as a Common Basis for Linguistic Specification
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-94-39.dvi.Z
%2 Krieger:1995:TFF.pdf Krieger:1995:TFF.ps
%3 j
%F Krieger:1995:TFF
%X 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.
%U 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


%0 Report
%A Krieger, Hans-Ulrich
%D 1995
%T Classification and Representation of Types in TDL
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-95-17
%! Classification and Representation of Types in TDL
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kruse-llncs.entry
%2 Krieger:1995:CRTa.pdf Krieger:1995:CRTa.ps
%3 j
%F Krieger:1995:CRTa
%X 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.
%U 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


%0 Conference Proceedings
%A Krieger, Hans-Ulrich
%D 1998
%T Typed Feature Structures, Definite Equivalences, Greatest Model Semantics, and Nonmonotonicity
%B 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS '98). Workshop on Mathematical Linguistics, August 24-28
%C Brno, Czech Republic
%P 85-95
%! Typed Feature Structures, Definite Equivalences, Greatest Model Semantics, and Nonmonotonicity
%3 j
%F Krieger:1998:TFS
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/130.entry


%0 Journal Article
%A Krieger, Hans-Ulrich
%D 2001
%T Greatest Model Semantics for Typed Feature Structures
%B Grammars
%V 4
%N 2
%P 139-165
%! Greatest Model Semantics for Typed Feature Structures
%3 j
%F Krieger:2001:GMS
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/2001_krieger_grammars.entry


%0 Report
%A Krieger, Hans-Ulrich
%A Nerbonne, John
%D 1991
%T Feature-Based Inheritance Networks for Computational Lexicons
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-91-31
%! Feature-Based Inheritance Networks for Computational Lexicons
%2 Krieger:1991:FBIb.pdf Krieger:1991:FBIb.ps Krieger:1991:FBIb.dvi
%3 j
%F Krieger:1991:FBIb
%U 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


%0 Book Section
%A Krieger, Hans-Ulrich
%A Nerbonne, John
%D 1993
%T Feature-Based Inheritance Networks for Computational Lexicons
%E Briscoe, Ted
%E Copestake, Ann
%E de Paiva, Valeria
%B Inheritance, Defaults, and the Lexicon
%C New York
%I Cambridge University Press
%P 90-136
%S Studies in Natural Language Processing
%! Feature-Based Inheritance Networks for Computational Lexicons
%3 j
%F Krieger:1993:FBI
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/128.entry


%0 Conference Proceedings
%A Krieger, Hans-Ulrich
%A Pirker, Hannes
%A Nerbonne, John
%D 1993
%T Feature-Based Allomorphy
%E ACL
%B 31st Annual Meeting of the Association for Computational Linguistics (ACL '93), June 22-26
%C Ohio State University, Columbus, Ohio, USA
%P 140-147
%! Feature-Based Allomorphy
%2 Krieger:1993:FBA.pdf Krieger:1993:FBA.ps Krieger:1993:FBA.dvi
%3 j
%F Krieger:1993:FBA
%U 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


%0 Conference Proceedings
%A Krieger, Hans-Ulrich
%A Schäfer, Ulrich
%D 1993
%T TDL - A Type Description Language for Unification-Based Grammars
%E Boley, Harold
%E Bry, François
%E Geske, Ulrich
%B Proceedings of the Workshop on "Neuere Entwicklungen der deklarativen KI-Programmierung"
%C Saarbrücken, Germany
%I DFKI
%P 67-82
%S DFKI Research Report
%7 RR-93-35
%! TDL - A Type Description Language for Unification-Based Grammars
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/129.entry
%2 Krieger:1993:TTD.pdf Krieger:1993:TTD.ps
%3 j
%F Krieger:1993:TTD
%X 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.
%U http://www.dfki.de/dfkibib/publications/docs/long_version.ps


%0 Report
%A Krieger, Hans-Ulrich
%A Schäfer, Ulrich
%D 1993
%T TDL ExtraLight User's Guide
%C Saarbrücken
%I DFKI
%S DFKI Document
%7 D-93-09
%! TDL ExtraLight User's Guide
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/127.entry
%2 Krieger:1993:TEU.pdf Krieger:1993:TEU.ps
%3 j
%F Krieger:1993:TEU
%X 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.
%U 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


%0 Conference Proceedings
%A Krieger, Hans-Ulrich
%A Schäfer, Ulrich
%D 1994
%T TDL - A Type Description Language for Constraint-Based Grammars
%E ACL
%B Proceedings of the15th International Conference on Computational Linguistics (COLING '94), August 5-9
%C Kyoto, Japan
%V 2
%P 893-899
%! TDL - A Type Description Language for Constraint-Based Grammars
%2 Krieger:1994:TTDa.pdf Krieger:1994:TTDa.ps Krieger:1994:TTDa.dvi
%3 j
%F Krieger:1994:TTDa
%U 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


%0 Report
%A Krieger, Hans-Ulrich
%A Schäfer, Ulrich
%D 1994
%T TDL - A Type Description Language for HPSG. Part 1: Overview
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-94-37
%! TDL - A Type Description Language for HPSG. Part 1: Overview
%2 Krieger:1994:TTDb.pdf Krieger:1994:TTDb.ps Krieger:1994:TTDb.dvi
%3 j
%F Krieger:1994:TTDb
%U 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


%0 Report
%A Krieger, Hans-Ulrich
%A Schäfer, Ulrich
%D 1994
%T TDL - A Type Description Language for HPSG. Part 2: User Guide
%C Saarbrücken
%I DFKI
%S DFKI Document
%7 D-94-14
%! TDL - A Type Description Language for HPSG. Part 2: User Guide
%2 Krieger:1994:TTDc.pdf Krieger:1994:TTDc.ps
%3 j
%F Krieger:1994:TTDc
%U 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


%0 Conference Proceedings
%A Krieger, Hans-Ulrich
%A Schäfer, Ulrich
%D 1995
%T Efficient Parameterizable Type Expansion for Typed Feature Formalisms
%B 14th International Joint Conference on Artificial Intelligence (IJCAI '95), August 20-25
%C Montréal, Québec, Canada
%I Morgan Kaufmann Publishers
%P 1428-1434
%! Efficient Parameterizable Type Expansion for Typed Feature Formalisms
%2 Krieger:1995:EPTa.pdf Krieger:1995:EPTa.ps
%3 j
%F Krieger:1995:EPTa
%U 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


%0 Report
%A Krieger, Hans-Ulrich
%A Schäfer, Ulrich
%D 1995
%T Efficient Parameterizable Type Expansion for Typed Feature Formalisms
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-95-18
%! Efficient Parameterizable Type Expansion for Typed Feature Formalisms
%2 Krieger:1995:EPTb.pdf Krieger:1995:EPTb.ps
%3 j
%F Krieger:1995:EPTb
%U 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


%0 Conference Proceedings
%A Kruijff, Geert-Jan M.
%D 2001
%T Categorial-Hybrid Logical Grammar
%E Van Rooy, Robert
%E Stokhof, Martin
%B Proceedings of the 13th Amsterdam Colloquium, December 17-19
%C Amsterdam
%P 138-143
%! Categorial-Hybrid Logical Grammar
%F Kruijff:2001:CHL


%0 Conference Proceedings
%D 1998
%T Proceedings of the Student Session, the 10th European Summer
School in Logic, Language and Information (ESSLLI'98)
%E Kruijff, Geert-Jan
%E Kruijff-Korbayova, Ivana
%C Saarbrücken,ESSLLI'98
%! Proceedings of the Student Session, the 10th European Summer
School in Logic, Language and Information (ESSLLI'98)
%F Kruijff:1998:PSS
%U http://www.dfki.de/~mbecker/unsup.ps


%0 Book Section
%A Kruijff, Geert-Jan M.
%A Kruijff-Korbayová, Ivana
%D 1999
%T Text Structuring in a Multilingual System for Generation of Instructions
%E Matousek, Václav
%E Mautner, Pavel
%E Ocelíková, Jana
%E Sojka, Petr
%B Text, Speech and Dialogue - Second International Workshop, TSD'99, Plzen, Czech Republic, September 1999
%C Berlin
%I Springer
%V 1692
%P 89-94
%! Text Structuring in a Multilingual System for Generation of Instructions
%2 Kruijff:1999:TSM.pdf Kruijff:1999:TSM.ps
%F Kruijff:1999:TSM
%U http://www.coli.uni-sb.de/~korbay/Publications/tsd99-ts.ps.gz


%0 Book Section
%A Kruijff, Geert-Jan M.
%A Kruijff-Korbayová, Ivana
%D 2000
%T Aggregation and Contextual Reference in Automatically Generated Instructions
%E Sojka, Petr
%E Kopecek, Ivan
%E Pala, Karal
%B Text, Speech and Dialogue - Third International Workshop, TSD 2000, Brno, Czech Republic, September 13-16
%C Berlin
%I Springer
%V 1902
%P 87-92
%S Lecture Notes in Computer Science
%! Aggregation and Contextual Reference in Automatically Generated Instructions
%2 Kruijff:2000:ACR.pdf Kruijff:2000:ACR.ps
%F Kruijff:2000:ACR
%U http://www.coli.uni-sb.de/~korbay/Publications/tsd2000.ps.gz


%0 Book Section
%A Kruijff, Geert-Jan M.
%A Kruijff-Korbayová, Ivana
%D 2001
%T A Hybrid Logic Formalization of Information Structure Sensitive Discourse Interpretation
%E Matousek, Václav
%E Mautner, Pavel
%E Moucek, Roman
%E Tauser, Karel
%B Text, Speech and Dialogue, 4th International Conference, TSD 2001, Zelezna Ruda, Czech Republic, September 11-13
%C Berlin
%I Springer
%V 2166
%P 31-38
%S Lecture Notes in Artificial Intelligence
%! A Hybrid Logic Formalization of Information Structure Sensitive Discourse Interpretation
%2 Kruijff:2001:HLF.pdf Kruijff:2001:HLF.ps
%F Kruijff:2001:HLF
%U http://www.coli.uni-sb.de/~korbay/Publications/tsd01.ps.gz


%0 Conference Proceedings
%A Kruijff, Geert-Jan M.
%A Kruijff-Korbayová, Ivana
%A Bateman, John
%A Teich, Elke
%D 2001
%T Linear Order as Higher-Level Decision: Information Structure in Strategic and Tactical Generation
%E Horacek, Helmut
%B 8th European Workshop on Natural Language Generation (ACL/EACL 2001 Workshop), July 6-7
%C Toulouse, France
%P 74-83
%! Linear Order as Higher-Level Decision: Information Structure in Strategic and Tactical Generation
%2 Kruijff:2001:LOH.pdf Kruijff:2001:LOH.ps
%F Kruijff:2001:LOH
%U http://www.coli.uni-sb.de/~korbay/Publications/enlg-01.ps.gz http://www.coli.uni-sb.de/~korbay/Publications/enlg-01.pdf


%0 Conference Proceedings
%A Kruijff, Geert-Jan M.
%A Teich, Elke
%A Bateman, John
%A Kruijff-Korbayová, Ivana
%A Skoumalová, Hana
%A Sharoff, Serge
%A Sokolova, Lena
%A Hartley, Tony
%A Staykova, Kamy
%A Hana, Jirí
%D 2000
%T A Multilingual System for Text Generation in Three Slavic Languages
%B 18th International Conference on Computational Linguistics (COLING '00), July 31 - August 4
%C Universität des Saarlandes, Saarbrücken, Germany
%I Morgan Kaufmann Publishers
%V 2
%P 474-480
%! A Multilingual System for Text Generation in Three Slavic Languages
%2 Kruijff:2000:MST.pdf Kruijff:2000:MST.ps
%F Kruijff:2000:MST
%U http://www.coli.uni-sb.de/~korbay/Publications/agile-coling00.ps.gz


%0 Journal Article
%A Kruijff-Korbayová, Ivana
%D 1994
%T Review of: Lambrecht, Knud: Information Structure and Sentence Form. Topic, Focus, and the Mental Representations of Discourse Referents. Cambridge: Cambridge University Press, 1994.
%B Prague Bulletin of Mathematical Linguistics
%! Review of: Lambrecht, Knud: Information Structure and Sentence Form. Topic, Focus, and the Mental Representations of Discourse Referents. Cambridge: Cambridge University Press, 1994.
%F Kruijff-Korbayova:1994:RLK


%0 Conference Proceedings
%A Kruijff-Korbayová, Ivana
%D 1997
%T Czech Noun Phrases in File Change Semantics
%E Drewery, Alice
%E Kruijff, Geert-Jan M.
%E Zuber, R.
%B 9th European Summer School in Logic, Language, and Information (ESSLLI '97), Student Session, August 11-22
%C Aix-en-Provence, France
%P 107-118
%! Czech Noun Phrases in File Change Semantics
%F Kruijff-Korbayova:1997:CNP


%0 Conference Proceedings
%A Kruijff-Korbayová, Ivana
%D 1998
%T Generation of Instructions in a Multilingual Environment
%B 1st Workshop on TEXT, SPEECH and DIALOGUE (TSD'98), September 23-26
%C Brno, Czech Republic
%I Masaryk University Press
%P 67-72
%! Generation of Instructions in a Multilingual Environment
%2 Kruijff-Korbayova:1998:GIM.pdf Kruijff-Korbayova:1998:GIM.ps
%F Kruijff-Korbayova:1998:GIM


%0 Thesis
%A Kruijff-Korbayová, Ivana
%D 1998
%T The Dynamic Potential of Topic and Focus: A Praguian Discourse Representation Theory
%C Prague
%I Charles University, Faculty of Mathematics and Physics
%! The Dynamic Potential of Topic and Focus: A Praguian Discourse Representation Theory
%F Kruijff-Korbayova:1998:DPT
%O unpublished


%0 Journal Article
%A Kruijff-Korbayová, Ivana
%D 1999
%T Review of: Bosch, P.;van der Sandt, R. (Eds.): Focus. Cambridge University Press, 1999.
%B Prague Bulletin of Mathematical Linguistics
%V 7
%P 80-82
%! Review of: Bosch, P.;van der Sandt, R. (Eds.): Focus. Cambridge University Press, 1999.
%F Kruijff-Korbayova:1999:RBP


%0 Journal Article
%A Kruijff-Korbayová, Ivana
%D 1999
%T Review of: Issues of Valency and Meaning: Studies in Honour of Jarmila Panevová
%B Slovo a slovesnost
%V LX/2
%N 60
%P 150-153
%! Review of: Issues of Valency and Meaning: Studies in Honour of Jarmila Panevová
%F Kruijff-Korbayova:1999:RIV
%O in Czech


%0 Journal Article
%A Kruijff-Korbayová, Ivana
%D 2000
%T Review of: Ladd, Robert: Intonational Phonology. Cambridge Studies in Linguistics 79, Cambridge University Press, 1997.
%B Prague Bulletin of Mathematical Linguistics
%N 73-74
%P 117-120
%! Review of: Ladd, Robert: Intonational Phonology. Cambridge Studies in Linguistics 79, Cambridge University Press, 1997.
%F Kruijff-Korbayova:2000:RLR


%0 Journal Article
%A Kruijff-Korbayová, Ivana
%D 2000
%T Discourse Meaning: Papers in Honour of Eva Hajicová
%B Linguistica Pragensia
%V 10
%N 2
%P 105-108
%! Discourse Meaning: Papers in Honour of Eva Hajicová
%F Kruijff-Korbayova:2000:DMP


%0 Conference Proceedings
%A Kruijff-Korbayová, Ivana
%D 2001
%T Information Structure and the Semantics of "otherwise"
%E Kruijff-Korbayová, Ivana
%E Steedman, Mark
%B Information Structure, Discourse Structure and Discourse Semantics, ESSLLI 2001 Workshop Proceedings, August 20-24
%C Helsinki, Finland
%I The University of Helsinki
%P 61-78
%! Information Structure and the Semantics of "otherwise"
%2 Kruijff-Korbayova:2001:ISS.pdf Kruijff-Korbayova:2001:ISS.ps
%F Kruijff-Korbayova:2001:ISS
%U http://www.coli.uni-sb.de/~korbay/esslli01-wsh/Proceedings/24-Korbay-Webber.ps.gz


%0 Journal Article
%A Kruijff-Korbayová, Ivana
%D 2001
%T Review of: McCawley, James D.: The Syntactic Phenomena of English (Second Edition). Chicago University Press.
%B Journal of Logic, Language and Information
%V 10
%N 2
%P 263-266
%! Review of: McCawley, James D.: The Syntactic Phenomena of English (Second Edition). Chicago University Press.
%F Kruijff-Korbayova:2001:RMJ


%0 Book Section
%A Kruijff-Korbayová, Ivana
%A Bateman, John
%A Kruijff, Geert-Jan M.
%D 2002
%T Generation of Contextually Appropriate Word Order
%E Kibble, Rodger
%E van Deemter, Kees
%B Information Sharing: Reference and Presupposition in Language Generation and Interpretation
%C Stanford
%I CSLI Publications
%V 143
%P 193-222
%S CSLI Lecture Notes
%! Generation of Contextually Appropriate Word Order
%2 Kruijff-Korbayova:1999:GCA.pdf Kruijff-Korbayova:1999:GCA.ps
%F Kruijff-Korbayova:2002:GCA


%0 Journal Article
%A Kruijff-Korbayová, Ivana
%A Hajicová, Eva
%D 1997
%T Topics and Centers: A Comparison of the Salience-Based Approach and the Centering Theory
%B Prague Bulletin of Mathematical Linguistics
%V 67
%P 25-50
%! Topics and Centers: A Comparison of the Salience-Based Approach and the Centering Theory
%2 Kruijff-Korbayova:1997:TCC.pdf Kruijff-Korbayova:1997:TCC.ps
%F Kruijff-Korbayova:1997:TCC
%O Charles University, Prague, Czech Republic
%U http://www.coli.uni-sb.de/~korbay/Publications/pbml67.ps


%0 Conference Proceedings
%A Kruijff-Korbayová, Ivana
%A Karagjosova, Elena
%A Larsson, Staffan
%D 2002
%T Enhancing Collaboration with Conditional Responses in Information Seeking Dialogues
%E Bos, Johan
%E Foster, Mary Ellen 
%E Matheson, Collin
%B Proceedings of the 6th Workshop on the Semantics and Pragmatics of Dialogue
%C Edinburgh University, UK
%P 93-100
%8 4-6 September
%! Enhancing Collaboration with Conditional Responses in Information Seeking Dialogues
%2 Kruijff-Korbayova:2002:ECC.pdf Kruijff-Korbayova:2002:ECC.ps
%F Kruijff-Korbayova:2002:ECC


%0 Conference Proceedings
%D 2003
%T Proceedings of the 7th workshop on the semantics and pragmatics of dialogue (DiaBruck)
%E Kruijff-Korbayova, Ivana
%E Kosny, Claudia
%C Computational Linguistics, Saarland University
%8 September 4-6
%! Proceedings of the 7th workshop on the semantics and pragmatics of dialogue (DiaBruck)
%F Kruijff-Korbayova:2003:PWS


%0 Conference Proceedings
%A Kruijff-Korbayová, Ivana
%A Kruijff, Geert-Jan M.
%D 1996
%T Identification of Topic-Focus Chains
%E Botley, S.
%E Glass, J.
%E McEnery, T.
%E Wilson, A.
%B Approaches to Discourse Anaphora: Proceedings of the Discourse Anaphora and Anaphora Resolution Colloquium (DAARC96), July 17-18
%C University Centre for Computer Corpus Research on Language, University of Lancaster, UK
%V 8
%P 165-179
%S Technical papers
%8 July
%! Identification of Topic-Focus Chains
%2 Kruijff-Korbayova:1996:ITF.pdf Kruijff-Korbayova:1996:ITF.ps
%F Kruijff-Korbayova:1996:ITF
%U http://www.coli.uni-sb.de/~korbay/Publications/daarc96.ps.gz


%0 Conference Proceedings
%A Kruijff-Korbayová, Ivana
%A Kruijff, Geert-Jan M.
%D 1997
%T Topic-Focus articulation in SDRT
%E Dekker, Paul
%E Stokhof, Martin
%E Venema, Yde
%B Proceedings of the 11th Amsterdam Colloquium, December 17-20
%C Amsterdam
%I ILLC/Department of Philosophy, Universiteit van Amsterdam
%P 43-48
%! Topic-Focus articulation in SDRT
%2 Kruijff-Korbayova:1997:TFS.pdf Kruijff-Korbayova:1997:TFS.ps
%F Kruijff-Korbayova:1997:TFA


%0 Book Section
%A Kruijff-Korbayová, Ivana
%A Kruijff, Geert-Jan M.
%D 1999
%T Handling Word Order in a Multilingual System for Generation of Instructions
%E Matousek, Václav
%E Mautner, Pavel
%E Ocelíková, Jana
%E Sojka, Petr
%B Text, Speech and Dialogue - Second International Workshop, TSD'99, Plzen, Czech Republic, September 1999
%C Berlin
%I Springer
%V 1692
%P 83-88
%! Handling Word Order in a Multilingual System for Generation of Instructions
%2 Kruijff-Korbayova:1999:HWO.pdf Kruijff-Korbayova:1999:HWO.ps
%F Kruijff-Korbayova:1999:HWO
%U http://www.coli.uni-sb.de/~korbay/Publications/tsd99-wo.ps.gz


%0 Conference Proceedings
%A Kruijff-Korbayová, Ivana
%A Kruijff, Geert-Jan M.
%D 1999
%T Contextually Appropriate Ordering of Nominal Expressions
%E Kibble, Rodger
%E van Deemter, Kees
%B 11th European Summer School "Logic Linguistics and Information" (ESSLLI '99). Workshop on Generating Nominal Expressions, August 9-20
%C Utrecht University, The Netherlands
%I European Summer School in Logic, Language and Information
%! Contextually Appropriate Ordering of Nominal Expressions
%2 Kruijff-Korbayova:1999:CAO.pdf Kruijff-Korbayova:1999:CAO.ps
%F Kruijff-Korbayova:1999:CAO
%U http://www.coli.uni-sb.de/~korbay/Publications/gennom99.ps.gz


%0 Edited Proceedings
%A Kruijff-Korbayová, Ivana
%A Steedman, Mark
%D 2001
%T Information Structure, Discourse Structure and Discourse Semantics. ESSLLI 2001 Workshop Proceedings, August 20-24
%C Helsinki, Finland
%I The University of Helsinki
%! Information Structure, Discourse Structure and Discourse Semantics. ESSLLI 2001 Workshop Proceedings, August 20-24
%F Kruijff-Korbayova:2001:ISD


%0 Conference Proceedings
%A Kruijff-Korbayová, Ivana
%A Webber, Bonnie
%D 2000
%T Discourse Connectives, Inference and Information Structure
%E Bos, Johan
%E Kohlhase, Michael
%B Workshop on Inference in Computational Semantics (ICoS-2)
%C International Conference and Research Center for Computer Science, Schloß Dagstuhl, Germany
%P 105-120
%8 July 29-30
%! Discourse Connectives, Inference and Information Structure
%2 Kruijff-Korbayova:2000:DCI.pdf Kruijff-Korbayova:2000:DCI.ps
%F Kruijff-Korbayova:2000:DCI
%U http://www.coli.uni-sb.de/~bos/icos/kruijff.ps


%0 Conference Proceedings
%A Kruijff-Korbayová, Ivana
%A Webber, Bonnie
%D 2000
%T Information Structure and the Interpretation of Discourse Connectives in English and Czech
%E Jaszcolt, Kasia
%E Turner, Ken
%B 2nd International Conference in Contrastive Semantics and Pragmatics (SIC-CSP 2000), September 11-13
%C Cambridge, UK
%! Information Structure and the Interpretation of Discourse Connectives in English and Czech
%F Kruijff-Korbayova:2000:ISI


%0 Conference Proceedings
%A Kruijff-Korbayová, Ivana
%A Webber, Bonnie
%D 2001
%T Concession, Implicature, and Alternative Sets
%E Bunt, Harry
%B 4th International Workshop on Computational Semantics (IWCS-4), January 10-12
%C Tilburg, The Netherlands
%P 227-248
%! Concession, Implicature, and Alternative Sets
%2 Kruijff-Korbayova:2001:CIA.pdf Kruijff-Korbayova:2001:CIA.ps
%F Kruijff-Korbayova:2001:CIA
%U http://www.coli.uni-sb.de/~korbay/Publications/iwcs-2001.ps.gz


%0 Master's Thesis
%A Kurz, Daniela
%D 2000
%T Wortstellungspräferenzen im Deutschen
%C Saarbrücken
%I Universität des Saarlandes, Computerlinguistik
%! Wortstellungspräferenzen im Deutschen
%F Kurz:2000:WID


%0 Conference Proceedings
%A Kurz, Daniela
%D 2000
%T A Statistical Account on Word Order Variation in German
%B COLING Workshop on Linguistically Interpreted Corpora (LINC '00), August 6
%C Luxembourg
%! A Statistical Account on Word Order Variation in German
%2 Kurz:2000:SAW.pdf Kurz:2000:SAW.ps
%F Kurz:2000:SAW
%X In this paper we present a corpus-based study involving the linear order of subject, indirect object and direct object in German. The aim was to examine several hypotheses derived from Hawkins' (1994) performance theory. In this context it was crucial to examine whether and to which extend length influences the order of subject and objects. The analysis was based on data extracted from the annotated NEGRA corpus (Skut et al., 1998) and the untagged Frankfurter Rundschau corpus. We developed an analysis system operating on the untagged corpus that facilitates the acquisition of data and subsequent statistical analysis. We describe this system and discuss the results drawn from the analysis of the data. These results do not support the theoretical assumptions made by Hawkins. Furthermore, they suggest the investigation of other factors than length.
%U http://www.coli.uni-sb.de/~kurz/linc00.ps.gz


%0 Conference Proceedings
%A Kurz, Daniela
%A Skut, Wojciech
%A Uszkoreit, Hans
%D 2000
%T German Factors Constraining Word Order Variation
%B 13th Annual Conference on Human Sentence Processing, Poster presentation (CUNY 2000), March 30 - April 1
%C La Jolla, California, USA
%! German Factors Constraining Word Order Variation
%1 http://www.coli.uni-sb.de/~kurz/cuny00.html
%3 j
%F Kurz:2000:GFC
%O poster presentation


%0 Conference Proceedings
%A Kurz, Daniela
%A Xu, Feiyu
%D 2002
%T Text Mining for the Extraction of Domain Relevant Terms and Term Collocations
%B Proceedings of the International Workshop on "Computational Approaches to Collocations"
%C Vienna
%! Text Mining for the Extraction of Domain Relevant Terms and Term Collocations
%2 Kurz:2002:TME.pdf
%3 j
%F Kurz:2002:TME
%X This paper provides a system which combines classification-based term extraction method with the statistical collocation calculations.
%U http://www.dfki.de/dfkibib/publications/docs/Kurz_2002_TMEDRTTC.pdf


%0 Report
%A Kuschert, Susanna
%D 1996
%T Higher Order Dynamics
%C Saarbrücken
%I Universität des Saarlandes
%P 41
%S CLAUS-Report
%7 84
%8 January
%! Higher Order Dynamics
%2 Kuschert:1996:HOD.pdf Kuschert:1996:HOD.ps
%F Kuschert:1996:HOD
%U http://www.coli.uni-sb.de/~kuschert/claus.ps.gz


%0 Book Section
%A Kuschert, Susanna
%D 1997
%T Akkommodation bei Anaphernresolution?
%E Krause, W.
%E Kotkamp, U.
%E Goertz, R.
%B Intelligente Informationsverarbeitung. Tagungsband der 3. Fachtagung der Gesellschaft für Kognitionswissenschaft
%C Leverkusen
%I Deutscher Universitäts-Verlag GmbH
%! Akkommodation bei Anaphernresolution?
%F Kuschert:1997:AA


%0 Report
%A Kuschert, Susanna
%D 1997
%T Accomodation during Anaphora Resolution
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS Report
%7 92
%8 December
%! Accomodation during Anaphora Resolution
%F Kuschert:1997:ADA


%0 Report
%A Kuschert, Susanna
%D 1998
%T Dynamic Deduction for Accomodation in Anaphora Resolution
%C Saarbrücken
%I Universität des Saarlandes
%P 16
%S CLAUS-Report
%7 100
%8 October
%! Dynamic Deduction for Accomodation in Anaphora Resolution
%2 Kuschert:1998:DDA.pdf Kuschert:1998:DDA.ps Kuschert:1998:DDA.dvi
%F Kuschert:1998:DDA
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus100.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus100.dvi


%0 Report
%A Kuschert, Susanna
%A Maier, Holger
%A Millies, Sebastian
%A Xu, Hui
%D 1993
%T SCOLD Kurzbeschreibung
%C Saarbrücken
%I Universität des Saarlandes
%S GuK Report
%8 März
%! SCOLD Kurzbeschreibung
%F Kuschert:1993:SK


%0 Report
%A Latecki, Longin
%A Pinkal, Manfred
%D 1990
%T Syntactic and Semantic Conditions for Quantifier Scope
%C Saarbrücken
%I Universität des Saarlandes
%S Technical Report
%! Syntactic and Semantic Conditions for Quantifier Scope
%F Latecki:1990:SSC


%0 Report
%A Laubsch, Joachim
%A Nerbonne, John
%D 1991
%T An Overview of NLL
%C Palo Alto
%I Hewlett-Packard Laboratories
%S Technical Report
%8 July
%! An Overview of NLL
%F Laubsch:1991:ON


%0 Thesis
%A Lehmann, Sabine
%D 2000
%T Towards a Theory of Syntactic Phenomena. Saarbrücken Dissertations in Computational Linguistics and Language Technology, Volume 11
%C Saarbrücken
%I Universität des Saarlandes, Fachbereich Computerlinguistik
%! Towards a Theory of Syntactic Phenomena. Saarbrücken Dissertations in Computational Linguistics and Language Technology, Volume 11
%3 j
%F Lehmann:2000:TTS
%U http://www.dfki.de/~slehmann/thesis.pdf
%2 Lehmann:2000:TTS.pdf


%0 Conference Proceedings
%A Lehmann, Sabine
%A Estival, Dominique
%A Oepen, Stephan
%D 1996
%T TSNLP -  Des jeux de phrases-test pour l'évaluation d'application dans le domaine du TALN
%B Proceedings of the 3rd International Conference on HPSG and Traitement Automatique du Langage Naturel (TALN'96), May 22-24
%C Marseille, France
%! TSNLP -  Des jeux de phrases-test pour l'évaluation d'application dans le domaine du TALN
%2 Lehmann:1996:TJP.pdf Lehmann:1996:TJP.ps
%3 j
%F Lehmann:1996:TJP
%X Le nombre d'applications dans le domaine du TALN n'a cessé d'augmenter lors de ces dernières années. Ce développement va de pair avec une demande croissante d'outils pour évaluer ces applications.  Le projet TSNLP répond à cette demande en proposant une méthodologie et des outils pour l'évaluation à l'aide de jeux de phrases-test.  Mis à part une méthodologie élaborée pour la construction de matériel de test, TSNLP a créé la plus grand base de données de jeux de phrases-test actuellement disponible pour le français, l'anglais et l'allemand.  En outre, ce projet a développé des outils qui facilitent la construction, le stockage et l'accès aux données. Les résultats de TSNLP seront publiques.  Le projet propose ainsi des ressources linguistiques qui pourraient devenir une proposition de standard pour un modèle d'evaluation pour tout utilisateur d'applications dans le domaine du TALN.
%U http://clwww.essex.ac.uk/group/projects/tsnlp/papers/tsnlp-taln96.ps.gz


%0 Conference Proceedings
%A Lehmann, Sabine
%A Oepen, Stefan
%A Regnier-Prost, Sylvie
%A Netter, Klaus
%A Lux, Veronika
%A Klein, Judith
%A Falkedal, Kirsten
%A Fouvry, Frederik
%A Estival, Dominique
%A Dauphin, Eva
%A Compagnion, Hervé 
%A Baur, Judith
%A Balkan, Lorna
%A Arnold, Doug
%D 1996
%T TSNLP - Test Suites for Natural Language Processing
%B Proceedings of the 16th International Conference on Computational Linguistics (COLING '96), August 5-9
%C Copenhagen, Danmark
%P 711-716
%! TSNLP - Test Suites for Natural Language Processing
%2 Lehmann:1996:TTS.pdf Lehmann:1996:TTS.ps
%3 j
%F Lehmann:1996:TTS
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/tsnlp-coling96.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/tsnlp-coling96.entry


%0 Conference Proceedings
%A Lenci, Alessandro 
%A Bartolini, Roberto 
%A Calzolari, Nicoletta 
%A Agua, Ana 
%A Busemann, Stephan 
%A Cartier, Emmanuel 
%A Chevreau, Karine 
%A Coch, José
%D 2002
%T Multilingual Summarization by Integrating Linguistic Resources in the MLIS-MUSI Project
%B Proceedings of the 3rd International Conference on Language Resources and Evaluation (LREC'02), May 29-31
%C Las Palmas, Canary Islands, Spain
%! Multilingual Summarization by Integrating Linguistic Resources in the MLIS-MUSI Project
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/MUSI_paper_LREC2002.entry
%2 Lenci:2002:MSI.pdf
%3 j
%F Lenci:2002:MSI
%X In this paper we will illustrate the approach to multilingual automatic abstract production adopted by the EUsponsored project MLIS MUSI. Although a small scale research project, MUSI has tried to tackle the challenges set by multilingual summarization by adopting an original approach based on the definition of a shared ontology and representation language, and on the reuse of existing linguistic resources. MUSI combines a statisticbased module for relevant sentence extraction and a conceptbased component to generate multilingual summaries.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/MUSI_paper_LREC2002.pdf


%0 Report
%A Lerner, Jan
%D 2001
%T Anaphern und Quantoren im elliptischen Rekonstruktionsverfahren
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 115
%8 December
%! Anaphern und Quantoren im elliptischen Rekonstruktionsverfahren
%F Lerner:2001:AQI
%X Man kann die VP-Ellipse als rein semantisches Phänomen auffassen. Das bedeutet, daß man für die elidierte VP ein Denotat durch Zugriff auf die Bedeutung des Antezedens-Satzes bekommt. Einer zweiten Auffassung zufolge ist eine elliptische Konstruktion eine syntaktische Struktur, die implizites, d.h. phonetisch nicht realisiertes Material enthält. 
Unsere Arbeit besteht aus einem kritischen und einem konstruktiven Teil. Im kritischen Teil erläutern wir an konkreten Problemen die Lösungen, die bestimmte Theorien bieten können. Im konstruktiven Teil entwickeln wir eine Theorie, die die Idee aufgibt, daß Sätze mit VP-Ellipse Strukturen enthalten, die bis auf phonetisch nicht realisiertes Material vollständig sind. Wir nehmen an, daß diese Sätze interpretiert werden müssen. Der Rekonstruktionsprozeß findet sowohl auf der syntaktischen als auch auf der semantischen Ebene statt. Zuerst wird eine syntaktische Struktur rekonstruiert, die bezüglich der Skopushierarchie zwischen Quantoren und bezüglich der Koreferenz-Beziehungen nicht determiniert ist. Daraus wird eine semantische Proto-Repräsentation abgeleitet, die semantisch unterspezifiziert ist. Die semantische Ergänzung dieser Struktur erfolgt durch Regeln, die Parallelität zwischen dem Antezedens-Satz und dem elidierten Satz gewährleisten. Unsere Theorie ist auch auf Sachverhaltsanaphorik und auf Konstruktionen mit fokussierenden Gradpartikeln anwendbar.
%O in collaboration with Petra Dünges


%0 Report
%A Lerner, Jean-Yves
%D 1991
%T Quantorenanhebung bei Komparativkonstruktionen
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 18
%8 December
%! Quantorenanhebung bei Komparativkonstruktionen
%F Lerner:1991:QK


%0 Report
%A Lerner, Jean-Yves
%D 1993
%T Die Schachtelstruktur von Satzkomparativen
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 27
%8 January
%! Die Schachtelstruktur von Satzkomparativen
%F Lerner:1993:SS


%0 Report
%A Lerner, Jean-Yves
%D 1994
%T Ellipse und Variablenbindung bei Komparativen
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 41
%8 July
%! Ellipse und Variablenbindung bei Komparativen
%F Lerner:1994:EVK


%0 Report
%A Lerner, Jean-Yves
%A Pinkal, Manfred
%D 1992
%T Comparatives and Nested Quantification
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 21
%8 March
%! Comparatives and Nested Quantification
%F Lerner:1992:CNQ


%0 Report
%A Lerner, Jean-Yves
%A Pinkal, Manfred
%D 1995
%T Comparative Ellipsis and Variable Bindings
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 64
%8 June
%! Comparative Ellipsis and Variable Bindings
%2 Lerner:1995:CEVa.pdf Lerner:1995:CEVa.ps
%F Lerner:1995:CEVa
%X In this paper, we discuss the question whether phrasal comparatives should be given a direct interpretation, or require an analysis as elliptic constructions, and answer it with Yes and No. The most adequate analysis of wide reading attributive (WRA) comparatives seems to be as cases of ellipsis, while a direct (but asymmetric) analysis fits the data for narrow scope attributive comparatives. The question whether it is a syntactic or a semantic process which provides the missing linguistic material in the complement of WRA comparatives is also given a complex answer: Linguistic context is accessed by combining a reconstruction operation and a mechanism of anaphoric reference. The analysis makes only few and straightforward syntactic assumptions. In part, this is made possible because the use of Generalized Functional Application as a semantic operation allows us to model semantic composition in a flexible way.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus64.ps


%0 Conference Proceedings
%A Lerner, Jean-Yves
%A Pinkal, Manfred
%D 1995
%T Comparative Ellipsis and Variable Bindings
%E Simons, M.
%E Galloway, T.
%B Conference on Semantics and Linguistic Theory (SALT V), February 24-26
%C University of Texas, Austin, USA
%I DMLL Publications
%! Comparative Ellipsis and Variable Bindings
%F Lerner:1995:CEVb


%0 Report
%A Lewin, Ian 
%A Rupp, C. J. 
%A Hieronymus, Jim
%A Milward, David
%A Larsson, Staffan
%A Berman, Alexander
%D 2000
%T Siridus System Architecture and Interface Report
%C Göteborg
%I Göteborg University, Department of Linguistics
%S Siridus Report
%7 6.1
%8 September
%! Siridus System Architecture and Interface Report
%2 Lewin:2000:SSA.pdf Lewin:2000:SSA.ps
%F Lewin:2000:SSA
%U http://www.ling.gu.se/projekt/siridus/Publications/deliv6-1.ps.gz


%0 Journal Article
%A Li, Jie
%D 1995
%T "Dou" and Wh-questions in Mandarin Chinese
%B Journal of East Asian Linguistics
%V 4
%N 4
%P 313-323
%! "Dou" and Wh-questions in Mandarin Chinese
%F Li:1995:DWQ


%0 Book Section
%A Li, Jie
%D 1996
%T Das chinesische Schriftsystem
%E Günther, Hartmut
%B Schrift und Schriftlichkeit : Ein interdisziplinäres Handbuch internationaler Forschung
%C Berlin
%I Walter de Gruyter
%V 2
%6 2
%P 1404-1412
%! Das chinesische Schriftsystem
%F Li:1996:CS


%0 Conference Proceedings
%A Lieske, Christian
%A Bos, Johan
%A Gambäck, Björn
%A Emele, Martin
%A Rupp, C. J.
%D 1997
%T Giving Prosody a Meaning
%E Kokkinakis, G.
%E Fakotakis, N.
%E Dermatas, E.
%B Proceedings of the 5th European Conference on Speech Communication and Technology
%C Rhodes, Greece
%V 3
%P 1431-1434
%! Giving Prosody a Meaning
%F Lieske:1997:GPM


%0 Master's Thesis
%A Lorenz, Benjamin
%D 1999
%T Ein Debugger für Oz
%C Saarbrücken
%I Universität des Saarlandes, Fachbereich Informatik
%! Ein Debugger für Oz
%2 Lorenz:1999:DO.pdf Lorenz:1999:DO.ps
%F Lorenz:1999:DO
%X Im Rahmen des Software-Entwicklungsprozesses nimmt die Fehlersuche eine wichtige Stellung ein. Syntaktische Fehler können bereits vom Compiler entdeckt werden, semantische Fehler dagegen sind häufig schwer zu finden; der Zeitbedarf hierfür kann enorm hoch sein. In vielen professionellen Programmierumgebungen existiert daher ein leistungsfähiges Werkzeug, ein Debugger, der die Fehlersuche erleichtert, indem das fehlerhafte Programm an beliebigen Stellen angehalten und zusammen mit seinen Daten untersucht werden kann. Diese Arbeit beschreibt den Entwurf eines Debuggers für die Programmiersprache Oz sowie seine Implementierung im Programmiersystem Mozart.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/OzDebugger.ps.gz


%0 Report
%A Lux, Andreas
%D 1992
%T A Multi-Agent Approach Towards Group Scheduling
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-92-41
%! A Multi-Agent Approach Towards Group Scheduling
%F Lux:1992:MAA


%0 Conference Proceedings
%A Lux, Andreas
%A Bomarius, Frank
%A Steiner, Donald
%D 1992
%T A Model for Supporting Human Computer Cooperation
%E Adler, M.
%E Simoudis, E.
%E Durfee, E.
%E Huhns, M.
%B AAAI Workshop on Cooperation among Heterogeneous Intelligent Systems, July
%C San Jose, California, USA
%I MIT Press
%! A Model for Supporting Human Computer Cooperation
%F Lux:1992:MSH


%0 Book Section
%A Maedche, Alexander
%A Neumann, Günter
%A Staab, Steffen
%D 2002
%T Bootstrapping an Ontology-based Information Extraction System. Studies in Fuzziness and Soft Computing
%E Szczepaniak, Piotr
%E Segovia, Javier
%E Kacprzyk, Janusz
%E Zadeh, Lofti A.
%B Intelligent Exploration of the Web
%C Berlin
%I Springer
%! Bootstrapping an Ontology-based Information Extraction System. Studies in Fuzziness and Soft Computing
%2 Maedche:2002:BOB.pdf
%3 j
%F Maedche:2002:BOB
%X Automatic intelligent web exploration will benefit from shallow information extraction techniques if the latter can be brought to work within many different domains. The major bottleneck for this, however, lies in the so far difficult and expensive modeling of lexical knowledge, extraction rules, and an ontology that together define the information extraction system. In this paper we present a bootstrapping approach that allows for the fast creation of an ontologybased information extracting system relying on several basic components, viz. a core information extraction system, an ontology engineering environment and an inference engine. We make extensive use of machine learning techniques to support the semi-automatic, incremental bootstrapping of the domain-specific target information extraction system.
%U http://www.dfki.de/~neumann/publications/new-ps/bootstrapping.pdf


%0 Conference Proceedings
%A Marasek, Krzysztof
%A Pützer, Manfred
%D 1997
%T Electroglotto-Graphical Differentiation of Pathological Voice Qualities
%B Proceedings of Larynx, June 16-18
%C Marseille, France
%P 91-94
%! Electroglotto-Graphical Differentiation of Pathological Voice Qualities
%F Marasek:1997:EGD


%0 Conference Proceedings
%A Marimon, Montserrat
%A Theofilidis, Axel
%A Declerck, Thierry
%A Bredenkamp, Andrew
%D 1999
%T Natural Language Understanding for Natural Language Interfaces
%B Proceedings of the Processamiento del Lenguaje Natural, September 8-10
%C Lleida, Spain
%V 25
%! Natural Language Understanding for Natural Language Interfaces
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/sepln99_mel.entry
%2 Marimon:1999:NLU.pdf Marimon:1999:NLU.ps
%3 j
%F Marimon:1999:NLU
%X In this paper we present the linguistic resources - the text handling and the linguistic processing modules - which have been developed for the MELISSA project using the ALEP platform. In particular, we will see how generic (large scale) grammars involving deep linguistic analysis can be efficiently used for NL interfaces, and how a modularized design of the linguistic resources allows us to deal with the peculiarities of sub-languages, while at the same time keeping the resources as general as possible.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/sepln99_mel.ps.gz


%0 Conference Proceedings
%A Martinovic, Miroslav
%A Strzalkowski, Tomek
%D 1992
%T Comparing Two Grammar-Based Generation-Algorithms: A Case Study
%E ACL
%B 30th Annual Meeting of the Association for Computational Linguistics (ACLANNUAL '92), June 28 - July 2
%C University of Delaware, Newark, Delaware, USA
%I ACL
%P 81-88
%! Comparing Two Grammar-Based Generation-Algorithms: A Case Study
%F Martinovic:1992:CTG


%0 Report
%A Mattern, Friedemann
%A Sturm, Peter
%D 1989
%T An Automated Distributed Calendar and Appointment System
%C Kaiserslautern
%I University of Kaiserslautern, Department of Computer Science
%S Technical Report
%7 SFB124-24/89
%! An Automated Distributed Calendar and Appointment System
%F Mattern:1989:ADC


%0 Thesis
%A Mehl, Michael
%D 1999
%T The Oz Virtual Machine - Records, Transients, and Deep Guards
%B Technische Fakultät
%C Saarbrücken
%I Universität des Saarlandes
%! The Oz Virtual Machine - Records, Transients, and Deep Guards
%2 Mehl:1999:OVM.pdf Mehl:1999:OVM.ps
%F Mehl:1999:OVM
%X In this thesis we describe the design and implementation of a virtual machine LVM for the execution of Oz programs. Oz is a concurrent, dynamically typed, functional language with logic variables, futures, by-need synchronization, records, feature constraints, and deep guard conditionals. The LVM supports light-weight threads, first-class procedures, exception handling, transients as generalization of logic variables, futures, and constraint variables, records and open records, and multiple computation spaces to implement the deep guard conditional. We discuss the modular, open, and extensible design of the LVM. Techniques for the efficient implementation of the store on standard hardware are shown. The LVM subsumes well-known virtual machines for functional, logic, and imperative languages.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/mehl-thesis.ps.gz


%0 Report
%A Mehl, Michael
%A Schulte, Christian
%A Smolka, Gert
%D 1998
%T Futures and By-need Synchronization
%C Saarbrücken
%I DFKI and Universität des Saarlandes
%S Draft
%8 May
%! Futures and By-need Synchronization
%F Mehl:1998:FNS
%X We propose a conservative extension of Oz that adds futures and by-need synchronization. Futures are read-only views of logic variables that make it possible to statically limit the scope in which a variable can be constrained. For instance, one can express with futures safe streams that cannot be assigned by their readers. By-need synchronization makes it possible to synchronize a thread on the event that a thread blocks on a future. It is used to express dynamic linking and lazy functions.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/oz-futures.ps.gz


%0 Book
%A Meteer, Marie
%D 1992
%T Expressibility: The Problem of Efficient Text Planning
%C London
%I Frances Pinter
%! Expressibility: The Problem of Efficient Text Planning
%F Meteer:1992:EPE


%0 Book Section
%A Metzing, Dieter
%A Ando, Kiyoshi
%A Siegel, Melanie
%D 1994
%T Aspekte aufgabenbezogener japanischer Dialoge
%E Fiehler, R.
%E Metzing, D.
%B Untersuchungen zur Kommunikationsstruktur
%C Bielefeld
%I Aisthesis
%P 163-181
%! Aspekte aufgabenbezogener japanischer Dialoge
%F Metzing:1994:AAJ


%0 Report
%A Metzing, Dieter
%A Siegel, Melanie
%D 1994
%T Zero Pronoun Processing: Some Requirements for a VERBMOBIL System
%C Bielefeld
%I Universität Bielefeld
%S Verbmobil-Memo
%7 46
%! Zero Pronoun Processing: Some Requirements for a VERBMOBIL System
%F Metzing:1994:ZPP


%0 Conference Proceedings
%A Meyer, Georg
%A Barry, William J.
%A Koreman, Jacques
%D 1998
%T Vowel Pre-Nasalization as a Cue for Auditory Scene Analysis
%B NATO Advanced Study Institute on Computational Hearing, July 1 - July 12
%C Il Ciocco, Italy
%P 233-238
%! Vowel Pre-Nasalization as a Cue for Auditory Scene Analysis
%F Meyer:1998:VPN


%0 Report
%A Millies, Sebastian
%D 1990
%T Ein modularer Ansatz für prinzipienbasiertes Parsing
%C Saarbrücken
%I Universität des Saarlandes
%S GUK Report
%! Ein modularer Ansatz für prinzipienbasiertes Parsing
%F Millies:1990:MAP


%0 Report
%A Millies, Sebastian
%D 1992
%T Modularity, Parallelism and Licensing in a Principle-Based Parser for German
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 17
%8 December
%! Modularity, Parallelism and Licensing in a Principle-Based Parser for German
%F Millies:1992:MPLa
%X This paper presents a direct implementation of Government-Binding theory in a parser for German, which faithfully models the modular structure of the theory. The modular design yields a flexible environment, in which it is possible to define and test various versions of principles and parameters. The several modules of linguistic theory and the parser proper are interleaved in parallel fashion for early elimination of ungrammatical structures. Efficient processing of global constraints is made possible by the concept of licensing, and the use of tree indexing techniques.


%0 Conference Proceedings
%A Millies, Sebastian
%D 1992
%T Modularity, Parallelism and Licensing in a Principle-Based Parser for German
%E ICCL
%B 14th International Conference on Computational Linguistics (COLING '92), July 23-28
%C Nantes, France
%V 1
%P 163-169
%! Modularity, Parallelism and Licensing in a Principle-Based Parser for German
%F Millies:1992:MPLb


%0 Conference Proceedings
%A Millies, Sebastian
%D 1992
%T Design Requirements for Principle-Based Parsers as Flexible Research Tools
%E van Eijck, J.
%E Meyer Viol, W.
%B Computational Linguistics in the Netherlands (CLIN '91), Papers from the Second CLIN-meeting, November 29
%C CWI Amsterdam, The Netherlands
%! Design Requirements for Principle-Based Parsers as Flexible Research Tools
%F Millies:1992:DRPa


%0 Report
%A Millies, Sebastian
%D 1992
%T Design Requirements for Principle-Based Parsers as Flexible Research Tools
%C Saarbrücken
%I Universität des Saarlandes
%S GuK Report
%! Design Requirements for Principle-Based Parsers as Flexible Research Tools
%F Millies:1992:DRPb


%0 Report
%A Millies, Sebastian
%D 1993
%T Compositional Interpretation and Syntactic Information in Scold
%C Saarbrücken
%I Universität des Saarlandes
%S SAMOS Report
%7 2
%! Compositional Interpretation and Syntactic Information in Scold
%F Millies:1993:CIS


%0 Report
%A Millies, Sebastian
%D 1995
%T Eine modulare Architektur für die syntaktisch-semantische Analyse
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 60
%8 May
%! Eine modulare Architektur für die syntaktisch-semantische Analyse
%2 Millies:1995:MAS.pdf Millies:1995:MAS.ps
%F Millies:1995:MAS
%X Für die Darstellung syntaktischer Strukturen und der Art des Zugriffs darauf gibt es im wesentlichen zwei Modelle: Einerseits die integrativen Modelle, in denen eine einheitliche Datenstruktur für die Repräsentation und Manipulation der verschiedenen Ebenen bereitgestellt wird, andererseits die modularen Modelle, die verschiedene, auf die speziellen Anforderungen der Ebenen abgestimmte Formalismen bieten. In diesem Papier werden die beiden Arten von Modellen diskutiert. Es wird eine modulare Architektur vorgestellt, in der von einer genuin semantischen Ebene gezielt und in kontrollierter Weise auf semantisch relevante syntaktische Information zugegriffen wird. Die Syntax wird als abstrakter Datentyp realisiert, so daß die Semantikkonstruktion unabhängig von der konkreten Darstellung syntaktischer Information beschrieben werden kann. Für drei verschiedene Grammatikformalismen (GB, LFG, HPSG) wird die Syntax-Semantik-Schnittstelle betrachtet. Die allgemeinen Grundsätze der beschriebenen Architektur sind auf den Entwurf weiterer Schnittstellen zwischen linguistischen Teilsystemen anwendbar. Schließlich wird der Kompositionalitätsbegriff im Kontext dieses Modells problematisiert.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus60.ps


%0 Book Section
%A Millies, Sebastian
%D 1996
%T Eine modulare Architektur für die syntaktisch-semantische Analyse
%E Habel, C.
%E Kanngießer, S.
%E Rickheit, G.
%B Perspektiven der kognitiven Linguistik: Modelle und Methoden
%C Opladen
%I Westdeutscher Verlag
%S Psycholinguistische Studien
%! Eine modulare Architektur für die syntaktisch-semantische Analyse
%F Millies:1996:MAS


%0 Report
%A Millies, Sebastian
%A Pinkal, Manfred
%D 1991
%T Eine deklarative Version der DRT in typisierter Merkmalslogik
%C Saarbrücken
%I Universität des Saarlandes
%S GuK report
%8 December
%! Eine deklarative Version der DRT in typisierter Merkmalslogik
%F Millies:1991:DVD


%0 Book Section
%A Millies, Sebastian
%A Pinkal, Manfred
%D 1993
%T Linking One Semantic Interpretation System to Different Syntactic Formalisms
%E Pinkal, M.
%E Scha, R.
%E Schubert, L.
%B Semantic Formalisms in Natural Language Processing
%C Dagstuhl
%I Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI)
%S Dagstuhl Report
%7 57
%! Linking One Semantic Interpretation System to Different Syntactic Formalisms
%F Millies:1993:LOSa


%0 Report
%A Millies, Sebastian
%A Pinkal, Manfred
%D 1993
%T Linking One Semantic Interpretation System to Different Syntactic Formalisms
%C Saarbrücken
%I Universität des Saarlandes
%S GuK Report
%! Linking One Semantic Interpretation System to Different Syntactic Formalisms
%F Millies:1993:LOSb


%0 Conference Proceedings
%A Milward, David
%D 1992
%T Dynamics, Dependency Grammar and Incremental Interpretation
%E ICCL
%B 14th International Conference on Computational Linguistics (COLING '92), July 23-28
%C Nantes, France
%P 1095-1099
%! Dynamics, Dependency Grammar and Incremental Interpretation
%F Milward:1992:DDG


%0 Conference Proceedings
%A Milward, David
%D 1994
%T On-Constituent Coordination: Theory and Practice
%E ACL
%B 15th International Conference on Computational Linguistics (COLING '94), August 5-9
%C Kyoto, Japan
%V 2
%P 935-941
%! On-Constituent Coordination: Theory and Practice
%F Milward:1994:CCT


%0 Journal Article
%A Milward, David
%D 1994
%T Dynamic Dependency Grammar
%B Linguistics and Philosophy
%V 17
%P 561-605
%! Dynamic Dependency Grammar
%F Milward:1994:DDG


%0 Conference Proceedings
%A Milward, David
%D 1995
%T Incremental Interpretation of Categorial Grammar
%B 7th Conference of the European Chapter of the Association for Computational Linguistics (EACL '95), March 27-31
%C University College Dublin, Ireland
%P 119-126
%! Incremental Interpretation of Categorial Grammar
%F Milward:1995:IIC


%0 Report
%A Milward, David
%D 1996
%T Integrating Situations into a Theory of Discourse Anaphora
%C Saarbrücken
%I Universität des Saarlandes
%P 20
%S CLAUS-Report
%7 74
%8 February
%! Integrating Situations into a Theory of Discourse Anaphora
%2 Milward:1996:IST.pdf Milward:1996:IST.ps
%F Milward:1996:IST
%X This paper provides an account of definite and pronominal anaphora which draws together insights from dynamic semantics and situation semantics. The result is a dynamic semantics in which contexts consist of the parts of a scenario which have been brought to a hearer's attention. The contexts are structured by meta-level disjunction, corresponding to a set of situations where one is in attention but the hearer doesn't know which one, and meta-level conjunction corresponding to a set of situations which are simultaneously in attention. Data from bridging reference, disjunction, and telescoping is used to motivate the account, together with some of the data which has been used in the past to argue for and against situation based accounts of anaphora.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus74.ps


%0 Conference Proceedings
%A Milward, David
%A Cooper, Robin
%D 1994
%T Incremental Interpretation: Applications, Theory and Relationship to Dynamic Semantics
%E ACL
%B 15th International Conference on Computational Linguistics (COLING '94), August 5-9
%C Kyoto, Japan
%V 2
%P 748-754
%! Incremental Interpretation: Applications, Theory and Relationship to Dynamic Semantics
%F Milward:1994:IIA


%0 Book Section
%A Mineur, Anne-Marie
%A Buitelaar, Paul
%D 1995
%T A Compositional Treatment of Polysemous Arguments in Categorial Grammar
%E van Deemter, K.
%E Peters, S.
%B Semantic Ambiguity and Underspecification
%C Stanford
%I CSLI Publications
%! A Compositional Treatment of Polysemous Arguments in Categorial Grammar
%3 j
%F Mineur:1995:CTPa


%0 Report
%A Mineur, Anne-Marie
%A Buitelaar, Paul
%D 1995
%T A Compositional Treatment of Polysemous Arguments in Categorial Grammar
%C Saarbrücken
%I Universität des Saarlandes
%P 19
%S CLAUS-Report
%7 49
%8 January
%! A Compositional Treatment of Polysemous Arguments in Categorial Grammar
%2 Mineur:1995:CTPb.pdf Mineur:1995:CTPb.ps
%3 j
%F Mineur:1995:CTPb
%X We discuss the extension of the standard logical rules (functional application and abstraction) in Categorial Grammar, in order to deal with some specific cases of polysemy. We borrow from Generative Lexicon theory which proposes the mechanism of coercion next to a rich nominal lexical semantic structure called qualia structure. 

In a previous paper we introduced coercion into the framework of sign-based Categorial Grammar and investigated its impact on traditional Fregean compositionality. In this paper we will elaborate on this idea, mostly working towards the introduction of a new semantic dimension. Where in current versions of sign-based Categorial Grammar only two representations are derived: a prosodic one (form) and a logical one (modelling), here we introduce also a more detailed representation of the lexical semantics. This extra knowledge will serve to account for linguistic phenomena like metonymy.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus49.ps


%0 Book Section
%A Mohri, Mehryar
%A Nederhof, Mark-Jan
%D 2001
%T Regular Approximation of Context-Free Grammars through Transformation
%E Junqua, Jean-Claude 
%E van Noord, Gertjan
%B Robustness in Language and Speech Technology
%C Dordrecht
%I Kluwer Academic Publishers
%P 153--163
%! Regular Approximation of Context-Free Grammars through Transformation
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof01b.entry
%2 Mohri:2001:RAC.pdf Mohri:2001:RAC.ps
%3 j
%F Mohri:2001:RAC
%X We present an algorithm for approximating context-free languages with regular languages. The algorithm is based on a simple transformation that applies to any context-free grammar and guarantees that the result can be compiled into a finite automaton. The resulting grammar contains at most one new nonterminal for any nonterminal symbol of the input grammar. The result thus remains readable and if necessary modifiable. We extend the approximation algorithm to the case of weighted context-free grammars. We also report experiments with several grammars showing that the size of the minimal deterministic automata accepting the resulting approximations is of practical use for applications such as speech recognition.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof01b.ps.gz


%0 Journal Article
%A Moore, Johanna D.
%A Paris, Cecile L.
%D 1993
%T Planning Text for Advisory Dialogues: Capturing Intentional and Rhetorical Information
%B Computational Linguistics
%V 19
%N 4
%P 651-694
%! Planning Text for Advisory Dialogues: Capturing Intentional and Rhetorical Information
%F Moore:1993:PTA


%0 Journal Article
%A Moore, Johanna D.
%A Pollack, Martha E.
%D 1992
%T A Problem for RST: The Need for Multi-Level Discourse Analysis
%B Computational Linguistics
%V 18
%N 4
%P 537-544
%! A Problem for RST: The Need for Multi-Level Discourse Analysis
%F Moore:1992:PRN


%0 Conference Proceedings
%A Mori, Yoshiki
%D 1996
%T Multiple Discourse Relations on the Sentential Level in Japanese
%E ACL
%B 15th International Conference on Computational Linguistics (COLING '96), August 5-9
%C Copenhagen, Denmark
%V 2
%P 788-793
%! Multiple Discourse Relations on the Sentential Level in Japanese
%F Mori:1996:MDR


%0 Conference Proceedings
%A Morris, Andrew C.
%A Bloothooft, Gerrit
%A Barry, William J.
%A Andreeva, Bistra
%A Koreman, Jacques
%D 1997
%T Human and Machine Identification of Consonantal Place of Articulation from Vocalic Transition Segments
%E Kokkinakis, G.
%E Fakotakis, N.
%E Dermatas, E.
%B 5th European Conference on Speech Communication and Technology (EUROSPEECH '97), September 22-25
%C Rhodes, Greece
%V 4
%P 2123-2126
%! Human and Machine Identification of Consonantal Place of Articulation from Vocalic Transition Segments
%F Morris:1997:HMI


%0 Report
%A Moshier, M. Andrew
%D 1993
%T On Completeness Theorems for Feature Logics
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 31
%8 April
%! On Completeness Theorems for Feature Logics
%F Moshier:1993:CTF
%X We formulate a sequent calculus K and prove that it is sound and complete in a strong sense with respect to a class of feature structures. The proof of completeness involves proving, first, a general characterization of the conditions under which any sequent calculus (that permits unrestricted use of Gentzen's structural rules) is strongly complete with respect to a semantical interpretation. With this general characterization, we prove completeness of the sequent calculus as well as a uniform relativization of strong completeness under appropriateness conditions. This establishes various completeness theorems from the literature as applications of the results here. To demonstrate the generality of our result, we also prove, by exactly the same technique, the completeness of an intuitionistic version of the calculus with respect to a class of Kripke structures. We next turn to a proof theoretic result that is intimately related to completeness: cut elimination. We prove a version of cut elimination for the classical calculus under appropriateness conditions, and as a corollary that various fragments of the calculus are also sound and strongly complete. Finally, completeness of the fragments allows us to investigate a correspondence between certain information systems and certain calculi. With this, we show that Pereira and Shieber's Domain of Descriptions is sound and complete, but only in a weak sense, with respect to its intended semantics.


%0 Report
%A Moshier, M. Andrew
%A Pollard, Carl
%D 1993
%T The Domain of Set-Valued Feature Structures
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 35
%8 November
%! The Domain of Set-Valued Feature Structures
%F Moshier:1993:DSV


%0 Conference Proceedings
%A Müller, Karin
%D 2002
%T Evaluating Syllabification: One Category Shared by Many Grammars
%E Setzer, Andrea
%E Gaizauskas, Robert
%B Proceedings of the Workshop of the Third International Conference on Language Resources and Evaluation (LREC2002), May 29-31
%C Las Palmas, Canary Islands, Spain
%! Evaluating Syllabification: One Category Shared by Many Grammars
%2 Muller:2002:ESO.pdf Muller:2002:ESO.ps
%F Muller:2002:ESO
%X We apply a series of contextfree grammars to syllabification by using a supervised training method. In our experiments, we investigate various phonological grammars, which strongly differ in structure. A simple evaluation metric "word accuracy" supports grammar development by denoting an increasing performance for grammars enriched with linguistic structure. This evaluation, judging one single category shared by all grammars, is in strong contrast to PARSEVAL, which is designed for a single grammar evaluating (almost) all categories. Using a toytreebank, we show that the PARSEVAL measures are hard to interpret, since the results are inconsistent with one another. It turns out that evaluating only a limited number of categories (here only one single category) is a harder evaluation measure than measuring the precision of all occurring substructures of a grammar.
%U http://www.coli.uni-sb.de/~kmueller/Onlinepapers/LREC02.ps


%0 Conference Proceedings
%A Müller, Karin
%D 2002
%T Probabilistic Context-Free Grammars for Phonology
%B Workshop on Morphological and Phonological  Learning at Association for Computational Linguistics
40th Anniversary Meeting (ACL-02), July 6-12
%C University of Pennsylvania, Philadelphia, USA
%! Probabilistic Context-Free Grammars for Phonology
%2 Muller:2002:PCF.pdf Muller:2002:PCF.ps
%F Muller:2002:PCF
%X We present a phonological probabilistic context free grammar, which describes the word and syllable structure of German words. The grammar is trained on a large corpus by a simple supervised method, and evaluated on a syllabification task achieving 96.88% word accuracy on word to kens, and 90.33% on word types. We added rules for English phonemes to the grammar, and trained the enriched grammar on an English corpus. Both grammars are evaluated qualitatively showing that probabilistic contextfree grammars can contribute linguistic knowledge to phonology. Our formal approach is multilingual, while the training data is languagedependent.
%U http://www.coli.uni-sb.de/~kmueller/Onlinepapers/SIGPHON02.ps


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


%0 Report
%A Müller, Martin
%A Niehren, Joachim
%D 1997
%T Entailment of Set Constraints is not Feasible
%C Saarbrücken
%I Universität des Saarlandes, Programming Systems Lab
%S Technical Report
%! Entailment of Set Constraints is not Feasible
%2 Muller:1997:ESC.pdf Muller:1997:ESC.ps
%F Muller:1997:ESC
%X Set constraints are inclusions between expressions denoting sets of trees. They have been used extensively for type inference and program analysis. At the lower end of the expressiveness scale there are atomic set constraints and Ines constraints (inclusions over non-empty sets) for both of which a cubic time satisfiability test is known. Recently, there has been increasing interest in entailment tests for set constraints. We prove that the entailment problem of atomic set constraints is coNP-hard. We also show that the entailment problem of Ines constraints is coNP-hard. This corrects a claim of polynomial complexity presented at CP'96. Our results suggest that a complete entailment test is not feasible even for simple classes of set constraints.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/inesInfeas.ps.gz


%0 Conference Proceedings
%A Müller, Martin
%A Niehren, Joachim
%D 1998
%T Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic
%E Nipkow, T.
%B 9th International Conference on Rewriting Techniques and Applications (RTA '98), March 30 - April 1
%C Tsukuba, Japan
%I Springer-Verlag
%P 196-210
%S Lecture Notes in Computer Science
%7 1379
%! Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic
%2 Muller:1998:OCF.pdf Muller:1998:OCF.ps
%F Muller:1998:OCF
%X The system FT$_\lt$ of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. We investigate decidability and complexity questions for fragments of the first-order theory of FT$_\lt$. It is well-known that the first-order theory of FT$_\lt$ is decidable and that several of its fragments can be decided in quasi-linear time, including the satisfiability problem of FT$_\lt$ and its entailment problem with existential quantification $$\phi\models E\ x1 ... E\ xn ( \phi' )$$ Much less is known on the first-order theory of FT$_\lt$. The satisfiability problem of FT$_\lt$ can be decided in cubic time, as well as its entailment problem without existential quantification. Our main result is that the entailment problem of FT$_\lt$ with existential quantifiers is decidable but PSPACE-hard. Our decidability proof is based on a new technique where feature constraints are expressed in second-order monadic logic with countably many successors SwS. We thereby reduce the entailment problem of FT$_\lt$ with existential quantification to Rabin's famous theorem on tree automata.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/SWS97.ps.gz


%0 Journal Article
%A Müller, Martin
%A Niehren, Joachim
%D 2000
%T Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic
%B Information and Computation
%V 159
%N 1-2
%P 22-58
%! Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic
%2 Muller:2000:OCFa.pdf Muller:2000:OCFa.ps
%F Muller:2000:OCFa
%X The system FT${}_\leq$ of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. While the first-order theory of FT is well understood, only few complexity and decidability results are known for fragments of the first-order theory of FT${}_\leq$. We introduce a new handle for such decidability questions by showing how to express ordering constraints over feature trees in second-order monadic logic (S2S or WS2S). Our relationship implies a new decidability result for feature logics, namely that the entailment problem of FT${}_\leq$ with existential quantifiers $\phi_1\models \exists x_1\ldots\exists x_n\ \phi_2$ is decidable. We also show that this problem is PSPACE-hard even though the quantifier-free case can be solved in cubic time. To our knowledge, this is the first time that a non-trivial decidability result of feature logic is reduced to Rabins famous tree theorem.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/SWSJournal99.ps.gz


%0 Conference Proceedings
%A Müller, Martin
%A Niehren, Joachim
%A Podelski, Andreas
%D 1997
%T Ordering Constraints over Feature Trees
%E Smolka, G.
%B 3rd International Conference on Principles and Practice of Constraint Programming (CP '97), October 29 - November 1
%C Schloss Hagenberg, Austria
%I Springer
%P 297-311
%S Lecture Notes in Computer Science
%7 1330
%! Ordering Constraints over Feature Trees
%2 Muller:1997:OCF.pdf Muller:1997:OCF.ps
%F Muller:1997:OCF
%X Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature constraints yield extensible and modular record descriptions. We introduce the constraint system FT$<$ of ordering constraints interpreted over feature trees. Under the view that feature trees represent symbolic information, the relation $<$ corresponds to the information ordering (carries less information than). We present a polynomial algorithm that decides the satisfiability of conjunctions of positive and negative information ordering constraints over feature trees. Our results include algorithms for the satisfiability problem and the entailment problem of FT$<$ in time $O(n^3)$. We also show that FT$<$ has the independence property and are thus able to handle negative conjuncts via entailment. Furthermore, we reduce the satisfiability problem of Dörre's weak-subsumption constraints to the satisfiability problem of FT$<$. This improves the complexity bound for solving weak subsumption constraints from $O(n^5)$ to $O(n^3)$.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/FTSub97.ps.gz


%0 Journal Article
%A Müller, Martin
%A Niehren, Joachim
%A Podelski, Andreas
%D 2000
%T Ordering Constraints over Feature Trees
%B Constraints, an International Journal
%V 5
%N 1-2
%P 7-42
%! Ordering Constraints over Feature Trees
%2 Muller:2000:OCFb.pdf Muller:2000:OCFb.ps
%F Muller:2000:OCFb
%X Feature trees are the formal basis for algorithms manipulating record like structures in constraint programming, computational linguistics and in concrete applications like software configuration management. Feature trees model records, and constraints over feature trees yield extensible and modular record descriptions. We introduce the constraint system FT${}_\leq$ of ordering constraints interpreted over feature trees. Under the view that feature trees represent symbolic information, the relation $\leq$ corresponds to the information ordering ("carries less information than''). We present two algorithms in cubic time, one for the satisfiability problem and one for the entailment problem of FT${}_\leq$. We show that FT${}_\leq$ has the independence property. We are thus able to handle negative conjuncts via entailment and obtain a cubic algorithm that decides the satisfiability of conjunctions of positive and negated ordering constraints over feature trees. Furthermore, we reduce the satisfiability problem of Dörre's weak subsumption constraints to the satisfiability problem of FT${}_\leq$ and improve the complexity bound for solving weak subsumption constraints from $O(n^5)$ to $O(n^3)$.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/ftsub-constraints-99.ps.gz


%0 Report
%A Müller, Martin
%A Niehren, Joachim
%A Smolka, Gert
%D 1997
%T Typed Concurrent Programming with Logic Variables
%C Saarbrücken
%I Universität des Saarlandes, Programming Systems Lab
%S Technical Report
%8 September
%! Typed Concurrent Programming with Logic Variables
%2 Muller:1997:TCP.pdf Muller:1997:TCP.ps
%F Muller:1997:TCP
%X We present a concurrent higher-order programming language called Plain and a concomitant static type system. Plain is based on logic variables and computes with possibly partial data structures. The data structures of Plain are procedures, cells, and records. Plain's type system features record-based subtyping, bounded existential polymorphism, and access modalities distinguishing between reading and writing.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/plain-report-97.ps.gz


%0 Conference Proceedings
%A Müller, Martin
%A Niehren, Joachim
%A Treinen, Ralf
%D 1998
%T The First-Order Theory of Ordering Constraints over Feature Trees
%B 13th Annual IEEE Symposium on Logic in Computer Sience (LICS '98), June 21 - 24
%C Indianapolis, Indiana, USA
%I IEEE Press
%P 432-443
%! The First-Order Theory of Ordering Constraints over Feature Trees
%2 Muller:1998:FOT.pdf Muller:1998:FOT.ps
%F Muller:1998:FOT
%X The system FT$_\leq$ of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. We investigate the first-order theory of FT$_\leq$ and its fragments in detail, both over finite trees and over possibly infinite trees. We prove that the first-order theory of FT$_\leq$ is undecidable, in contrast to the first-order theory of FT which is well-known to be decidable. We show that the entailment problem of FT$_\leq$ with existential quantification is PSPACE-complete. So far, this problem has been shown decidable, coNP-hard in case of finite trees, PSPACE-hard in case of arbitrary trees, and cubic time when restricted to quantifier-free entailment judgments. To show PSPACE-completeness, we show that the entailment problem of FT$_\leq$ with existential quantification is equivalent to the inclusion problem of non-deterministic finite automata.
%U http://www.ps.uni-sb.de/Papers/abstracts/FTSubTheory-Long:99.html ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/FTSubTheory-Long:99.ps.gz


%0 Journal Article
%A Müller, Martin
%A Niehren, Joachim
%A Treinen, Ralf
%D 2001
%T The First-Order Theory of Ordering Constraints over Feature Trees
%B Discrete Mathematics and Theoretical Computer Science
%V 4
%N 2
%P 193-234
%! The First-Order Theory of Ordering Constraints over Feature Trees
%2 Muller:2001:FOT.pdf
%F Muller:2001:FOT
%X The system FT${}_\leq$ of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. We investigate the first-order theory of FT${}_\leq$ and its fragments in detail, both over finite trees and over possibly infinite trees. We prove that the first-order theory of FT${}_\leq$ is undecidable, in contrast to the first-order theory of FT which is well-known to be decidable. We show that the entailment problem of FT${}_\leq$ with existential quantification is PSPACE-complete. So far, this problem has been shown decidable, coNP-hard in case of finite trees, PSPACE-hard in case of arbitrary trees, and cubic time when restricted to quantifier-free entailment judgments. To show PSPACE-completeness, we show that the entailment problem of FT${}_\leq$ with existential quantification is equivalent to the inclusion problem of non-deterministic finite automata.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/FTSubTheory-98.ps.gz


%0 Conference Proceedings
%A Müller, Martin
%A Nishimura, Susumu
%D 1998
%T Type Inference for First-Class Messages with Feature Constraints
%E Hsiang , J.
%E Ohori, A.
%B Asian Computer Science Conference (ASIAN '98), December 8-10
%C Manila, The Philippines
%I Springer
%P 169-187
%S Lecture Notes in Computer Science
%7 1538
%! Type Inference for First-Class Messages with Feature Constraints
%2 Muller:1998:TIF.pdf Muller:1998:TIF.ps
%F Muller:1998:TIF
%X We present a constraint system OF of feature trees that is appropriate to specify and implement type inference for first-class messages. OF extends traditional systems of feature constraints by a selection constraint "by first-class feature tree" $x \langle y \rangle z$, in contrast to the standard selection constraint $x[f]y$ "by fixed feature" $f$. We investigate the satisfiability problem of OF and show that it can be solved in polynomial time, and even in quadratic time in an important special case. We compare OF with Treinen's constraint system EF of feature constraints with first-class features, which has an NP-complete satisfiability problem. This comparison yields that the satisfiability problem for OF with negation is NP-hard. Based on OF we give a simple account of type inference for first-class messages in the spirit of Nishimura's recent proposal, and show that it has polynomial time complexity: We also highlight an immediate extension that is desirable but makes type inference NP-hard.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/FirstClass98.ps.gz


%0 Journal Article
%A Müller, Martin
%A Smolka, Gert
%D 1996
%T Oz: Nebenläufige Programmierung mit Constraints
%B KI - Künstliche Intelligenz
%V 3
%P 55-61
%! Oz: Nebenläufige Programmierung mit Constraints
%2 Muller:1996:ONP.pdf Muller:1996:ONP.ps
%F Muller:1996:ONP
%X Dieser Artikel behandelt die Programmiersprache Oz und das ihr zugrundeliegende Programmiermodell. Oz ist eine nebenläufige Programmiersprache, die Constraintprogrammierung mit funktionaler und objektorientierter Programmierung verbindet. Oz ist als Nachfolger von Hochsprachen wie Lisp, Prolog und Smalltalk entworfen; diese Sprachen sind nur unzureichend für Anwendungen geeignet, die sowohl Problemlösungskomponenten enthalten, als auch Nebenläufigkeit und Reaktivität. Im Vergleich zu Prolog gibt Oz die Idee auf, dass Programme stets auch logische Spezifikationen sein müssen. Andererseits erlaubt Oz die flexible Programmierung von Inferenzmaschinen, deren Leistungsfähigkeit weit über das in Prolog Machbare hinausgeht. Damit steht insbesondere die Funktionalität von CLP-Sprachen wie CHIP bereit.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/KI-LP96.ps.gz


%0 Report
%A Müller, Stefan
%D 1997
%T Scrambling in German - Extraction into the Mittelfeld
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-97-06
%! Scrambling in German - Extraction into the Mittelfeld
%2 Muller:1997:SGE.pdf Muller:1997:SGE.ps
%3 j
%F Muller:1997:SGE
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dfki-report-97-06.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dfki-report-97-06.entry


%0 Report
%A Müller, Stefan
%D 1997
%T Yet Another Paper about Partial Verb Phrase Fronting in German
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-97-07
%! Yet Another Paper about Partial Verb Phrase Fronting in German
%2 Muller:1997:YAP.pdf Muller:1997:YAP.ps
%3 j
%F Muller:1997:YAP
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dfki-report-97-07.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dfki-report-97-07.entry


%0 Thesis
%A Müller, Stefan
%D 1997
%T Spezifikation und Verarbeitung deutscher Syntax in Head-Driven Phrase Structure Grammar
%C Saarbrücken
%I Universität des Saarlandes
%! Spezifikation und Verarbeitung deutscher Syntax in Head-Driven Phrase Structure Grammar
%3 j
%F Muller:1997:SVD


%0 Report
%A Müller, Stefan
%D 1997
%T Complement Extraction Lexical Rules  and Argument Attraction
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-97-08
%! Complement Extraction Lexical Rules  and Argument Attraction
%2 Muller:1997:CEL.pdf Muller:1997:CEL.ps
%3 j
%F Muller:1997:CEL
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dfki-report-97-08.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dfki-report-97-08.entry


%0 Conference Proceedings
%A Müller, Stefan
%D 1997
%T Subsumption or Unification - An HPSG-Analysis for Free Relative Clauses in German
%B 6. Fachtagung der Sektion Computerlinguistik der Deutschen Gesellschaft für Sprachwissenschaft (DGfS/CL 97): Sektion Computerlinguistik, 08.-10. Oktober
%C Heidelberg, Germany
%! Subsumption or Unification - An HPSG-Analysis for Free Relative Clauses in German
%3 j
%F Muller:1997:SUH


%0 Conference Proceedings
%A Müller, Stefan
%D 1997
%T An HPSG-Analysis for Free Relative Clauses in German
%B Proceedings of the Formal Grammar 1997. Linguistic Aspects of Logical and Computational Perspectives on Language, August 9-10
%C Aix-En-Provence, France
%I Kruijff,Geert-Jan
Morrill, Glyn V.
Oehrle, Richard T.
%P 179-188
%! An HPSG-Analysis for Free Relative Clauses in German
%2 Muller:1997:HAF.pdf Muller:1997:HAF.ps
%3 j
%F Muller:1997:HAF
%X Aus der GB-Literatur (Bausewein, 1990) über freie Relativsätze ist bekannt, daß sich diese teilweise wie ihre Relativphrasen verhalten. Sie können Argumentpositionen des Verbs füllen. 

(1) a. Was er nicht kennt, ißt er nicht.
    b. Die da stehen, kennen wir nicht.
    c. Ich denke nach, über was ich nachdenken will.

Obwohl freie Relativsätze finite Sätze sind, werden sie entsprechend der syntaktischen Eigenschaften ihrer Relativphrase im Mittelfeld angeordnet. 
(2) Er hat, was er geschenkt bekommen hat, sofort in den Schrank gestellt. 

Freie Relativsätze können nicht nur wie in (1)-(2) als Komplemente auftreten. In Abhängigkeit von den Eigenschaften der Relativphrase können sie auch - wie in (3) - als Modifikator fungieren. 
(3) Wo du schläfst, ist es laut.

Ich zeige, daß freie Relativsätze zu einer Kategorie projizieren, die in einer engen Beziehung zu den lokalen Eigenschaften der Relativphrase steht. Diese Beziehung wird durch eine Relation, die im wesentlichen einer komplexen Disjunktion entspricht, implementiert. Die Relation beschreibt sowohl die syntaktischen als auch die semantischen Regelmäßigkeiten, die sich bei freien Relativsätzen beobachten lassen. Entsprechend bestimmter Argumenthierarchien können auch Argumentpositionen gefüllt werden, die von der syntaktischen Kategorie der Relativphrase abweichen. 
(4) Wen solche Lehren nicht erfreun, verdienet nicht, ein Mensch zu sein. (Zauberflöte)

Wie Ingria (1990) gezeigt hat, stellt die unterschiedliche Kasuszuweisung im Relativsatz und im Matrixsatz, wie sie z.B. in (1b) vorliegt, ein Problem für Unifikationsgrammatiken dar. Ich zeige, daß Ingrias Ansatz nicht mit anderen Annahmen innerhalb der HPSG-Theorie vereinbar ist und schlage eine andere Lösung für das Problem vor. 

Im Allgemeinen gibt es drei Möglichkeiten, Sätze wie (1)-(3) zu analysieren: einen leeren Kopf, ein unäres Schema und eine lexikalische Regel. Im Aufsatz wird gezeigt, daß die Daten gegen die lexikalische Regel sprechen und es wird erklärt, wo die Vorteile des unären Schemas gegenüber dem leeren Kopf liegen. 


Zum Abschluß noch ein Beispielsatz, der auch in Deutsche Syntax Deklarativ vorkommt: 

(5) Was bei Ingria ein Subsumptionstest ist, ist bei Dalrymple und Kaplan ein Enthaltenseinstest.
%U http://www.cl.uni-bremen.de/~stefan/PS/fg.ps


%0 Report
%A Müller, Stefan
%D 1998
%T An HPSG-Analysis for Free Relative Clauses in German
%C Saarbrücken
%I DFKI
%S Verbmobil Report
%7 224
%! An HPSG-Analysis for Free Relative Clauses in German
%2 Muller:1998:HAF.pdf Muller:1998:HAF.ps
%3 j
%F Muller:1998:HAF
%U http://www.cl.uni-bremen.de/~stefan/PS/freeRel.ps


%0 Conference Proceedings
%A Müller, Stefan
%D 1998
%T Case in German - An HPSG-Analysis
%B ESSLLI '98 Workshop on Current Topics in Constraint-Based Theories of Germanic Syntax, August 17-21
%C Saarbrücken, Germany
%P 113-132
%! Case in German - An HPSG-Analysis
%2 Muller:1998:CGH.pdf Muller:1998:CGH.ps
%3 j
%F Muller:1998:CGH
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/esslli98.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/esslli98.entry http://www.cl.uni-bremen.de/~stefan/PS/esslli98-pic.ps


%0 Conference Proceedings
%A Müller, Stefan
%D 1999
%T Restricting Discontinuity
%B Proceedings of the 5th Natural Language Processing Pacific Rim Symposium 1999 (NLPRS '99), November 5-7
%C Beijing, China
%P 85-90
%! Restricting Discontinuity
%2 Muller:1999:RD.pdf Muller:1999:RD.ps
%3 j
%F Muller:1999:RD
%U http://www.cl.uni-bremen.de/~stefan/PS/restricting.ps


%0 Journal Article
%A Müller, Stefan
%D 1999
%T An HPSG-Analysis for Free Relative Clauses in German
%B Grammars
%V 2
%N 1
%P 53-105
%! An HPSG-Analysis for Free Relative Clauses in German
%2 Muller:1999:HAF.pdf Muller:1999:HAF.ps
%3 j
%F Muller:1999:HAF
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mueller99b.entry http://www.cl.uni-bremen.de/~stefan/PS/freeRel.ps


%0 Book
%A Müller, Stefan
%D 1999
%T Deutsche Syntax deklarativ. Head-Driven Phrase Structure Grammar für das Deutsche
%B Linguistische Arbeiten
%C Tübingen
%I Max Niemeyer Verlag
%V 394
%! Deutsche Syntax deklarativ. Head-Driven Phrase Structure Grammar für das Deutsche
%3 j
%F Muller:1999:DSD
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mueller99.entry


%0 Conference Proceedings
%A Müller, Stefan
%D 1999
%T Syntactic Properties of German Particle Verbs
%B 6th International Conference on Head-Driven Phrase Structure Grammar (HPSG '99), August 4-6
%C University of Edinburgh, Scotland
%P 83-87
%! Syntactic Properties of German Particle Verbs
%3 j
%F Muller:1999:SPG


%0 Conference Proceedings
%A Müller, Stefan
%D 1999
%T Parsing of an HPSG Grammar for German: Word Order Domains and Discontinuous Constituents
%E Gippert, Jost
%E Olivier, Peter
%B Proceedings of the 11. Jahrestagung der Gesellschaft für Linguistische DatenVerarbeitung. Multilinguale Corpora: Codierung, Strukturierung, Analyse
%C Frankfurt a. M.
%I Enigma corporation
%! Parsing of an HPSG Grammar for German: Word Order Domains and Discontinuous Constituents
%2 Muller:1999:PHG.pdf
%3 j
%F Muller:1999:PHG
%U http://titus.fkidg1.uni-frankfurt.de/curric/gldv99/paper/mueller/Muellerx.pdf


%0 Conference Proceedings
%A Müller, Stefan
%D 2000
%T Continuous or Discontinuous Constituents
%E Hinrichs, Erhard
%E Meurers, Detmar
%E Wintner, Shuly
%B Proceedings of the ESSLLI'00 Workshop on Linguistic Theory and Grammar Implementation, August 6-18
%C Birmingham
%P 133-152
%! Continuous or Discontinuous Constituents
%2 Muller:2000:CDC.pdf Muller:2000:CDC.ps
%3 j
%F Muller:2000:CDC
%X In diesem Aufsatz diskutiere ich verschiedene HPSG-Ansätze zur Beschreibung der Konstituentenstellung im Deutschen. Ansätze, die von kontinuierlichen Konstituenten ausgehen, werden mit einem Ansatz, der diskontinuierliche Konstituenten annimmt, verglichen. 

Die Anzahl der passiven Kanten, die beim Parsen von 24.602 Äußerungen aus dem Verbmobil-Korpus von der Verbmobil-Grammatik erzeugt werden, werden mit der Anzahl der passiven Kanten verglichen, die die Babel-Grammatik erzeugt

In this paper I discuss several possibile analyses for constituent order in German. Approaches that assume continuous constituents are compared with an approach that assumes discontinuous constituents. I will show that certain proposals that have been made to analyze constituent order are either not adequate or cannot be implemented with currently availible systems. For the proposals that can be implementd I will discuss the amount of work a parser has to do. I then compare two implementations of larger fragments of German: the Verbmobil grammar and the Babel grammar. It is shown that the amount of work to be done to parse the Verbmobil grammar is significantly higher then the work that has to be done parsing with the Babel grammar.
%U http://www.cl.uni-bremen.de/~stefan/PS/esslli00.ps


%0 Conference Proceedings
%A Müller, Stefan
%D 2000
%T Object-to-Subject Raising or Lexical Rule - An HPSG Analysis of the German Passive
%E Zühlke, Werner
%E Schukat-Talamazzini, Ernst G.
%B Proceedings of the 5. Konferenz zur Verarbeitung natürlicher Sprache (KONVENS'00) Sprachkommunikation
%C Ilmenau, Deutschland
%I VDE Verlag
%P 157-162
%! Object-to-Subject Raising or Lexical Rule - An HPSG Analysis of the German Passive
%1 http://www.cl.uni-bremen.de/~stefan/Pub/e_pass_lr.html
%2 Muller:2000:OSR.pdf Muller:2000:OSR.ps
%3 j
%F Muller:2000:OSR
%X In dem Aufsatz zeige ich, daß Objekt-zu-Subjektanhebungsansätze wie der von Pollard (1994) und mir (1999) vorgeschlagene problematisch sind, weil sie die Adjektivbildung nicht zufriedenstellend erklären können. Der Ansatz von Heinz und Matiasek (1994) kommt mit modalen Infinitiven und Kontrolle nicht klar. 

Ich entwickle dann eine auf Lexikonregeln basierende Analyse, die auch komplizierte Fälle des Fernpassivs erklären kann.
%U http://www.cl.uni-bremen.de/~stefan/PS/konvens2000.ps.gz


%0 Book Section
%A Müller, Stefan
%D 2000
%T German Particle Verbs and the Predicate Complex
%E Cann, Ronnie
%E Grover, Claire
%E Miller, Philip
%B Grammatical Interfaces in HPSG
%C Stanford
%I CSLI
%V 8
%P 215-229
%S Studies in Constraint-Based Lexicalism
%! German Particle Verbs and the Predicate Complex
%2 Muller:2000:GPV.pdf Muller:2000:GPV.ps
%3 j
%F Muller:2000:GPV
%X In German there is a class of verbs that can appear discontinuously (1). 
The part that appears to the left of the main verb in verb final position and that is stranded when the finite verb is in initial position is traditionally called a separable prefix. Since prefixes are by definition not separable, the terms particle and preverb are used in more recent work. 
(1) a. Setzt der Fährmann Karl über? 
takes the ferryman Karl across 
'Does the ferryman take Karl across?' 
b. daß der Fährmann Karl übersetzt. 
that the ferryman Karl across.takes 
In (1a), where the verb is in initial position, the preverb is stranded. 
Below I will argue that separable verbs in German behave like other elements in the predicate complex. This view is supported by the following facts: Preverbs are serialized like verbal or predicative adjectival complements in the right sentence bracket (the right periphery of a clause that does not contain extraposed elements), they can be fronted as can be done with single verbs or predicative adjectives. If preverbs are analyzed as part of the predicate complex, the fronting data can be accounted for as an instance of complex fronting (Partial Verb Phrase Fronting (PVP)). The inability of particles and predicates in resultative constructions to co-occur and the non-iterability of preverbs will be explained by the fact that particles and resultative predicates occupy a designated valance position that does not allow more than one particle Grammatical Interfaces in HPSG.
%U http://www.cl.uni-bremen.de/~stefan/PS/part-complex.ps


%0 Thesis
%A Müller, Stefan
%D 2000
%T Complex Predicates: Verbal Complexes, Resultative Constructions, and Particle Verbs in German
%B Philosophische Fakultät II
%C Saarbrücken
%I Universität des Saarlandes
%9 Habilitationsschrift
%! Complex Predicates: Verbal Complexes, Resultative Constructions, and Particle Verbs in German
%1 http://www.cl.uni-bremen.de/~stefan/Pub/e_complex.html
%3 j
%F Muller:19xx:CPV
%X In dem Buch entwickle ich eine Theorie der komplexen Prädikate, die normale Kopulakonstruktionen, kohärente Infinitive einschließich der AcI-Konstruktionen, Subjekt- und Objektprädikative, Resultativkonstruktionen und Partikelverben erfaßt. 

(1) Er fährt das Auto kaputt / zu Schrott.

(2) Er ißt das Fleisch roh.

Zur Abgrenzung der Resultativkonstruktionen (1) von anderen sekundäre Prädikaten wird auch auf depiktive Prädikate (2) eingegangen und eine entsprechende Analyse für diese entwickelt. Ich zeige, daß depiktive Prädikate als Adjunkte zu behandeln sind, die mit einem Element in der Argumentstruktur des Verbs, das sie modifizieren, koindiziert sind. Ich zeige auch, daß die Elemente in der Argumentstruktur des Verbs je nach ihrer Obliqueness als Antezedenten unterschiedlich gut geeignet sind. 
Im Teil, der sich mit Partikelverben beschäftigt, argumentiere ich, daß sich Verbzusätze wie andere Teile das Prädikatskomplexes verhalten. Sie werden wie Verben in der rechten Satzklammer angeordnet (3)-(4), können wie Adjektive oder Verben einzeln im Vorfeld stehen (5) oder bei Fokussierung wie Adjektive auch im Mittelfeld links vom Verbalkomplex angeordnet werden. 

(3) Karl kommt abends in Berlin an.

(4) Karl kommt abends in der Stadt an, in der ich wohne.

(5) Fest steht, daß Karl nicht der Mörder war.

Es scheint also angebracht zu sein, die Verbzusatz-Verb-Konstruktionen syntaktisch wie Verbalkomplexe, also in der Syntax, zu behandeln. Wenn Verbzusätze analog zu anderen Elementen des Verbalkomplexes behandelt werden, kann (5) als Falle von (Partial) Verb Phrase Fronting behandelt werden. Für nicht-transparente Partikelverben nehme ich Lexikoneinträge an, die denen von verbalkomplexbildenden Verben ähneln. Lexikoneinträge, die in transparente Partikelverbkombinationen verwendet werden, werden durch Lexikonregeln lizensiert. 

Bei Behandlung der Partikeln als eigenständige syntaktische Einheiten stellt sich natürlich die Frage, wie die morphologischen Fakten, insbesondere die Derivation erklärt werden kann. In einer breiten empirischen Untersuchung werden Ähnlichkeiten zur Derivation mit Resultativkonstruktionen aufgezeigt und es wird deutlich gemacht, daß weder bei Resultativkonstruktionen noch bei Partikelverben Listedness für die Derivation entscheidend ist. Produktive Partikel-Verb-Verbindungen und die eindeutig syntaktischen Resultativkonstruktionen treten z.B. in ähnlicher Weise in vielen Nominalisierungsformen auf. Zur Beschreibung von Flexion und Derivation nehme ich Lexikonregeln an, die Stämme auf flektierte Formen bzw. Stämme auf andere Stämme abbilden. Im Fall der Partikelverben wird ein Stamm, der für eine Partikel subkategorisiert ist, durch Flexionsregeln auf ein Wort abgebildet, das dann in der Syntax mit der Partikel kombiniert werden kann. Alternativ kann der Stamm aber auch durch eine Derivationsregel auf einen anderen Stamm abgebildet werden, dieser Stamm muß dann natürlich auch flektiert werden. Da der Stamm für die Partikel subkategorisiert ist, haben Derivationsregeln Zugriff auf Information, die von der Partikel begesteuert wird (z.B. semantische Information bzw. Information über zusätzliche Komplemente zusätzliche Komplemente). Die vieldiskutierten Klammerparadoxa existieren für diesen Ansatz nicht. Mächtig Mittel wie Umklammerung (Rebrackating) werden nicht benötigt. 

Die Daten aus dem in diesem Buch enthaltenen Kapitel über Partikelverben wurden teilweise auf der HPSG 99 und dem Partikelverbworkshop in Leipzig präsentiert. Die Passivanalyse mit Lexikonregeln wurde auf der HPSG 2000 in Berkeley vorgestellt. Über komplexe Prädikate und Partikelverben habe ich auf der GGS 2000 in Potsdam vorgetragen. Über eine Lösung der Klammerparadoxa in der morphologischen Analyse der Partikelverben habe ich auf der HPSG 2001 in Trondheim gesprochen und die Analyse für depiktive Prädikate wurde auf der FG 2001 in Helsinki vorgestellt.


%0 Conference Proceedings
%A Müller, Stefan
%D 2000
%T The Passive as a Lexical Rule
%E Flickinger, Dan
%E Kathol, Andreas
%B Proceedings of the 7th International Conference on Head-Driven Phrase Structure Grammar (HPSG'00), July 22-23
%C Berkeley, University of California, USA
%I CSLI
%P 247-266
%! The Passive as a Lexical Rule
%2 Muller:2000:PLR.pdf
%3 j
%F Muller:2000:PLR
%X In this paper I show that object to subject raising approaches as suggested by Pollard (1994) and Müller (1999) are problematic since they cannot account for adjective formation in a satisfying way. The approach by Heinz and Matiasek (1994), which is a formalization of Haider's (1986) ideas, cannot account for modal infinitives and control. 

I develop a lexical rule based approach and it will be shown that this approach also extends to tricky cases of remote passive.
%U http://cslipublications.stanford.edu/HPSG/1/hpsg00mueller.pdf


%0 Book Section
%A Müller, Stefan
%D 2001
%T Case in German - Towards an HPSG-Analysis
%E Kiss, Tibor
%E Meurers, Detmar
%B Constraint-Based Approaches to Germanic Syntax
%C Stanford
%I CSLI
%V 7
%P 217-255
%S Studies in Constraint-Based Lexicalism
%! Case in German - Towards an HPSG-Analysis
%1 http://www.cl.uni-bremen.de/~stefan/Pub/e_case.html
%2 Muller:2001:CGT.pdf Muller:2001:CGT.ps
%3 j
%F Muller:2001:CGT
%X In Tibor Kiss and Detmar Meurers (Eds): Constraint-based Approaches to Germanic Syntax, Studies in Constraint-Based Lexicalism, No. 7. Stanford: CSLI-Publications, pages 217-255. 

The case theory that is developed in the paper builds on work done by Heinz and Matiasek (1994). Their approach is improved in such a way that case assignent in coherent constructions like (1) works properly. 

(1) Er sieht den Mann  den Wagen reparieren.
    he sees  the manacc the caracc repair
    'He sees the man repairing the car.'

With the type hierarchy of Heinz and Matiasek it is impossible to describe the phenomenon Kongruenzkasus. Sentences like (2) and (3) cannot be analyzed. 
(2) a. Sie nannte ihn   einen Lügner.
       She called himacc a     liaracc
    b. Er   wurde ein Lügner  genannt.
       henom was   a   liarnom  called
       'He was called a liar.'

(3) a. Ich sehe ihn   als meinen Freund   an.
       I   see  himacc as  my     friendacc PRFX
       'I regard him as my friend.'
    b. Er wird als mein Freund angesehen.

In the paper, I propose a more structured case feature and appropriate lexical entries to analyze these sentences. 
Apart from that it is explained how the case assignment in adjectival and participal environments works and the case assignment to non-realized subjects as in (4) will be explaind. 

(4) Ich habe den Männern erlaubt, einer nach dem anderen wegzulaufen.
%U http://www.cl.uni-bremen.de/~stefan/PS/csli-case.ps.gz


%0 Conference Proceedings
%A Müller, Stefan
%D 2002
%T The Morphology of German Particle Verbs: Solving the Bracketing Paradox
%E van Eynde, Frank
%E Hellan, Lars
%E Beermann, Dorothee
%B Proceedings of the HPSG-2001 Conference, Norwegian University of Science andTechnology, August 3-5
%C Trondheim
%I CSLI Publications
%P 247-266
%! The Morphology of German Particle Verbs: Solving the Bracketing Paradox
%1 http://www.cl.uni-bremen.de/~stefan/Pub/paradox.html http://cslipublications.stanford.edu/HPSG/2/hpsg01-toc.html
%2 Muller:2002:MGP.pdf Muller:2002:MGP.ps
%3 j
%F Muller:2002:MGP
%X Inflectional affixes are sensitive to morphological properties of the elements they attachto. Therefore Bierwisch (1987) suggested that the inflectional material is combinedwith both the verbal stem of simplex verbs and the verbal stem of particle verbs. Heargued that this leads to the bracketing paradox in the case of particle verbs since thesemantic contribution of the inflectional information scopes over the semantic contri-bution of the complete particle verb. This paradox will be discussed in section 2.1.In section 2.2, I will discuss nominalizations and adjective derivation, which are alsoproblematic because of various bracketing paradoxes. In section 3 I will suggest a solu-tion to these apparent paradoxes that assumes that inflectional and derivational prefixesand suffixes always attach to a form of a stem that contains the information about a pos-sible particle already, but without containing a phonological realization of the particle.The particle is a dependent of the verb and is combined with its head after inflectionand derivation. With such an approach no rebracketing for the analysis of particle verbsmechanisms are necessary.
%U http://cslipublications.stanford.edu/HPSG/2/Mueller-pn.pdf http://www.cl.uni-bremen.de/~stefan/PS/paradox.ps.gz http://www.cl.uni-bremen.de/~stefan/PS/paradox.pdf


%0 Book Section
%A Müller, Stefan
%D 2002
%T Syntax or Morphology: German Particle Verbs Revisited
%E Dehé, Nicole 
%E Jackendoff, Ray
%E McIntyre, Andrew
%E Urban, Silke
%B Verb-Particle Explorations
%C Berlin
%I Mouton de Gruyter
%V 1
%P 119-139
%S Interface Explorations
%! Syntax or Morphology: German Particle Verbs Revisited
%1 http://www.cl.uni-bremen.de/~stefan/Pub/syn-morph-part.html
%2 Muller:2002:SMG.pdf Muller:2002:SMG.ps
%3 j
%F Muller:2002:SMG
%X In diesem Aufsatz untersuche ich einige Argumente, die in der Literatur benutzt wurden, um zu zeigen, daß Partikelverben als morphologische Objekte zu analysieren sind. Ich zeige, daß die Nichttransparenz mancher Partikelverben kein Kriterium dafür ist, daß Partikelverben morphologische Objekte sind, daß die Partikel unter bestimmten Voraussetzungen vorfeldfähig ist und daß auch bei Verbletztstellung die Partikel vom Verb getrennt im Mittelfeld stehen kann. Außerdem zeige ich, daß hinter am auch syntaktische Verbindungen stehen, können, so daß man nicht davon ausgehen kann, daß hinter am nur Wörter stehen können. Mit diesem Test haben andere Autoren versucht zu zeigen, daß Partikelverben Wörter und somit morphologische Objekte sind.
%U http://www.cl.uni-bremen.de/~stefan/PS/dfki-report-mouton.ps.gz


%0 Book Section
%A Müller, Stefan
%D 2002
%T Complex Predicates: Verbal Complexes, Resultative Constructions, and Particle Verbs in German
%B Studies in Constraint-Based Lexicalism
%C Stanford
%I CSLI Publications
%! Complex Predicates: Verbal Complexes, Resultative Constructions, and Particle Verbs in German
%2 Muller:2002:CPV.pdf
%3 j
%F Muller:2002:CPV
%X In this book, I develop a theory of complex predicates that accounts for normal copula constructions, subject and object predicatives, secondary predicates like depictives (1) and resultative constructions (2), and particle verbs. 

(1) Er ißt das Fleisch roh.

(2) Er fährt das Auto kaputt / zu Schrott.

In the part about particle verbs it is argued that particles should be treated as parts of the predicate complex. They are serialized in the right sentence bracket (3)-(4) and they can be fronted like adjectives or verbs (5). 
(3) Karl kommt abends in Berlin an.

(4) Karl kommt abends in der Stadt an, in der ich wohne.

(5) Fest steht, daß Karl nicht der Mörder war.

So it seems reasonable to treat the preverb-verb-constructions in the same way as other predicate complex constructions. Frontings as (5) then can be described as instances of Partial Verb Phrase Fronting.
%U http://www.cl.uni-bremen.de/~stefan/PS/complex.ps.gz http://www.essex.ac.uk/linguistics/clmt/papers/hpsg/mueller.pdf


%0 Conference Proceedings
%A Müller, Stefan
%D 2002
%T Multiple Constituents in the "Vorfeld"
%E Jäger, Gerhard
%E Monachesi, Paola
%E Penn, Gerald
%E Winter, Shuly
%B The 7th conference on Formal Grammar (FG 2002), 3-4 August
%C Trento, Italy
%P 113-124
%! Multiple Constituents in the "Vorfeld"
%3 j
%F Muller:2002:MCV
%O Preliminary version.  Final version appeared as specified in http://www.cl.uni-bremen.de/~stefan/Pub/mehr-vf-ds.html and http://www.cl.uni-bremen.de/~stefan/Pub/mehr-vf-lb.html



%0 Conference Proceedings
%A Müller, Stefan
%D 2002
%T Mehrfache Vorfeldbesetzung
%E Busemann, Stephan
%B Proceedings der 6. Konferenz zur Verarbeitung natürlicher Sprache (KONVENS 2002), 30. September - 2. Oktober
%C Saarbrücken, Germany
%I German Research Center for AI (DFKI)
%P 115-122
%S DFKI Document D-02-01
%! Mehrfache Vorfeldbesetzung
%2 Muller:2002:MV.pdf
%3 j
%F Muller:2002:MV
%X In diesem Aufsatz wird gezeigt, daß das Voranstellen von mehreren Konstituenten vor das finite Verb im Deutschen möglich ist, obwohl das Deutsche normalerweise als Verbzweitsprache klassifiziert wird. Es wird eine HPSG-Analyse entwickelt, die die Konstituenten im Vorfeld als zusammengehörige Einheit analysiert und diese Einheit in Bezug zu einem Verb setzt.
%U http://www.cl.uni-bremen.de/~stefan/PS/konvens2002.pdf


%0 Book Section
%A Müller, Stefan
%A Kasper, Walter
%D 2000
%T HPSG Analysis of German
%E Wahlster, Wolfgang
%B Verbmobil: Foundations of Speech-to-Speech Translation
%C Berlin
%I Springer
%P 238-253
%S Arificial Intelligence
%! HPSG Analysis of German
%3 j
%F Muller:2000:HAG
%X Es wird ein Überblick über die HPSG-Grammatik für die tiefe Analyse im Verbmobil-System gegeben. Die Verarbeitung von Spontansprache und der Sprache spezifischer Anwendungsdomänen wird diskutiert. Extralinguistische Information, die es in der geschriebenen Sprache nicht gibt, wie z.B. die Prosodie wird berücksichtigt. Eine empirische Evaluation der Grammatik in bezug auf Verbmobil-Korpora wird durchgeführt.


%0 Conference Proceedings
%A Müller, Tobias
%D 1999
%T Practical Investigation of Constraints with Graph Views
%E Sagonas, K.
%E Tarau, P.
%B International Workshop on Implementation of Declarative Languages (IDL'99), September 27-28
%C Paris, France
%! Practical Investigation of Constraints with Graph Views
%2 Muller:1999:PIC.pdf Muller:1999:PIC.ps
%F Muller:1999:PIC
%X Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the problem at hand and subsequently implementing that model. Typically, erroneous behavior of a constraint-based application is caused by either the model or the implementation (or both of them). Current constraint programming systems provide limited debugging support for modeling and implementing a problem. This paper proposes the Constraint Investigator, an interactive tool for debugging the model and the implementation of a constraint-based application. In particular, the Investigator is targeted at problems like wrong, void, or partial solutions. A graph metaphor is used to reflect the constraints in the solver and to present them to the user. The paper shows that this metaphor is intuitive and that it scales up to real-life problem sizes. The Constraint Investigator has been implemented in Mozart Oz. It complements other constraint debugging tools as an interactive search tree visualizer, forming the base for an integrated constraint debugging environment.
%U http://www.cs.unt.edu/~idl99/Proceedings/ProceedingsIDL99.html ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Mueller:99b.ps.gz


%0 Conference Proceedings
%A Müller, Tobias
%D 2000
%T Promoting Constraints to First-Class Status
%E Lloyd, J.
%E Dahl, V.
%E Furbach, U.
%E Kerber, M.
%E Lau, K.-K.
%E Palamidessi, C.
%E Pereira, L. M.
%E Sagiv, Y.
%E Stuckey, P.J.
%B 1st International Conference on Computational Logic (CL '00), July 24-28
%C Imperial College, London, UK
%I Springer
%P 429-447
%S Lecture Notes in Artificial Intelligence
%7 1861
%! Promoting Constraints to First-Class Status
%2 Muller:2000:PCF.pdf Muller:2000:PCF.ps
%F Muller:2000:PCF
%X This paper proposes to promote constraints to first-class status. In contrast to constraint propagation, which performs inference on values of variables, first-class constraints allow reasoning about the constraints themselves. This lets the programmer access the current state of a constraint and control a constraint's behavior directly, thus making powerful new programming and inference techniques possible, as the combination of constraint propagation and rewriting constraints à la term rewriting. First-class constraints allow for meta constraint programming. Promising applications in the field of combinatorial optimization include early unsatisfiability detection, constraint reformulation to improve propagation, garbage collection of redundant but not yet entailed constraints, and finding minimal inconsistent subsets of a given set of constraints for debugging immediately failing constraint programs. We demonstrate the above-mentioned applications by means of examples. The experiments were done with Mozart Oz but can be easily ported to other constraint solvers.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Mueller-00a.ps.gz


%0 Conference Proceedings
%A Müller, Tobias
%D 2000
%T Practical Investigation of Constraints with Graph Views
%E Dechter, R.
%B 6th International Conference on Principles and Practice of Constraint Programming (CP '00), September 18-22
%C Singapore
%I Springer
%P 320-336
%S Lecture Notes in Computer Science
%7 1984
%! Practical Investigation of Constraints with Graph Views
%2 Muller:2000:PIC.ps
%F Muller:2000:PIC
%X Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the problem at hand and subsequently implementing that model. Typically, erroneous behavior of a constraint-based application is caused by either the model or the implementation (or both of them). Current constraint programming systems provide limited debugging support for modeling and implementing a problem. This paper proposes the Constraint Investigator, an interactive tool for debugging the model and the implementation of a constraint-based application. In particular, the Investigator is targeted at problems like wrong, void, or partial solutions. A graph metaphor is used to reflect the constraints in the solver and to present them to the user. The paper shows that this metaphor is intuitive and proposes appraoches to deal with real-life problem sizes. The Investigator has been implemented in Mozart Oz and complements other constraint programming tools as an interactive visual search engine, forming the base for an integrated constraint debugging environment.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Mueller00b.ps.gz


%0 Conference Proceedings
%A Müller, Tobias
%A Müller, Martin
%D 1997
%T Finite Set Constraints in Oz
%E Bry, F.
%E Freitag, B.
%E Seipel, D.
%B 12. Workshop Logische Programmierung (WLP '97), 17.-19. September
%C Ludwig-Maximilians-Universität München, Germany
%P 104-115
%! Finite Set Constraints in Oz
%2 Muller:1997:FSC.pdf Muller:1997:FSC.ps
%F Muller:1997:FSC
%X We report on the extension of the concurrent constraint language Oz by constraints over finite sets of integers. Set constraints are an important addition to the constraint programming system Oz and are very employable in natural language processing and general problem solving. This extension profits much from its integration with the existing constraint systems over finite domains and feature trees, as well as from the availability of first-class procedures. This combination of features is unique to Oz. This paper focuses on the expressiveness gained by set constraints and on the benefits of the integration with finite domain constraints. A number of case studies demonstrates programming techniques exploring these advantages.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/TMMM97a.ps.gz


%0 Conference Proceedings
%A Müller, Tobias
%A Würtz, Jörg
%D 1996
%T Interfacing Propagators with a Concurrent Constraint Language
%B Joint International Conference and Symposium on Logic Programming (JICSLP '96). Post-Conference Workshop and Compulog Net Meeting on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages, September 5-6
%C Bonn, Germany
%P 195-206
%! Interfacing Propagators with a Concurrent Constraint Language
%2 Muller:1996:IPC.pdf Muller:1996:IPC.ps
%F Muller:1996:IPC
%X This paper describes a C++ interface for the concurrent constraint language Oz to implement non-basic constraints as propagators. The programmer benefits from the advantages of a high-level language, like elegant and concise coding, in conjunction with efficiency. For the user it is transparent whether a constraint is implemented by an Oz procedure or through the interface. The interface is completely separated from the underlying Oz implementation. Moreover, it frees the user from tedious tasks like suspending and waking up constraints. The overall efficiency of the resulting system is comparable to existing finite domain systems. For scheduling applications we demonstrate how algorithms from Operations Research can be incorporated, which allows to obtain results comparable to commercially available systems.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/interfacing96.ps.gz


%0 Conference Proceedings
%A Müller, Tobias
%A Würtz, Jörg
%D 1997
%T Extending a Concurrent Constraint Language by Propagators
%E Maluszynski, J.
%B International Logic Programming Symposium (ILPS '97), October 12-17
%C Port Jefferson, Long Island N.Y., USA
%I MIT Press
%P 149-163
%! Extending a Concurrent Constraint Language by Propagators
%2 Muller:1997:ECC.pdf Muller:1997:ECC.ps
%F Muller:1997:ECC
%X This paper describes the extension of a concurrent constraint programming (CCP) language with an interface to define new finite domain constraints efficiently. While the extension is implemented for the CCP language Oz, the described interface is well-suited to be also applied to other CCP languages and even to Prolog-based implementations with coroutining. The interface is easily extendable to other constraint systems as done for set constraints. Constraints are implemented as instances of C++ classes, so-called propagators. Propagators are completely separated from the runtime system. The supplied abstractions are as high-level as to hide away issues like suspension handling but provide an expressiveness adequate to implement global constraints employing advanced algorithmic techniques. This allows to solve demanding combinatorial problems, as for instance scheduling problems. The presented interface exploits specific features of Oz, like equality constraints and local computation spaces, but avoids to bother the programmer with implementation details of these features.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/mueller97.ps.gz


%0 Journal Article
%A Müller, Tobias
%A Würtz, Jörg
%D 1999
%T Embedding Propagators in a Concurrent Constraint Language
%B The Journal of Functional and Logic Programming
%N Special Issue 1
%! Embedding Propagators in a Concurrent Constraint Language
%2 Muller:1999:EPC.pdf Muller:1999:EPC.ps
%F Muller:1999:EPC
%X Solving large and hard discrete combinatorial problems often requires the design of new constraints. Current constraint systems focus on either high-level modeling or efficient implementation technology. While each approach lacks the advantages of the other one, this paper describes the combination of them in the high-level concurrent constraint language Oz. We describe an interface to Oz providing abstractions to program new efficient constraints in CPP, preserving the benefits of Oz for problem modeling. While constraints and the Oz runtime system are linked through the interface, and adequate interface abstractions are supplied to implement advanced algorithmic techniques. In particular, it provides the means to reflect the validity of a constraint and to control and inspect the state of a constraint. This allows the user to solve demanding combinatorial problems, such as hard scheduling problems. It is desirable to execute concurrent constraint programs in parallel to profit from multiprocessor architectures. We discuss how the proposed interface can be adapted to parallel execution, avoiding the recoding of constraint implementations for sequential solvers.
%O Published on the Internet: http://mitpress.mit.edu/JFLP/, ISSN 1080--5230, MIT Press Journals, Five Cambridge Center, Cambridge, USA
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/MuellerWuertz:99a.ps.gz


%0 Thesis
%A Müller-Landmann, Sonja
%D 2000
%T Corpus-Based Parse Pruning - Applying Empirical Data to Symbolic Knowledge
%C Saarbrücken
%I Universität des Saarlandes, Department of Computational Linguistics
%! Corpus-Based Parse Pruning - Applying Empirical Data to Symbolic Knowledge
%F Muller-Landmann:2000:CBP


%0 Journal Article
%A Muskens, Reinhard
%D 1996
%T Combining Montague Semantics and Discourse Representation
%B Linguistics and Philosophy
%V 19
%P 143-186
%! Combining Montague Semantics and Discourse Representation
%F Muskens:1996:CMS


%0 Report
%A Muskens, Reinhard
%D 1997
%T Program Semantics and Classical Logic
%C Saarbrücken
%I Universität des Saarlandes
%P 29
%S CLAUS-Report
%7 86
%8 January
%! Program Semantics and Classical Logic
%2 Muskens:1997:PSC.pdf Muskens:1997:PSC.ps Muskens:1997:PSC.dvi
%F Muskens:1997:PSC
%X In the tradition of Denotational Semantics one usually lets program constructs take their denotations in reflexive domains, i.e. in domains where self-application is possible. For the bulk of programming constructs, however, working with reflexive domains is an unnecessary complication. In this paper we shall use the domains of ordinary classical type logic to provide the semantics of a simple programming language containing choice and recursion. We prove that the rule of Scott Induction holds in this new setting, prove soundness of a Hoare calculus relative to our semantics, give a direct calculus C on programs, and prove that the denotation of any program P in our semantics is equal to the union of the denotations of all those programs L such that P follows from L in our calculus and L does not contain recursion or choice.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus86.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus86.dvi


%0 Book Section
%A Muskens, Reinhard
%D 1999
%T Underspecified Semantics
%E Egli, U.
%E Heusinger, K.
%B Reference and Anaphoric Relations
%C Dordrecht
%I Kluwer Academic Publishers
%V 72
%P 311--338
%S Studies in Linguistics and Philosophy
%! Underspecified Semantics
%F Muskens:1999:US


%0 Book Section
%A Muskens, Reinhard
%A Van Benthem, Johan F.
%A Visser, Alber
%D 1996
%T Dynamics
%E Van Benthem, J. F.
%E Ter Meulen, A.
%B Handbook of Logic and Language
%C Amsterdam
%I Elsevier
%P 587-648
%! Dynamics
%F Muskens:1996:D


%0 Conference Proceedings
%A Nederhof, Mark-Jan
%D 1997
%T Regular Approximations of CFLs: A Grammatical View
%B International Workshop on Parsing Technologies (IWPT '97), September 17-20
%C Boston, USA
%! Regular Approximations of CFLs: A Grammatical View
%3 j
%F Nederhof:1997:RAC


%0 Conference Proceedings
%A Nederhof, Mark-Jan
%D 1998
%T An Alternative LR Algorithm for TAGs
%E ACL
%B 17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association for Computational Linguistics (COLING-ACL '98), August 10-14
%C Montréal, Québec, Canada
%I Morgan Kaufmann Publishers
%V 2
%P 946-952
%! An Alternative LR Algorithm for TAGs
%2 Nederhof:1998:ALA.pdf Nederhof:1998:ALA.ps
%3 j
%F Nederhof:1998:ALA
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98b.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98b.entry


%0 Conference Proceedings
%A Nederhof, Mark-Jan
%D 1998
%T Linear Indexed Automata and Tabulation of TAG Parsing
%B Premières Journées sur la Tabulation en Analyse Syntaxique et Déduction/ 1st Workshop on Tabulation in Parsing and Deduction (TAPD '98), April 2-3
%C Paris, France
%P 1-9
%! Linear Indexed Automata and Tabulation of TAG Parsing
%2 Nederhof:1998:LIA.pdf Nederhof:1998:LIA.ps
%3 j
%F Nederhof:1998:LIA
%U http://www.dfki.de/dfkibib/publications/docs/nederhof98e.ps.gz


%0 Conference Proceedings
%A Nederhof, Mark-Jan
%D 1998
%T Context-Free Parsing Through Regular Approximation
%B 1st International Workshop on Finite State Methods in Natural Language Processing (FSMNLP '98), June 29 - July 1
%C Bilkent University, Ankara, Turkey
%P 13-24
%! Context-Free Parsing Through Regular Approximation
%2 Nederhof:1998:CFP.pdf Nederhof:1998:CFP.ps
%3 j
%F Nederhof:1998:CFP
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98a.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98a.entry


%0 Conference Proceedings
%A Nederhof, Mark-Jan
%D 1999
%T Models of Tabulation for TAG Parsing
%B Proceedings of the 6th Meeting on Mathematics of Language (MOL6), July 23-25
%C Orlando, Florida, USA
%P 143-158
%! Models of Tabulation for TAG Parsing
%2 Nederhof:1999:MTT.pdf Nederhof:1999:MTT.ps
%3 j
%F Nederhof:1999:MTT
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mol99.ps ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mol99.entry


%0 Journal Article
%A Nederhof, Mark-Jan
%D 1999
%T The Computational Complexity of the Correct-Prefix Property for TAGs
%B Computational Linguistics
%V 25
%N 3
%P 345-360
%! The Computational Complexity of the Correct-Prefix Property for TAGs
%2 Nederhof:1999:CCC.pdf Nederhof:1999:CCC.ps
%3 j
%F Nederhof:1999:CCC
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof99b.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof99b.entry


%0 Book Section
%A Nederhof, Mark-Jan
%D 1999
%T Efficient Generation of Random Sentences
%B An Encyclopedia of Computer Science and Technology
%I Marcel Dekker Verlag
%V 41
%P 45-65
%! Efficient Generation of Random Sentences
%2 Nederhof:1999:EGR.pdf Nederhof:1999:EGR.ps
%3 j
%F Nederhof:1999:EGR
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof99a.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof99a.entry


%0 Journal Article
%A Nederhof, Mark-Jan
%D 2000
%T Practical Experiments with Regular Approximation of Context-Free Languages
%B Computational Linguistics
%V 26
%N 1
%P 17-44
%! Practical Experiments with Regular Approximation of Context-Free Languages
%2 Nederhof:2000:PER.pdf Nederhof:2000:PER.ps
%3 j
%F Nederhof:2000:PER
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof00.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof00.entry


%0 Conference Proceedings
%A Nederhof, Mark-Jan
%D 2000
%T Preprocessing for Unification Parsing of Spoken Language
%E Christodoulakis, D. N.
%B Proceedings of the Natural Language Processing - NLP 2000, June 2-4
%C Patras, Greece
%I Springer
%P 118-129
%S Lecture Notes in Artificial Intelligence
%7 1835
%! Preprocessing for Unification Parsing of Spoken Language
%2 Nederhof:2000:PUP.pdf Nederhof:2000:PUP.ps
%3 j
%F Nederhof:2000:PUP
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof00a.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof00a.entry


%0 Conference Proceedings
%A Nederhof, Mark-Jan
%D 2000
%T Preprocessing for Unification Parsing of Spoken Language
%E Christodoulakis, Dimitris
%B Proceedings of the Natural Language Processing - NLP 2000, June 2-4
%C Patras, Greece
%I Springer
%P 118-129
%S Lecture Notes in Artificial Intelligence
%7 1835
%! Preprocessing for Unification Parsing of Spoken Language
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof00a.entry
%2 Nederhof:2000:PUPa.pdf Nederhof:2000:PUPa.ps
%3 j
%F Nederhof:2000:PUPa
%X Wordgraphs are structures that may be output by speech recognizers. We discuss various methods for turning wordgraphs into smaller structures. One of these methods is novel; this method relies on a new kind of determinization of acyclic weighted finite automata that is language-preserving but not fully weight-preserving, and results in smaller automata than in the case of traditional determinization of weighted finite automata. We present empirical data comparing the respective methods. The methods are relevant for systems in which wordgraphs form the input to kinds of syntactic analysis that are very time consuming, such as unification parsing.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof00a.ps.gz


%0 Book Section
%A Nederhof, Mark-Jan
%D 2000
%T Regular Approximation of CFLs: A Grammatical View
%E Bunt, Harry
%E Nijholt, Anton
%B Advances in Probabilistic and other Parsing Technologies
%I Kluwer Academic Publishers
%P 221-241
%! Regular Approximation of CFLs: A Grammatical View
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof00b.entry
%2 Nederhof:2000:RACa.pdf Nederhof:2000:RACa.ps
%3 j
%F Nederhof:2000:RACa
%X We show that for each context-free grammar a new grammar can be constructed that generates a regular language. This construction differs from some existing methods of approximation in that use of a pushdown automaton is avoided. This allows better insight into how the generated language is affected.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof00b.ps.gz


%0 Conference Proceedings
%A Nederhof, Mark-Jan
%D 2001
%T Approximating Context-Free by Rational Transduction for Example-Based MT
%B Proceedings of the 39th Annual Meeting and 10th Conference of the European Chapter, Workshop proceedings: Data-Driven Machine Translation, July 5-11
%C Toulouse, France
%I Morgan Kaufmann Publishers
%P 25-32
%! Approximating Context-Free by Rational Transduction for Example-Based MT
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof01.entry
%2 Nederhof:2001:ACFa.pdf Nederhof:2001:ACFa.ps
%3 j
%F Nederhof:2001:ACFa
%X Existing studies show that a weighted context-free transduction of reasonable quality can be effectively learned from examples. This paper investigates the approximation of such transduction by means of weighted rational transduction. The advantage is increased processing speed, which benefits real-time applications involving spoken language.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof01.ps.gz


%0 Book Section
%A Nederhof, Mark Jan
%D 2000
%T Regular Approximation of CFLs: A Grammatical View
%E Bunt, H. 
%E Nijholt, A.
%B Advances in Probabilistic and other Parsing Technologies
%I Kluwer Academic Publishers
%P 221-241
%! Regular Approximation of CFLs: A Grammatical View
%2 Nederhof:2000:RAC.pdf Nederhof:2000:RAC.ps
%3 j
%F Nederhof:2000:RAC
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof00b.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof00b.entry


%0 Conference Proceedings
%A Nederhof, Mark Jan
%D 2001
%T Approximating Context-Free by Rational Transduction for Example-Based MT
%E ACL
%B Proceedings of the 39th Annual Meeting and 10th Conference of the European Chapter, Workshop proceedings: Data-Driven Machine Translation, July 5-11
%C Toulouse, France
%I Morgan Kaufmann Publishers
%P 25-32
%! Approximating Context-Free by Rational Transduction for Example-Based MT
%2 Nederhof:2001:ACF.pdf Nederhof:2001:ACF.ps
%3 j
%F Nederhof:2001:ACF
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof01.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof01.entry


%0 Conference Proceedings
%A Nederhof, M. J.
%A Sarkar, A.
%A Satta, G.
%D 1998
%T Prefix Probabilities for Linear Indexed Grammars
%B 4th International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4), August 1-3
%C University of Pennsylvania, Philadelphia, USA
%P 116-119
%S IRCS Report
%7 98-12
%! Prefix Probabilities for Linear Indexed Grammars
%2 Nederhof:1998:PPL.pdf Nederhof:1998:PPL.ps
%3 j
%F Nederhof:1998:PPL
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98d.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98d.entry


%0 Conference Proceedings
%A Nederhof, Mark Jan
%A Satta, Giorgio
%D 2000
%T Left-To-Right Parsing and Bilexical Context-Free Grammars
%E Nirenburg, S.
%E Appelt, D.
%E Ciravegna, F.
%E Dale, R.
%B Proceedings of the 6th Applied Natural Language Processing Conference and 1st Meeting of the North American Chapter of the Association for Computational Linguistics (ANLP-NAACL '00), April 29 - May 3
%C Seattle, Washington, USA
%P 272-279
%! Left-To-Right Parsing and Bilexical Context-Free Grammars
%2 Nederhof:2000:LRP.pdf Nederhof:2000:LRP.ps
%3 j
%F Nederhof:2000:LRP
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof-satta00.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof-satta00.entry


%0 Book Section
%A Nederhof, Mark-Jan
%A Bertsch, Eberhard
%D 1999
%T An Innovative Finite State Concept for Recognition and Parsing of Context-Free Languages
%E Kornai, A.
%B Extended Finite State Models of Language
%C Stanford
%I Cambridge University Press
%P 226-243
%! An Innovative Finite State Concept for Recognition and Parsing of Context-Free Languages
%2 Nederhof:1999:IFS.pdf Nederhof:1999:IFS.ps
%3 j
%F Nederhof:1999:IFS
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nebe99.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nebe99.entry


%0 Conference Proceedings
%A Nederhof, Mark-Jan
%A Sarkar, Anoop
%A Satta, Giorgio
%D 1998
%T Prefix Probabilities from Stochastic Tree Adjoining Grammar
%E ACL
%B Proceedings of the 17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association on Computational Linguistics (COLING-ACL '98), August 10-14
%C Montréal, Québec, Canada
%I Morgan Kaufmann Publishers
%V 2
%P 953-959
%! Prefix Probabilities from Stochastic Tree Adjoining Grammar
%2 Nederhof:1998:PPS.pdf Nederhof:1998:PPS.ps
%3 j
%F Nederhof:1998:PPS
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98c.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98c.entry


%0 Conference Proceedings
%A Nederhof, Mark-Jan
%A Sarkar, Anoop
%A Satta, Giorgio
%D 1998
%T Prefix Probabilities for Linear Indexed Grammars
%B Proceedings of the 4th International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4), August 1-3
%C University of Pennsylvania, Philadelphia, USA
%P 116-119
%S IRCS Report
%7 98-12
%! Prefix Probabilities for Linear Indexed Grammars
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98d.entry
%2 Nederhof:1998:PPLb.pdf Nederhof:1998:PPLb.ps
%3 j
%F Nederhof:1998:PPLb
%X We show how prefix probabilities can be computed for stochastic linear indexed grammars (SLIGs). Our results apply as well to stochastic tree-adjoining grammars (STAGs), due to their equivalence to SLIGs.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98d.ps.gz


%0 Conference Proceedings
%A Nederhof, Mark-Jan
%A Satta, Giorgio
%D 1997
%T A Variant of Earley Parsing
%E Lenzerini, Maurizio
%B Advances in Artificial Intelligence. 5th Conference of the Italian Association for Artificial Intelligence (AI*IA 97), September 17-19
%C Rome, Italy
%I Springer Verlag
%P 84-95
%S Lecture Notes in Artificial Intelligence
%7 1321
%! A Variant of Earley Parsing
%2 Nederhof:1997:VEP.pdf
%3 j
%F Nederhof:1997:VEP
%U http://lanl.arxiv.org/PS_cache/cmp-lg/pdf/9808/9808017.pdf


%0 Conference Proceedings
%A Nederhof, Mark-Jan
%A Satta, Giorgio
%D 2000
%T Left-To-Right Parsing and Bilexical Context-Free Grammars
%E Nirenburg, Sergei
%E Appelt, Douglas
%E Ciravegna, Fabio
%E Dale, Robert
%B Proceedings of the 6th Applied Natural Language Processing Conference and 1st Meeting of the North American Chapter of the Association for Computational Linguistics (ANLP-NAACL'00), April 29 - May 3
%C Seattle, Washington, USA
%P 272-279
%! Left-To-Right Parsing and Bilexical Context-Free Grammars
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof-satta00.entry
%2 Nederhof:2000:LRPb.pdf Nederhof:2000:LRPb.ps
%3 j
%F Nederhof:2000:LRPb
%X We compare the asymptotic time complexity of left-to-right and bidirectional parsing techniques for bilexical context-free grammars, a grammar formalism that is an abstraction of language models used in several state-of-the-art real-world parsers. We provide evidence that left-to-right parsing cannot be realised within acceptable time-bounds if the so called correct-prefix property is to be ensured. Our evidence is based on complexity results for the representation of regular languages.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof-satta00.ps.gz


%0 Conference Proceedings
%A Nederhof, Mark-Jan
%A Satta, Giorgio
%D 2002
%T Parsing Non-Recursive Context-Free Grammars
%B Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL ANNUAL'02), July 7-12
%C Philadelphia, Pennsylvania, USA
%P 112-119
%! Parsing Non-Recursive Context-Free Grammars
%2 Nederhof:2002:PNR.pdf Nederhof:2002:PNR.ps
%F Nederhof:2002:PNR
%X We consider the problem of parsing nonrecursive contextfree grammars, i.e., contextfree grammars that generate finite languages. In natural language processing, this problem arises in several areas of application, including natural language generation, speech recognition and machine translation. We present two tabular algorithms for parsing of nonrecursive contextfree grammars, and show that they perform well in practical settings, despite the fact that this problem is PSPACE complete.
%U http://www.dfki.de/dfkibib/publications/docs/nederhof02d.ps


%0 Book Section
%A Nerbonne, John
%D 1991
%T Feature-Based Disambiguation
%E Johnson, R.
%E Rosner, M.
%E Rupp, C. J.
%B Constraint Propagation, Linguistic Description and Computation
%I Academic Press
%! Feature-Based Disambiguation
%F Nerbonne:1991:FBD


%0 Conference Proceedings
%A Nerbonne, John
%D 1992
%T A Feature-Based Syntax/ Semantics Interface
%E Manaster-Ramer, A.
%E Zadrozny, W.
%B Proceedings of the 2nd International Conference on the Mathematics of Language. Annals of Mathematics and Artificial Intelligence
%V 2
%! A Feature-Based Syntax/ Semantics Interface
%F Nerbonne:1992:FBSa


%0 Conference Proceedings
%A Nerbonne, John
%D 1992
%T Constraint-Based Semantics
%E Dekker, P.
%E Stokhof, M.
%B 8th Amsterdam Colloquium
%C Amsterdam, The Netherlands
%I Institute for Logic, Language and Computation
%P 425-444
%! Constraint-Based Semantics
%F Nerbonne:1992:CBSa


%0 Journal Article
%A Nerbonne, John
%D 1992
%T Evaluierungsworkshop
%B Künstliche Intelligenz
%V 6
%N 4
%P 43-44
%! Evaluierungsworkshop
%F Nerbonne:1992:E


%0 Conference Proceedings
%A Nerbonne, John
%D 1992
%T Feature-Based Lexicons - An Example and a Comparison to DATR
%E Reimann, D.
%B Beiträge des ASL-Lexikon-Workshops
%C Wandlitz, Germany
%P 36-49
%! Feature-Based Lexicons - An Example and a Comparison to DATR
%F Nerbonne:1992:FBLa


%0 Conference Proceedings
%A Nerbonne, John
%D 1992
%T Natural Language Disambiguation and Taxonomic Reasoning
%E Heinsohn, J.
%E Hollunder, B.
%B DFKI Workshop on Taxonomic Reasoning, February 26
%C Saarbrücken, Germany
%P 40-47
%! Natural Language Disambiguation and Taxonomic Reasoning
%F Nerbonne:1992:NLD


%0 Conference Proceedings
%A Nerbonne, John
%D 1992
%T Nominal Comparatives and Generalized Quantifieres
%E Allgayer, J.
%B Processing Plurals and Quantifiers: Proceedings of the 1990 German Workshop on Artificial Intelligence. Workshop on the Semantics of Plurals and Quantifiers, September 10-14
%C Eringerfeld, Germany
%I CSLI
%! Nominal Comparatives and Generalized Quantifieres
%F Nerbonne:1992:NCG


%0 Conference Proceedings
%A Nerbonne, John
%D 1992
%T Representing Grammar, Meaning and Knowledge
%E Preuß, S.
%E Schmitz, B.
%B Berlin Workshop on Text Representation and Domain Modeling: Ideas from Linguistics. KIT FAST 97
%C Berlin, Germany
%P 130-147
%! Representing Grammar, Meaning and Knowledge
%F Nerbonne:1992:RGMa


%0 Report
%A Nerbonne, John
%D 1992
%T A Feature-Based Syntax/ Semantics Interface
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-92-42
%! A Feature-Based Syntax/ Semantics Interface
%2 Nerbonne:1992:FBSb.pdf
%F Nerbonne:1992:FBSb
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-42.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-42.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-42.ps.Z


%0 Report
%A Nerbonne, John
%D 1992
%T Constraint-Based Semantics
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-92-18
%! Constraint-Based Semantics
%2 Nerbonne:1992:CBSb.pdf
%F Nerbonne:1992:CBSb
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-18.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-18.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-18.ps.Z


%0 Report
%A Nerbonne, John
%D 1992
%T Feature-Based Lexicons: An Example and a Comparison to DATR
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-92-04
%! Feature-Based Lexicons: An Example and a Comparison to DATR
%F Nerbonne:1992:FBLb


%0 Report
%A Nerbonne, John
%D 1992
%T Representing Grammar, Meaning and Knowledge
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-92-20
%! Representing Grammar, Meaning and Knowledge
%F Nerbonne:1992:RGMb
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-18.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-18.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-92-18.ps.Z


%0 Report
%A Nerbonne, John
%A Gawron, Jean Mark
%A Peters, Stanley
%D 1991
%T Anaphora, Quantification and Absorption
%C Stanford
%I Center for the Studies of Linguistics and Information
%S Technical Report
%7 CSLI-91-153
%! Anaphora, Quantification and Absorption
%F Nerbonne:1991:AQA


%0 Conference Proceedings
%A Nerbonne, John
%A Gawron, Jean Mark
%A Peters, Stanley
%D 1991
%T The Absorption Principle and E-Type Anaphora
%E Barwise, J.
%E Gawron, J. M.
%E Plotkin, G.
%E Tutiya, S.
%B 2nd Conference on Situation Theory and its Applications
%C Stanford University, USA
%I CSLI Lecture Notes
%V 2
%P 335-362
%! The Absorption Principle and E-Type Anaphora
%F Nerbonne:1991:APTa


%0 Report
%A Nerbonne, John
%A Gawron, Jean Mark
%A Peters, Stanley
%D 1991
%T The Absorption Principle and E-Type Anaphora
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-91-12
%! The Absorption Principle and E-Type Anaphora
%F Nerbonne:1991:APTb


%0 Conference Proceedings
%A Nerbonne, John
%A Iida, Masayo
%A Ladusaw, William
%D 1989
%T Running on Empty: Null Heads in Head-Driven Grammar
%E Fee, J.
%E Hunt, K.
%B 8th Annual West Coast Conference on Formal Linguistics (WCCFL)
%C Stanford
%I CSLI
%P 276-288
%! Running on Empty: Null Heads in Head-Driven Grammar
%F Nerbonne:1989:REN


%0 Conference Proceedings
%A Nerbonne, John
%A Iida, Masayo
%A Ladusaw, William
%D 1990
%T Semantics of Common Noun Phrase Anaphora
%E Halpern, A.
%B 9th West Coast Conference on Formal Linguistics (WCCFL)
%C Stanford
%I CSLI
%P 379-394
%! Semantics of Common Noun Phrase Anaphora
%F Nerbonne:1990:SCN


%0 Generic
%A Nerbonne, John
%A Laubsch, Joachim
%D 1990
%T Logics for Meaning Representation
%! Logics for Meaning Representation
%F Nerbonne:1990:LMR
%X Unpublished documentation, Hewlett-Packard Laboratories, Palo Alto, Feb 1990.


%0 Report
%A Nerbonne, John
%A Laubsch, Joachim
%A Diagne, Abdel Kader
%A Oepen, Stefan
%D 1992
%T Natural Language Semantics and Compiler Technology
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-92-55
%! Natural Language Semantics and Compiler Technology
%3 j
%F Nerbonne:1992:NLS


%0 Conference Proceedings
%A Nerbonne, John
%A Laubsch, Joachim
%A Diagne, Abdel Kader
%A Oepen, Stefan
%D 1993
%T Software for Applied Semantics
%E Huang, C.-R.
%E Chang, C. H.
%E Chen, K. J.
%E Lui, C.-H.
%B 1st Pacific Asia Conference on Formal and Computational Linguistics, August 30-31
%C Taipei, Taiwan
%P 35-56
%! Software for Applied Semantics
%2 Nerbonne:1993:SAS.pdf
%3 j
%F Nerbonne:1993:SAS


%0 Book Section
%A Nerbonne, John
%A Netter, Klaus
%A Diagne, Abdel Kader
%A Dickmann, Ludwig
%A Klein, Judith
%D 1991
%T A Diagnostic Tool for German Syntax
%E Neal, J. G.
%E Walter, S. M.
%B Natural Language Processing Systems Workshop: Final Technical Report RL-TR-91-362
%C New York
%I Rome Laboratory
%P 79-96
%! A Diagnostic Tool for German Syntax
%3 j
%F Nerbonne:1991:DTGa


%0 Report
%A Nerbonne, John
%A Netter, Klaus
%A Diagne, Abdel Kader
%A Dickmann, Ludwig
%A Klein, Judith
%D 1991
%T A Diagnostic Tool for German Syntax
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-91-18
%! A Diagnostic Tool for German Syntax
%2 Nerbonne:1991:DTGb.pdf
%3 j
%F Nerbonne:1991:DTGb
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-91-18.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-91-18.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/RR-91-18.ps.Z


%0 Journal Article
%A Nerbonne, John
%A Netter, Klaus
%A Diagne, Abdel Kader
%A Dickmann, Ludwig
%A Klein, Judith
%D 1993
%T A Diagnostic Tool for German Syntax
%B Machine Translation
%V 8
%P 85-107
%! A Diagnostic Tool for German Syntax
%3 j
%F Nerbonne:1993:DTG


%0 Edited Book
%A Nerbonne, John
%A Netter, Klaus
%A Pollard, Carl J.
%D 1994
%T German in Head-Driven Phrase Structure Grammar
%B Lecture Notes Series
%C Stanford
%I CSLI Publications
%V 46
%! German in Head-Driven Phrase Structure Grammar
%3 j
%F Nerbonne:1994:GHDa


%0 Conference Proceedings
%A Nerbonne, John
%A Oepen, Stefan
%A Diagne, Abdel Kader
%A Konrad, Karsten
%A Neis, Ingo
%D 1993
%T NLL - Tools for Meaning Representation
%E Busemann, S.
%E Harbusch, K.
%B DFKI Workshop on Natural Language Systems: Re-Usability and Modularity, October 23
%C Saarbrücken, Germany
%P 43-50
%S DFKI Document
%7 D-93-03
%! NLL - Tools for Meaning Representation
%3 j
%F Nerbonne:1993:NTM


%0 Edited Book
%A Nerbonne, John
%A Pollard, Carl
%A Netter, Klaus
%D 1994
%T German in Head-Driven Phrase Structure Grammar
%B Lecture Notes Series
%C Stanford
%I CSLI Publications
%V 46
%! German in Head-Driven Phrase Structure Grammar
%3 j
%F Nerbonne:1994:GHD


%0 Report
%A Netter, Klaus
%D 1991
%T Clause Union and Verb Raising Phenomena in German
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-91-21
%! Clause Union and Verb Raising Phenomena in German
%3 j
%F Netter:1991:CUVa
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kn91dyana.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kn91dyana.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kn91dyana.ps.Z


%0 Book Section
%A Netter, Klaus
%D 1991
%T Clause Union and Verb Raising Phenomena in German
%B Clause Structure and Word Order Variation in Germanic
%C Edinburgh
%I University of Edinburgh
%V R1.1.B
%S DYANA Deliverable
%! Clause Union and Verb Raising Phenomena in German
%3 j
%F Netter:1991:CUVb


%0 Conference Proceedings
%A Netter, Klaus
%D 1992
%T On Non-Head Non-Movement.
%E Görz, G.
%B 1. Konferenz Verarbeitung natürlicher Sprache (KONVENS '92), 7.-9. Oktober
%C Nürnberg, Germany
%I Springer Verlag
%P 218-227
%S Informatik Aktuell
%! On Non-Head Non-Movement.
%3 j
%F Netter:1992:NHN
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kn92konvens.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kn92konvens.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kn92konvens.ps.Z


%0 Conference Proceedings
%A Netter, Klaus
%D 1993
%T Architecture and Coverage of the DISCO Grammar
%E Busemann, Stephan
%E Harbusch, Karin
%B DFKI Workshop on Natural Language Systems: Re-Usability and Modularity, October 23
%C Saarbrücken, Germany
%I DFKI
%P 1-10
%S DFKI Document
%7 D-93-03
%! Architecture and Coverage of the DISCO Grammar
%2 Netter:1993:ACD.pdf Netter:1994:ACD.ps
%3 j
%F Netter:1993:ACD
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kndisco.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kndisco.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kndisco.ps.Z http://www.dfki.de/dfkibib/publications/docs/Busemann_1992_DWNLSRM.pdf


%0 Journal Article
%A Netter, Klaus
%D 1994
%T Syntax in der Maschinellen Sprachverarbeitung
%B Informationstechnik und Technische Informatik (it+ti)
%C Oldenburg
%V 36
%N 2
%P 6-13
%! Syntax in der Maschinellen Sprachverarbeitung
%3 j
%F Netter:1994:SMS


%0 Book Section
%A Netter, Klaus
%D 1994
%T Towards a Theory of Functional Heads: German Nominal Phrases.
%E Nerbonne, J.
%E Netter, K.
%E Pollard, C.
%B German in Head-Driven Phrase Structure Grammar
%C Stanford
%I CSLI
%V 46
%P 297-340
%S Lecture Note Series
%! Towards a Theory of Functional Heads: German Nominal Phrases.
%3 j
%F Netter:1994:TTF


%0 Thesis
%A Netter, Klaus
%D 1996
%T Functional Categories in an HPSG for German. Saarbrücken Dissertations in Computational Linguistics and Language Technology, Volume 3
%C Saarbrücken
%I Universität des Saarlandes, Computational Linguistics
%! Functional Categories in an HPSG for German. Saarbrücken Dissertations in Computational Linguistics and Language Technology, Volume 3
%3 j
%F Netter:1996:FCH


%0 Conference Proceedings
%A Netter, Klaus
%D 1998
%T POP-EYE and OLIVE - Human Language as the Medium for Cross-Lingual Multimedia Information Retrieval
%B Proceedings of the 2nd International Conference on Quality and Standards in Audiovisual Language Transfer. Languages and the Media
%C Berlin, Germany
%! POP-EYE and OLIVE - Human Language as the Medium for Cross-Lingual Multimedia Information Retrieval
%2 Netter:1998:PEO.pdf Netter:1998:PEO.ps
%3 j
%F Netter:1998:PEO
%X Also published in: The ELRA Newsletter. Vol. 3, 1998.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/langmed-98.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/langmed-98.entry


%0 Conference Proceedings
%A Netter, Klaus
%A Armstrong, Susan
%A Kiss, Tibor
%A Klein, Judith
%A Lehmann, Sabine
%A Milward, David
%A Regnier-Prost, Sylvie
%A Schäler, Reinhard
%A Wegst, Tillmann
%D 1998
%T DiET - Diagnostic and Evaluation Tools for Natural Language Application
%B Proceedings of the 1st International Conference on Language Resources and Evaluation, May 28-30
%C Granada, Spain
%P 573-579
%! DiET - Diagnostic and Evaluation Tools for Natural Language Application
%2 Netter:1998:DDE.pdf Netter:1998:DDE.ps
%3 j
%F Netter:1998:DDE
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/granada-diet.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/granada-diet.entry


%0 Edited Proceedings
%A Netter, Klaus
%A Estival, Dominique
%A Lavelli, Alberto
%A Pianesi, Fabio
%D 1997
%T Computational Environments for Grammar Development and Linguistic Engineering (ACL'97 - EACL'97 Workshop), July 7-12
%C Madrid, Spain
%! Computational Environments for Grammar Development and Linguistic Engineering (ACL'97 - EACL'97 Workshop), July 7-12
%3 j
%F Netter:1997:CEG


%0 Edited Book
%A Netter, K.
%A Haider, H.
%D 1991
%T Representation and Derivation in the Theory of Grammar
%B Studies in Natural Language and Linguistic Theory
%C Dordrecht
%I Kluwer Academic Publishers
%V 22
%! Representation and Derivation in the Theory of Grammar
%3 j
%F Netter:1991:RDT


%0 Edited Proceedings
%A Netter, Klaus
%A Hiemstra, Djoerd
%A de Jong, Franciska
%D 1998
%T Language Technology in Multimedia Information Retrieval. Proceedings of the 14th Twente Workshop on Language Technology (TWLT 14), December 7-8
%C University of Twente, Enschede, The Netherlands
%! Language Technology in Multimedia Information Retrieval. Proceedings of the 14th Twente Workshop on Language Technology (TWLT 14), December 7-8
%3 j
%F Netter:1998:LTM
%U http://parlevink.cs.utwente.nl/Conferences/TWLT14/abstracts.html


%0 Conference Proceedings
%A Netter, Klaus
%A Kasper, Robert
%A Kiefer, Bernd
%A Shanker, Vijay K.
%D 1994
%T HPSG and TAG
%B Proceedings of the 3eme Colloque International sur les Grammaires d'Arbres Adjoints, September
%C Paris, France
%P 77-82
%S (TAG+3) Rapport TALANA
%7 RT-94-01
%! HPSG and TAG
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knh2tparis.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knh2tparis.entry
%3 j
%F Netter:1994:HTa
%X We present a compilation algorithm that translates Head Driven Phrase Structure Grammars into lexicalized feature based Tree Adjoining Grammars. Through this exercise we attempt to gain further insights into the nature of the two theories and to identify correlating concepts. While HPSG has a more elaborated lexicalized and principle-based theory of functor argument structures, TAG provides the means to represent lexical-based structural information more explicitly and to factor out recursion. Our objectives are met by giving clear and simple definitions for projecting structure from the lexicon, for determining "maximal" projections, and for identifying potential auxiliary trees and foot nodes.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knh2tparis.ps.Z


%0 Conference Proceedings
%A Netter, Klaus
%A Kasper, Robert
%A Kiefer, Bernd
%A Vijay-Shanker, Krishnamurti
%D 1994
%T HPSG and TAG
%B 3eme Colloque International sur les Grammaires d'Arbres Adjoints, September
%C Paris, France
%P 77-82
%S (TAG+3) Rapport TALANA
%7 RT-94-01
%! HPSG and TAG
%3 j
%F Netter:1994:HT
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knh2tparis.ps.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knh2tparis.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/knh2tparis.entry


%0 Edited Book
%A Netter, Klaus
%A Reape, Mike
%D 1992
%T Clause Structure and Word Order Variation in Germanic
%B DYANA Deliverable
%C Edinburgh
%I University of Edinburgh
%V R1.1.B
%! Clause Structure and Word Order Variation in Germanic
%3 j
%F Netter:1992:CSW


%0 Report
%A Netter, Klaus
%A Wegst, Tillmann
%D 1999
%T Project Update: DiET - Diagnostic and Evaluation Tools for Natural Language Application
%C Brighton, Sussex
%I European Network in Language and Speech
%P 8-9
%S ELSNews
%7 8.2
%! Project Update: DiET - Diagnostic and Evaluation Tools for Natural Language Application
%2 Netter:1999:PUD.pdf Netter:1999:PUD.ps
%3 j
%F Netter:1999:PUD
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kn-tw-elsnews99.ps ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/kn-tw-elsnews99.pdf


%0 Conference Proceedings
%A Neumann, Günter
%D 1991
%T A Bidirectional Model for Natural Language Processing
%B 5th Conference of the European Chapter of the Association for Computational Linguistics (EACL '91), April
%C Berlin, Germany
%P 245-250
%! A Bidirectional Model for Natural Language Processing
%2 Neumann:1991:BMN.pdf
%3 j
%F Neumann:1991:BMN
%X In this paper* I will argue for a model of grammatical processing that is based on uniform processing and knowledge sources. The main feature of this model is to view parsing and generation as two strongly interleaved tasks performed by a single parametrized deduction process. It will be shown that this view supports flexible and efficient natural language processing.
%U http://acl.ldc.upenn.edu/E/E91/E91-1043.pdf


%0 Conference Proceedings
%A Neumann, Günter
%D 1991
%T Reversibility and Modularity in Natural Language Generation
%B ACL Workshop on Reversible Grammar in Natural Language Processing
%C Berkeley, California, USA
%P 31-39
%! Reversibility and Modularity in Natural Language Generation
%3 j
%F Neumann:1991:RMNa


%0 Report
%A Neumann, Günter
%D 1991
%T Reversibility and Modularity in Natural Language Generation
%C Saarbrücken
%I Universität des Saarlandes
%P 9
%S CLAUS-Report
%7 11
%8 June
%! Reversibility and Modularity in Natural Language Generation
%3 j
%F Neumann:1991:RMNb
%X A thorough-going use of reversible grammars within natural language generation systems has strong implications for the separation into strategic and tactical components. A central goal of this paper is to make plausible that a uniform architecture for grammatical processing will serve as a basis to achieve more flexible and efficient generation systems.


%0 Report
%A Neumann, Günter
%D 1991
%T A Bidirectional Model for Natural Language Processing
%C Saarbrücken
%I Universität des Saarlandes
%P 6
%S CLAUS-Report
%7 7
%8 April
%! A Bidirectional Model for Natural Language Processing
%2 Neumann:1991:BMNb.pdf
%3 j
%F Neumann:1991:BMNb
%X In this paper I will argue for a model of grammatical processing that is based on uniform processing and knowledge sources. The main feature of this model is to view parsing and generation as two strongly interleaved tasks performed by a single parametrized deduction process. It will be shown that this view supports flexible and efficient natural language processing.


%0 Conference Proceedings
%A Neumann, Günter
%D 1993
%T Design Principles of the Disco System
%E de Jong, Franciska
%E Nijholt, Anton
%B Proceedings of the Twente Workshop on Language Technology (TWLT 5). Natural Language Interfaces, June 3-4
%C University of Twente, Enschede, The Netherlands
%! Design Principles of the Disco System
%3 j
%F Neumann:1993:DPD
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/disco-archi.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/disco-archi.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/disco-archi.ps.Z http://www.dfki.de/cl/papers/cl-abstracts.html#disco-archi.abstract


%0 Journal Article
%A Neumann, Günter
%D 1993
%T Grammatikformalismen in der Generierung und ihre Verarbeitung
%B Künstliche Intelligenz
%N Themenheft Generierung
%P 22-30
%! Grammatikformalismen in der Generierung und ihre Verarbeitung
%2 Neumann:1993:GGI.pdf Neumann:1993:GGI.ps
%3 j
%F Neumann:1993:GGI
%U http://www.dfki.de/~neumann/publications/ki-93/ki-93-abstract.html http://www.dfki.de/~neumann/publications/ki-93/gram-gen.ps.gz


%0 Conference Proceedings
%A Neumann, Günter
%D 1993
%T The DISCO Development Shell and its Application in the COSMA System
%E Busemann, Stephan
%E Harbusch, Karin
%B Proceedings of the DFKI Workschop on Natural Languages Systems: Reusability and Modularity, October 23
%C Saarbrücken, Germany
%I DFKI
%P 65-74
%S DFKI Document
%7 D-93-03
%! The DISCO Development Shell and its Application in the COSMA System
%1 http://www.dfki.uni-kl.de/~dfkidok/publications/D/93/03/abstract.html
%2 Neumann:1993:DDS.pdf
%3 j
%F Neumann:1993:DDS
%X This paper describes the Disco DEVELOPMENT SHELL, which serves as a basic tool for the integration of natural language components in the Disco project, and its application in the COSMA system, a Cooperative Schedule Management Agent. Following an object oriented architectural model we introduce a two-step approach, where in the first phase the architecture is developed independently of specific components to be used and of a particular flow of control. In the second phase the "frame system" is instantiated by the integration of existing components as well as by defining the particular flow of control between these components. Because of the object-oriented paradigm it is easy to augment the frame system, which increases the flexibility of the whole system with respect to new applications. The development of the COSMA system will serve as an example of this claim.
%U http://www.dfki.de/dfkibib/publications/docs/Neumann_1992_TDDSACS.pdf http://www.dfki.de/dfkibib/publications/docs/Busemann_1992_DWNLSRM.pdf


%0 Conference Proceedings
%A Neumann, Günter
%D 1994
%T Application of Explanation-Based Learning for Efficient Processing of Constraint-Based Grammars
%B Proceedings of the 10th IEEE Conference on Artificial Intelligence for Applications, March 1-4
%C San Antonio, Texas, USA
%P 208-215
%! Application of Explanation-Based Learning for Efficient Processing of Constraint-Based Grammars
%3 j
%F Neumann:1994:AEB
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ebl.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ebl.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ebl.ps.Z http://www.dfki.de/cl/papers/cl-abstracts.html#ebl.abstract


%0 Thesis
%A Neumann, Günter
%D 1994
%T A Uniform Computational Model for Natural Language Parsing and Generation. Saarbruecken Dissertations in Computational Linguistics and Language Technology. Vol. 1
%C Saarbrücken
%I Universität des Saarlandes, Computational Linguistics
%! A Uniform Computational Model for Natural Language Parsing and Generation. Saarbruecken Dissertations in Computational Linguistics and Language Technology. Vol. 1
%2 Neumann:1994:UCM.pdf Neumann:1994:UCM.ps
%3 j
%F Neumann:1994:UCM
%U http://www.dfki.de/~neumann/publications/new-ps/diss-gn.ps.gz


%0 Report
%A Neumann, Günter
%D 1996
%T Interleaving Natural Language Parsing and Generation Through Uniform Processing
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-96-03
%! Interleaving Natural Language Parsing and Generation Through Uniform Processing
%2 Neumann:1996:INL.pdf Neumann:1996:INL.ps Neumann:1996:INL.dvi
%3 j
%F Neumann:1996:INL
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ai-uta.dvi.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ai-uta.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ai-uta.ps.gz


%0 Conference Proceedings
%A Neumann, Günter
%D 1997
%T Applying Explanation-Based Learning to Control and Speeding-Up Natural Language Generation
%B Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and the 8th Conference of the European Chapter of the Association for Computational Linguistics (ACL/ EACL '97), July 7-12
%C Madrid, Spain
%I Morgan Kaufmann Publishers
%! Applying Explanation-Based Learning to Control and Speeding-Up Natural Language Generation
%2 Neumann:1997:AEB.pdf Neumann:1997:AEB.ps
%3 j
%F Neumann:1997:AEB
%U http://www.dfki.de/~neumann/publications/new-ps/ebl-acl97.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ebl-acl97.entry


%0 Conference Proceedings
%A Neumann, Günter
%D 1997
%T Methoden zur intelligenten Informationsextraktion im Internet
%B Proceedings of the 20th European Congress Fair for Technical Communication ONLINE'97
%C Hamburg, Germany
%P 208-215
%! Methoden zur intelligenten Informationsextraktion im Internet
%2 Neumann:1997:MII.ps
%3 j
%F Neumann:1997:MII
%U http://www.dfki.de/~neumann/publications/new-ps/smes-online97.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/smes-online97.entry


%0 Report
%A Neumann, Günter
%D 1997
%T An On-line Learning Method to Speed-Up Natural Language Processing
%C Saarbrücken
%I DFKI
%S Technical Report
%! An On-line Learning Method to Speed-Up Natural Language Processing
%2 Neumann:1997:LLM.pdf Neumann:1997:LLM.ps
%3 j
%F Neumann:1997:LLM
%U http://www.dfki.de/~neumann/publications/new-ps/incr-ebl.ps.gz


%0 Conference Proceedings
%A Neumann, Günter
%D 1998
%T Automatic Extraction of Stochastic Lexicalized Tree Grammars from Treebanks
%B Proceedings of the 4th Workshop on Tree-Adjoining Grammars and Related Frameworks (TAG+4), August 1-3
%C Philadelphia, USA
%! Automatic Extraction of Stochastic Lexicalized Tree Grammars from Treebanks
%2 Neumann:1998:AES.pdf Neumann:1998:AES.ps
%3 j
%F Neumann:1998:AES
%U http://www.dfki.de/~neumann/publications/new-ps/tag+.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/gn-tag.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/gn-tag.entry


%0 Journal Article
%A Neumann, Günter
%D 1998
%T Interleaving Natural Language Parsing and Generation Through Uniform Processing
%B Artificial Intelligence
%V 99
%P 121-163
%! Interleaving Natural Language Parsing and Generation Through Uniform Processing
%2 Neumann:1998:INL.pdf Neumann:1998:INL.ps
%3 j
%F Neumann:1998:INL
%U http://www.dfki.de/~neumann/publications/new-ps/ai-uta.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/uta.entry


%0 Book Section
%A Neumann, Günter
%D 2000
%T A Uniform Method for Automatically Extracting Stochastic Lexicalized Tree Grammars from Treebanks and HPSG
%E Abeille, A.
%B Building and Using Syntactically Annotated Corpora
%C Dordrecht
%I Kluwer Academic Publishers
%S Language and Speech Series
%! A Uniform Method for Automatically Extracting Stochastic Lexicalized Tree Grammars from Treebanks and HPSG
%2 Neumann:2000:UMA.pdf
%3 j
%F Neumann:2000:UMA
%U http://www.dfki.de/~neumann/publications/new-ps/kluwer-tag+.pdf


%0 Book Section
%A Neumann, Günter
%D 2001
%T Informationsextraktion
%E Klabunde, R.
%B Computerlinguistik und Sprachtechnologie - Eine Einführung
%C Heidelberg
%I Spektrum Akademischer Verlag
%P 448-455
%! Informationsextraktion
%2 Neumann:2001:I.pdf
%3 j
%F Neumann:2001:I
%U http://www.dfki.de/~neumann/publications/new-ps/ie.pdf


%0 Book Section
%A Neumann, Günter
%D 2002
%T Data-driven Approaches to Head-driven Phrase Structure Grammar
%E Bod, Rens 
%E Scha, Remko 
%E Sima'an, Khahil
%B Introduction to Data-oriented Parsing
%C Stanford
%I CSLI Publications
%! Data-driven Approaches to Head-driven Phrase Structure Grammar
%2 Neumann:2002:DDA.pdf
%3 j
%F Neumann:2002:DDA
%X We present HPSG–DOP, a method for automatically extracting a Stochastic Lexicalized Tree Grammar (SLTG) from a HPSG source grammar and a given corpus.1 Processing of a SLTG is performed by a specialized fast parser. The approach has been tested on a large English grammar and has been shown to achieve additional performance increase compared to parsing with a highly tuned HPSG parser. Our approach is simple and transparent. The extracted grammars are declaratively represented and have a high degree of practical applicability.
%U http://www.dfki.de/~neumann/publications/new-ps/hpsg-dop-main.pdf


%0 Book Section
%A Neumann, Günter
%D 2002
%T Programming Languages in Artificial Intelligence
%E Bentley
%E Bidgoli
%B Encyclopedia of Information Systems
%C San Diego
%I Academic Press
%! Programming Languages in Artificial Intelligence
%2 Neumann:2002:PLA.pdf
%3 j
%F Neumann:2002:PLA
%U http://www.dfki.de/~neumann/publications/new-ps/ai-pgr.pdf


%0 Conference Proceedings
%A Neumann, Günter
%A Backofen, Rolf
%A Baur, Judith
%A Becker, Markus
%A Braun, Christian
%D 1997
%T An Information Extraction Core System for Real World German Text Processing
%E Jacobs, P.
%B Proceedings of the 5th Conference on Applied Natural Language Processing (ANLP '97), March 31 - April 3
%C Washington D.C., USA
%I Morgan Kaufmann Publishers
%P 208-215
%! An Information Extraction Core System for Real World German Text Processing
%2 Neumann:1997:IEC.pdf Neumann:1997:IEC.ps
%3 j
%F Neumann:1997:IEC
%U http://www.dfki.de/~neumann/publications/new-ps/smes-anlp97.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/smes-anlp97.entry


%0 Conference Proceedings
%A Neumann, Günter
%A Declerck, Thierry
%D 1999
%T PARADIME Parametrizable Domain-Adaptive Information and Message Extraction
%B Les journées d'Etude de l'ATALA, June 18-19
%C Paris, France
%! PARADIME Parametrizable Domain-Adaptive Information and Message Extraction
%3 j
%F Neumann:1999:PPD


%0 Conference Proceedings
%A Neumann, Günter
%A Declerck, Thierry
%D 2001
%T Domain Adaptive Information Extraction
%B Proceedings of the International Workshop on Innovative Language Technology and Chinese Information Processing (ILT & CIP '01), April
%C Shanghai
%! Domain Adaptive Information Extraction
%2 Neumann:2001:DAI.pdf Neumann:2001:DAI.ps
%3 j
%F Neumann:2001:DAI
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/smes-shanghai2001.ps.gz


%0 Conference Proceedings
%A Neumann, Günter
%A Finkler, Wolfgang
%D 1990
%T A Head-Driven Approach to Incremental and Parallel Generation of Syntactic Structures
%E Karlgren, Hans
%B 13th International Conference on Computational Linguistics (COLING '90), August 19-25
%C Helsinki, Finland
%V 2
%P 288-293
%! A Head-Driven Approach to Incremental and Parallel Generation of Syntactic Structures
%1 http://www.dfki.uni-kl.de/~dfkidok/publications/RR/91/07/abstract.html
%3 j
%F Neumann:1990:HDAa
%X This paper describes the construction of syntactic structures within an incremental multi-level and parallel generation system. Incremental and parallel generation imposes special requirements upon syntactic description and processing. A head-driven grammar represented in a unification-based formalism is introduced which satisfies these demands. Furthermore the basic mechanisms for the parallel processing of syntactic segments are presented.


%0 Report
%A Neumann, Günter
%A Finkler, Wolfgang
%D 1990
%T A Head-Driven Approach to Incremental and Parallel Generation of Syntactic Structures
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 2
%8 August
%! A Head-Driven Approach to Incremental and Parallel Generation of Syntactic Structures
%3 j
%F Neumann:1990:HDAb
%X This paper describes the construction of syntactic structures within an incremental multi-level and parallel generation system. Incremental and parallel generation imposes special requirements upon syntactic description and processing. A head-driven grammar represented in a unification-based formalism is introduced which satisfies these demands. Furthermore the basic mechanisms for the parallel processing of syntactic segments are presented.


%0 Report
%A Neumann, Günter
%A Finkler, Wolfgang
%D 1991
%T A Head-Driven Approach to Incremental and Parallel Generation of Syntactic Structures
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-91-07
%! A Head-Driven Approach to Incremental and Parallel Generation of Syntactic Structures
%3 j
%F Neumann:1991:HDA
%X This paper describes the construction of syntactic structures within an incremental multi-level and parallel generation system. Incremental and parallel generation imposes special requirements upon syntactic description and processing. A head-driven grammar represented in a unification-based formalism is introduced which satisfies these demands. Furthermore the basic mechanisms for the parallel processing of syntactic segments are presented.


%0 Report
%A Neumann, Günter
%A Flickinger, Dan
%D 1999
%T Learning Stochastic Lexicalized Tree Grammars from HPSG
%C Saarbrücken
%I DFKI
%S Technical Report
%! Learning Stochastic Lexicalized Tree Grammars from HPSG
%2 Neumann:1999:LSL.pdf Neumann:1999:LSL.ps
%3 j
%F Neumann:1999:LSL
%U http://www.dfki.de/~neumann/publications/new-ps/sltg.ps.gz


%0 Conference Proceedings
%A Neumann, Günter
%A Flickinger, Dan
%D 2002
%T HPSG-DOP: Data-Oriented Parsing with HPSG
%B Proceedings of the 9th International Conference on HPSG (HPSG-2002), August 8-9
%C Kyung Hee University, Seoul
%! HPSG-DOP: Data-Oriented Parsing with HPSG
%2 Neumann:2002:HDD.pdf
%3 j
%F Neumann:2002:HDD
%U http://www.dfki.de/~neumann/publications/new-ps/hpsg-dop-short.pdf


%0 Journal Article
%A Neumann, Günter
%A Piskorski, Jakub
%D 2002
%T A Shallow Text Processing Core Engine
%B Journal of Computational Intelligence
%V 18
%N 3
%! A Shallow Text Processing Core Engine
%2 Neumann:2002:STP.pdf
%3 j
%F Neumann:2002:STP
%O to appear
%U http://www.dfki.de/~neumann/publications/new-ps/comp-intell.pdf


%0 Conference Proceedings
%A Neumann, Günter
%A Piskorski, Jakub
%A Braun, Christian
%D 2000
%T An Intelligent Text Extraction and Navigation System
%E Nirenburg, Sergei
%E Appelt, Douglas
%E Ciravegna, Fabio
%E Dale, Robert
%B Proceedings of the 6th Applied Natural Language Processing Conference (ANLP'00). 1st Meeting of the North American Chapter of the Association for Computational Linguistics (NAACL'00), April 29 - May 4
%C Seattle, Washington, USA
%I ACL
%P 239-246
%! An Intelligent Text Extraction and Navigation System
%2 Neumann:2000:ITE.pdf Neumann:2000:ITE.ps
%3 j
%F Neumann:2000:ITE
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/final-acl2000.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/final-acl2000.entry


%0 Conference Proceedings
%A Neumann, Günter
%A Schäfer, Ulrich
%D 2002
%T Whiteboard - Eine XML-basierte Architektur für die Analyse natürlichsprachlicher Texte
%E Jänichen, Stefan
%B Proceedings of Online 2002, 25th European Congress Fair for Technical Communication Düsseldorf
%C Düsseldorf, Deutschland
%I Online GmbH Kongresse und Messen für technische Kommunikation
%V C
%P 635.01-635.12
%! Whiteboard - Eine XML-basierte Architektur für die Analyse natürlichsprachlicher Texte
%2 Neumann:2002:WXB.pdf
%3 j
%F Neumann:2002:WXB
%U http://www.dfki.de/~neumann/publications/new-ps/Whiteboard-DFKI-online2002.pdf


%0 Conference Proceedings
%A Neumann, Günter
%A Schmeier, Sven
%D 1999
%T Combining Shallow Text Processing and Machine Learning in Real World Applications
%B Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI '99). Workshop on Machine Learning for Information Filtering, July 31 - August 6
%C Stockholm, Sweden
%! Combining Shallow Text Processing and Machine Learning in Real World Applications
%2 Neumann:1999:CST.pdf
%3 j
%F Neumann:1999:CST
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/SchmeierNeumann99.pdf http://www.dfki.de/~neumann/publications/new-ps/ijcai99-ws.pdf


%0 Journal Article
%A Neumann, Günter
%A Schmeier, Sven
%D 2002
%T Shallow Natural Language Technology and Text Mining
%B Künstliche Intelligenz. The German Artificial Intelligence Journal
%! Shallow Natural Language Technology and Text Mining
%3 j
%F Neumann:2002:SNL
%O to appear
%U http://www.dfki.de/~neumann/publications/new-ps/ki-tm-final.rtf


%0 Report
%A Neumann, Günter
%A van Noord, Gertjan
%D 1991
%T Self-Monitoring with Reversible Grammars
%C Saarbrücken
%I Universität des Saarlandes
%P 7
%8 October
%! Self-Monitoring with Reversible Grammars
%2 Neumann:1991:SMR.pdf
%3 j
%F Neumann:1991:SMR
%X We describe a method and its implementation for self-monitoring during natural language generation. In situations of communication where the generation of ambiguous utterances should be avoided our method is able to compute an unambiguous utterance for a given semantic input. The proposed method is based on a very strict integration of parsing and generation. During the monitored generation step, a previously generated (possibly) ambiguous utterance is parsed and the obtained alternative derivation trees are used as a "guide" for re-generating the utterance. To achieve such an integrated approach the underlying grammar should be reversible.


%0 Conference Proceedings
%A Neumann, Günter
%A van Noord, Gertjan
%D 1992
%T Self-Monitoring with Reversible Grammars
%E ICCL
%B Proceedings of the 14th International Conference on Computational Linguistics (COLING '92), July 23-28
%C Nantes, France
%V 2
%P 700-706
%! Self-Monitoring with Reversible Grammars
%2 Neumann:1992:SMR.pdf Neumann:1992:SMR.ps
%3 j
%F Neumann:1992:SMR
%U http://www.dfki.de/~neumann/publications/new-ps/monitor.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/monitor.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/monitor.entry


%0 Book Section
%A Neumann, Günter
%A van Noord, Gertjan
%D 1994
%T Reversibility and Self-Monitoring in Natural Language Generation
%E Strzalkowski, Tomek
%B Reversible Grammar in Natural Language Processing
%C Boston
%I Kluwer Academic Publishers
%P 59-96
%! Reversibility and Self-Monitoring in Natural Language Generation
%3 j
%F Neumann:1994:RSM
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/monitor.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/revgram.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/revgram.ps.Z http://www.dfki.de/cl/papers/cl-abstracts.html#revgram.abstract


%0 Conference Proceedings
%A Ng, Ka Boon
%A Choi, Chiu Wo
%A Henz, Martin
%A Müller, Tobias
%D 2000
%T GIFT: A Generic Interface for Reusing Filtering Algorithms
%E Beldiceanu, N.
%E Harvey, W.
%E Henz, M.
%E Laburthe, F.
%E Monfroy, E.
%E Müller, T.
%E Perron, L.
%E Schulte, C.
%B Workshop on Techniques for Implementing Constraint Programming Systems (TRICS), September
%C Singapore
%P 86-100
%! GIFT: A Generic Interface for Reusing Filtering Algorithms
%2 Ng:2000:GGI.pdf Ng:2000:GGI.ps
%F Ng:2000:GGI
%X Many different constraint programming (CP) systems exist today. For each CP system, there are many different filtering algorithms. Researchers and developers usually choose a CP system of their choice to implement their filtering algorithms. To use these filtering algorithms on another system, we have to port the code over. This situation is clearly not desirable. In this paper, we propose a generic C++ interface for writing filtering algorithms called GIFT (Generic Interface for FilTers). By providing the generic interface on different CP systems, we can reuse any filtering algorithms easily. A case study on reusing scheduling filtering algorithms between Mozart and Figaro further highlights the feasibility of this approach.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/KaboonChoiHenzMueller00a.ps.gz


%0 Report
%A Niehren, Joachim
%D 1995
%T Functional Computation as Concurrent Computation
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-95-14
%! Functional Computation as Concurrent Computation
%F Niehren:1995:FCC


%0 Conference Proceedings
%A Niehren, Joachim
%D 1996
%T Functional Computation as Concurrent Computation
%B 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '96), January 21-24
%C St. Petersburg Beach, Florida, USA
%I ACM Press
%P 333-343
%! Functional Computation as Concurrent Computation
%2 Niehren:1996:FCC.pdf Niehren:1996:FCC.ps
%F Niehren:1996:FCC
%X We investigate functional computation as a special form of concurrent computation. As formal basis, we use a uniformly confluent core of the pi-calculus, which is also contained in models of higher-order concurrent constraint programming. We embed the call-by-need and the call-by-value lambda-calculus into the pi-calculus. We prove that call-by-need complexity is dominated by call-by-value complexity. In contrast to the recently proposed call-by-need lambda-calculus, our concurrent call-by-need model incorporates mutual recursion and can be extended to cyclic data structures by means of constraints.
%O longer version appeared as DFKI Research Report RR-95-14
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/POPL96.ps.gz


%0 Report
%A Niehren, Joachim
%D 1999
%T Uniform Confluence in Concurrent Computation
%C Saarbrücken
%I Universität des Saarlandes, Programming Systems Lab
%S Technical Report
%! Uniform Confluence in Concurrent Computation
%2 Niehren:1999:UCC.pdf Niehren:1999:UCC.ps
%F Niehren:1999:UCC
%X Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the successful actor is indeterministic. As a consequence, the execution of a concurrent program may be nonconfluent. Even worse, most observables (termination, computational result, and time complexity) typically depend on the scheduling of actors created during program execution. This property contrast concurrent programs from purely functional programs. A functional program is uniformly confluent in the sense that all its possible executions coincide modulo reordering of execution steps. In this paper, we investigate concurrent programs that are uniformly confluent and their relation to eager and lazy functional programs. We study uniform confluence in concurrent computation within the applicative core of the $\pi$-calculus which is widely used in different models of concurrent programming (with interleaving semantics). In particular, the applicative core of the $\pi$-calculus serves as a kernel in foundations of concurrent constraint programming with first-class procedures (as provided by the programming language Oz). We model eager functional programming in the $\lambda$-calculus with weak call-by-value reduction and lazy functional programming in the call-by-need amming in the $\lambda$-calculus with standard reduction. As a measure of time complexity, we count application steps. We encode the $\lambda$-calculus with both above reduction strategies into the applicative core of the $\pi$-calculus and show that time complexity is preserved. Our correctness proofs employs a new technique based on uniform confluence and simulations. The strength of our technique is illustrated by proving a folk theorem, namely that the call-by-need complexity of a functional program is smaller than its call-by-value complexity.
%U http://www.ps.uni-sb.de/Papers/abstracts/Uniform:2000.html ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Uniform-97.ps.gz


%0 Journal Article
%A Niehren, Joachim
%D 2000
%T Uniform Confluence in Concurrent Computation
%B Journal of Functional Programming
%V 10
%N 3
%P 1-47
%! Uniform Confluence in Concurrent Computation
%2 Niehren:2000:UCC.pdf Niehren:2000:UCC.ps
%F Niehren:2000:UCC
%X Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the successful actor is indeterministic. As a consequence, the execution of a concurrent program may be nonconfluent. Even worse, most observables (termination, computational result, and time complexity) typically depend on the scheduling of actors created during program execution. This property contrast concurrent programs from purely functional programs. A functional program is uniformly confluent in the sense that all its possible executions coincide modulo reordering of execution steps. In this paper, we investigate concurrent programs that are uniformly confluent and their relation to eager and lazy functional programs. We study uniform confluence in concurrent computation within the applicative core of the $\pi$-calculus which is widely used in different models of concurrent programming (with interleaving semantics). In particular, the applicative core of the $\pi$-calculus serves as a kernel in foundations of concurrent constraint programming with first-class procedures (as provided by the programming language Oz). We model eager functional programming in the $\lambda$-calculus with weak call-by-value reduction and lazy functional programming in the call-by-need $\lambda$-calculus with standard reduction. As a measure of time complexity, we count application steps. We encode the $\lambda$-calculus with both above reduction strategies into the applicative core of the $\pi$-calculus and show that time complexity is preserved. Our correctness proofs employs a new technique based on uniform confluence and simulations. The strength of our technique is illustrated by proving a folk theorem, namely that the call-by-need complexity of a functional program is smaller than its call-by-value complexity. A shortened version of this report will appear in the Journal of Functional Programming. Due to lack of space, this journal version does not contain the encoding of the $\delta$-calculus (introduced in the paper) into the applicative core of the $\pi$-calculus (given here), which is of its own interest.
%U www.ps.uni-sb.de/Papers/abstracts/Uniform:99.html ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Uniform:2000.ps.gz


%0 Conference Proceedings
%A Niehren, Joachim
%A Koller, Alexander
%D 1998
%T Dominance Constraints in Context Unification
%E Moortgat, M.
%B 3rd International Conference on Logical Aspects of Computational Linguistics (LACL '98), December 14-16
%C Grenoble, France
%I Springer
%P 199-218
%S Lecture Notes in Artificial Intelligence
%7 2014
%! Dominance Constraints in Context Unification
%2 Niehren:1998:DCC.pdf Niehren:1998:DCC.ps
%F Niehren:1998:DCC
%X Tree descriptions based on dominance constraints are popular in several areas of computational linguistics including syntax, semantics, and discourse. Tree descriptions in the language of context unification have attracted some interest in unification and rewriting theory. Recently, dominance constraints and context unification have both been used in different underspecified approaches to the semantics of scope, parallelism, and their interaction. This raises the question whether both description languages are related. In this paper, we show for a first time that dominance constraints can be expressed in context unification. We also prove that dominance constraints extended with parallelism constraints are equal in expressive power to context unification.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Dominance-98.ps.gz


%0 Conference Proceedings
%A Niehren, Joachim
%A Müller, Martin
%A Podelski, Andreas
%D 1997
%T Inclusion Constraints over Non-Empty Sets of Trees
%E Bidoit, M.
%E Dauchet, M.
%B 7th International Joint Conference CAAP/ FASE. Theory and Practice of Software Development (TAPSOFT '97), April 14-18
%C Lille, France
%I Springer
%P 217-231
%S Lecture Notes in Computer Science
%7 1214
%! Inclusion Constraints over Non-Empty Sets of Trees
%2 Niehren:1997:ICN.pdf Niehren:1997:ICN.ps
%F Niehren:1997:ICN
%X We present a new constraint system called Ines. Its constraints are conjunctions of inclusions $t_1\subseteq t_2$ between first-order terms (without set operators) which are interpreted over non-empty sets of trees. The existing systems of set constraints can express Ines constraints only if they include negation. Their satisfiability problem is NEXPTIME-complete. We present an incremental algorithm that solves the satisfiability problem of Ines constraints in cubic time. We intend to apply Ines constraints for type analysis for a concurrent constraint programming language.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/ines97.ps.gz


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


%0 Conference Proceedings
%A Niehren, Joachim
%A Müller, Martin
%A Talbot, Jean-Marc
%D 1999
%T Entailment of Atomic Set Constraints is PSPACE-Complete
%B 14th Annual IEEE Symposium on Logic in Computer Science (LICS '99), July 2-5
%C Trento, Italy
%I IEEE Press
%P 285-294
%! Entailment of Atomic Set Constraints is PSPACE-Complete
%2 Niehren:1999:EAS.pdf Niehren:1999:EAS.ps
%F Niehren:1999:EAS
%X The complexity of set constraints has been extensively studied over the last years and was often found quite high. At the lower end of expressiveness, there are atomic set constraints which are conjunctions of inclusions t1 $\subseteq$ t2 between first-order terms without set operators. It is well-known that satisfiability of atomic set constraints can be tested in cubic time. Also, entailment of atomic set constraints has been claimed decidable in polynomial time. We refute this claim. We show that entailment between atomic set constraints can express validity of quantified boolean formulas and is thus PSPACE hard. For infinite signatures, we also present a PSPACE-algorithm for solving atomic set constraints with negation. This proves that entailment of atomic set constraints is PSPACE-complete for infinite signatures. In case of finite signatures, this problem is even DEXPTIME-hard.
%U www.ps.uni-sb.de/Papers/abstracts/atomic:98.html ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/atomic-lics-99.ps.gz


%0 Conference Proceedings
%A Niehren, Joachim
%A Pinkal, Manfred
%A Ruhrberg, Peter
%D 1997
%T On Equality up-to Constraints over Finite Trees, Context Unification and One-Step Rewriting
%E McCune, W.
%B 14th International Conference on Automated Deduction (CADE 14), July 13-17
%C Townsville, Australia
%I Springer
%P 34-48
%S Lecture Notes in Computer Science
%7 1249
%! On Equality up-to Constraints over Finite Trees, Context Unification and One-Step Rewriting
%2 Niehren:1997:ECF.pdf Niehren:1997:ECF.ps
%F Niehren:1997:ECF
%X We introduce equality up-to constraints over finite trees and investigate their expressiveness. Equality up-to constraints subsume equality constraints, subtree constraints, and one-step rewriting constraints. We establish a close correspondence between equality up-to constraints over finite trees and context unification. Context unification subsumes string unification and is subsumed by linear second-order unification. We obtain the following three new results. The satisfiability problem of equality up-to constraints is equivalent to context unification, which is an open problem. The positive existential fragment of the theory of one-step rewriting is decidable. The $\exists^*\forall^*\exists^*$ fragment of the theory of context unification is undecidable.
%U Full version available from http://www.ps.uni-sb.de/Papers/abstracts/fullContext.html


%0 Conference Proceedings
%A Niehren, Joachim
%A Pinkal, Manfred
%A Ruhrberg, Peter
%D 1997
%T A Uniform Approach to Underspecification and Parallelism
%E Cohen, P. R. 
%E Wahlster, W.
%B 35th Annual Meeting of the Association of Computational Linguistics (ACL), July 7-12
%C Madrid, Spain
%I ACL
%P 410-417
%! A Uniform Approach to Underspecification and Parallelism
%2 Niehren:1997:UAU.pdf Niehren:1997:UAU.ps
%F Niehren:1997:UAU
%X We propose a unified framework in which to treat semantic underspecification and parallelism phenomena in discourse. The framework employs a constraint language that can express equality and subtree relations between finite trees. In addition, our constraint language can express the equality up-to relation over trees which captures parallelism between them. The constraints are solved by context unification. We demonstrate the use of our framework at the examples of quantifier scope, ellipses, and their interaction.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Ellipses.ps.gz


%0 Report
%A Niehren, Joachim
%A Priesnitz, Tim
%D 1999
%T Characterizing Subtype Entailment in Automata Theory
%C Saarbrücken
%I Universität des Saarlandes
%S Technical Report
%! Characterizing Subtype Entailment in Automata Theory
%2 Niehren:1999:CSE.pdf Niehren:1999:CSE.ps
%F Niehren:1999:CSE
%X Subtype entailment is the entailment problem of subtype constraints for some type language. Understanding the algorithmic properties of subtype entailment is relevant to several subtype inference systems. For simple types, subtype entailment is coNP complete; when extended with recursive types it becomes PSPACE complete. Adding the least and greatest type renders subtyping non-structural. Whether non-structural subtype entailment is decidable is a prominent open problem. We characterize subtype entailment in automata theory. This yields a uniform proof method by which all known complexity results on subtype entailment in the literature can be derived. The main contribution of the paper is an equivalent characterization of non-structural subtype entailment in automata theory (by so called P-automata). On the one hand side, our characterization implies that several variants of non-structural subtype entailment are polynomial time equivalent (with or without contravariant function types or recursive types). This robustness result is new and nontrivial. On the other hand side, we believe that our characterization contributes an important and necessary step towards answering the open question on decidability of non-structural subtype entailment.
%U http://www.ps.uni-sb.de/Papers/abstracts/pauto.html ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/pauto.ps.gz


%0 Conference Proceedings
%A Niehren, Joachim
%A Priesnitz, Tim
%D 1999
%T Entailment of Non-Structural Subtype Constraints
%B Asian Computing Science Conference, December 10-12
%C Phuket, Thailand
%I Springer
%P 251-265
%S Lecture Notes in Computer Science
%7 1742
%! Entailment of Non-Structural Subtype Constraints
%2 Niehren:1999:ENS.pdf Niehren:1999:ENS.ps
%F Niehren:1999:ENS
%X Entailment of subtype constraints was introduced for constraint simplification in subtype inference systems. Designing an efficient algorithm for subtype entailment turned out to be surprisingly difficult. The situation was clarified by Rehof and Henglein who proved entailment of structural subtype constraints to be coNP-complete for simple types and PSPACE-complete for recursive types. For entailment of non-structural subtype constraints of both simple and recursive types they proved PSPACE-hardness and conjectured PSPACE-completeness but failed in finding a complete algorithm. In this paper, we investigate the source of complications and isolate a natural subproblem of non-structural subtype entailment that we prove PSPACE-complete. We conjecture (but this is left open) that the presented approach can be extended to the general case.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/SubTypeEntailment:99.ps.gz


%0 Journal Article
%A Niehren, Joachim
%A Treinen, Ralf
%A Tison, Sophie
%D 2000
%T On Rewrite Constraints and Context Unification
%B Information Processing Letters
%V 74
%N 1-2
%P 35-40
%! On Rewrite Constraints and Context Unification
%2 Niehren:2000:RCC.pdf Niehren:2000:RCC.ps
%F Niehren:2000:RCC
%X We show that stratified context unification, which is one of the most expressive fragments of context unification known to be decidable, is equivalent to the satisfiability problem of slightly generalized rewriting constraints.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/rewrite-context.ps.gz


%0 Generic
%A Oepen, Stefan
%D 1992
%T Compiling NLL into the COSMA internal representation
%! Compiling NLL into the COSMA internal representation
%3 j
%F Oepen:1992:CNC
%X Unpublished Manuscript


%0 Master's Thesis
%A Oepen, Stefan
%D 1993
%T German Nominal Syntax in HPSG. On Syntactic Categories and Syntagmatic Relations
%B Germanistik
%C Berlin
%I Freie Universität Berlin
%! German Nominal Syntax in HPSG. On Syntactic Categories and Syntagmatic Relations
%F Oepen:1993:GNS


%0 Report
%A Oepen, Stefan
%D 1994
%T German Nominal Syntax in HPSG: On Syntactic Categories and Syntagmatic Relations
%C Saarbrücken
%I DFKI
%S DFKI Document
%7 D-94-15
%! German Nominal Syntax in HPSG: On Syntactic Categories and Syntagmatic Relations
%2 Oepen:1994:GNS.pdf Oepen:1994:GNS.ps
%F Oepen:1994:GNS
%U ftp://ftp.dfki.uni-kl.de/pub/Publications/Documents/1994/D-94-15.ps.gz


%0 Conference Proceedings
%A Oepen, Stephan
%A Bender, Emily M.
%A Callmeier, Ulrich
%A Flickinger, Dan
%A Siegel, Melanie
%D 2002
%T Parallel Distributed Grammar Engineering for Practical Applications
%B Proceedings of the 19th International Conference on Computational Linguistics
%C Taipei, Taiwan
%! Parallel Distributed Grammar Engineering for Practical Applications
%2 Oepen:2002:PDG.pdf
%F Oepen:2002:PDG
%X Based on a detailed case study of parallel grammar development distributed across two sites, we review some of the requirements for regression testing in grammar engineering, summarize our approach to systematic competence and performance profiling, and discuss our experience with grammar development for a commercial application. If possible, the workshop presentation will be organized around a software demonstration.
%U http://www-csli.stanford.edu/~bender/papers/gee13.pdf


%0 Conference Proceedings
%A Oepen, Stefan
%A Callmeier, Ulrich
%D 2000
%T Measure for Measure: Parser Cross-Fertilization. Towards Increased Component Comparability and Exchange
%B Proceedings of the 6th International Workshop on Parsing Technology (IWPT '00), February 23-25
%C Trento, Italy
%P 183-194
%! Measure for Measure: Parser Cross-Fertilization. Towards Increased Component Comparability and Exchange
%2 Oepen:2000:MMP.pdf Oepen:2000:MMP.ps
%3 j
%F Oepen:2000:MMP
%X Over the past few years significant progress was accomplished in efficient processing with wide-coverage HPSG grammars. HPSG-based parsing systems are now available that can process medium-complexity sentences (of ten to twenty words, say) in average parse times equivalent to real (i.e. human reading) time. A large number of engineering improvements in current HPSG systems were achieved through collaboration of multiple research centers and mutual exchange of experience, encoding techniques, algorithms, and even pieces of software. 
This article presents an approach to grammar and system engineering, termed competence & performance profiling, that makes systematic experimentation and the precise empirical study of system properties a focal point in development. Adapting the profiling metaphor familiar from software engineering to constraint-based grammars and parsers, enables developers to maintain an accurate record of system evolution, identify grammar and system deficiencies quickly, and compare to earlier versions or between different systems. 
We discuss a number of exemplary problems that motivate the experimental approach, and apply the empirical methodology in a fairly detailed discussion of what was achieved during a development period of three years. Given the collaborative nature in setup, the empirical results we present involve research and achievements of a large group of people.
%U http://www.coli.uni-sb.de/itsdb/publications/fertilization.ps.gz http://www.coli.uni-sb.de/~uc/pubs/iwpt00.pdf


%0 Conference Proceedings
%A Oepen, Stefan
%A Carroll, John
%D 2000
%T Ambiguity Packing in Constraint-Based Parsing - Practical Results
%B 1st Meeting of the North American Chapter of the Association of Computational Linguistics (NAACL '00), April 29 - May 3
%C Seattle, Washington, USA
%P 162-169
%! Ambiguity Packing in Constraint-Based Parsing - Practical Results
%2 Oepen:2000:APC.pdf
%F Oepen:2000:APC


%0 Journal Article
%A Oepen, Stefan
%A Carroll, John
%D 2000
%T Parser Engineering and Performance Profiling
%B Journal of Natural Language Engineering
%V 6
%N 1
%P 81-98
%! Parser Engineering and Performance Profiling
%F Oepen:2000:PEP


%0 Journal Article
%A Oepen, Stefan
%A Flickinger, Dan
%D 1998
%T Towards Systematic Grammar Profiling. Test Suite Technology Ten Years After
%B Journal of Computer Speech and Language
%V 12
%N 4
%P 411-436
%! Towards Systematic Grammar Profiling. Test Suite Technology Ten Years After
%2 Oepen:1998:TSG.pdf
%F Oepen:1998:TSG


%0 Edited Book
%A Oepen, Stephan
%A Flickinger, Dan
%A Tsujii, Jun-ichi
%A Uszkoreit, Hans
%D 2002
%T Collaborative Language Engineering. A Case Study in Efficient Grammar-based Processing
%B CSLI Lecture Notes
%C Stanford
%I CSLI Publications
%P 300
%! Collaborative Language Engineering. A Case Study in Efficient Grammar-based Processing
%3 j
%F Oepen:2002:CLE
%X Following high hopes and subsequent disillusionment in the late 1980s, the past decade of work in language engineering has seen a dramatic increase in the power and sophistication of statistical approaches to natural language processing, along with a growing recognition that these methods alone cannot meet the full range of demands for applications of NLP. While statistical methods, often described as 'shallow' processing techniques, can bring real advantages in robustness and efficiency, they do not provide the precise, reliable representations of meaning which more conventional symbolic grammars can supply for natural language. A consistent, fine-grained mapping between form and meaning is of critical importance in some NLP applications, including machine translation, speech prosthesis, and automated email response. Recent advances in grammar development and processing implementations offer hope of meeting these demands for precision. 

This volume provides an update on the state of the art in the development and application of broad-coverage declarative grammars built on sound linguistic foundations -- the 'deep' processing paradigm -- and presents several aspects of an international research effort to produce comprehensive, re-usable grammars and efficient technology for parsing and generating with such grammars.


%0 Report
%A Oepen, Stefan
%A Fouvry, Frederik
%A Netter, Klaus
%A Fettig, Tom
%A Oberhauser, Fred
%D 1996
%T TSNLP User Manual. Volume 2: Core Test Suite Technology
%C Saarbrücken
%I DFKI
%S Technical Report
%! TSNLP User Manual. Volume 2: Core Test Suite Technology
%2 Oepen:1996:TUM.pdf Oepen:1996:TUM.ps
%3 j
%F Oepen:1996:TUM
%U ftp://ftp.coli.uni-sb.de/tsnlp/manual/volume2.ps.gz


%0 Conference Proceedings
%A Oepen, Stefan
%A Netter, Klaus
%D 1995
%T TSNLP - Test Suites for Natural Language Processing
%B Proceedings of the Conference on Linguistic Databases, March 23-24
%C Groningen, The Netherlands
%! TSNLP - Test Suites for Natural Language Processing
%2 Oepen:1995:TTS.pdf Oepen:1995:TTS.ps
%3 j
%F Oepen:1995:TTS
%U http://clwww.essex.ac.uk/group/projects/tsnlp/papers/tsnlp-groningen95.ps.gz


%0 Book Section
%A Oepen, Stefan
%A Netter, Klaus
%A Klein, Judith
%D 1998
%T TSNLP - Test Suites for Natural Language Processing
%E Nerbonne, John
%B Linguistic Databases
%C Stanford
%I CSLI Publications
%V 77
%P 13-36
%S CSLI Lecture Notes
%! TSNLP - Test Suites for Natural Language Processing
%2 Oepen:1998:TTS.pdf Oepen:1998:TTS.ps
%3 j
%F Oepen:1998:TTS
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ling-db98.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ling-db98.entry


%0 Report
%A Oepen, Stefan
%A Sablayrolles, Pierre
%D 1992
%T COSMA Internal Representation Language
%C Saarbrücken
%S Technical Notes
%! COSMA Internal Representation Language
%3 j
%F Oepen:1992:CIR


%0 Conference Proceedings
%A Oliva, Karel
%D 1990
%T Simple Parser for an HPSG-Style Grammar Implemented in Prolog
%E Karlgren, H.
%B 13th International Conference on Computational Linguistics (COLING '90), August 20-25
%C Helsinki, Finland
%V 3
%P 434-437
%! Simple Parser for an HPSG-Style Grammar Implemented in Prolog
%F Oliva:1990:SPH


%0 Report
%A Oliva, Karel
%D 1991
%T On Cases of "Fixed" Word Order in a "Free" Word Order Language
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 14
%8 November
%! On Cases of "Fixed" Word Order in a "Free" Word Order Language
%F Oliva:1991:CFW
%X The main stress of this paper will be put on description and explanation of certain phenomena concerning the "crossing dependencies" ("non-projective" constructions), but some more general implications of the proposals contained will be mentioned as well. To this end, two recent approaches to the problem will be reviewed and compared, which comparison creates actually the very core of the paper. 

The first of the appraches to description of crossing dependencies is presented in the paper "On Head Non-Movement" by Pollard. This approach tries to implant the "crossing" into the (syntactic) structure. To achieve this goal, it uses means resulting in changing the intuitive subcategorization requirements of words and phrases involved - actually a non-transformational analog of "raising". 

The second approach, put forward in the paper by Reape "A Theory of Word Order And Discontinuous Constituency in West Continental Germanic", keeps the immediate dominance relations (expressing subcategorization, among other) intact, and aims at describing the "crossing" phenomena by means of non-concatenative phonology. 

Unsurprisingly, it can be shown that, in the general case, neither of them is to be considered satisfactory alone, and that only a reasonable combination of the two can be hoped to cover the full range of data. Nevertheless, one of the approaches will be shown to be superior to the other as to description of their syntactically interesting part. Later some refinements and changes of this approach will be proposed (together with their motivations), with the aim of making the theory fit better the empirical data. 

The sketched approach is illustrated on certain constructions from German and Czech.


%0 Conference Proceedings
%A Oliva, Karel
%D 1992
%T The Proper Treatment of Word Order in HPSG
%E ICCL
%B 14th International Conference on Computational Linguistics (COLING '92), August 23-28
%C Nantes, France
%P 184-190
%! The Proper Treatment of Word Order in HPSG
%F Oliva:1992:PTW


%0 Report
%A Oliva, Karel
%D 1992
%T Expressing Linguistic Knowledge in STUF'91 (manual of the formalism)
%I IBM
%S IWBS Report
%7 206
%! Expressing Linguistic Knowledge in STUF'91 (manual of the formalism)
%F Oliva:1992:ELK


%0 Report
%A Oliva, Karel
%D 1992
%T Word Order Constraints in Binary Branching Syntactic Structures
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 20
%8 February
%! Word Order Constraints in Binary Branching Syntactic Structures
%F Oliva:1992:WOC
%X This paper describes a possibility of expressing ordering constraints among non-sister constituents in binary branching syntactic structures on a local basis, supported by viewing the binary branching structure as a list (rather than a tree) of constituents within HPSG-style grammars. The core idea of such a description of ordering is constituted by creating a type hierarchy for lists. The possibilities of expressing different approaches to word order in the framework are briefly discussed, exemplified and compared to other methods.


%0 Report
%A Oliva, Karel
%D 1993
%T String Processing and Text-to-Tree(s) Transformation Tools (manual of the formalism)
%C Saarbrücken
%I Universität des Saarlandes
%S Report of the Project LATESLAV
%! String Processing and Text-to-Tree(s) Transformation Tools (manual of the formalism)
%F Oliva:1993:SPT


%0 Conference Proceedings
%A Oliva, Karel
%D 1994
%T HPSG Lexicon without Lexical Rules
%E ACL
%B 15th International Conference on Computational Linguistics (COLING '94), August 5-9
%C Kyoto, Japan
%V 2
%P 823-826
%! HPSG Lexicon without Lexical Rules
%F Oliva:1994:HLLa


%0 Report
%A Oliva, Karel
%D 1994
%T Parsing with Syntactic Lists: Linguistic Intuition, Formal Algorithm, Computer Implementation
%C Saarbrücken
%I Universität des Saarlandes
%S Report of the Project LATESLAV
%! Parsing with Syntactic Lists: Linguistic Intuition, Formal Algorithm, Computer Implementation
%F Oliva:1994:PSL


%0 Report
%A Oliva, Karel
%D 1994
%T HPSG Lexicon without Lexical Rules
%C Saarbrücken
%I Universität des Saarlandes
%P 7
%S CLAUS-Report
%7 38
%8 April
%! HPSG Lexicon without Lexical Rules
%F Oliva:1994:HLLb
%X The paper introduces an alternative to the lexical rules in a lexicon in a HPSG style by replacing them by relational constraints corresponding more directly to the standard lexicographic and morphological practice.


%0 Conference Proceedings
%A Oliva, Karel
%D 1995
%T Grammatikbasierte Grammarchecking
%B 5th German Student Conference on Computational Linguistics
%C Saarbrücken, Germany
%! Grammatikbasierte Grammarchecking
%F Oliva:1995:GG


%0 Conference Proceedings
%A Oliva, Karel
%D 1997
%T Techniques for Accelerating a Grammar-Checker
%E Jacobs, P.
%B 5th Conference on Applied Natural Language Processing (ANLP '97), March 31 - April 3
%C Washington D.C., USA
%I Morgan Kaufmann Publishers
%P 155-158
%! Techniques for Accelerating a Grammar-Checker
%F Oliva:1997:TAG


%0 Report
%A Oliva, Karel
%D 1999
%T Formal Complexity of Word Order: Linguistic-theoretical Considerations
%C Saarbrücken
%I Universität des Saarlandes
%P 27
%S CLAUS-Report
%7 110
%8 June
%! Formal Complexity of Word Order: Linguistic-theoretical Considerations
%2 Oliva:1999:FCW.pdf Oliva:1999:FCW.ps
%F Oliva:1999:FCW
%X In this paper, we review the traditional term "word order freedom" and show that it can be understood in two ways: first, as the freedom of order of elements within a continuous head domain, and second, as the freedom of extraction out of a finite head domain, that is, as the freedom of making head domain(s) discontinuous. Further on, we concentrate on the more linguistical aspects of the latter understanding. In particular, we compare the pair of languages Czech and English, whose considerably different status as to the severity of constraints on ordering of elements within a continuous head domain of the finite verb is notorious, and aim this comparison at the possibilities which these languages offer for discontinuity of head domains. In this respect, we demonstrate that the two possible ways of understanding of word order freedom correlate, that is to say that English with its rather fixed order freedom within a continuos head domain also imposes severe constraints on extraction out of these domains, while Czech with its almost free order within a domain is also much more liberal as to extraction. The paper contains a longer discussion of this issue, together with a number of relevant examples from both languages.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus110.ps


%0 Conference Proceedings
%A Oliva, Karel
%D 2000
%T Hovory k sobe/si/sebe/se
%B Ceština - univerzália a specifika 2 (sborník konference  ve Šlapanicích u Brna 17-19.11.1999)
%C Šlapanice
%! Hovory k sobe/si/sebe/se
%F Oliva:2000:HKS


%0 Conference Proceedings
%A Oliva, Karel
%D 2001
%T Nekteré aspekty komplexity ceského slovního neporádku (Some Aspects of the Complexity of Word Disorder in Czech)
%B Ceština - univerzália a specifika 3 (sborník konference v Brne 16-18.11.2000)
%C Brno
%! Nekteré aspekty komplexity ceského slovního neporádku (Some Aspects of the Complexity of Word Disorder in Czech)
%F Oliva:2001:NAK


%0 Conference Proceedings
%A Oliva, Karel
%A Hnátková, Milena
%A Petkevic, Vladimir
%A Kveton, Pavel
%D 2000
%T The Linguistic Basis of a Rule-Based Tagger of Czech
%E Sojka, P.
%E Kopecek, I.
%E Pala, K.
%B 3rd International Workshop "Text, Speech and Dialogue 2000" (TSD '00), September 13-16
%C Brno, Czech Republic
%I Springer
%P 3-8
%S Lecture Notes in Artificial Intelligence
%7 1902
%! The Linguistic Basis of a Rule-Based Tagger of Czech
%F Oliva:2000:LBR


%0 Conference Proceedings
%A Oliva, Karel
%A Moshier, M. Andrew
%A Lehmann, Sabine
%D 1999
%T Grammar Engineering for the Next Millenium
%B Proceedings of the 5th Natural Language Processing Pacific Rim Symposium 1999 "Closing the Millenium", November 5-7
%C Beijing, China
%I Tsinghua University Press
%! Grammar Engineering for the Next Millenium
%2 Oliva:1999:GEN.pdf
%F Oliva:1999:GEN
%X The prevailing current view of a (symbolic, computational) grammar is basically that of a set of rewriting rules using featurestructured categories. However, whenever such a grammar is aimed at development of a real world applied project, at least two disadvantages become clear. First, it breaks with the traditional understanding of a grammar as a network of phenomena (such as agreement, subcategorization, etc.), thus impeding the (direct) incorporation of this knowledge into such grammars. Second, a realistic grammar is inevitably huge and simultaneously contains very complex interdependencies among rules. This makes any modularization of grammar engineering (aka division of labour within a team) and 
above all maintaining and debugging realistic grammars a virtually impossible task. 
This paper presents an alternative view of formal (computational) grammars of natural language allowing for smooth modularization of the grammarwriting process and hence for meeting the pressing task of distributed grammardevelopment. The examples of both problems and their solutions are related to 
grammars in HPSG style, however, the problems discussed are in no way HPSG specific, just on the contrary, they indeed concern any approach making use of feature structured categories.
%U http://korterm.kaist.ac.kr/nlprs99/finalpaper/528-10.rtf


%0 Book Section
%A Oliva, Karel
%A Petkevic, Vladimir
%D 1998
%T Phenomena-Based Description of Dependency-Syntax: A Survey of Ideas and Formalization
%E Hajicová, E.
%E Hladká, B.
%B Issues of Valency and Meaning - Studies in Honour of Jarmila Panevová
%C Praha
%I Charles University Press
%! Phenomena-Based Description of Dependency-Syntax: A Survey of Ideas and Formalization
%F Oliva:1998:PBD


%0 Master's Thesis
%A Oliver, Dominika
%D 1998
%T Polish Text to Speech Synthesis
%I University of Edinburgh
%! Polish Text to Speech Synthesis
%F Oliver:1998:PTS


%0 Conference Proceedings
%A Oravecz, Csaba
%A Dienes, Peter
%D 2002
%T Efficient Stochastic Part-of-Speech Tagging for Hungarian
%B Proceedings of the Third International Conference on Language Resources and Evaluation (LREC2002), May 29-31
%C Las Palmas, Canary Islands, Spain
%P 710-717
%! Efficient Stochastic Part-of-Speech Tagging for Hungarian
%2 Oravecz:2002:ESP.pdf Oravecz:2002:ESP.ps
%F Oravecz:2002:ESP
%X Many of the methods developed for Western European languages and used widespread to produce annotated language resources cannot readily be applied to Central and Eastern European languages, due to the large number of novel phenomena exhibited in the syntax and morphology of these languages, which  these methods have to handle but have not been designed to cope with. The process of morphological  tagging when applied to Hungarian data to produce corpora annotated at least at the morphosyntactic level is most indicative of this problem: several of the algorithms (either rule-based or statistical) that have been used very successfully in other domains cannot readily be applied to a language exhibiting such a varied morphology and huge number of wordforms as Hungarian. The paper will describe a robust tagging scenario for Hungarian using a relatively simple stochastic system augmented with external morphological processing, which can overcome the two most conspcicuous problems: the complexity of morphosyntactic descriptions and most importantly the huge number of possible wordforms.
%U http://www.coli.uni-sb.de/~dienes/oravecz_dienes_02.ps.gz


%0 Report
%A Paritong, Maike
%D 1992
%T Constituent Coordination in HPSG
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 24
%8 July
%! Constituent Coordination in HPSG
%2 Paritong:1992:CCH.pdf
%F Paritong:1992:CCH
%X In this paper we propose a treatment of constituent coordination within the framework of Head-driven Phrase Structure Grammar (HPSG). In contrast to former approaches which assume that a coordinated structure is either a headless or a multi-headed structure, we take the position that the conjunction is a functional category which functions as the head of the coordinate phrase. Under this assumption, the internal structure of ordinary and complex coordinate constitiuents can be described with the existing inventory of principles and rules in HPSG. Coordination of unsaturated conjuncts is controlled by the lexical entry for the conjunction and without any additional rules or modifications.
%U http://www.dfki.de/dfkibib/publications/docs/Paritong_1992_CCIH.pdf


%0 Report
%A Pechmann, Thomas
%A Uszkoreit, Hans
%A Engelkamp, Johannes
%A Zerbst, Dieter
%D 1994
%T Word Order in the German Middle Field: Linguistic Theory and Psycholinguistic Evidence
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 43
%8 August
%! Word Order in the German Middle Field: Linguistic Theory and Psycholinguistic Evidence
%2 Pechmann:1994:WOG.pdf
%3 j
%F Pechmann:1994:WOG
%X This paper deals with linearization of complements of German verbs. In German all permutations of the subject, the indirect, and the direct object do occur. Yet, they are supposed to differ regarding their degree of acceptability. Uszkoreit (1987) proposed a set of rules which aimed at representing such preferences as the product of different factors. This theoretical account leads to a predicted ranking of the possible syntactic forms. In a set of experiments we tested some of these predictions by application of different methods for tapping into the actual processing of the sentences. In particular, the predictions were (a) that sentences are more acceptable if subjects precede objects than vice versa and (b) that sentences are more acceptable if indirect objects precede direct objects than vice versa. Both comprehension and production experiments were carried out. The methods we used included a ranking task, delayed sentence matching, delayed articulation, rapid serial visual presentation and a sentence generation task. The findings yielded a very consistent picture concerning the position of the subject. Sentences were particularly easy to process if the subject was in initial position and particularly hard to process in subject-final constructions. Furthermore, there is somewhat weaker evidence for the assumption that sentences are easier to process if direct objects are preceded by indirect objects. Since these results were obtained by rather different methods they can be regarded as particularly reliable. Moreover, the data did provide evidence for a gradual increase or decrease of acceptability and no evidence for a jump function, sharply separating grammatical from ungrammatical forms. One of the principal aims of this first phase of our investigations which is reported in the present paper was to find experimental methods which consistently differentiate between the various permutations of verb complements as predicted by theoretical assumptions. This aim could be achieved. The next step will be to include pragmatic factors which are supposed to play a significant role in determining the acceptability of the sentences we are studying.
%U http://www.dfki.de/dfkibib/publications/docs/Pechmann_1994_WOIGMF.pdf


%0 Book Section
%A Pechmann, Thomas
%A Uszkoreit, Hans
%A Engelkamp, Johannes
%A Zerbst, Dieter
%D 1996
%T Wortstellung im Deutschen Mittelfeld
%E Habel, Christopher
%E Kanngießer, Siegfried
%E Rickheit, Gert
%B Perspektiven der Kognitiven Linguistik
%C Oplaten
%I Westdeutscher Verlag
%P 257-299
%! Wortstellung im Deutschen Mittelfeld
%2 Pechmann:1996:WID.pdf
%3 j
%F Pechmann:1996:WID
%U http://www.dfki.de/dfkibib/publications/docs/Pechmann_1994_WOIGMF.pdf


%0 Conference Proceedings
%A Peeters, Wim J.
%A Barry, William J.
%D 1989
%T Diphthong Dynamics: Production and Perception in Southern British English
%E Tubach, J. P.
%E Mariani, J. J.
%B European Conference on Speech Communication and Technology (EUROSPEECH '89), September
%C Paris, France
%V 1
%P 55-58
%! Diphthong Dynamics: Production and Perception in Southern British English
%F Peeters:1989:DDP


%0 Book
%A Peetz, Anna
%A Pützer, Manfred
%D 1995
%T Wörterbuch der Beurener Mundart
%B Phonetica Saraviensia
%C Saarbrücken, Germany
%V 15
%! Wörterbuch der Beurener Mundart
%F Peetz:1995:WBM


%0 Book
%A Peetz, Anna
%A Pützer, Manfred
%D 2000
%T Wörterbuch der Beurener Mundart. Mundart-Hochdeutsch, Hochdeutsch-Mundart
%C Kell am See, Germany
%I Alta Silva
%! Wörterbuch der Beurener Mundart. Mundart-Hochdeutsch, Hochdeutsch-Mundart
%F Peetz:2000:WBM


%0 Book Section
%A Pickering, Martin
%A Clifton, Charles, Jr.
%A Crocker, Matthew
%D 2000
%T Introduction
%E Crocker, M.
%E Pickering, M.
%E Clifton, C., Jr.
%B Architectures and Mechanisms for Language Processing
%C Cambridge
%I Cambridge University Press
%! Introduction
%F Pickering:2000:I


%0 Journal Article
%A Pickering, Martin
%A Traxler, Matthew
%A Crocker, Matthew
%D 2000
%T Ambiguity Resolution in Sentence Processing: Evidence Against Likelihood
%B Journal of Memory and Language
%V 43
%N 3
%P 447-475
%! Ambiguity Resolution in Sentence Processing: Evidence Against Likelihood
%F Pickering:2000:ARS


%0 Conference Proceedings
%A Pilzecker, Markus
%D 2002
%T Semantically Driven Automatic Hyperlinking
%E Handschuh, Siegfried
%E Collier, Nigel
%E Dieng, Rose
%E Staab, Steffen
%B Proceedings of 15th European Conference on Artificial Intelligence (ECAI 2002), Workshop 22: Semantic Authoring, Annotation and Knowledge Markup, July 22
%C Lyon, France
%P 99-102
%! Semantically Driven Automatic Hyperlinking
%2 Pilzecker:2002:SDA.pdf Pilzecker:2002:SDA.ps
%3 j
%F Pilzecker:2002:SDA
%X This paper sketches some experiences and ideas, how a contemporary automatic hyperlinking system may be advantageously combined with sufficiently powerful methods that extract semantics from human language text.
%U http://www.dfki.de/~mp/document/publications/ecai_w22.ps.gz


%0 Book Section
%A Pinkal, Manfred
%D 1990
%T Imprecise Concepts and Quantification
%E van Benthem, J.
%E Bartsch, R.
%E van Emde, B.
%B Semantics and Contextual Expresssion
%C Dordrecht
%I Foris
%P 221 - 226
%! Imprecise Concepts and Quantification
%F Pinkal:1990:ICQ


%0 Report
%A Pinkal, Manfred
%D 1991
%T On the Syntactic-Semantic Analysis of Bound Anaphora
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 6
%8 February
%! On the Syntactic-Semantic Analysis of Bound Anaphora
%2 Pinkal:1991:SSAa.pdf
%F Pinkal:1991:SSAa
%X Two well-known phenomena in the area of pronoun binding are considered: ndirect binding of pronouns by indefinite NPs ("donkey sentences") and surface-syntactic constraints on binding ("weak cross-over"). A common treatment is proposed, and general consequences for the relation between syntactic and semantic processing are discussed. It is argued that syntactic and semantic analysis must interact in a complex way, rather than in a simple sequential or strict rule-to-rule fashion.


%0 Conference Proceedings
%A Pinkal, Manfred
%D 1991
%T On the Syntactic-Semantic Analysis of Bound Anaphora
%B 5th EACL Conference, April 9-11
%C Berlin, Germany
%P 45-50
%! On the Syntactic-Semantic Analysis of Bound Anaphora
%2 Pinkal:1991:SSAb.pdf
%F Pinkal:1991:SSAb
%X Two well-known phenomena in the area of pronoun binding are considered: Indirect binding of pronouns by indefinite NPs ("donkey sentences") and surface-syntactic constraints on binding ("weak cross-over"). A common treatment is proposed, and general consequences for the relation between syntactic and semantic processing are discussed. It is argued that syntactic and semantic analysis must interact in a complex way, rather than in a simple sequential or strict rule-to-rule fashion.
%U http://acl.ldc.upenn.edu/E/E91/E91-1009.pdf


%0 Book Section
%A Pinkal, Manfred
%D 1991
%T Vagheit und Ambiguität
%E von Stechow, A.
%E Wunderlich, D.
%B Semantik: Internationales Handbuch der zeitgenössischen Forschung
%C Berlin
%I de Gruyter
%P 250-269
%! Vagheit und Ambiguität
%F Pinkal:1991:VA


%0 Report
%A Pinkal, Manfred
%D 1993
%T Semantikformalismen für die Sprachverarbeitung
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 26
%8 January
%! Semantikformalismen für die Sprachverarbeitung
%F Pinkal:1993:SS
%X The paper gives an introduction into logic-based formalisms for semantic representation in Natural Language Processing. It discusses First-Order Predicate Logic, Type Theory, Montague's Intensional Logic and Discourse Representation Theory as the most influential formalisms. For each of them, motivating NL examples are presented and discussed. The paper concludes with a short survey of alternative semantic formalisms that have been proposed recently.


%0 Book Section
%A Pinkal, Manfred
%D 1993
%T Semantik
%E Görz, G.
%B Einführung in die Künstliche Intelligenz
%C Bonn
%I Addison-Wesley
%P 425-498
%! Semantik
%F Pinkal:1993:S


%0 Book
%A Pinkal, Manfred
%D 1995
%T Logic and Lexicon. The semantics of the indefinite
%C Dordrecht
%I Kluwer Academic Publishers
%! Logic and Lexicon. The semantics of the indefinite
%F Pinkal:1995:LLS


%0 Conference Proceedings
%A Pinkal, Manfred
%D 1995
%T Radical Underspecification
%E Dekker, P.
%E Stokhof, M.
%B 10th Amsterdam Colloquium
%C Amsterdam, The Netherlands
%I University of Amsterdam
%P 587-606
%! Radical Underspecification
%F Pinkal:1995:RU


%0 Report
%A Pinkal, Manfred
%D 1996
%T Radical Underspecification
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 72
%8 February
%! Radical Underspecification
%F Pinkal:1996:RU
%2 Pinkal:1996:RU.ps


%0 Report
%A Pinkal, Manfred
%D 1996
%T Constraints for Semantic Underspecification
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 73
%8 February
%! Constraints for Semantic Underspecification
%F Pinkal:1996:CSU


%0 Book Section
%A Pinkal, Manfred
%D 1996
%T Wie die Semantik arbeitet. Ein unterspezifiziertes Modell
%E Harras, G.
%E Bierwisch, M.
%B Wenn Die Semantik arbeitet. Klaus Baumgärtner zum 65. Geburtstag
%C Tübingen
%I Max Niemeyer Verlag
%P 57-88
%! Wie die Semantik arbeitet. Ein unterspezifiziertes Modell
%F Pinkal:1996:WSA


%0 Report
%A Pinkal, Manfred
%D 1996
%T Vagueness, Ambiguity and Underspecification
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 82
%8 September
%! Vagueness, Ambiguity and Underspecification
%F Pinkal:1996:VAUa


%0 Conference Proceedings
%A Pinkal, Manfred
%D 1996
%T Vagueness, Ambiguity, and Underspecification
%E Galloway, T.
%E Spence, J.
%B Conference on Semantics and Linguistic Theory (SALT VI)
%C Rutgers University
%I Cornell University
%P 185-201
%! Vagueness, Ambiguity, and Underspecification
%F Pinkal:1996:VAUb


%0 Book Section
%A Pinkal, Manfred
%D 1997
%T Leben in virtuellen Welten. Neue Medien und Künstliche Intelligenz
%E Akademie, Evangelische
%B Die verlorene Leiblichkeit. Nachdenklichkeiten über ein Gegenwartsproblem im Umkreis der Theologie Paul Tillichs
%C Bad Boll
%P 27-38
%! Leben in virtuellen Welten. Neue Medien und Künstliche Intelligenz
%F Pinkal:1997:LVW


%0 Conference Proceedings
%A Pinkal, Manfred
%D 1997
%T Constraints for Semantic Underspecification
%E Kamp, H.
%E Partee, B.
%B Context-Dependence in the Analysis of Linguistic Meaning. Proceedings of the Workshops in Prague and Bad Teinach. Volume 2: Comments and Replies, February
%C Bad Teichnach, Germany and Prague, Czech Republic
%P 155-166
%! Constraints for Semantic Underspecification
%F Pinkal:1997:CSU


%0 Edited Book
%A Pinkal, Manfred
%D 1998
%T CHORUS: Semantische Verarbeitung mit beschränkter Information
%B Technical Report
%C Saarbrücken
%I Universität des Saarlandes
%! CHORUS: Semantische Verarbeitung mit beschränkter Information
%F Pinkal:1998:CSV


%0 Report
%A Pinkal, Manfred
%D 1998
%T Wie die Semantik arbeitet
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 103
%8 March
%! Wie die Semantik arbeitet
%F Pinkal:1998:WSA


%0 Conference Proceedings
%A Pinkal, Manfred
%D 1999
%T On semantic underspecification
%E Bunt, H.
%E Muskens, R.
%B Proceedings of the 2nd International Workshop on Computational Semantics (IWCS 2), January 13-15
%C Tilburg University, The Netherlands
%! On semantic underspecification
%2 Pinkal:1999:SU.ps
%F Pinkal:1999:SU
%X Underspecification has become fashionable in computational semantics. In this chapter, I will try to give an idea of what semantic underspecification is, what it has been good for, and what the perspective for future application are. I will start with the inspection of specific phenomena and techniques which are usually associated with the notion of underspecification (in Section 1 and 2, respectively). In Sect. 3, I will try to indicate the main motivations for using underspecification techniques. Then, I will point out one important use of the concept in some detail, i.e., direct reasoning with incomplete semantic information, discussing first the appropriate truth-conditional basis (Sect. 4), and second perspectives on efficient reasonig systems (Sect. 5). I will conclude with some remarks about the general status of the semantic underspecification concept, in Sect. 6..


%0 Book Section
%A Pinkal, Manfred
%D 2001
%T Geleitwort
%E Klabunde, R.
%E Carstensen, K.-U.
%E Ebert, C.
%E Enriss, D.
%E Jekat, S.
%E Langer, H.
%B Computerlinguistik und Sprachtechnologie - Eine Einführung
%C Heidelberg
%I Spektrum Akademischer Verlag
%P v
%! Geleitwort
%F Pinkal:2001:G


%0 Conference Proceedings
%A Pinkal, Manfred
%A Kohlhase, Michael
%D 2000
%T Feature Logic for Dotted Types: A Formalism for Complex Word Meanings
%B Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics (ACL '00), October 1-8
%C Hong Kong
%I Morgan Kaufmann Publishers
%! Feature Logic for Dotted Types: A Formalism for Complex Word Meanings
%1 http://www.ags.uni-sb.de/~kohlhase/submit/acl00.ps
%2 Pinkal:2000:FLD.pdf Pinkal:2000:FLD.ps
%F Pinkal:2000:FLD
%X In this paper we revisit Pustejovsky's proposal to treat ontologically complex word meaning by so-called dotted pairs. We use a higher-order feature logic based on Ohori's record lambda-calculus to model the semantics of words like book and library, in particular their behavior in the context of quantification and cardinality statements.
%U http://www.cs.cmu.edu/~kohlhase/papers/acl00.ps


%0 Report
%A Pinkal, Manfred
%A Millies, Sebastian
%D 1992
%T An Autonomous, Syntax-Sensitive Module for Semantic Interpretation
%C Saarbrücken
%I Universität des Saarlandes
%S GUK Report
%8 Dezember
%! An Autonomous, Syntax-Sensitive Module for Semantic Interpretation
%F Pinkal:1992:ASS


%0 Book Section
%A Pinkal, Manfred
%A Rupp, C. J.
%A Worm, Karsten
%D 2000
%T Robust Semantic Processing of Spoken Language
%E Wahlster, W.
%B Verbmobil: Foundations of Speech-to-Speech Translation
%C Berlin
%I Springer
%P 322-336
%S Artificial Intelligence
%! Robust Semantic Processing of Spoken Language
%F Pinkal:2000:RSP
%2 Pinkal:2000:RSP.ps

%0 Report
%A Piskorski, Jakub
%D 2002
%T Finite-State Machine Toolkit
%C Saarbrücken
%I DFKI
%S Technical Report
%7 RR-02-04
%! Finite-State Machine Toolkit
%2 Piskorski:2002:FSM.pdf
%3 j
%F Piskorski:2002:FSM
%X Finite-state devices such as finite-state automata and finite-state transducers have been known since the emergence of computer science and are recently extensively used in many areas of language technology. The use of finite-state devices is mainly motivated by their time and space efficiency. In this paper we present the Finite-State Machine Toolkit for building, combining and optimizing the finite-state machines, developed at the Language Technology Lab of the German Research Cener for Artficial Intelligence.
%U http://www.dfki.de/dfkibib/publications/docs/Piskorski_2002_DFSMTK.pdf


%0 Conference Proceedings
%A Piskorski, Jakub
%A Drozdzynski, Witold
%A Xu, Feiyu
%A Scherf, Oliver
%D 2002
%T A Flexible XML-based Regular Compiler for Creation and Converting Linguistic Resources
%B Proceedings of the 3rd International Conference on Language Resources an Evaluation (LREC'02)
%C Las Palmas, Canary Islands, Spain
%! A Flexible XML-based Regular Compiler for Creation and Converting Linguistic Resources
%2 Piskorski:2002:FXB.pdf
%3 j
%F Piskorski:2002:FXB
%X Finite-state devices are widely used to compactly model linguistic phenomena, whereas regular expressions are regarded as the adequate level of abstraction for thinking about finite-state languages. In this paper we present a flexible XML-based and Unicode-compatible regular compiler for creating, and integrating existing linguistic resources. Our tool provides user-friendly graphical interface which enables the transparent control of the compilation process and allows for testing generated finite-state grammars with several diagnostic tools. Through the direct database connection, existing linguistic resources can be converted into user-definable finite-state representations.
%U http://www.dfki.de/~feiyu/regular_compiler.pdf


%0 Conference Proceedings
%A Piskorski, Jakub
%A Jaeger, Tilman
%A Xu, Feiyu
%D 2002
%T A Framework for Domain and Task Adaptive Named-Entity Recognition
%B Proceedings of the 5th International Baltic Conference on Databases and Information Systems, June 3-6
%C Tallinn, Estonia
%! A Framework for Domain and Task Adaptive Named-Entity Recognition
%2 Piskorski:2002:FDT.ps Piskorski:2002:FDT.pdf
%3 j
%F Piskorski:2002:FDT
%X Robust Named--Entity Recognition software is an essential preprocessing tool for performing more complex text processing tasks in business information systems. In this paper we present a Framework for Domain and Task Adaptive Named--Entity Recognition. It consists of several clear--cut subcomponents which can be flexibly and variably combined together in order to construct a task--specific NE--Recognition tool. Additionally, a diagnostic tool for automatic prediction of best system configuration is provided, which speeds up the development cycle.
%U http://www.dfki.de/~feiyu/balt.tar.gz


%0 Conference Proceedings
%A Piskorski, Jakub
%A Neumann, Günter
%D 2000
%T An Intelligent Text Extraction and Navigation System
%B Proceedings of the 6th International Conference on Computer-Assisted Information Retrieval (RIAO'00)
%C Paris, France
%! An Intelligent Text Extraction and Navigation System
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/sppc.entry
%2 Piskorski:2000:ITE.pdf Piskorski:2000:ITE.ps
%3 j
%F Piskorski:2000:ITE
%X We present SPPC, a high-performance system for intelligent text extraction and navigation from German free text documents. SPPC consists of a set of domain-independent shallow core components which are realized by means of cascaded weighted finite state machines and generic dynamic tries.
All extracted information is represented uniformly in one data structure (called the text chart) in a highly compact and linked form in order to support indexing and navigation through the set of solutions.
German text processing includes (among others) compound processing, high performance named entity recognition and chunk parsing based on a divide-and-conquer strategy. SPPC has a good performance (4380 words per second on standard PC environments) and high linguistic coverage.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/sppc.ps.gz


%0 Conference Proceedings
%A Piskorski, Jakub
%A Skut, Wojciech
%D 2000
%T Intelligent Information Extraction
%B Proceedings of the 4th International Conference on Business Information Systems, April 24-25
%C Poznan, Poland
%! Intelligent Information Extraction
%3 j
%F Piskorski:2000:IIE
%X New developments in Information Technology and an ever-growing amount of unstructured business text documents in digital form require intelligent tools for precisely determining their content and relevance. In this paper we give an overview of the natural language processing approach to information extraction and information retrieval. Our article contains a brief description of efficient linguistic core components.


%0 Conference Proceedings
%A Piwek, Paul
%A Krenn, Brigitte
%A Schröder, Marc
%A Grice, Martine
%A Baumann, Stefan
%A Pirker, Hannes
%D 2002
%T RRL: A Rich Represenatation Language for the Description of Agent Behaviour in NECA
%B Proceedings of AAMAS 2002 Workshop:"Embodied Conversational Agents - Let's Specify and Evaluate Them!",  July 15-16
%C Bologna, Italy
%! RRL: A Rich Represenatation Language for the Description of Agent Behaviour in NECA
%2 Piwek:2002:RRR.pdf
%3 j
%F Piwek:2002:RRR
%X In this paper, we describe the Rich Representation Language (RRL) which is used in the NECA system. The NECA system generates interactions between two or more animated characters. The RRL is a formal framework for representing the information that is exchanged at the interfaces between the various NECA system modules.
%U http://www.vhml.org/workshops/AAMAS/papers/piwek.pdf


%0 Master's Thesis
%A Plaehn, Oliver
%D 1999
%T Probabilistic Parsing with Discontinuous Phrase Structure Grammar
%B Computational Linguistics
%C Saarbrücken
%I Universität des Saarlandes
%! Probabilistic Parsing with Discontinuous Phrase Structure Grammar
%2 Plaehn:1999:PPD.pdf Plaehn:1999:PPD.ps
%F Plaehn:1999:PPD
%U http://www.coli.uni-sb.de/~plaehn/papers/dt.ps


%0 Conference Proceedings
%A Plaehn, Oliver
%D 2000
%T Computing the Most Probable Parse for a Discontinuous Phrase Structure Grammar
%E Bunt, H.
%B 6th International Workshop on Parsing Technologies (IWPT '00), February 23-25
%C Trento, Italy
%! Computing the Most Probable Parse for a Discontinuous Phrase Structure Grammar
%2 Plaehn:2000:CMP.pdf Plaehn:2000:CMP.ps
%F Plaehn:2000:CMP
%X This paper presents a probabilistic extension of Discontinuous Phrase Structure Grammar (DPSG), a formalism designed to describe discontinuous constituency phenomena adequately and perspicuously by means of trees with crossing branches. We outline an implementation of an agenda-based chart parsing algorithm that is capable of computing the Most Probable Parse for a given input sentence for probabilistic versions of both DPSG and Context-Free Grammar. Experiments were conducted with both types of grammars extracted from the NEGRA corpus. In spite of the much greater complexity of DPSG parsing in terms of the number of (partial) analyses that can be constructed for an input sentence, accuracy results from both experiments are comparable. We also briefly hint at future lines of research aimed at more efficient ways of probabilistic parsing with discontinuous constituents.
%U http://www.coli.uni-sb.de/~plaehn/papers/iwpt2000.ps http://www.coli.uni-sb.de/~plaehn/papers/iwpt2000.ps.gz http://www.coli.uni-sb.de/~plaehn/papers/iwpt2000.html


%0 Conference Proceedings
%A Plaehn, Oliver
%A Brants, Thorsten
%D 2000
%T Annotate - An Efficient Interactive Annotation Tool
%B 6th Applied Natural Language Processing Conference (ANLP '00), April 29 - May 4
%C Seattle, Washington, USA
%! Annotate - An Efficient Interactive Annotation Tool
%2 Plaehn:2000:AEI.pdf Plaehn:2000:AEI.ps
%F Plaehn:2000:AEI
%X During the creation of the NEGRA corpus, we developed very efficient interactive annotation tools. An easy-to-use graphical tool, Annotate, is used to manipulate syntactic structures. Annotate interacts with a part-of-speech tagger and a parser running in the background, thus facilitating rapid semi-automatic corpus annotation.
%U http://www.coli.uni-sb.de/~plaehn/papers/anlp2000.ps.gz http://www.coli.uni-sb.de/~plaehn/papers/anlp2000.pdf http://www.coli.uni-sb.de/~plaehn/papers/anlp2000.html


%0 Report
%A Podelski, Andreas
%A Charatonik, Witold
%A Müller, Martin
%D 1997
%T Set-Based Error Diagnosis of Concurrent Constraint Programs
%C Saarbrücken
%I Universität des Saarlandes
%S Technical Report
%8 December
%! Set-Based Error Diagnosis of Concurrent Constraint Programs
%2 Podelski:1997:SBE.pdf Podelski:1997:SBE.ps
%F Podelski:1997:SBE
%X We present an automated method for the static prediction of the run-time error 'deadlock or failure' in concurrent constraint programs. The method is based on a new set-based analysis of reactive logic programs which computes an approximation of the greatest-model semantics. Semantically, the method is based on the connection between the inevitability of 'deadlock or failure' in concurrent constraint programs, finite failure in logic programming and the greatest-model semantics over infinite trees.
%U http://www.ps.uni-sb.de/Paper/abstracts/Diagnosis-97.html ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Diagnosis-97.ps.gz


%0 Conference Proceedings
%A Podelski, Andreas
%A Charatonik, Witold
%A Müller, Martin
%D 1999
%T Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs
%E Swierstra, S. D.
%B 8th European Symposium of Programming (ESOP '99). Programming Languages and Systems, March 22-28
%C Amsterdam, The Netherlands
%I Springer
%P 177-192
%S Lecture Notes in Computer Science
%7 1576
%! Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs
%2 Podelski:1999:SBF.pdf Podelski:1999:SBF.ps
%F Podelski:1999:SBF
%X This paper presents the first approximation method of the finite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs with ongoing behaviors (perpetual processes). Our technical contributions are (1) the semantical characterization of finite failure of logic programs over infinite trees and (2) the design and soundness proof of the first set-based analysis of logic programs with the greatest-model semantics. Finally, we exhibit the connection between finite failure and the inevitability of the 'inconsistent-store' error in fair executions of concurrent constraint programs where no process suspends forever. This indicates a potential application to error diagnosis for concurrent constraint programs.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/esop99.ps.gz


%0 Conference Proceedings
%A Podelski, Andreas
%A Smolka, Gert
%D 1995
%T Situated Simplification
%E Montanari, U.
%B 1st Conference on Principles and Practice of Constraint Programming, September
%C Cassis, France
%I Springer
%P 328-344
%S Lecture Notes in Computer Science
%7 976
%! Situated Simplification
%2 Podelski:1995:SS.pdf Podelski:1995:SS.ps
%F Podelski:1995:SS
%X Testing satisfaction of guards is the essential operation of concurrent constraint programming (CCP) systems. We present and prove correct, for the first time, an incremental algorithm for the simultaneous tests of entailment and disentailment of rational tree constraints to be used in CCP systems with deep guards (e.g., AKL or Oz). The algorithm is presented as the simplification of the constraints which form the (possibly deep) guards and which are situated at different nodes (or, local computation spaces) in a tree (of arbitrary depth). In this algorithm, each variable may have multiple bindings (representing multiple constraints on the same variable in different nodes). These may be realized by re- and de-installation upon each newly resumed check of the guard in the corresponding node (as done, e.g., in AKL or Oz), or by using look-up tables (with entries indexed by the nodes). We give a simple fixed-point algorithm and use it for proving that the tests implemented by another, practical algorithm are correct and complete for entailment and disentailment. We formulate the results in this paper for rational tree constraints; they can be adapted to finite and feature trees.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/SituSimpliTCS.ps.gz


%0 Journal Article
%A Podelski, Andreas
%A Smolka, Gert
%D 1997
%T Situated Simplification
%B Theoretical Computer Science
%V 173
%P 209-233
%8 February
%! Situated Simplification
%F Podelski:1997:SS


%0 Conference Proceedings
%A Popov, Konstantin
%D 1997
%T A Parallel Abstract Machine for the Thread-Based Concurrent Constraint Language Oz
%E de Castro Dutra, I.
%E Santos Costa, V.
%E Silva, F.
%E Pontelli, E.
%E Gupta, G.
%B Workshop On Parallism and Implementation Technology for (Constraint) Logic Programming Languages
%! A Parallel Abstract Machine for the Thread-Based Concurrent Constraint Language Oz
%2 Popov:1997:PAM.pdf Popov:1997:PAM.ps
%F Popov:1997:PAM
%X A parallel abstract machine for Oz PAMOz is presented in this paper. Oz is a thread-based concurrent constraint programming language with state. Oz is convenient for concurrent programming like modelling multi-agent systems, as well as for solving combinatoric problems. PAMOz models the execution of a sublanguage of Oz without its constraint solving facilities. PAMOz has been implemented in the parallel Oz system, which is derived from the sequential Oz system and inherits its optimizations. PAMOz is targeted to shared-memory multiprocessors. PAMOz executes Oz threads in parallel. PAMOz is derived from AMOz, a sequential abstract machine for Oz. There are two principal differences between PAMOz and AMOz: the architecture of the abstract machine, and the implementation of operations on stateful data. PAMOz can be conservatively extended for full Oz; there is an interface between PAMOz and its constraint solving extension.
%U ftp://ftp.ps.uni-sb.de/pub/papers/Others/pamoz.ps.gz


%0 Conference Proceedings
%A Prescher, Detlef
%D 2001
%T Novel Properties and Well-Tried Performance of EM-Based Multivariate Clustering
%B Proceedings of the EuroConference on Recent Advances in Natural Language Processing (RANLP-01), September 5-7
%C Tzigov Chark, Bulgaria
%P 216-222
%! Novel Properties and Well-Tried Performance of EM-Based Multivariate Clustering
%2 Prescher:2001:NPW.pdf
%3 j
%F Prescher:2001:NPW
%X We present three novel properties for EM-based multivariate clustering: simplified re-estimation 
formulas, a simple pruning technique, and a novel invariance property preserving the characteristics of the given empirical distribution. Evaluation on two tasks shows: EM-based multivariate clustering models require only twice the storage space of the original sample, and these models yield reliable estimates for unknown data. Moreover we refer to selected experiments showing that EM-based multivariate clustering improves several real-world applications.
%U http://www.dfki.de/~prescher/papers/bib/2001ranlp.prescher.pdf


%0 Report
%A Prescher, Detlef
%D 2001
%T Inside-Outside Estimation Meets Dynamic EM - GOLD
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-01-02
%! Inside-Outside Estimation Meets Dynamic EM - GOLD
%2 Prescher:2001:IOEa.pdf
%3 j
%F Prescher:2001:IOEa
%X It is an interesting fact that most of the stochastic models used by linguists can be interpreted as probabilistic context-free grammars. In this paper, this result will be accompanied by the formal proof that the inside-outside algorithm, the standard training method for probabilistic context-free grammars, can be regarded as a dynamic-programming variant of the EM algorithm. Even if this result is considered in isolation this means that most of the probabilistic models used by linguists are trained by a version of the EM algorithm. However, this result is even more interesting when considered in a theoretical context because the well-known convergence behavior of the inside-outside algorithm has been confirmed by many experiments but it seems that it never has been formally proved. Furthermore, being a version of the EM algorithm, the inside-outside algorithm also inherits the good convergence behavior of EM. We therefore contend that the as yet imperfect line of argumentation can be transformed into a coherent proof.
%U http://www.dfki.de/~prescher/papers/bib/2001dfki_report.prescher.pdf


%0 Conference Proceedings
%A Prescher, Detlef
%D 2001
%T Inside-Outside Estimation Meets Dynamic EM
%B Proceedings of the 7th International Workshop on Parsing Technologies (IWPT-01), October 17-19
%C Beijing, China
%P 241-244
%! Inside-Outside Estimation Meets Dynamic EM
%2 Prescher:2001:IOEb.pdf
%3 j
%F Prescher:2001:IOEb
%X It is an interesting fact that most of the stochastic models used by linguists can be interpreted as probabilistic context-free grammars. In this paper, this result will be accompanied by the formal proof that the inside-outside algorithm, the standard training method for probabilistic context-free grammars, can be regarded as a dynamic-programming variant of the EM algorithm. Even if this result is considered in isolation this means that most of the probabilistic models used by linguists are trained by a version of the EM algorithm. However, this result is even more interesting when considered in a theoretical context because the well-known convergence behavior of the inside-outside algorithm has been confirmed by many experiments but it seems that it never has been formally proved. Furthermore, being a version of the EM algorithm, the inside-outside algorithm also inherits the good convergence behavior of EM. We therefore contend that the as yet imperfect line of argumentation can be transformed into a coherent proof.
%U http://www.dfki.de/~prescher/papers/bib/2001iwpt.prescher.pdf


%0 Thesis
%A Prescher, Detlef
%D 2002
%T EM-basierte maschinelle Lernverfahren für natürliche Sprachen
%C Stuttgart
%I Universität Stuttgart, Institut für Maschinelle Sprachverarbeitung (IMS)
%S AIMS Report
%7 8(1)
%! EM-basierte maschinelle Lernverfahren für natürliche Sprachen
%2 Prescher:2002:EBM.pdf
%3 j
%F Prescher:2002:EBM
%X This thesis presents the Expectation-Maximization algorithm (EM algorithm, Dempster et al. (1977)) in its practical and theoretical aspects. The EM algorithm is the stochastic basis of many machine learning algorithms for natural language processing. In the theoretical part of this thesis the stochastic basis of linguistics and the formal basis of the EM algorithm is explained. The practical part of this thesis presents a probabilistic clustering method for multivariate linguistic data and stochastic modeling of lexicalized grammars.
%U http://www.dfki.de/~prescher/papers/bib/2002phd.prescher.pdf


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


%0 Thesis
%A Pützer, Manfred
%D 1989
%T Die Mundart von Großrosseln
%C Saarbrücken, Germany
%! Die Mundart von Großrosseln
%F Putzer:1989:MG


%0 Book
%A Pützer, Manfred
%D 1993
%T Wörterbuch der Großrosseler Mundart
%B Phonetica Saraviensia
%C Saarbrücken, Germany
%V 12
%! Wörterbuch der Großrosseler Mundart
%F Putzer:1993:WGM


%0 Journal Article
%A Pützer, Manfred
%D 1995
%T Die Wortakzente von Beuren. Ein Beitrag zu Wortprosodischen Strukturen in einer Moselfränkischen Mundart
%B PHONUS
%C Universität des Saarlandes, Phonetik, Saarbrücken
%V 1
%P 65-104
%! Die Wortakzente von Beuren. Ein Beitrag zu Wortprosodischen Strukturen in einer Moselfränkischen Mundart
%2 Putzer:1995:WBB.pdf
%F Putzer:1995:WBB
%X This report addresses the topic of word-accent in the dialect of the Rhine-Palatinate town of Beuren, close to the Northern Saarland border and belonging to the Mosel-Franconian dialect region. The report is presented in two thematically linked parts, and their partly complementary results contribute to a better understanding of the word-prosody structure of this dialect. The first part is a pilot study of the Rhenish Accentuation phenomena. It is an acoustic analysis of Accent 1 (also called "Stoßton") and Accent 2 (also called "Schleifton") words produced under different sentence-accent conditions in different intonation patterns. The second part is concernd with another tonal accent, sometimes called the "neutral accent", which is assumed, on the basis of auditory judgements, to exist in the dialect of Beuren. A pilot experiment tests the perceptual contribution of durational and tonal properties to the acceptability of this accent and of accent 2.
%U http://www.coli.uni-sb.de/Phonetics/Research/PHONUS_research_reports/Phonus1/Puetzer_PHONUS1.ps.gz


%0 Journal Article
%A Pützer, Manfred
%D 1997
%T Zu Transkriptionskonventionen bei Plosiven im Übergangsgebiet zwischen moselfränkischen und rheinfränkischen Dialekten im germanophonen Lothringen (Frankreich)
%E Barry, William J.
%E Koreman, Jacques
%B PHONUS
%C Universität des Saarlandes, Phonetik, Saarbrücken
%V 3
%P 25-60
%! Zu Transkriptionskonventionen bei Plosiven im Übergangsgebiet zwischen moselfränkischen und rheinfränkischen Dialekten im germanophonen Lothringen (Frankreich)
%2 Putzer:1997:TPI.pdf
%F Putzer:1997:TPI
%X Phonus 3, Institute of Phonetics, University of the Saarland, 1997, 35-60. The present study deals with the dialect of a town situated in the transitional region between the Mosel-Franconian and Rhine-Franconian areas in Germanophone Lorraine. The focus of this study is the phonetic basis of the plosives /p, t, k/ and /b, d, g/ in initial, medial and final position, i.e.: prevocalic / presonorant, intervocalic and postvocalic / postsonorant position, respectively. Interest in this subject stems from the different transciption conventions traditionally in use in the three Germanophone dialect regions of Lorraine: the Mosel-Franconian, Rhine-Franconian and transitional regions. Both an auditive evaluation and an instrumental analysis of the systematically elicited speech corpus, followed by a statistical analysis, support the choice of the phonetic symbols in phonologically non-relevant positions in the dialect under investigation.
%U http://www.coli.uni-sb.de/Phonetics/Research/PHONUS_research_reports/Phonus3/Puetzer_PHONUS3.ps.gz


%0 Conference Proceedings
%A Pützer, Manfred
%D 1997
%T Cross-Frontier and Interregional Differences in the Production and Perception of Fortis-Lenis Oppositions in Plosives to be Found in the French-German Border Area
%B Proceedings of the Second Workshop on: Divergence and Convergence of Dialects Across Political Borders, March 13-15
%C Ghent, Belgium
%P 97-105
%! Cross-Frontier and Interregional Differences in the Production and Perception of Fortis-Lenis Oppositions in Plosives to be Found in the French-German Border Area
%F Putzer:1997:CFI


%0 Journal Article
%A Pützer, Manfred
%D 2001
%T Multiparametrische Stimmqualitäts-erfassung männlicher und weiblicher Normalstimmen
%B Folia Phoniatr. Logop.
%V 53
%P 73-84
%! Multiparametrische Stimmqualitäts-erfassung männlicher und weiblicher Normalstimmen
%F Putzer:2001:MSE


%0 Thesis
%A Pützer, Manfred
%D 2004
%T Stimmqualität und linguistische Funktionalität in der individuell referentiellen Bewertung. Ein instrumenteller und auditiver Beitrag zu Phonations- und Artikulationsvaria-tionen bei Dysarthrophonien
%C Saarbrücken
%I Universität des Saarlandes, Department of Computational Linguistics
%9 Habilitation Thesis
%! Stimmqualität und linguistische Funktionalität in der individuell referentiellen Bewertung. Ein instrumenteller und auditiver Beitrag zu Phonations- und Artikulationsvaria-tionen bei Dysarthrophonien
%F Putzer:2004:SLF


%0 Journal Article
%A Pützer, Manfred
%A Barry, William J.
%D 1998
%T Geographische und generationsbezogene Verbreitung saarländischer Dialekt-phänomene im germanophonen Lothringen (Frankreich)
%B Zeitschrift für Dialektologie und Linguistik
%V 65
%N 2
%P 152-178
%! Geographische und generationsbezogene Verbreitung saarländischer Dialekt-phänomene im germanophonen Lothringen (Frankreich)
%F Putzer:1998:GGV


%0 Journal Article
%A Pützer, Manfred
%A Barry, William J.
%D 1999
%T Soziophonetische Betrachtungen zu deutschen Dialekten in Lothringen (Frankreich)
%B Folia Linguistica
%V 32
%N 3-4
%P 161-199
%! Soziophonetische Betrachtungen zu deutschen Dialekten in Lothringen (Frankreich)
%F Putzer:1999:SBD


%0 Journal Article
%A Pützer, Manfred
%A Barry, William J.
%D 2002
%T Differential Weighting of Phonetic Properties in Cross-Dialectal Perception
%E Barry, William J.
%E Pützer, Manfred
%B PHONUS
%C Universität des Saarlandes, Phonetik, Saarbrücken
%V 6, Festschrift für Max Mangold
%P 191-220
%S PHONUS
%! Differential Weighting of Phonetic Properties in Cross-Dialectal Perception
%F Putzer:2002:DWP


%0 Journal Article
%A Pützer, Manfred
%A Barry, William J.
%D 2002
%T Methodische Aspekte der auditiven Bewertung von Stimmqualität
%B Sprache Stimme Gehör
%! Methodische Aspekte der auditiven Bewertung von Stimmqualität
%F Putzer:2002:MAA
%O to appear


%0 Journal Article
%A Pützer, Manfred
%A Erriquez, Attilio
%A Barry, William J.
%A Just, Manfred
%D 2001
%T Differenzierte Stimmprofile zur männlichen und weiblichen Normalstimme
%B Aktuelle phoniatrisch-pädaudiologische Aspekte
%V 8
%P 71-75
%! Differenzierte Stimmprofile zur männlichen und weiblichen Normalstimme
%F Putzer:2001:DSM


%0 Conference Proceedings
%A Pützer, Manfred
%A Erriquez, Attilio
%A Barry, William J.
%A Just, Manfred
%D 2001
%T Differenzierte Stimmprofile zur männlichen und weiblichen Normalstimme
%B 17. Wissenschaftliche Jahrestagung der Deutschen Gesellschaft für Phoniatrie und Pädaudiologie, 6.-8. Oktober
%C Tübingen, Germany
%! Differenzierte Stimmprofile zur männlichen und weiblichen Normalstimme
%F Putzer:2001:DSMb


%0 Journal Article
%A Pützer, Manfred
%A Just, Manfred
%D 1999
%T Akustische und elektrophysiologische Stimmanalyse nach laserchirurgischer Larynxkarzinomresektion: Ein Fallstudie
%E Barry, William J.
%E Koreman, Jacques
%B PHONUS
%C Universität des Saarlandes, Phonetik, Saarbrücken
%V 4
%P 103-121
%! Akustische und elektrophysiologische Stimmanalyse nach laserchirurgischer Larynxkarzinomresektion: Ein Fallstudie
%2 Putzer:1999:AES.pdf
%F Putzer:1999:AES
%X Phonus 4, Institute of Phonetics, University of the Saarland, 1999, 103-121. In this paper the course of the therapy after minimally invasive laser surgery for a carcinoma of the vocal cord (T1) is evaluated using acoustic and electroglottographic methods. The evaluation includes preoperative, postoperative and post-rehabilitative conditions. With the help of frequency and amplitude perturbation parameters derived from the acoustic output, and parameters based on electroglottographic properties of single periods (contact and skewing quotient; jitter), respectively, we are able to provide statistical evidence for the effectiveness of the therapeutic measures. Comparisons with the tolerance values given by the producers of the analysis programs and with empirically derived variation ranges from a large sample of normal speakers allow us to quantify the effect. The course of the recovery, also described in this study, provides the anatomical and physiological basis to explain the functional improvement of phonation observed in the acoustic and electroglottographic correlates.
%U http://www.coli.uni-sb.de/Phonetics/Research/PHONUS_research_reports/Phonus4/Puetzer_PHONUS4.ps.gz


%0 Journal Article
%A Pützer, Manfred
%A Koreman, Jacques
%D 1997
%T A German Database of Patterns of Pathological Vocal Fold Vibration
%E Barry, William J.
%E Koreman, Jacques
%B PHONUS
%C Universität des Saarlandes, Phonetik, Saarbrücken
%V 3
%P 143-153
%! A German Database of Patterns of Pathological Vocal Fold Vibration
%2 Putzer:1997:GDP.pdf
%F Putzer:1997:GDP
%X This paper presents a survey of a database of pathological voice qualities, collected in collaboration with the Department of Phoniatrics and ENT at the Caritas clinic St. Theresia in Saarbr.cken. The major part of this paper is devoted to a medical description of pathological voice qualities, but the recording procedure as well as the goal of the database collection will also be described. In particular, we hope that in the future it will be possible, on the basis of the present database, to relate properties of recorded voice signals to phoniatric diagnoses of voice pathologies.
%U http://www.coli.uni-sb.de/Phonetics/Research/PHONUS_research_reports/Phonus3/PuetzerKoreman_PHONUS3.ps.gz


%0 Journal Article
%A Pützer, Manfred
%A Marasek, Krzysztof
%D 2000
%T Differenzierung gesunder Stimmqualitäten und Stimmqualitäten bei Rekurrens-parese mit Hilfe elektroglottographischer Messungen und RBH-System
%B Sprache Stimme Gehör
%V 24
%P 154-163
%! Differenzierung gesunder Stimmqualitäten und Stimmqualitäten bei Rekurrens-parese mit Hilfe elektroglottographischer Messungen und RBH-System
%F Putzer:2000:DGS


%0 Journal Article
%A Pützer, Manfred
%A Moringlane, Jean Richard
%A Fuss, Gerhard
%D 2002
%T Auswirkungen neurstimulatorischer Eingriffe auf das glottale Schwingungsverhalten bei Patienten mit M. Parkinson und Multipler Sklerose
%B Folia Phoniatr. Logop.
%! Auswirkungen neurstimulatorischer Eingriffe auf das glottale Schwingungsverhalten bei Patienten mit M. Parkinson und Multipler Sklerose
%F Putzer:2002:ANE
%O to appear


%0 Book
%A Pützer, Manfred
%A Till, Adolphe
%A Helleringer, Julien
%D 2001
%T Wörterbuch der Mundart von St. Avold. Dictionnaire du parler francique de Saint-Avold
%C Metz, France
%I Édition Serpenoise
%! Wörterbuch der Mundart von St. Avold. Dictionnaire du parler francique de Saint-Avold
%F Putzer:2001:WMS


%0 Conference Proceedings
%A Raileanu, Diana 
%A Buitelaar, Paul
%A Vintar, Spela
%A Bay, Jörg
%D 2002
%T Evaluation Corpora for Sense Disambiguation in the Medical Domain
%B Proceedings of the 3rd International Conference on Language Resources and Evaluation (LREC'02), May 29-31
%C Las Palmas, Canary Islands, Spain
%! Evaluation Corpora for Sense Disambiguation in the Medical Domain
%2 Raileanu:2002:ECS.pdf Raileanu:2002:ECS.ps
%3 j
%F Raileanu:2002:ECS
%X An important aspect of word sense disambiguation is the evaluation of different methods and parameters. Unfortunately, there is a lack of test sets for evaluation, specifically for languages other than English and even more so for specific domains like medicine. Given that our work focuses on English as well as German text in the medical domain, we had to develop our own evaluation corpora in order to test our disambiguation methods. In this paper we describe the work on developing these corpora, using GermaNet and UMLS as (lexical) semantic resources, next to a description of the annotation tool KiC that we developed for support of the annotation task.
%U http://dfki.de/~paulb/lrec2002.eval.ps http://www.dfki.de/dfkibib/publications/docs/lrec2002.eval.final.pdf http://www2.arnes.si/~svinta/lrec2002.eval.final.pdf


%0 Conference Proceedings
%A Ramírez Bustamante, Flora
%A Declerck, Thierry
%A Sanchéz León, Fernando
%D 1999
%T Integrated Set of Tools for Robust Text Processing
%B Proceedings of the Conference Venezia per il Trattamento Automatico delle Lingue (VEXTAL)
%C Venice, Italy
%! Integrated Set of Tools for Robust Text Processing
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/vextal99_ram.entry
%2 Bustamante:1999:IST.pdf Bustamante:1999:IST.ps
%3 j
%F Bustamante:1999:IST
%X This paper describes a set of tools for morpho-syntactic annotation of Spanish texts, based both on well known public domain tools (emerging from MULTEXT) and proprietary technologies (as Constraint Grammars). Besides, a complete bunch of new specific modules ranging from morphological analyzers to form, typographical and morphosyntactic checkers have been integrated in this NLP tool.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/vextal99_ram.ps.gz


%0 Conference Proceedings
%A Ramírez Bustamante, Flora
%A Declerck, Thierry
%A Sanchéz León, Fernando
%D 2000
%T Towards a Theory of Textual Errors
%B Proceedings of the 3rd International Workshop on Controlled Language Applications (CLAW'00), April 29-30
%C Seattle, USA
%! Towards a Theory of Textual Errors
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/claw00_ram.entry
%2 Bustamante:2000:TTT.pdf Bustamante:2000:TTT.ps
%3 j
%F Bustamante:2000:TTT
%X In this paper we present a discussion on the current state of checking technology (both Controlled Language and Grammar Checking), and we stress the need for a generalized theory of textual errors which leads to a hierarchical organization of errors and illegal structures in relation to linguistic text processing. We then discuss the issue of an integrated checking approach.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/claw00_ram.ps.gz


%0 Conference Proceedings
%A Ramírez Bustamante, Flora
%A Sanchéz León, Fernando
%A Declerck, Thierry
%D 1997
%T Correccion grammatical y preprocesamiento
%B Proceedings of the Lenguaje Natural, Revista numero 21, July
%C Madrid, Spain
%! Correccion grammatical y preprocesamiento
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/sepln1997_dec.entry
%2 Bustamante:1997:CGPa.pdf Bustamante:1997:CGPa.ps
%3 j
%F Bustamante:1997:CGPa
%X In this paper we investigate within the context of grammar checking in which sense the use of pre-processing steps can contribute to the robusteness of the syntactic analysis. Based on the experience done within the GramCheck project, we try to distinguish types of textual errors which could be handled at a lower level of NL processing. (The paper is written in Spanish).
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/sepln1997_dec.ps.gz


%0 Conference Proceedings
%A Ramírez Bustamante, Flora
%A Sanchéz León, Fernando
%A Declerck, Thierry
%D 1998
%T CON-TEXT. Un corrector grammatical de bajo nivel
%B Proceedings of the Processamiento del Lenguaje Natural
%V 23
%P 165-170
%! CON-TEXT. Un corrector grammatical de bajo nivel
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/sepln1998_dec.entry
%2 Bustamante:1998:CTC.pdf Bustamante:1998:CTC.ps
%3 j
%F Bustamante:1998:CTC
%X In this paper we present the results of the CON-TEXT project which was concerned with the development of a grammar checker for Spanish texts. The grammar checking procedures are here exclusively based on the use of low level processing tools, such as segmentation and morphological analysis. We describe the tools under usage and the double architecture on the top of which the checker has been implemented. (The paper is written in Spanish).
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/sepln1998_dec.ps.gz


%0 Conference Proceedings
%A Ramírez Bustamante, F.
%A Sánchez Leon, F.
%A Declerck, T.
%D 1997
%T Correccion grammatical y preprocesamiento
%B Lenguaje Natural, Revista numero 21, July
%C Madrid, Spain
%! Correccion grammatical y preprocesamiento
%2 Bustamante:1997:CGP.pdf Bustamante:1997:CGP.ps
%3 j
%F Bustamante:1997:CGP
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/sepln1997_dec.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/sepln1997_dec.ps.gz


%0 Conference Proceedings
%A Ramírez Bustamante, Flora
%A Sánchez León, Fernando
%A Declerck, Thierry
%D 1997
%T Grammar Checking and Preprocessing in ALEP
%B Proceedings of the 3rd ALEP User Group Workshop, March 6-7
%C Saarbrücken, Germany
%! Grammar Checking and Preprocessing in ALEP
%2 Bustamante:1997:GCP.pdf Bustamante:1997:GCP.ps
%3 j
%F Bustamante:1997:GCP
%U http://www.iai.uni-sb.de/alep/papers/checking.ps.gz


%0 Report
%A Ramm, Wiebke
%A Rothkegel, Annely
%A Steiner, Erich
%A Villiger, Claudia
%D 1995
%T Discourse Grammar for German
%C Saarbrücken
%I Universität des Saarlandes
%S Technical Report ESPRIT Basic Research Action: Dandelion
%7 EP6665; Deliverable R2.3.2
%! Discourse Grammar for German
%F Ramm:1995:DGG


%0 Conference Proceedings
%A Ramm, Wiebke
%A Villiger, Claudia
%D 1995
%T Global Text Organization and Sentence-Grammatical Realization: Discourse-Level Constraints on Theme Selection
%E Boguraev, B.
%B Recent Advances in Natural Language Processing (RANLP '95), September 11-13
%C Tzigov Chark, Bulgaria
%I European Association of Computational Linguistics
%! Global Text Organization and Sentence-Grammatical Realization: Discourse-Level Constraints on Theme Selection
%F Ramm:1995:GTOa


%0 Report
%A Ramm, Wiebke
%A Villiger, Claudia
%D 1995
%T Global Text Organization and Sentence-Grammatical Realization: Discourse-Level Constraints on Theme Selection
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 61
%8 May
%! Global Text Organization and Sentence-Grammatical Realization: Discourse-Level Constraints on Theme Selection
%2 Ramm:1995:GTOb.pdf Ramm:1995:GTOb.ps
%F Ramm:1995:GTOb
%X In this paper we address aspects of the interaction of global discourse parameters such as text type and subject matter with the selection of local features (e.g., thematic organization in terms of theme-rheme configurations) responsible for the appearance of the individual linguistic units the discourse consists of. Our starting point is the observation that the same propositional content often can be expressed linguistically by different lexical and grammatical means, for instance, by word order alternatives or by using different lexical categories. These alternatives result from the exploitation of a number of linguistic mechanisms (e.g., focussing, thematization) controlling the foregrounding and backgrounding of different parts of information communicated and differ in the pragmatic effects they achieve. Our interest lies in the textual-pragmatic motivations leading to the choice of a certain textual variant; in particular, we investigate the constraints global discourse structure imposes on sentence-level discourse organization. Proceeding from a stratificational model of the language system, our approach aims at the specification of interstratal constraints expressing the interdependency between higher-level discourse organization and lexico-grammatical realization on sentence level. A possible application area would be text generation where a notorious problem is the gap between global-level text planning and lexico-grammatical expression. The choice of grammatical (sentence) theme in German and its text type and domain dependency is taken as a sample phenomenon to illustrate our methodology.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus61.ps


%0 Book Section
%A Ramm, Wiebke
%A Villiger, Claudia
%D 1996
%T Wissenschaftliche Textproduktion und Fachdomäne. Sprachliche Realisierung wissenschaftlicher Inhalte in verschiedenen Fachdisziplinen und ihre computerlinguistische Modellierung
%E Knorr, D.
%E Jakobs, E.-M.
%B Textproduktion. HyperText, Text, KonText
%C Frankfurt a. M.
%I Peter Lang
%P 205-222
%S Textproduktion und Medium, volume 5
%! Wissenschaftliche Textproduktion und Fachdomäne. Sprachliche Realisierung wissenschaftlicher Inhalte in verschiedenen Fachdisziplinen und ihre computerlinguistische Modellierung
%F Ramm:1996:WTF


%0 Conference Proceedings
%A Rayner, Manny
%A Alshawi, Hiyan
%A Bretan, Ivan
%A Carter, David M.
%A Digalakis, Vassilios
%A Gambäck, Björn
%A Kaja, Jaan
%A Karlgren, Jussi
%A Lyberg, Bertil
%A Pulman, Stephen G.
%A Price, Patti
%A Samuelsson, Christer
%D 1993
%T A Speech to Speech Translation System Built from Standard Components
%B Workshop on Human Language Technology, March 21-24
%C Princeton, New Jersey, USA
%I Morgan Kaufmann
%! A Speech to Speech Translation System Built from Standard Components
%2 Rayner:1993:SSTa.pdf Rayner:1993:SSTa.ps
%F Rayner:1993:SSTa
%U http://www.sics.se/~gamback/publications/hlt93.ps


%0 Report
%A Rayner, Manny
%A Alshawi, Hiyan
%A Bretan, Ivan
%A Carter, David M.
%A Digalakis, Vassilios
%A Gambäck, Björn
%A Kaja, Jaan
%A Karlgren, Jussi
%A Lyberg, Bertil
%A Pulman, Stephen G.
%A Price, Patti
%A Samuelsson, Christer
%D 1993
%T A Speech to Speech Translation System Built from Standard Components
%C Cambridge
%I Stanford Research Institute
%S SRI International Technical Report
%7 CRC-031
%! A Speech to Speech Translation System Built from Standard Components
%F Rayner:1993:SSTb


%0 Conference Proceedings
%A Rayner, Manny
%A Bretan, Ivan
%A Carter, David M.
%A Collins, Michael
%A Digalakis, Vassilios
%A Gambäck, Björn
%A Kaja, Jaan
%A Karlgren, Jussi
%A Lyberg, Bertil
%A Pulman, Stephen G.
%A Price, Patti
%A Samuelsson, Christer
%D 1993
%T Spoken Language Translation with Mid-90's Technology: A Case Study
%E Fellbaum, K.
%B 3rd European Conference on Speech Communication and Technology (EUROSPEECH '93), September 21-23
%C Berlin, Germany
%V 2
%P 1299-1302
%! Spoken Language Translation with Mid-90's Technology: A Case Study
%1 www.sics.se/~gam/eurospeech93.ps
%F Rayner:1993:SLTa


%0 Report
%A Rayner, Manny
%A Bretan, Ivan
%A Carter, David M.
%A Collins, Michael
%A Digalakis, Vassilios
%A Gambäck, Björn
%A Kaja, Jaan
%A Karlgren, Jussi
%A Lyberg, Bertil
%A Pulman, Stephen G.
%A Price, Patti
%A Samuelsson, Christer
%D 1993
%T Spoken Language Translation with Mid-90's Technology: A Case Study
%C Cambridge
%I SRI International
%S SRI International Technical Report
%7 CRC-032
%! Spoken Language Translation with Mid-90's Technology: A Case Study
%F Rayner:1993:SLTb


%0 Conference Proceedings
%A Rayner, Manny
%A Samuelsson, Christer
%D 1990
%T Using Explanation-Based Learning to Increase Performance in a Large-Scale NL Query Interface
%B 3rd DARPA Speech and Natural Language Workshop, June
%C Hidden Valley, Pennsylvania, USA
%I Morgan Kaufmann
%P 251-256
%! Using Explanation-Based Learning to Increase Performance in a Large-Scale NL Query Interface
%F Rayner:1990:UEB


%0 Conference Proceedings
%A Refice, Mario
%A Savino, Michelina
%A Grice, Martine
%D 1997
%T A Contribution to the Estimation of Naturalness in the Intonation of Italian Spontaneous Speech
%B 5th European Conference on Speech Communication and Technology (EUROSPEECH '97), September 22-25
%C Rhodes, Greece
%P 783-786
%! A Contribution to the Estimation of Naturalness in the Intonation of Italian Spontaneous Speech
%F Refice:1997:CEN


%0 Conference Proceedings
%A Reyelt, Matthias
%A Grice, Martine
%A Benzmüller, Ralf
%A Mayer, Jörg
%A Batliner, Anton
%D 1996
%T Prosodische Etikettierung des Deutschen mit ToBI
%E Gibbon, D.
%B 3. Konferenz Verarbeitung natürlicher Sprache (KONVENS '96), 7.-9. Oktober
%C Bielefeld, Germany
%I Mouton de Gryuter
%P 144-155
%! Prosodische Etikettierung des Deutschen mit ToBI
%F Reyelt:1996:PED


%0 Journal Article
%A Rhie, Sung Ja
%A Barry, William J.
%A Koreman, Jacques
%D 1997
%T Syllable Structure and Duration in the Realisation of German Rhythm by Korean Learners
%B PHONUS
%C Universität des Saarlandes, Phonetik, Saarbrücken
%V 3
%P 111-141
%! Syllable Structure and Duration in the Realisation of German Rhythm by Korean Learners
%2 Rhie:1997:SSD.pdf
%F Rhie:1997:SSD
%X Sentences read and imitated by four Korean learners of German, two "advanced" and two "beginners", containing selected two-, three- and four-syllable words were compared with readings of the same sentences by two native speakers of German. The words were also varied systematically in their complexity and in the familiarity of their syllable structure. They combined familiar and unfamiliar sounds with known [CV(son)] and unknown [C(C)VC(C)] syllables. The realisations by the Korean learners were analysed for deviations from the native productions with respect to pause behaviour, articulation rate, the duration of the selected words, and the relative syllable duration within those words. Results show that unfamiliar sounds, syllable structure and Korean syllable-dependent rhythmic patterning combine to interfere with the production of the correct German rhythm. As the length and the syllable complexity of the German target words increases so does the degree of deviation from the native German patterns. Length of exposure to German did not appear to guarantee a closer approximation to the target patterns, but all learners were able to modify their L2-productions in the imitation task.
%U http://www.coli.uni-sb.de/Phonetics/Research/PHONUS_research_reports/Phonus3/Rhie_PHONUS3.ps.gz


%0 Report
%A Riezler, Stefan
%D 1995
%T Binding Without Hierarchies
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 50
%8 January
%! Binding Without Hierarchies
%2 Riezler:1995:BH.pdf Riezler:1995:BH.ps
%F Riezler:1995:BH
%X The aim of this paper is to show that current HPSG binding theory (and similarly other binding approaches encoding asymmetries explicitly) is inadequate with regard to describing binding variabilities in local binding contexts. This inadequacy stems mainly from the usage of too restrictive and order-independent obliqueness-based hierarchies as constraints on possible binders and bindees. We propose binding constraints to be directly implemented as path equations/path inequations in thematic relation sorts. This allows a more fine-grained description of local binding symmetries and asymmetries via a modular interplay of general binding constraints on thematic arguments together with linear precedence constraints on certain anaphoric elements.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus50.ps


%0 Conference Proceedings
%A Ripplinger, Bärbel 
%A Vintar, Spela
%A Buitelaar, Paul
%D 2002
%T Cross-Lingual Information Retrieval through Semantic Annotation
%B Proceedings of the Workshop on Natural Language Processing in Biomedical Applications (NLPBA'02), March 8-9
%C Nicosia, Cyprus
%! Cross-Lingual Information Retrieval through Semantic Annotation
%2 Ripplinger:2002:CLI.pdf Ripplinger:2002:CLI.ps
%3 j
%F Ripplinger:2002:CLI
%X We present a framework for concept-based, cross-lingual information retrieval (CLIR) in the medical domain, which is under development in the MUCHMORE project. Our approach is based on using the Unified Medical Language System (UMLS) as the primary source of semantic data, whereby documents and queries are annotated with multiple layers of linguistic information. Linguistic processing includes POS-tagging, morphological analysis, phrase recognition and the identification of medical concepts and semantic relations between them. The paper describes experiments in mono- and bilingual document retrieval, performed on a parallel English-German corpus of medical abstracts. Results show on the one hand that linguistic processing, especially lemmatisation and compound analysis, is a crucial step to achieving good baseline performance. On the other hand we show that semantic information, specifically the combined use of concepts and relations, significantly increases performance in cross-lingual retrieval.
%U http://dfki.de/~paulb/nlpba.ps


%0 Journal Article
%A Rothkegel, Annely
%A Schmitt, Michael
%A Villiger, Claudia
%D 1994
%T CHAINING - Eine Strategie zum Aufbau der sequentiellen Textstruktur
%B Sprache und Datenverarbeitung
%V 18
%N 2
%P 19-44
%! CHAINING - Eine Strategie zum Aufbau der sequentiellen Textstruktur
%F Rothkegel:1994:CSA


%0 Report
%A Rothkegel, Annely
%A Villiger, Claudia
%D 1993
%T CHAINING
%C Saarbrücken
%I Universität des Saarlandes
%S Technical Report, ESPRIT Basic Research Action: Dandelion
%7 EP6665; Deliverable R1.2.2a
%8 September
%! CHAINING
%F Rothkegel:1993:C


%0 Conference Proceedings
%A Ruland, Tobias
%A Rupp, C. J.
%A Spilker, Jörg
%A Weber, Hans
%A Worm, Karsten L.
%D 1998
%T Making the Most of Multiplicity: A Multi-Parser Multi-Strategy Architecture for the Robust Processing of Spoken Language
%E Mannell, Robert H.
%E Robert-Ribes, Jordi
%B Prceedings of the 5th International Conference on Spoken Language Processing (ICSLP'98), November 30 - December 4
%C Sydney, Australia
%I ASSTA
%! Making the Most of Multiplicity: A Multi-Parser Multi-Strategy Architecture for the Robust Processing of Spoken Language
%F Ruland:1998:MMM


%0 Report
%A Rupp, C. J.
%A Milward, David
%D 2000
%T A Robust Linguistic Processing Architecture
%C Göteborg
%I Göteborg University, Department of Linguistics
%S Siridus Report
%7 4.1
%8 September
%! A Robust Linguistic Processing Architecture
%2 Rupp:2000:RLP.pdf Rupp:2000:RLP.ps
%F Rupp:2000:RLP
%U http://www.ling.gu.se/projekt/siridus/Publications/deliv4-1.ps.gz


%0 Book Section
%A Rupp, C. J.
%A Spilker, Jörg
%A Klarner, Martin
%A Worm, Karsten L.
%D 2000
%T Combining Analyses from Various Parsers
%E Wahlster, Wolfgang
%B Verbmobil: Foundations of Speech-to-Speech Translation
%C Berlin
%I Springer
%P 311-320
%! Combining Analyses from Various Parsers
%F Rupp:2000:CAV


%0 Report
%A Sablayrolles, Pierre
%A Schupeta, Achim
%D 1993
%T Conflict Resolving Negotiation for Cooperative Schedule Management Agents (COSMA)
%C Saarbrücken
%I DFKI
%S Technical Memo
%7 TM-93-02
%! Conflict Resolving Negotiation for Cooperative Schedule Management Agents (COSMA)
%F Sablayrolles:1993:CRN


%0 Master's Thesis
%A Samuelsson, Christer
%D 1991
%T Using Explanation-Based Learning to Speed up Natural Language Systems
%C Stockholm
%I The Royal Institute of Technology
%! Using Explanation-Based Learning to Speed up Natural Language Systems
%F Samuelsson:1991:UEB


%0 Conference Proceedings
%A Samuelsson, Christer
%D 1993
%T Avoiding Non-Termination in Unification Grammars
%E Matsumoto, Y.
%B 4th International Workshop on Natural Language Understanding and Logic Programming (NLULP4), September 29 - October 1
%C Nara, Japan
%P 4-16
%! Avoiding Non-Termination in Unification Grammars
%F Samuelsson:1993:ANT


%0 Conference Proceedings
%A Samuelsson, Christer
%D 1994
%T Notes on LR Parser Design
%E ACL
%B 15th International Conference on Computational Linguistics (COLING '94), August 5-9
%C Kyoto, Japan
%V 1
%P 386-390
%! Notes on LR Parser Design
%F Samuelsson:1994:NLP


%0 Conference Proceedings
%A Samuelsson, Christer
%D 1994
%T Explanation-Based Learning of Grammar for Parsing
%B ELSNET/MLNET Workshop on Machine Learning of Natural Language and Speech, December 2-3
%C University of Amsterdam, The Netherlands
%! Explanation-Based Learning of Grammar for Parsing
%F Samuelsson:1994:EBL


%0 Thesis
%A Samuelsson, Christer
%D 1994
%T Fast Natural-Language Parsing Using Explanation-Based Learning
%C Stockholm
%I The Royal Institute of Technology
%! Fast Natural-Language Parsing Using Explanation-Based Learning
%F Samuelsson:1994:FNL


%0 Conference Proceedings
%A Samuelsson, Christer
%D 1994
%T Grammar Specialization through Entropy Thresholds
%B 32nd Annual Meeting of the Association for Computational Linguistics (ACL '94), June 27-30
%C New Mexico State University, Las Cruces, New Mexico, USA
%I Morgan Kaufmann Publishers
%P 188-195
%! Grammar Specialization through Entropy Thresholds
%F Samuelsson:1994:GST


%0 Conference Proceedings
%A Samuelsson, Christer
%D 1994
%T Morphological Tagging Based Entirely on Bayesian Inference
%E Eklund, R.
%B 9th Scandinavian Conference on Computational Linguistics
%C Stockholm, Sweden
%P 225-238
%! Morphological Tagging Based Entirely on Bayesian Inference
%F Samuelsson:1994:MTB


%0 Report
%A Samuelsson, Christer
%D 1994
%T An Efficient Algorithm for Surface Generation
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 44
%8 September
%! An Efficient Algorithm for Surface Generation
%2 Samuelsson:1994:EAS.pdf Samuelsson:1994:EAS.ps Samuelsson:1994:EAS.dvi
%F Samuelsson:1994:EAS
%X A method is given that "inverts" a grammar and displays it from the point of view of the semantic form, rather than from that of the word string. Techniques for compiling LR-parsing tables are used to allow a simple recursive-descent generation algorithm to perform "functor merging" in the same way as an LR-parser performs prefix merging. This is an improvement on the semantic-head-driven generator that results in a much smaller search space.
%U ftp://ftp.coli.uni-sb.de/pub/claus/claus44.ps ftp://ftp.coli.uni-sb.de/pub/claus/claus44.dvi


%0 Conference Proceedings
%A Samuelsson, Christer
%D 1995
%T A Novel Framework for Reductionistic Statistical Parsing
%B 4th International Workshop on Parsing Technologies (IWPT '95), September 20-24
%C Prague and Karlovy Vary, Czech Republic
%P 208-215
%! A Novel Framework for Reductionistic Statistical Parsing
%F Samuelsson:1995:NFR


%0 Conference Proceedings
%A Samuelsson, Christer
%D 1995
%T An Efficient Algorithm for Surface Generation
%B 14th International Joint Conference on Artificial Intelligence (IJCAI '95), August 20-25
%C Montréal, Québec, Canada
%I Morgan Kaufmann Publishers
%V 2
%P 1414-1419
%! An Efficient Algorithm for Surface Generation
%F Samuelsson:1995:EAS


%0 Conference Proceedings
%A Samuelsson, Christer
%D 1995
%T Example-Based Optimization of Surface-Generation Tables
%E Boguraev, B.
%B 1st International Conference on Recent Advances in Natural Language Processing, September
%C Tzigov Chark, Bulgaria
%! Example-Based Optimization of Surface-Generation Tables
%F Samuelsson:1995:EBOa


%0 Report
%A Samuelsson, Christer
%D 1995
%T Example-Based Optimization of Surface-Generation Tables
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 56
%8 April
%! Example-Based Optimization of Surface-Generation Tables
%F Samuelsson:1995:EBOb
%X A method is given that 'inverts' a logic grammar and displays it from the point of view of the logical form, rather than from that of the word string. LR-compiling techniques are used to allow a recursive-descent generation algorithm to perform 'functor merging' much in the same way as an LR parser performs prefix merging. This is an improvement on the semantic-head-driven generator that results in a much smaller search space. The amount of semantic lookahead can be varied, and appropriate tradeoff points between table size and resulting nondeterminism can be found automatically. This can be done by removing all spurious nondeterminism for input sufficiently close to the examples of a training corpus, and large portions of it for other input, while preserving completeness.


%0 Conference Proceedings
%A Samuelsson, Christer
%D 1996
%T Handling Sparse Data by Successive Abstraction
%E ACL
%B 16th International Conference on Computational Linguistics (COLING '96), August 5-9
%C Copenhagen, Danmark
%V 2
%P 895-900
%! Handling Sparse Data by Successive Abstraction
%2 Samuelsson:1996:HSDa.pdf
%F Samuelsson:1996:HSDa
%X A general, practical method for handling sparse data that avoids held-out data and iterative reestimation is derived from first principles. It has been tested on a part-of-speech tagging task and outperformed (deleted) interpolation with context-independent weights, even when the latter used a globally optimal parameter setting determined a posteriori.


%0 Conference Proceedings
%A Samuelsson, Christer
%D 1996
%T Relating Turing's Formula and Zipf's Law
%B 4th Workshop on Very Large Corpora (WVLC-4), August 4
%C Copenhagen, Denmark
%! Relating Turing's Formula and Zipf's Law
%F Samuelsson:1996:RTFa


%0 Report
%A Samuelsson, Christer
%D 1996
%T Relating Turing's Formula and Zipf's Law
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 78
%8 June
%! Relating Turing's Formula and Zipf's Law
%2 Samuelsson:1996:RTFb.pdf Samuelsson:1996:RTFb.ps
%F Samuelsson:1996:RTFb
%X A general, practical method for handling sparse data that avoids held-out data and iterative reestimation is derived from first principles. It has been tested on a part-of-speech tagging task and outperformed linear (deleted) interpolation even when the latter used a globally optimal parameter setting determined a posteriori. An asymptote is derived from Turing's local reestimation formula for population frequencies, and a local reestimation formula is derived from Zipf's law for the asymptotic behavior of population frequencies. The two are shown to be qualitatively different asymptotically, but nevertheless to be instances of a common class of reestimation-formula-asymptote pairs, in which they constitute the upper and lower bounds of the convergence region of the cumulative of the frequency function, as rank tends to infinity. The results demonstrate that Turing's formula is qualitatively different from the various extensions to Zipf's law, and suggest that it smooths the frequency estimates towards a geometric distribution.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus78.ps


%0 Report
%A Samuelsson, Christer
%D 1996
%T Handling Sparse Data by Successive Abstraction
%C Saarbrücken
%I Unversität des Saarlandes
%P 6
%S CLAUS-Report
%7 69
%8 January
%! Handling Sparse Data by Successive Abstraction
%2 Samuelsson:1996:HSDb.pdf
%F Samuelsson:1996:HSDb
%X A general, practical method for handling sparse data that avoids held-out data and iterative reestimation is derived from first principles. It has been tested on a part-of-speech tagging task and outperformed linear (deleted) interpolation even when the latter used a globally optimal parameter setting determined a posteriori.


%0 Book
%A Samuelsson, Christer
%A Karlgren, Jussi
%A Gambäck, Björn
%A Bretan, Ivan
%D 1993
%T Natural Language Parsing in Prolog. A Compendium for a Course in Natural Language Processing Systems held at Stockholm University
%I The Royal Institute of Technology and Helsinki University
%! Natural Language Parsing in Prolog. A Compendium for a Course in Natural Language Processing Systems held at Stockholm University
%F Samuelsson:1993:NLP


%0 Conference Proceedings
%A Samuelsson, Christer
%A Rayner, Manny
%D 1990
%T Developing an EBL Bypass for a Natural Language System
%B 9th Annual Meeting of the Swedish Artificial Intelligence Society, April
%C Stockholm, Sweden
%! Developing an EBL Bypass for a Natural Language System
%F Samuelsson:1990:DEB


%0 Report
%A Samuelsson, Christer
%A Rayner, Manny
%D 1991
%T Developing an EBL Bypass for a Large-Scale Natural Language Query Interface to Relational Data Bases
%C Stockholm
%I Swedish Institute of Computer Science (SICS)
%S Research Report
%7 R91001
%8 January
%! Developing an EBL Bypass for a Large-Scale Natural Language Query Interface to Relational Data Bases
%F Samuelsson:1991:DEB


%0 Conference Proceedings
%A Samuelsson, Christer
%A Rayner, Manny
%D 1991
%T Explanation-Based Learning as a Tuning Tool for Large-Scale Natural Language Interfaces
%B AAAI Spring Symposium Series, Workshop on Machine Learning in Natural Language and Ontology, March
%C Stanford, California, USA
%P 143-145
%! Explanation-Based Learning as a Tuning Tool for Large-Scale Natural Language Interfaces
%F Samuelsson:1991:EBL


%0 Conference Proceedings
%A Samuelsson, Christer
%A Rayner, Manny
%D 1991
%T Quantitative Evaluation of Explanation-Based Learning as an Optimization Tool for a Large-Scale Natural Language System
%E Mylopoulos, J.
%E Reiter, R.
%B 12th International Joint Conference on Artificial Intelligence (IJCAI '91), August 24-30
%C Sydney, Australia
%I Morgan Kaufmann
%P 609-615
%! Quantitative Evaluation of Explanation-Based Learning as an Optimization Tool for a Large-Scale Natural Language System
%F Samuelsson:1991:QEE


%0 Conference Proceedings
%A Samuelsson, Christer
%A Tapanainen, Pasi
%A Voutalainen, Atro
%D 1996
%T Inducing Constraint Grammars
%E Miclet, L.
%E De La Higuera, C.
%B 3rd International Colloquium on Grammatical Inference (ICGI '96): Grammatical Inference: Learning Syntax from Sentences, September 25-27
%C Montpellier, France
%I Springer
%P 146-155
%S Lecture Notes in Computer Science
%7 1147
%! Inducing Constraint Grammars
%F Samuelsson:1996:ICGa


%0 Report
%A Samuelsson, Christer
%A Tapanainen, Pasi
%A Voutalainen, Atro
%D 1996
%T Inducing Constraint Grammars
%C Saarbrücken
%I Universität des Saarlandes
%P 10
%S CLAUS-Report
%7 79
%8 July
%! Inducing Constraint Grammars
%2 Samuelsson:1996:ICGb.pdf Samuelsson:1996:ICGb.ps
%F Samuelsson:1996:ICGb
%X Constraint Grammar rules are induced from corpora. A simple scheme based on local information, i.e., on lexical biases and next-neighbour contexts, extended through the use of barriers, reached 87.3 percent precision (1.12 tags/word) at 98.2 percent recall. The results compare favourably with other methods that are used for similar tasks although they are by no means as good as the results achieved using the original hand-written rules developed over several years time.
%U ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus79.ps


%0 Conference Proceedings
%A Santamarta, Lena
%A Lindberg, Nikolaj
%A Gambäck, Björn
%D 1995
%T Towards Building a Swedish Treebank
%B 10th Nordic Conference of Computational Linguistics, May 30-31
%C Helsinki, Finland
%P 37-40
%! Towards Building a Swedish Treebank
%2 Santamarta:1995:TBS.pdf Santamarta:1995:TBS.ps
%F Santamarta:1995:TBS
%U www.sics.se/humle/papers/nodalida95_tree.ps


%0 Report
%A Saurer, Werner
%D 1991
%T A Natural Deduction System for Discourse Representation Theory
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 16
%8 December
%! A Natural Deduction System for Discourse Representation Theory
%F Saurer:1991:NDS


%0 Journal Article
%A Saurer, Werner
%D 1993
%T A Natural Deduction System for Discourse Representation Theory
%B Journal of Philosophical Logic
%V 22
%P 249-302
%! A Natural Deduction System for Discourse Representation Theory
%F Saurer:1993:NDS


%0 Report
%A Saurer, Werner
%D 1994
%T A Note on Anaphora and Inference
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 46
%8 October
%! A Note on Anaphora and Inference
%F Saurer:1994:NAI
%X There are cases of anaphoric relations that even dynamic semantic theories such as Discourse Representation Theory (DRT) have difficulties with in that they cannot provide for an appropriate antecedent for certain occurrences of pronouns. Some people think this shows that those theories are not dynamic enough and have suggested various remedies such as accommodation. In this paper I show how inference can provide for the missing antecedent in those problem cases even within the framework of existing dynamic theories. A natural deduction system working directly with Discourse Representation Structures is used to accomplish this.


%0 Master's Thesis
%A Schäfer, Ulrich
%D 1995
%T Parameterized Type Expansion in TDL
%B DFKI
%C Saarbrücken
%I Universität des Saarlandes
%! Parameterized Type Expansion in TDL
%3 j
%F Schafer:1995:PTE


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


%0 Report
%A Scheepers, Christoph
%D 1998
%T Menschliche Satzverarbeitung: Syntaktische und thematische Aspekte der Wortstellung im Deutschen
%C Freiburg
%I Institut für Informatik und Gesellschaft
%S IIG-Berichte
%7 1/98
%! Menschliche Satzverarbeitung: Syntaktische und thematische Aspekte der Wortstellung im Deutschen
%F Scheepers:1998:MSS
%O edited by Müller, G., Schinzel, B., Strube, G.


%0 Conference Proceedings
%A Scheepers, Christoph
%A Corley, Martin M. B.
%D 2000
%T Syntactic Priming in German Sentence Production
%E Gleitman, L. R.
%E Joshi, A. K.
%B Proceedings of the Twenty-Second Meeting of the Cognitive Science Society (CogSci2000), August 13-15
%C Philadelphia, Pennsylvania, USA
%I Lawrence Erlbaum Associates
%P 435-440
%! Syntactic Priming in German Sentence Production
%F Scheepers:2000:SPG


%0 Conference Proceedings
%A Scheepers, Christoph
%A Hemforth, Barbara 
%A Konieczny, Lars
%D 1999
%T Incremental Processing of German Verb-Final Constructions: Predicting the Verb's Minimum (!) Valency
%B Proceedings of the 2nd International Conference on Cognitive Science (ICCS/JCSS99), July 27-30
%C Tokyo, Japan
%! Incremental Processing of German Verb-Final Constructions: Predicting the Verb's Minimum (!) Valency
%F Scheepers:1999:IPG


%0 Book Section
%A Scheepers, Christoph
%A Hemforth, Barbara 
%A Konieczny, Lars
%D 2000
%T Linking Syntactic Functions with Thematic Roles: Psych-Verbs and the Resolution of Subject-Object Ambiguity
%E Hemforth, B.
%E Konieczny, L.
%B German Sentence Processing
%C Dodrecht
%I Kluwer Academic Publishers
%P 95-135
%! Linking Syntactic Functions with Thematic Roles: Psych-Verbs and the Resolution of Subject-Object Ambiguity
%F Scheepers:2000:LSF


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


%0 Book Section
%A Schiehlen, Michael
%A Bos, Johan
%A Dorna, Michael
%D 2000
%T Verbmobil Interface Terms (VITs)
%E Wahlster, Wolfgang
%B Verbmobil: Foundations of Speech-to-Speech Translation
%C Berlin - Heidelberg - New York
%I Springer
%P 183-199
%! Verbmobil Interface Terms (VITs)
%F Schiehlen:2000:VIT


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


%0 Conference Proceedings
%A Schmidt, P.
%A Groenendijk, M.
%A Phelan, P.
%A Schulz, H.
%A Rieder, S.
%A Theofilidis, A.
%A Declerck, T.
%A Bredenkamp, A.
%D 1998
%T Natural Language Access to Software Applications
%B 36th Annual Meeting of the Association for Computational Linguistics and the 17th International Conference on Computational Linguitics (COLING-ACL '98), August 10-14
%C Montréal, Québec, Canada
%I Morgan Kaufmann Publishers
%V 2
%P 1193-1197
%! Natural Language Access to Software Applications
%2 Schmidt:1998:NLA.pdf Schmidt:1998:NLA.ps
%3 j
%F Schmidt:1998:NLA
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/melissa98_col.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/melissa98_col.entry


%0 Conference Proceedings
%A Schmidt, Paul 
%A Rieder, Sibylle 
%A Theofilidis, Axel 
%A Declerck, Thierry
%D 1996
%T Lean Formalisms, Linguistic Theory, and Applications. Grammar Development in ALEP
%B Proceedings of the 16th International Conference on Computational Linguistics (COLING'96), August 5-9
%C Copenhagen, Danmark
%! Lean Formalisms, Linguistic Theory, and Applications. Grammar Development in ALEP
%2 Schmidt:1996:LFL.pdf Schmidt:1996:LFL.ps
%3 j
%F Schmidt:1996:LFL
%X This paper describes results achieved in a project which addresses the issue of how the gap between unificationbased grammars as a scientific concept and real world applications can be narrowed down 1 . Applicationoriented grammar development has to take into account the following parameters: 
Efficiency: The project chose a so called 'lean' formalism, a termencodable language providing efficient term unification, ALEP. 
Coverage: The project adopted a corpusbased approach. 
Completeness: All modules needed from text handling to semantics must be there. 
The paper reports on a text handling component, Two Level morphology, word structure, phrase structure, semantics and the interfaces between these components. Mainstream approach: The approach claims to be mainstream, very much indebted to HPSG, thus based on the currently most prominent and recent linguistic theory. The relation (and tension) between these parameters are described in this paper.
%U http://www.iai.uni-sb.de/LS-GRAM/coling.ps.gz http://www.dfki.de/dfkibib/publications/docs/Declerck_1996_LFLTA.pdf


%0 Journal Article
%A Schmitt, Michael
%A Villiger, Claudia
%D 1997
%T Sprachwissenschaft im Netz - Strukturkriterien für ein Virtuelles Linguistisches Museum
%B Sprache und Datenverarbeitung
%V 21
%N 1
%P 41-52
%! Sprachwissenschaft im Netz - Strukturkriterien für ein Virtuelles Linguistisches Museum
%F Schmitt:1997:SIN


%0 Master's Thesis
%A Schröder, Marc
%D 1998
%T L'expression audiovisuelle de l'amusement - premières expériences audiovisuelles
%C Grenoble
%I Université Stendhal, Sciences du Langage
%9 Mémoire de Maîtrise
%! L'expression audiovisuelle de l'amusement - premières expériences audiovisuelles
%1 http://www.dfki.de/~schroed/
%2 Schroder:1998:LAA.pdf
%3 j
%F Schroder:1998:LAA
%U http://www.dfki.de/~schroed/articles/schroeder1998.pdf


%0 Book Section
%A Schröder, Marc
%D 1999
%T Zur Machbarkeit von Synthese emotionaler Sprache ohne Modellierung der Stimmqualität
%B Elektronische Sprachsignalverarbeitung
%C Görlitz
%P 222-229
%! Zur Machbarkeit von Synthese emotionaler Sprache ohne Modellierung der Stimmqualität
%1 http://www.dfki.de/~schroed/
%2 Schroder:1999:MSE.pdf
%3 j
%F Schroder:1999:MSE
%X Die vorliegende Studie widmet sich der Frage, ob emotionale Sprechweise in konkatenativer Sprachsynthese ohne Manipulation der Stimmqualität modelliert werden kann. Ein Satz wurde von drei Sprechern mit vier Emotionen (Wut, Freude, Angst und Traurigkeit) sowie mit neutraler Sprechweise produziert. Die besterkannten dieser "natürlichen" emotionalen Äußerungen wurden akustisch analysiert (Segmentdauern, -energie, und F0-Extrema) und mittels Copy-Synthese nachgebildet. Während einige der resultierenden "synthetischen" Stimuli fast so gut der intendierten Emotion zugeordnet wurden wie die
"natürlichen" Originale, ging bei anderen die Erkennung komplett verloren. In einem offenen Perzeptionstest wurde eine ausgeprägte und nur bedingt vom Stimulus abhängende Präferenz für die Kategorie "Enttäuschung" gefunden.
%U http://www.dfki.de/~schroed/articles/schroeder1999a.pdf


%0 Journal Article
%A Schröder, Marc
%D 1999
%T Can Emotions be Synthesized without Controlling Voice Quality?
%B PHONUS
%C Universität des Saarlandes, Phonetik, Saarbrücken
%V 4
%P 37-55
%! Can Emotions be Synthesized without Controlling Voice Quality?
%1 http://www.dfki.de/~schroed/
%2 Schroder:1999:CES.pdf
%3 j
%F Schroder:1999:CES
%X The present study addresses the question whether it is in principle feasible to convey emotion in synthesized speech using a restricted parameter set which can usually be controlled in concatenation based synthesizers. Using copy synthesis, the prosodic structure of one sentence uttered with five emotional expressions (anger, joy, fear, sadness, and neutral) was transferred to synthetic stimuli. Perception tests show that for some synthetic stimuli, the high recognition rates for the corresponding natural stimuli are almost reproduced, while for other stimuli the emotional information is lost. In a free association perception test, a tendency towards the perception of the unintended category "disappointment" was found that only varied to a limited extend across stimuli.
Die vorliegende Untersuchung widmet sich der Frage, ob Emotionen prinzipiell mit einem begrenzten Parametersatz vermittelt werden können, wie er üblicherweise in konkatenativer Synthese zur Verfügung steht. Mittels Kopiesynthese wurde die prosodische Struktur eines Satzes, der mit fünf emotionalen Ausdrücken (Wut, Freude, Angst, Traurigkeit, und neutral) produziert worden war, auf synthetische Stimuli übertragen. Perzeptionstests zeigen, daß für manche Stimuli die hohen Erkennungsraten der entsprechenden natürlichen Stimuli nahezu reproduziert werden, während für andere Stimuli die emotionale Information verlorengeht. In einem Perzeptionstest zur freien Assoziation wurde eine Tendenz zur Wahrnehmung der unbeabsichtigten Kategorie ”Enttäuschung” festgestellt, die nur bedingt zwischen den Stimuli variierte.
%U http://www.dfki.de/~schroed/articles/schroeder1999b.pdf


%0 Conference Proceedings
%A Schröder, Marc
%D 2000
%T Experimental Study of Affect Bursts
%E Cowie, Roddy
%E Douglas-Cowie, Ellen
%E Schröder, Marc
%B ISCA Workshop on Speech and Emotion
%C Belfast
%I Textflow
%P 132-137
%! Experimental Study of Affect Bursts
%1 http://www.dfki.de/~schroed/
%2 Schroder:2000:ESA.pdf
%3 j
%F Schroder:2000:ESA
%X The study described here investigates the perceived emotional content of “affect bursts” for German. Affect bursts are defined as short emotional non-speech expressions interrupting speech. This study shows that affect bursts, presented without context, can convey a clearly identifiable emotional meaning. Affect bursts expressing ten emotions were produced by actors. After a pre-selection procedure, “good examples” for each emotion were presented in a perception test. The mean recognition score of 81% indicates that affect bursts seem to be an effective means of expressing emotions. Affect bursts are grouped into classes on the basis of phonetic similarity. Recognition and confusion patterns are examined for these.
classes
%U http://www.dfki.de/~schroed/articles/schroeder2000.pdf


%0 Conference Proceedings
%A Schröder, Marc
%D 2001
%T Emotional Speech Synthesis - A Review
%E Dalsgaard, Paul 
%E Lindberg, Borge 
%E Benner, Henrik
%B Proceedings of the 7th European Conference on Speech Communication and Technology (EUROSPEECH'01)
%C Aalborg
%I Kommunik Grafiske Losninger A/S
%V 1
%P 561-564
%! Emotional Speech Synthesis - A Review
%1 http://www.dfki.de/~schroed/
%2 Schroder:2001:ESS.pdf
%3 j
%F Schroder:2001:ESS
%X Attempts to add emotion effects to synthesised speech have existed for more than a decade now. Several prototypes and fully operational systems have been built based on different synthesis techniques, and quite a number of smaller studies have been conducted. This paper aims to give an overview of what has been done in this field, pointing out the inherent properties of the various synthesis techniques used, summarising the prosody rules employed, and taking a look at the evaluation paradigms. Finally, an attempt is made to discuss interesting directions for future development.
%U http://www.dfki.de/~schroed/articles/schroeder2001.pdf


%0 Conference Proceedings
%A Schröder, Marc
%A Aubergé, Véronique
%A Cathiard, Marie-Agnès
%D 1998
%T Can we hear Smiles?
%B Proceedings of the 5th International Conference of Spoken Language Processing (ICSLP'98)
%C Sydney, Australia
%! Can we hear Smiles?
%1 http://www.dfki.de/~schroed/
%2 Schroder:1998:CWH.pdf
%3 j
%F Schroder:1998:CWH
%X The amusement expression is both visual and audible in speech. After recording comparable spontaneous, acted, mechanical, reiterated and seduction stimuli, five perceptual experiments were held, mainly based on the hypothesis of prosodically controlled effects of amusement on speech. Results show that audio is partially independant from video, which is as performant as audio-video. Spontaneous speech(unvolontary controlled) can be identified in front of acted speech (volontary controlled). Amusement speech can be distinguished from seduction speech.
%U http://www.dfki.de/~schroed/articles/schroederetal1998.pdf


%0 Conference Proceedings
%A Schröder, Marc
%A Cowie, Roddy
%A Douglas-Cowie, Ellen
%A Westerdijk, Machiel
%A Gielen, Stan
%D 2001
%T Acoustic Correlates of Emotion Dimensions in View of Speech Synthesis
%E Dalsgaard, Paul 
%E Lindberg, Borge 
%E Benner, Henrik
%B Proceedings of the 7th European Conference on Speech Communication and Technology (EUROSPEECH'01)
%C Aalborg
%I Kommunik Grafiske Losninger A/S
%V 1
%P 87--90
%! Acoustic Correlates of Emotion Dimensions in View of Speech Synthesis
%1 http://www.dfki.de/~schroed/
%2 Schroder:2001:ACE.pdf
%3 j
%F Schroder:2001:ACE
%X In a database of emotional speech, dimensional descriptions of emotional states have been correlated with acoustic variables. Many stable correlations have been found. The predictions made by linear regression widely agree with the literature. The numerical form of the description and the choice of acoustic variables studied are particularly well suited for future implementation in a speech synthesis system, possibly allowing for the expression of gradual emotional states.
%U http://www.dfki.de/~schroed/articles/schroeder_etal2001.pdf


%0 Conference Proceedings
%A Schröder, Marc
%A Trouvain, Jürgen
%D 2001
%T The German Text-to-Speech Synthesis System MARY: A Tool for Research, Development and Teaching
%B Proceedings of the 4th ISCA Tutorial and Research Workshop on Speech Synthesis, August 29 - September 1
%C Perthshire, Scotland
%P 131-136
%! The German Text-to-Speech Synthesis System MARY: A Tool for Research, Development and Teaching
%2 Schroder:2001:GTS.pdf Schroder:2001:GTS.ps
%3 j
%F Schroder:2001:GTS
%X The German Text-to-Speech Synthesis system Mary is presented. An interface allowing to access and modify intermediate processing steps without the need for a technical understanding of the system is described, along with examples of how this interface can be put to use in research, development and teaching.
%U http://www.ssw4.org/papers/112.pdf


%0 Conference Proceedings
%A Schulte, Christian
%D 1997
%T Programming Constraint Inference Engines
%E Smolka, G.
%B 3rd International Conference on Principles and Practice of Constraint Programming (CP '97), October 29 - November 1
%C Schloß Hagenberg, Austria
%I Springer
%P 519-533
%S Lecture Notes in Computer Science
%7 1330
%! Programming Constraint Inference Engines
%2 Schulte:1997:PCI.pdf Schulte:1997:PCI.ps
%F Schulte:1997:PCI
%X Existing constraint programming systems offer a fixed set of inference engines implementing search strategies such as single, all, and best solution search. This is unfortunate, since new engines cannot be integrated by the user. The paper presents first-class computation spaces as abstractions with which the user can program inference engines at a high level. Using computation spaces, the paper covers several inference engines ranging from standard search strategies to techniques new to constraint programming, including limited discrepancy search, visual search, and saturation. Saturation is an inference method for tautology-checking used in industrial practice. Computation spaces have shown their practicability in the constraint programming system Oz.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Engines.ps.gz


%0 Conference Proceedings
%A Schulte, Christian
%D 1997
%T Oz Explorer: A Visual Constraint Programming Tool
%E Naish, L.
%B 14th International Conference on Logic Programming (ICLP '97), June
%C Leuven, Belgium
%I MIT Press
%P 286-300
%! Oz Explorer: A Visual Constraint Programming Tool
%2 Schulte:1997:OEV.pdf Schulte:1997:OEV.ps
%F Schulte:1997:OEV
%X This paper describes the Oz Explorer and its implementation. The Explorer is a visual constraint programming tool intended to support the development of constraint programs. It uses the search tree of a constraint problem as its central metaphor. Exploration and visualization of the search tree are user-driven and interactive. The constraints of any node in the tree are available first-class: predefined or user-defined procedures can be used to display or analyze them. The Explorer is a fast and memory efficient tool intended for the development of real-world constraint programs. The Explorer is implemented in Oz using first-class computation spaces. There is no fixed search strategy in Oz. Instead, first-class computation spaces allow to program search engines. The Explorer is one particular example of a user-guided search engine. The use of recomputation to trade space for time makes it possible to solve large real-world problems, which would use too much memory otherwise.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Explorer.ps.gz


%0 Conference Proceedings
%A Schulte, Christian
%D 1999
%T Comparing Trailing and Copying for Constraint Programming
%E De Schreye, D.
%B 16th International Conference on Logic Programming (ICLP '99), November 29 - December 4
%C Las Cruces, New Mexico, USA
%I MIT Press
%P 275-289
%! Comparing Trailing and Copying for Constraint Programming
%2 Schulte:1999:CTC.pdf Schulte:1999:CTC.ps
%F Schulte:1999:CTC
%X A central service of a constraint programming system is search. In almost all constraint programming systems search is based on trailing, which is well understood and known to be efficient. This paper compares trailing to copying. Copying offers more expressiveness as required by parallel and concurrent systems. However, little is known how trailing compares to copying as it comes to implementation effort, runtime efficiency, and memory requirements. This paper discusses these issues. Execution speed of a copying-based system is shown to be competitive with state-of-the-art trailing-based systems. For the first time, a detailed analysis and comparison with respect to memory usage is made. It is shown how recomputation decreases memory requirements which can be prohibitive for large problems with copying alone. The paper introduces an adaptive recomputation strategy that is shown to speedup search while keeping memory consumption low. It is demonstrated that copying with recomputation outperforms trailing on large problems with respect to both space and time.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/copying.ps.gz


%0 Conference Proceedings
%A Schulte, Christian
%D 2000
%T Programming Deep Concurrent Constraint Combinators
%E Pontelli, E.
%E Santos Costa, V.
%B Practical Aspects of Declarative Languages, Second International Workshop, PADL 2000, January 17-18
%C Boston, Massachusetts, USA
%I Springer
%P 215-229
%S Lecture Notes in Computer Science
%7 1753
%! Programming Deep Concurrent Constraint Combinators
%2 Schulte:2000:PDC.pdf Schulte:2000:PDC.ps
%F Schulte:2000:PDC
%X Constraint combination methods are essential for a flexible constraint programming system. This paper presents deep concurrent constraint combinators based on computation spaces as combination mechanism. It introduces primitives and techniques needed to program constraint combinators from computation spaces. The paper applies computation spaces to a broad range of combinators: negation, generalized reification, disjunction, and implication. Even though computation spaces have been conceived in the context of Oz, they are mainly programming language independent. This point is stressed by discussing them here in the context of Standard ML with concurrency features.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/combinators.ps.gz


%0 Report
%A Schulte, Christian
%D 2000
%T Parallel Search Made Simple
%C Singapore
%I National University of Singapore, School of Computing
%S Technical Report
%7 TRA9/00
%8 September
%! Parallel Search Made Simple
%2 Schulte:2000:PSM.pdf Schulte:2000:PSM.ps
%F Schulte:2000:PSM
%X Search in constraint programming is a time consuming task. Search can be speeded up by exploring subtrees of a search tree in parallel. This paper presents distributed search engines that achieve parallelism by distribution across networked computers. The main point of the paper is a simple design of the parallel search engine. Simplicity comes as an immediate consequence of clearly separating search, concurrency, and distribution. The obtained distributed search engines are simple yet offer substantial speedup on standard network computers.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/par-trics.ps.gz


%0 Book Section
%A Schulte im Walde, Sabine
%A Schmid, Helmut
%A Rooth, Mats
%A Riezler, Stefan
%A Prescher, Detlef
%D 2001
%T Statistical Grammar Models and Lexicon Acquisition
%B Linguistic Form and its Computation
%C Stanford
%I CSLI Publications
%! Statistical Grammar Models and Lexicon Acquisition
%2 Walde:2001:SGM.pdf
%3 j
%F Walde:2001:SGM
%U http://www.dfki.de/~prescher/papers/bib/2001csli.schulte_im_walde.schmid.rooth.riezler.prescher.pdf


%0 Conference Proceedings
%A Schwenter, Scott A. 
%A Vasishth, Shravan
%D 2000
%T Absolute and Relative Scalar Particles in Spanish and Hindi
%B 26th Berkeley Linguistics Society Conference (BLS 26), February 18-21
%C University of California, Berkeley, USA
%P 225-233
%! Absolute and Relative Scalar Particles in Spanish and Hindi
%2 Schwenter:2000:ARS.pdf
%F Schwenter:2000:ARS
%U ftp://ftp.ling.ohio-state.edu/pub/Students/Vasishth/Published/BLS2000/BLS00paper.pdf


%0 Conference Proceedings
%A Sen, Sandip
%A Durfee, Edmund H.
%D 1992
%T Automated Meeting Scheduling among Heterogeneous Agents
%B AAAI Workshop on Cooperation among Heterogeneous Intelligent Systems, June
%C San Jose, California, USA
%! Automated Meeting Scheduling among Heterogeneous Agents
%F Sen:1992:AMS


%0 Journal Article
%A Shieber, Stuart M.
%A van Noord, Gertjan
%A Pereira, Fernando 
%A Moore, Robert
%D 1990
%T A Semantic-Head-Driven Generation Algorithm for Unification-Based Formalisms
%B Computational Linguistics
%V 16
%N 1
%P 30-42
%! A Semantic-Head-Driven Generation Algorithm for Unification-Based Formalisms
%F Shieber:1990:SHD


%0 Report
%A Siegel, Melanie
%D 1994
%T Definitheit und Numerus. Anforderungen an den Transfer Japanisch-Englisch
%C Bielefeld
%I Universität Bielefeld
%S Verbmobil-Memo
%7 56
%! Definitheit und Numerus. Anforderungen an den Transfer Japanisch-Englisch
%3 j
%F Siegel:1994:DNA


%0 Conference Proceedings
%A Siegel, Melanie
%D 1995
%T Problems of Automatic Translation of Japanese Dialogues into German
%E von Hahn, W.
%E Jekat, S. 
%E Maleck, I.
%B Machine Translation and Machine Interpretation. Proceedings of the VERBMOBIL Workshop at the University of Hamburg, October
%C Hamburg, Germany
%I Computer Science Department, University Hamburg
%! Problems of Automatic Translation of Japanese Dialogues into German
%2 Siegel:1995:PAT.pdf Siegel:1995:PAT.ps
%3 j
%F Siegel:1995:PAT
%U http://www.dfki.de/~siegel/hamburg.ps.gz


%0 Book Section
%A Siegel, Melanie
%D 1996
%T Definiteness and Number in Japanese to German Machine Translation
%E Gibbon, Dafydd
%B Natural Language Processing and Speech Technology
%C Berlin
%I Mouton de Gruyter
%! Definiteness and Number in Japanese to German Machine Translation
%2 Siegel:1996:DNJ.pdf Siegel:1996:DNJ.ps
%3 j
%F Siegel:1996:DNJ
%U http://www.dfki.de/~siegel/konvens.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/konvens.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/konvens.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/konvens.ps.Z


%0 Report
%A Siegel, Melanie
%D 1996
%T Die japanische Syntax im Verbmobil-Forschungsprototypen
%C Saarbrücken
%I DFKI
%S Verbmobil Report
%7 133
%! Die japanische Syntax im Verbmobil-Forschungsprototypen
%2 Siegel:1996:JSIa.pdf Siegel:1996:JSIa.ps
%3 j
%F Siegel:1996:JSIa
%U http://www.dfki.de/~siegel/vm-report.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/vm-report.dvi.Z ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/vm-report.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/vm-report.ps.Z


%0 Conference Proceedings
%A Siegel, Melanie
%D 1996
%T Preferences and Defaults for Definiteness and Number in Japanese to German Machine Translation
%E Park, Byung-Soo 
%E Kim, Jong-Bok
%B Selected Papers from the 11th Pacific Asia Conference on Language, Information and Computation (PACLIC 11), December 20-22
%C Kyung Hee University, Seoul
%! Preferences and Defaults for Definiteness and Number in Japanese to German Machine Translation
%2 Siegel:1996:PDD.pdf Siegel:1996:PDD.ps
%3 j
%F Siegel:1996:PDD
%U http://www.dfki.de/~siegel/paclic.ps.gz


%0 Thesis
%A Siegel, Melanie
%D 1996
%T Die maschinelle Übersetzung aufgabenorientierter japanisch-deutscher Dialoge. Lösungen für Translation Mismatches
%! Die maschinelle Übersetzung aufgabenorientierter japanisch-deutscher Dialoge. Lösungen für Translation Mismatches
%2 Siegel:1996:MUA.pdf Siegel:1996:MUA.ps
%3 j
%F Siegel:1996:MUA
%U http://www.dfki.de/~siegel/diss.ps.gz


%0 Book
%A Siegel, Melanie
%D 1997
%T Die maschinelle Übersetzung aufgabenorientierter japanisch-deutscher Dialoge. Lösungen für Translation Mismatches
%C Berlin
%I Logos Verlag
%! Die maschinelle Übersetzung aufgabenorientierter japanisch-deutscher Dialoge. Lösungen für Translation Mismatches
%3 j
%F Siegel:1997:MUA


%0 Report
%A Siegel, Melanie
%D 1998
%T Japanese Particles in an HPSG Grammar
%C Saarbrücken
%I Universität des Saarlandes
%S Verbmobil Report
%7 220
%! Japanese Particles in an HPSG Grammar
%2 Siegel:1998:JPH.pdf Siegel:1998:JPH.ps
%3 j
%F Siegel:1998:JPH
%U http://www.dfki.de/~siegel/report-220-98.ps.gz


%0 Conference Proceedings
%A Siegel, Melanie
%D 1999
%T The Syntactic Processing of Participles in Japanese Spoken Language
%E Wang, Jhing-Fa 
%E Wu, Chung-Hsien
%B Proceedings of the 13th Pacific Asia Conference on Language, Information and Computation (PACLIC 13), February 10-12
%C Taipei, Taiwan
%! The Syntactic Processing of Participles in Japanese Spoken Language
%2 Siegel:1999:SPP.pdf Siegel:1999:SPP.ps
%3 j
%F Siegel:1999:SPP
%X Particles fullfill several distinct central roles in the Japanese language. They can mark arguments as well as 
adjuncts, can be functional or have semantic funtions. There is, however, no straightforward matching from 
particles to functions, as, e.g., ga can mark the subject, the object or an adjunct of a sentence. Particles 
can cooccur. Verbal arguments that could be identified by particles can be eliminated in the Japanese 
sentence. And finally, in spoken language particles are often omitted. A proper treatment of particles is 
thus necessary to make an analysis of Japanese sentences possible. Our treatment is based on an empirical investigation of 800 dialogues. We set up a type hierarchy of particles motivated by their subcategorizational and modificational behaviour. This type hierarchy is part of the Japanese syntax in VERBMOBIL.
%U http://www.dfki.de/~siegel/paclic99.ps.gz


%0 Book Section
%A Siegel, Melanie
%D 2000
%T HPSG Analysis of Japanese
%E Wahlster, W.
%B Verbmobil: Foundations of Speech-to-Speech Translation
%C Berlin
%I Springer
%P 265-280
%S Artificial Intelligence
%! HPSG Analysis of Japanese
%2 Siegel:2000:HAJ.pdf Siegel:2000:HAJ.ps
%3 j
%F Siegel:2000:HAJ
%U http://www.dfki.de/~siegel/vm-buch.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ms1.entry


%0 Conference Proceedings
%A Siegel, Melanie
%D 2000
%T Japanese Honorification in an HPSG Framework
%E Ikeya, Akira
%E Kawamori, Masahito
%B Proceedings of the 14th Pacific Asia Conference on Language, Information and Computation, February 15-17
%C Tokyo, Japan
%I Waseda University International Conference Center
%P 289-300
%! Japanese Honorification in an HPSG Framework
%2 Siegel:2000:JHH.pdf Siegel:2000:JHH.ps
%3 j
%F Siegel:2000:JHH
%X We present a solution for the representation of Japanese honorificational information in the 
HPSG framework. Basically, there are three dimensions of honorification. We show that a 
treatment is necessary that involves both the syntactic and the contextual level of information. 
The Japanese grammar is part of a machine translation system.
%U http://www.dfki.de/~siegel/paclic2000.ps.gz


%0 Conference Proceedings
%A Siegel, Melanie
%A Bender, Emily M.
%D 2002
%T Efficient Deep Processing of Japanese
%B Proceedings of the 3rd Workshop on Asian Language Resources and International Standardization. COLING 2002 Post-Conference Workshop, August 31
%C Taipei, Taiwan
%! Efficient Deep Processing of Japanese
%2 Siegel:2002:EDP.pdf
%3 j
%F Siegel:2002:EDP
%X We present a broad coverage Japanese grammar written in the HPSG formalism with MRS semantics. The grammar is created for use in real world applications, such that robustness and performance issues play an important role. It is connected to a POS tagging and word segmentation tool. This grammar is being developed in a multilingual context, requiring MRS structures that are easily comparable across languages.
%U http://arxiv.org/pdf/cs.CL/0207005.pdf


%0 Report
%A Siegel, Melanie
%A Kuroda, Hideko
%A Kudo, Eri
%D 1993
%T Dialogdaten: Terminplanung japanisch-deutsch
%C Bielefeld
%I Universität Bielefeld
%S Arbeitsberichte Computerlinguistik
%7 2-93
%! Dialogdaten: Terminplanung japanisch-deutsch
%3 j
%F Siegel:1993:DTJ


%0 Report
%A Siegel, Melanie
%A Metzing, Dieter
%D 1993
%T Dialogdolmetschen. Eine Pilotstudie zu aufgabenorientierten Dialogen (Terminabsprachen) Japanisch-Deutsch
%C Bielefeld
%I Universität Bielefeld
%S Arbeitsberichte Computerlinguistik
%7 2-93
%! Dialogdolmetschen. Eine Pilotstudie zu aufgabenorientierten Dialogen (Terminabsprachen) Japanisch-Deutsch
%3 j
%F Siegel:1993:DPA


%0 Book Section
%A Siegel, Melanie
%A Metzing, Dieter
%D 1993
%T Rekonstruktion von Verfahren der Textproduktion
%E Rickheit, G.
%B Modellierung von Sprachverarbeitung in Texten und Diskursen
%C Opladen
%I Westdeutscher Verlag
%! Rekonstruktion von Verfahren der Textproduktion
%3 j
%F Siegel:1993:RVT


%0 Report
%A Siegel, Melanie
%A Metzing, Dieter
%D 1994
%T Nullpronomina und die Organisation von Wissensquellen für den Transfer Japanisch - Englisch
%C Bielefeld
%I Universität Bielefeld
%S Verbmobil Memo
%7 12
%! Nullpronomina und die Organisation von Wissensquellen für den Transfer Japanisch - Englisch
%3 j
%F Siegel:1994:NOW


%0 Conference Proceedings
%A Siegel, Melanie
%A Scherf, Oliver
%D 2000
%T Morphological Parsing of Japanese
%B Conference Handbook of the 2nd International Conference on Practical Linguistics of Japanese
%C San Francisco State University, USA
%P 116-117
%! Morphological Parsing of Japanese
%1 Siegel:2000:MPJ.pdf Siegel:2000:MPJ.ps
%3 j
%F Siegel:2000:MPJ
%U http://www.dfki.de/~siegel/icplj.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ms2.entry


%0 Book Section
%A Siegel, Melanie
%A Scherf, Oliver
%D 2001
%T Nihongo Keitaiso Kaiseki (Analysis of Japanese Morphology)
%B Gengogaku to Nihongo Kyooiku -Jitsuyooteki Gengo Kenkyuu no Koochiku o Mezashite (Linguistics and Japanese Language Education - Aiming at Constructing Practical Theoies of Linguistics)
%C Tokyo, Japan
%I Kurosio Shuppan
%! Nihongo Keitaiso Kaiseki (Analysis of Japanese Morphology)
%2 Siegel:2001:NKK.pdf
%3 j
%F Siegel:2001:NKK
%U http://www.dfki.de/~siegel/jap-mor.doc


%0 Conference Proceedings
%A Siegel, Melanie
%A Xu, Feiyu
%A Neumann, Günter
%D 2001
%T Customizing GermaNet for the Use in Deep Linguistic Processing
%B Workshop on WordNet and Other Lexical Resources: Applications, Extensions and Customizations. 2nd Meeting of the North American Chapter of the Association for Computational Linguistics (NAACL '01), June 2-7
%C Pittsburgh, Philadelphia, USA
%P 165-167
%! Customizing GermaNet for the Use in Deep Linguistic Processing
%2 Siegel:2001:CGU.pdf
%3 j
%F Siegel:2001:CGU
%U http://www.dfki.de/~siegel/short-Naacl2001.doc http://www.dfki.uni-sb.de/~feiyu/NAACL2001.pdf


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


%0 Master's Thesis
%A Skut, Wojciech
%D 1995
%T Underspecification-Based Representation of Noun Phrase Semantics
%C Saarbrücken
%I Universität des Saarlandes, Department of Computational Linguistics
%! Underspecification-Based Representation of Noun Phrase Semantics
%F Skut:1995:UBR


%0 Conference Proceedings
%A Skut, Wojciech
%D 1996
%T Adjuncts, Ambiguity, Phrase Structure and Scope
%B 3rd International Conference on HPSG. Abstracts. May 20-22
%C Marseille, France
%! Adjuncts, Ambiguity, Phrase Structure and Scope
%F Skut:1996:AAP


%0 Conference Proceedings
%A Skut, Wojciech
%D 1996
%T Finite Automata for Processing Word Order
%B Workshop on Extended Finite State Models of Language (ECAI '96), August 12-16
%C Budapest, Hungary
%I von Neumann Society of Computer Science
%! Finite Automata for Processing Word Order
%3 j
%F Skut:1996:FAP


%0 Thesis
%A Skut, Wojciech
%D 1999
%T Partial Parsing for Corpus Annotation and Text Processing
%C Saarbrücken
%I Universität des Saarlandes
%! Partial Parsing for Corpus Annotation and Text Processing
%F Skut:1999:PPC


%0 Conference Proceedings
%A Skut, Wojciech
%A Brants, Thorsten
%D 1998
%T A Maximum-Entropy Partial Parser for Unrestricted Text
%B 6th Workshop on Very Large Corpora, August 15-16
%C Montreal, Canada
%P 143-151
%! A Maximum-Entropy Partial Parser for Unrestricted Text
%2 Skut:1998:MEP.pdf
%F Skut:1998:MEP
%X This paper describes a partial parser that assigns syntactic structures to sequences of part-of-speech tags. The program uses the maximum entropy parameter estimation method, which allows a flexible combination of different knowledge sources: the hierarchical structure, parts of speech and phrasal categories. In effect, the parser goes beyond simple bracketing and recognises even fairly complex structures. We give accuracy figures for different applications of the parser.
%U http://www.coli.uni-sb.de/~thorsten/wvlc98/


%0 Conference Proceedings
%A Skut, Wojciech
%A Brants, Thorsten
%D 1998
%T Chunk Tagger - Statistical Recognition of Noun Phrases
%B ESSLLI Workshop on Automated Acquisition of Syntax and Parsing, August 17-28
%C Saarbrücken, Germany
%! Chunk Tagger - Statistical Recognition of Noun Phrases
%2 Skut:1998:CTS.pdf
%F Skut:1998:CTS
%X We describe a stochastic approach to partial parsing, i.e., the recognition of syntactic structures of limited depth. The technique utilises Markov Models, but goes beyond usual bracketing approaches, since it is capable of recognising not only the boundaries, but also the internal structure and syntactic category of simple as well as complex NP's, PP's, AP's and adverbials. We compare tagging accuracy for different applications and encoding schemes.
%U http://www.coli.uni-sb.de/~thorsten/esslli98-parsing/


%0 Conference Proceedings
%A Skut, Wojciech
%A Brants, Thorsten
%A Krenn, Brigitte
%A Uszkoreit, Hans
%D 1997
%T Annotating Unrestricted German Text
%B 6. Fachtagung der Sektion Computerlinguistik der Deutschen Gesellschaft für Sprachwissenschaft (DGfS/CL 97), 8.-10. Oktober
%C Heidelberg, Germany
%! Annotating Unrestricted German Text
%2 Skut:1997:AUG.pdf Skut:1997:AUG.ps
%3 j
%F Skut:1997:AUG
%U http://www.coli.uni-sb.de/~thorsten/publications/Skut-ea-DGfS97.pdf http://www.coli.uni-sb.de/~thorsten/publications/Skut-ea-DGfS97.ps.gz


%0 Conference Proceedings
%A Skut, Wojciech
%A Brants, Thorsten
%A Krenn, Brigitte
%A Uszkoreit, Hans
%D 1998
%T A Linguistically Interpreted Corpus of German Newspaper Text
%E Krenn, Brigitte
%E Brants, Thorsten
%E Skut, Wojciech
%E Uszkoreit, Hans
%B Proceedings of the 10th European Summer School in Logic, Language and Information (ESSLLI'98). Workshop on Recent Advances in Corpus Annotation, August 17-28
%C Saarbrücken, Germany
%! A Linguistically Interpreted Corpus of German Newspaper Text
%2 Skut:1998:LIC.pdf Skut:1998:LIC.ps
%3 j
%F Skut:1998:LIC
%X In this paper, we report on the development of an annotation scheme an annotation tools for unrestricted German text. Our representation format is based on argument structure, but also permits the extraction of other kinds of representations. We discuss several methodological issues and the analysis of some phenomena. Additional focus is on the tools developed in our project and their applications.
%U http://www.coli.uni-sb.de/~thorsten/publications/Skut-ea-ESSLLI-Corpus98.pdf http://www.coli.uni-sb.de/~thorsten/publications/Skut-ea-ESSLLI-Corpus98.ps.gz http://www.dfki.de/dfkibib/publications/docs/Krenn_1998_RACA


%0 Conference Proceedings
%A Skut, Wojciech
%A Krenn, Brigitte
%A Brants, Thorsten
%A Uszkoreit, Hans
%D 1997
%T An Annotation Scheme for Free Word Order Languages
%E Jacobs, Paul
%B Proceedings of the 5th Conference on Applied Natural Language Processing (ANLP'97), March 31 - April 3
%C Washington D.C., USA
%I Morgan Kaufmann Publishers
%! An Annotation Scheme for Free Word Order Languages
%2 Skut:1997:ASF.pdf Skut:1997:ASF.ps
%3 j
%F Skut:1997:ASF
%X We describe an annotation scheme and a tool developed for creating linguistically annotated corpora for non-configurational languages. Since the requirements for such a formalism differ from those posited for configurational languages, several features have been added, influencing the architecture of the scheme. The resulting scheme reflects a stratificational notion of language, and makes only minimal assumptions about the interrelation of the particular representational strata.
%U http://www.coli.uni-sb.de/~thorsten/publications/Skut-ea-ANLP97.pdf http://www.coli.uni-sb.de/~thorsten/publications/Skut-ea-ANLP97.ps.gz


%0 Conference Proceedings
%A Skut, Wojciech
%A Weiß, Christian
%D 1996
%T Modelling Focus Projection with Finite State Automata
%B 3rd International Conference on HPSG and Traitement Automatique du Langage Naturel (TALN '96), May 22-24
%C Marseille, France
%! Modelling Focus Projection with Finite State Automata
%F Skut:1996:MFP


%0 Journal Article
%A Smolka, Gert
%D 1996
%T Problem Solving with Constraints and Programming
%B ACM Computing Surveys
%V 28
%N 4
%! Problem Solving with Constraints and Programming
%2 Smolka:1996:PSC.pdf Smolka:1996:PSC.ps
%F Smolka:1996:PSC
%X I sketch a general model of constraint-based problem solving that is not committed to a particular programming paradigm, show that Prolog in particular and logic programming in general do not provide a satisfactory framework for constraint programming, and outline how constraint programming is realized in Oz, a general-purpose language for symbolic processing.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/ACM_Surveys_96.ps.gz


%0 Book Section
%A Smolka, Gert
%D 1998
%T Concurrent Constraint Programming Based on Functional Programming
%E Hankin, Chris
%B Programming Languages and Systems
%C Lisbon
%I Springer
%V 1381
%P 1-11
%S Lecture Notes in Computer Science
%! Concurrent Constraint Programming Based on Functional Programming
%2 Smolka:1998:CCP.pdf Smolka:1998:CCP.ps
%F Smolka:1998:CCP
%X We show how the operational features of logic programming can be added as conservative extensions to a functional base language with call by value semantics. We will address both concurrent and constraint logic programming. As base language we will use a dynamically typed language that is obtained from SML by eliminating type declarations and static type checking. Our approach can be extended to cover all features of Oz. The experience with the development of Oz tells us that the outlined approach is the right base for the practical development of concurrent constraint programming languages. It avoids unnecessary duplication of concepts by reusing functional programming as core technology. Of course, it does not unify the partly incompatible theories behind functional and logic programming. They both contribute at a higher level of abstraction to the understanding of different aspects of the class of programming languages proposed here.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Smolka-Oz-SML-98.ps.gz


%0 Master's Thesis
%A Spackman, Stephen P.
%D 1992
%T Images of Type
%B Computer Science
%C River Forest
%I Concordia University
%! Images of Type
%F Spackman:1992:IT


%0 Conference Proceedings
%A Staab, Steffen
%A Braun, Christian
%A Bruder, Ilvio
%A Düsterhöft, Antje
%A Heuer, Andreas
%A Klettke, Meike
%A Neumann, Günter
%A Prager, Bernd 
%A Petzel, Jan
%A Schnurr, Hans-Peter
%A Studer, Rudi
%A Uszkoreit, Hans
%A Wrenger, Burkhard
%D 1999
%T GETESS - Searching the Web Exploiting German Texts
%E Klusch, Matthias
%E Shehory, Onn
%E Weiß, Gerhard
%B Proceedings of the 3rd International Workshop on Cooperative Information Agents (CIA'99), July 31 - August 2
%C Uppsala, Sweden
%I Springer
%P 113-124
%S Lecture Notes in Artificial Intelligence
%7 1652
%! GETESS - Searching the Web Exploiting German Texts
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/cia99.entry
%2 Staab:1999:GSWa.pdf Staab:1999:GSWa.ps
%3 j
%F Staab:1999:GSWa
%X We present an intelligent information agent that uses semantic methods and natural language processing capabilites in order to gather tourist information from theWWWand present it to the human user in an intuitive, user-friendly way. Thereby, the information agent is designed such that as background knowledge
and linguistic coverage increase, its benefits improve, while it guarantees state-of-the-art information and database retrieval capabilities as its bottom line.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/cia99.ps.gz


%0 Conference Proceedings
%A Staab, Steffen
%A Braun, Christian
%A Bruder, Ilvio
%A Düsterhöft, Antje
%A Heuer, Andreas
%A Klettke, Meike
%A Neumann, Günter
%A Prager, Bernd 
%A Petzel, Jan
%A Schnurr, Hans-Peter
%A Studer, Rudi
%A Uszkoreit, Hans
%A Wrenger, Burkhard
%D 1999
%T A System for Facilitating and Enhancing Web Search
%B Proceedings of the 5th International Work-Conference on Artificial and Natural Neural Networks (IWANN'99), June 2-4
%C Alicante, Spain
%I Springer
%! A System for Facilitating and Enhancing Web Search
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/iwann99.entry
%2 Staab:1999:SFEa.pdf Staab:1999:SFEa.ps
%3 j
%F Staab:1999:SFEa
%X We present a system that uses semantic methods and natural language processing capabilites in order to provide comprehensive and easy-to-use access to tourist information in the WWW. Thereby, the system is designed such that as background knowledge and linguistic coverage increase, the benefits of the system improve, while it guarantees state-of-the-art information and database retrieval capabilities as its bottom line.
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/iwann99.ps.gz


%0 Conference Proceedings
%A Staab, Steffen
%A Braun, Christian
%A Bruder, Ilvio
%A Düsterhöft, Antje
%A Heuer, Andreas
%A Klettke, Meike 
%A Neumann, Günter
%A Prager, Bernd
%A Pretzel, Jan
%A Schnurr, Hans-Peter
%A Studer, Rudi
%A Uszkoreit, Hans
%A Wrenger, Burkhard
%D 1999
%T A System for Facilitating and Enhancing Web Search
%B 5th International Work-Conference on Artificial and Natural Neural Networks (IWANN '99), June 2-4
%C Alicante, Spain
%I Springer
%! A System for Facilitating and Enhancing Web Search
%2 Staab:1999:SFE.pdf Staab:1999:SFE.ps
%3 j
%F Staab:1999:SFE
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/iwann99.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/iwann99.entry


%0 Conference Proceedings
%A Staab, Steffen
%A Braun, Christian
%A Bruder, Ilvio
%A Düsterhöft, Antje
%A Heuer, Andreas
%A Klettke, Meike
%A Neumann, Günter
%A Prager, Bernd
%A Pretzel, Jan
%A Schnurr, Hans-Peter
%A Studer, Rudi
%A Uszkoreit, Hans
%A Wrenger, Burkhard
%D 1999
%T GETESS - Searching the Web Exploiting German Texts
%E Klusch, M.
%E Shehory, O. M.
%E Weiss, G.
%B 3rd International Workshop on Cooperative Information Agents (CIA '99), July 31 - August 2
%C Uppsala, Sweden
%I Springer
%P 113-124
%S Lecture Notes in Artificial Intelligence
%7 1652
%! GETESS - Searching the Web Exploiting German Texts
%2 Staab:1999:GSW.pdf Staab:1999:GSW.ps
%3 j
%F Staab:1999:GSW
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/cia99.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/cia99.entry


%0 Conference Proceedings
%A Steedman, Mark
%A Kruijff-Korbayová, Ivana
%D 2001
%T Introduction: Two dimensions of Information Structure in Relation to Discourse Structure and Discourse Semantics
%E Kruijff-Korbayová, Ivana
%E Steedman, Mark
%B Information Structure, Discourse Structure and Discourse Semantics, ESSLLI 2001 Workshop Proceedings, August 20-24
%C Helsinki, Finland
%I The University of Helsinki
%P 1-6
%! Introduction: Two dimensions of Information Structure in Relation to Discourse Structure and Discourse Semantics
%2 Steedman:2001:ITD.pdf
%F Steedman:2001:ITD
%U http://www.coli.uni-sb.de/~korbay/esslli01-wsh/Proceedings/proc-for-cdrom.pdf


%0 Conference Proceedings
%A Steingrimsson, P.
%A Markussen, B.
%A Andersen, Ove
%A Dalsgaard, Paul
%A Barry, William J.
%D 1995
%T From Acoustic Signal to Phonetic Features: A Dynamically Constrained Self-Organising Neural Network
%B 13th International Congress of Phonetic Sciences (ICPhS), August 13-19
%C Stockholm, Sweden
%V 4
%P 316-319
%! From Acoustic Signal to Phonetic Features: A Dynamically Constrained Self-Organising Neural Network
%F Steingrimsson:1995:ASP


%0 Edited Book
%A Stichweh, Rudolf
%A Reyer, Heinz-Ulrich
%A Uszkoreit, Hans
%D 1999
%T Memorandum zu einem Institut für Evolutionswissenschaft. Suchprozesse für innovative Fragestellungen in der Wissenschaft
%C Bad Homburg
%I Werner Reimers Stiftung
%V 1
%! Memorandum zu einem Institut für Evolutionswissenschaft. Suchprozesse für innovative Fragestellungen in der Wissenschaft
%2 Stichweh:1999:MEI.pdf
%3 j
%F Stichweh:1999:MEI
%X Zwei große Lücken stellen die Autoren in der gegenwärtigen Forschungslandschaft fest: 1. Es fehlt eine transdisziplinäre allgemeine Evolutionstheorie. 2. Es fehlen laterale Verknüpfungen unter den beteiligten Disziplinen. Alle genannten Disziplinen stehen in mehr oder weniger engen Beziehungen zur Evolutionsbiologie. Die Forschungsansätze in den einzelnen Disziplinen sind jedoch voneinander isoliert, so daß Querverbindungen fehlen und beispielsweise die wechselseitigen Anregungen zwischen evolutionären Kulturtheorien und evolutionärer Ökonomie minimal sind. Das vorgeschlagene Institut für Evolutionswissenschaft soll daher 1. eine transdisziplinäre allgemeine Evolutionstheorie oder allgemeine Selektionstheorie entwickeln. 2. Die Theorie- und Modellbildung in den einzelnen Disziplinen vorantreiben, um auf diese Weise die Anregungs- und Lernchancen interdisziplinären Kontakts zu optimieren.
%U http://www.reimers-stiftung.de/suchprozesse/heft1.doc


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


%0 Conference Proceedings
%A Striegnitz, Kristina
%D 2001
%T Model Checking for Contextual Reasoning in NLG
%E Blackburn, Patrick
%E Kohlhase, Michael
%B Proceedings of Inference in Computational Semantics (ICoS-3), June 18-23
%C Siena, Italy
%P 101-115
%! Model Checking for Contextual Reasoning in NLG
%2 Striegnitz:2001:MCC.pdf Striegnitz:2001:MCC.ps
%F Striegnitz:2001:MCC
%X Presupposition triggers, such as e.g. 'the', 'too', 'another', impose constraints on the context they are used in. A violation of these constraints results in an infelicitous utterance. A natural language generation system therefore has to reason on the context to check that they are satisfied. We argue that this kind of contextual reasoning is essentially a model checking task and demonstrate this for a variety of presupposition triggers. To account for the influence of some background knowledge, we propose to embed queries to a description logic knowledge base in a first order model checking algorithm.
%U http://www.coli.uni-sb.de/cl/projects/indigen/papers/icos3.ps.gz


%0 Edited Proceedings
%A Striegnitz, Kristina
%D 2001
%T Proceedings of the ESSLLI'01 Student Session, August 13-24
%C Helsinki, Finland
%! Proceedings of the ESSLLI'01 Student Session, August 13-24
%2 Striegnitz:2001:PES.pdf Striegnitz:2001:PES.ps
%F Striegnitz:2001:PES
%U http://www.coli.uni-sb.de/~kris/esslli/proc.ps.gz


%0 Conference Proceedings
%A Strom, Volker
%A Elsner, Aanja
%A Hess, Wolfgang
%A Kasper, Walter
%A Klein, Alexandra
%A Krieger, Hans-Ulrich
%A Spilker, Jörg
%A Weber, Hans
%A Görz, Günther
%D 1997
%T On the Use of Prosody in a Speech-to-Speech Translator
%B Proceedings of the 5th Biennial European Conference on Speech Communication and Technology (Eurospeech'97), September 22-25
%C Rhodes, Greece
%P 1479-1482
%! On the Use of Prosody in a Speech-to-Speech Translator
%1 ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/eurospeech97.entry
%2 Strom:1997:UPS.ps
%3 j
%F Strom:1997:UPS
%X 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.
%U 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


%0 Book Section
%A Strzalkowski, Tomek
%D 1994
%T A General Computational Method for Grammar Inversion
%E Strzalkowski, T.
%B Reversible Grammars in Natural Language Processing
%C Dordrecht
%I Kluwer Academic Publishers
%P 175-200
%! A General Computational Method for Grammar Inversion
%F Strzalkowski:1994:GCM


%0 Journal Article
%A Sturt, Patrick
%A Pickering, Martin
%A Crocker, Matthew
%D 2000
%T Search Strategies in Syntactic Reanalysis
%B Journal of Psycholinguistic Research
%V 29
%N 2
%P 183-194
%! Search Strategies in Syntactic Reanalysis
%F Sturt:2000:SSS


%0 Journal Article
%A Sturt, Patrick
%A Pickering, Martin J.
%A Scheepers, Christoph
%A Crocker, Matthew W.
%D 2001
%T The Preservation of Structure in Language Comprehension: Is Reanalysis the last Resort?
%B Journal of Memory and Language
%V 45
%P 283-307
%! The Preservation of Structure in Language Comprehension: Is Reanalysis the last Resort?
%F Sturt:2001:PSL


%0 Conference Proceedings
%A Sturt, Patrick
%A Scheepers, Christoph
%A Pickering, Martin
%A Crocker, Matthew
%D 2000
%T The Interaction of Structure Preservation and Recency in First- and Second-Pass Ambiguity Resolution
%B 6th Conference on Architectures and Mechanisms for Language Processing (AMLaP-2000), September 20-23
%C Leiden, The Netherlands
%! The Interaction of Structure Preservation and Recency in First- and Second-Pass Ambiguity Resolution
%F Sturt:2000:ISP


%0 Journal Article
%A Sturt, Patrick
%A Scheepers, Christoph
%A Pickering, Martin J.
%D 2002
%T Syntactic Ambiguity Resolution after Initial Misanalysis: The Role of Recency
%B Journal of Memory and Language
%V 46
%P 371-390
%! Syntactic Ambiguity Resolution after Initial Misanalysis: The Role of Recency
%F Sturt:2002:SAR


%0 Conference Proceedings
%A Teich, Elke
%A Hansen, Silvia
%D 2001
%T Towards an integrated representation of multiple layers of linguistic annotation in multilingual corpora
%B Online Proceedings of Computing Arts 2001: Digital Resources for Research in the Humanities, September 26-28
%C Sydney, Australia
%! Towards an integrated representation of multiple layers of linguistic annotation in multilingual corpora
%2 Teich:2001:TIR.pdf
%F Teich:2001:TIR
%U http://www.coli.uni-sb.de/~hansen/hansen_teich.pdf


%0 Conference Proceedings
%A Teich, Elke
%A Hansen, Silvia
%A Fankhauser, Peter
%D 2001
%T Representing and querying multi-layer annotated corpora
%E Bird, Steven
%E Buneman, Peter
%E Liberman, Mark
%B Proceedings of IRCS Workshop on Linguistic Databases 2001, December 11-13
%C University of Pennsylvania, Philadelphia, USA
%! Representing and querying multi-layer annotated corpora
%2 Teich:2001:RQM.pdf
%F Teich:2001:RQM
%X The goal of the present paper is to review the methods employed in multi-layer corpus representation and querying and to identify the more fundamental issues involved in the task. Asking questions such as: What are the linguistic requirements on multi-layer corpora? Do the data structures commonly employed mirror the needs of linguistic representation appropriately? Should different layers of annotation be kept separate, or should and can they be merged? How and at which granularity can we align/integrate multiple layers of annotation? If expressively more powerful data structures than trees/forests are required, then what kinds of mechanisms are needed to query such data structures?, we propose an XML-based approach to the representation and querying of multi-layer corpora.
%U http://www.coli.uni-sb.de/~hansen/teich-etal.pdf


%0 Journal Article
%A ter Stal, W. G.
%A Beijert, J.-H.
%A de Bruin, G.
%A van Gent, J.
%A de Jong, F.
%A Kraaij, W.
%A Netter, K. 
%A Smart, G.
%D 1998
%T Twenty-One: Cross-Language Disclosure and Retrieval of Multimedia Documents on Sustainable Development
%B Computer Networks and ISDN Systems
%V 30
%N 13
%P 1237-1248
%! Twenty-One: Cross-Language Disclosure and Retrieval of Multimedia Documents on Sustainable Development
%2 Stal:1998:TOC.pdf Stal:1998:TOC.ps
%3 j
%F Stal:1998:TOC
%U ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/twentyone97.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/twentyone97.entry


%0 Conference Proceedings
%A Thalmann, Lars
%A Samuelsson, Christer
%D 1995
%T A Uniform Framework for Grammar Induction and Robust Parsing
%B 5th Scandinavian Conference on Artificial Intelligence, (SCAI '95), May
%C Trondheim, Norway
%! A Uniform Framework for Grammar Induction and Robust Parsing
%F Thalmann:1995:UFG


%0 Journal Article
%A Traum, David
%A Hinkelman, Elizabeth
%D 1992
%T Conversation Acts in Task-Oriented Spoken Dialogue
%B Computational Intelligence
%V 8
%N 3
%P 579-599
%! Conversation Acts in Task-Oriented Spoken Dialogue
%2 Traum:1992:CAT.pdf Traum:1992:CAT.ps
%3 j
%F Traum:1992:CAT
%U http://www.cs.tufts.edu/~elizh/ci-single.ps


%0 Report
%A Traum, David
%A Hinkelman, Elizabeth
%D 1993
%T Conversation Acts in Task-Oriented Spoken Dialogue
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-93-32
%! Conversation Acts in Task-Oriented Spoken Dialogue
%2 Traum:1993:CAT.pdf Traum:1993:CAT.ps
%3 j
%F Traum:1993:CAT
%U http://www.cs.tufts.edu/~elizh/ci-single.ps


%0 Conference Proceedings
%A Trost, Harald
%D 1990
%T The Application of Two-Level Morphology to Non-Concatenative German Morphology
%E Karlgren, Hans
%B Proceedings of the13th International Conference on Computational Linguistics (COLING '90), August 20-25
%C Helsinki, Finland
%V 2
%P 371-376
%! The Application of Two-Level Morphology to Non-Concatenative German Morphology
%3 j
%F Trost:1990:ATLa


%0 Report
%A Trost, Harald
%D 1990
%T The Application of Two-Level Morphology to Non-Concatenative German Morphology
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-90-15
%! The Application of Two-Level Morphology to Non-Concatenative German Morphology
%2 Trost:1990:ATLb.pdf Trost:1990:ATLb.ps
%3 j
%F Trost:1990:ATLb
%U ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1990/RR-90-15.ps.gz


%0 Report
%A Trost, Harald
%D 1991
%T X2MORF: A Morphological Component Based on Augmented Two-Level Morphology
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-91-04
%! X2MORF: A Morphological Component Based on Augmented Two-Level Morphology
%2 Trost:1991:XMCa.pdf Trost:1991:XMCa.ps
%3 j
%F Trost:1991:XMCa
%U ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1991/RR-91-04.ps.gz


%0 Journal Article
%A Trost, Harald
%D 1991
%T A Morphological Component for the Recognition and Generation of Word Forms in Natural Language Understanding Systems: Integrating Two-Level Morphology and Feature Unification
%B Applied Artificial Intelligence
%V 4
%N 4
%P 411-457
%! A Morphological Component for the Recognition and Generation of Word Forms in Natural Language Understanding Systems: Integrating Two-Level Morphology and Feature Unification
%3 j
%F Trost:1991:MCR


%0 Conference Proceedings
%A Trost, Harald
%D 1991
%T X2MORF: A Morphological Component Based on Augmented Two-Level Morphology
%E Mylopoulos, John
%E Reiter, Raymond
%B Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI '91), August 24-30
%C Sydney, Australia
%I Morgan Kaufmann Publishers
%V 2
%P 1024-1030
%! X2MORF: A Morphological Component Based on Augmented Two-Level Morphology
%3 j
%F Trost:1991:XMCb


%0 Journal Article
%A Trost, Harald
%D 1991
%T Recogniton and Generation of Word Forms for Natural Language Understanding Systems: Integrating Two-Level Morphology and Feature Unification
%B Applied Artificial Intelligence
%V 4
%N 4
%P 411-457
%! Recogniton and Generation of Word Forms for Natural Language Understanding Systems: Integrating Two-Level Morphology and Feature Unification
%2 Trost:1991:RGW.pdf
%3 j
%F Trost:1991:RGW
%X A language-independent morphological component for the recognition and generation of word forms is presented. Based on a lexicon of morphs, the approach combines two-level morphology and a feature-based unification grammar describing word formation. To overcome the heavy use of diacritics, feature structures are associated with the two-level rules. These feature structures function as filters for the application of the rules. That way information contained in the lexicon and the morphological grammar can guide the application of the two-level rules. Moreover, information can be transmitted from the two-level part to the grammar part. This approach allows for a natural description of some nonconcatenative morphological phenomena as well as morphonological phenomena that are restricted to certain word classes in their applicability. The approach is applied to German inflectional and derivational morphology. The component may easily be incorporated into natural language understanding systems and can be especially useful in medical, scientific, or technical languages where it can be used for the automatic processing of compound words.
%U http://www.dfki.de/dfkibib/publications/docs/Trost_1991_RGWFVLUS.pdf


%0 Journal Article
%A Trouvain, Jürgen
%D 1999
%T Phonological Aspects of Reading Rate Strategies
%B PHONUS
%C Universität des Saarlandes, Phonetik, Saarbrücken
%V 4
%P 15-35
%! Phonological Aspects of Reading Rate Strategies
%2 Trouvain:1999:PAR.pdf Trouvain:1999:PAR.ps
%F Trouvain:1999:PAR
%X This paper deals with the effect of tempo on phonological structure. In two production experiments, German speakers were asked to read texts at three self-selected rates, "normal", "fast", and "slow". Different speaker strategies were inspected in terms of pausing, phrasing, pitch accent structure and segmental reductions. The first aim of the study is to describe the reorganisation of the pho-nological structure as a function of the three speech rate categories. The second goal is to discuss the strategies used in speaking faster and slower than normal, considering in particular the homogeneity among speakers and the symmetry within speakers. The differences found between and within speakers provide a basis for modelling individual tempo profiles at the phonological level, which could be exploited e.g. for the synthesis of individual voices and speaking styles.


%0 Conference Proceedings
%A Trouvain, Jürgen
%D 2001
%T Phonetic Aspects of "Speech-Laughs"
%B Conference on Orality & Gestuality (ORAGE), June 18-22
%C Aix-en-Provence, France
%P 634-639
%! Phonetic Aspects of "Speech-Laughs"
%2 Trouvain:2001:PAS.pdf Trouvain:2001:PAS.ps
%F Trouvain:2001:PAS
%X This study examines laughter co-occurring speech, so-called "speech-laughs" in a corpus of German spontaneous dialogues. Against a common expectation the majority of labelled laughs are speech-laughs. The phonetic characteristics for this type of laughter is an additional aspiration (different for voiced and unvoiced sounds) which is sometimes accompanied by a vibrato voice quality and a duration of two syllables. In a perception test the hypothesis of an acoustic continuum from smile to laugh has been rejected. The results and the problems are discussed in the context of paralinguistic phonetics.


%0 Conference Proceedings
%A Trouvain, Jürgen
%A Barry, William J.
%D 2000
%T The Prosody of Excitement in Horse Race Commentaries
%B ISCA-Workshop on "Speech and Emotion": A Conceptual Framework for Research, September 5-7
%C Belfast, Northern Ireland
%P 86-91
%! The Prosody of Excitement in Horse Race Commentaries
%2 Trouvain:2000:PEH.pdf Trouvain:2000:PEH.ps
%F Trouvain:2000:PEH
%X This study investigates examples of horse race commentaries and compares the acoustic properties with an auditorily based description of the typical suspense pattern from calm to very excited at the finish and relaxation after the finish. With the exception of tempo, the auditory impressions were basically confirmed. The examination shows further that the results of the investigated prosodic parameters pause duration, pausing and breathing rate, F0 level and range, intensity, and spectral tilt fit well with other forms of excitement such as anger or elation. Additionally, it is discussed how the specific speaking style of horse race commentators can be classified. Finally, the role of prosodic descriptions for modelling those speaking styles and emotions, especially for speech technology, is considered.
%U http://www.qub.ac.uk/en/isca/proceedings/pdfs/trouvain.pdf


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


%0 Conference Proceedings
%A Trouvain, Jürgen
%A Grice, Martine
%D 1999
%T The Effect of Tempo on Prosodic Structure
%B 14th International Congress of Phonetic Sciences (ICPhS), August 1-7
%C San Francisco, USA
%P 1067-1070
%! The Effect of Tempo on Prosodic Structure
%2 Trouvain:1999:ETP.pdf Trouvain:1999:ETP.ps
%F Trouvain:1999:ETP
%X This study investigates the effect of tempo on prosodic structuring at both temporal and melodic levels. Readings of a German text are examined to ascertain to what extent changes in pausing, prosodic phrasing, pitch accent structure and F0 realisations contribute towards strategies for speaking at a faster or slower speed than normal. Furthermore, speeding up strategies are compared to those for slowing down, to investigate how far the speakers' behaviour is symmetrical with respect to each of the parameters examined.


%0 Conference Proceedings
%A Trouvain, Jürgen
%A Koreman, Jacques
%A Erriquez, Attilio
%A Braun, Bettina
%D 2001
%T Articulation Rate Measures and their Relations to Phone Classification of
  Spontaneous and Read German Speech
%B ISCA Workshop on ``Adaptation Methods for Speech Recognition'', August 29-30
%C Sophia Antipolis, France
%P 150-158
%! Articulation Rate Measures and their Relations to Phone Classification of
  Spontaneous and Read German Speech
%2 Trouvain:2001:ARM.pdf
  Trouvain:2001:ARM.ps
%F Trouvain:2001:ARM
%X This paper evaluates articulation rate measures and rate characteristics of
  read and spontaneous speech on the basis of a manually labelled database for
  German. The results of phone classification experiments for three different
  articulation rates only partially confirm our expectations. Phonetic
  explanations are suggested.
%U http://www.coli.uni-sb.de/~trouvain/trouvain_et_al_01.ps.gz


%0 Conference Proceedings
%A Tsovaltzi, Dimitra 
%A Matheson, Colin
%D 2002
%T Formalising Hinting in Tutorial Dialogues
%E Bos, Johan
%E Foster, Mary Ellen
%E Matheson, Colin
%B 6th workshop on the semantics and pragmatics of dialogue (EDILOG 2002), September 4-6
%C University of Edinburgh, Scotland
%P 185-192
%! Formalising Hinting in Tutorial Dialogues
%2 Tsovaltzi:2002:FHT.pdf
%F Tsovaltzi:2002:FHT
%X The formalisation of the hinting process in Tutorial Dialogues is undertaken in order to simulate the Socratic teaching method. An adaptation of the BE&E annotation scheme for Dialogue Moves, based on the theory of social obligations, is sketched, and a taxonomy of hints and a selection algorithm is suggested based on data from the BE&E corpus. Both the algorithm and the tutor's reasoning are formalised in the context of the information state theory of dialogue management developed on the trindi project. The algorithm is characterised using update rules which take into account the student model, and the tutor's reasoning process is described in terms of context accommodation.
%U http://www.ltg.ed.ac.uk/edilog/papers/185.pdf


%0 Book Section
%A Uszkoreit, Hans
%D 1990
%T 13 Lexikonartikel für den Bereich der Unifikationsgrammatiken
%E Bußmann, H.
%B Lexikon der Sprachwissenschaft
%C Stuttgart
%I Kröner
%! 13 Lexikonartikel für den Bereich der Unifikationsgrammatiken
%3 j
%F Uszkoreit:1990:LBU


%0 Book Section
%A Uszkoreit, Hans
%D 1990
%T 16 Einträge für den Bereich der Unifikationsgrammatiken
%E Bußmann, H.
%B Lexikon der Sprachwissenschaft
%C Stuttgart
%I Kröner
%! 16 Einträge für den Bereich der Unifikationsgrammatiken
%3 j
%F Uszkoreit:1990:EBU
%O In der englischen Übersetzung als Bußmann, H., Routledge Dictionary of Language and Linguistics, Routledge, London and New York, 1996


%0 Book Section
%A Uszkoreit, Hans
%D 1990
%T Des faisceaux de traits aux types de données abstraits: nouvelles orientations des représentations et traitements linguistiques
%E Clément, Danièle
%B Grammaires d'Unification
%C Paris
%I ATALA
%! Des faisceaux de traits aux types de données abstraits: nouvelles orientations des représentations et traitements linguistiques
%3 j
%F Uszkoreit:1990:FTT
%O revised translation of: Uszkoreit, H. (1989): From Feature Bundles to Abstract Data Types: New Directions in the Representation of Linguistic Knowledge. In: Blaser, H., Natural Language at the Computer, Berlin: Springer


%0 Book Section
%A Uszkoreit, Hans
%D 1990
%T La grammaire d'unification catégorelle
%E Miller, P.
%E Torris, T.
%B Formalismes syntaxiques pour le traitement automatique du langage naturel
%C Paris
%I Hermes
%P 183-205
%! La grammaire d'unification catégorelle
%3 j
%F Uszkoreit:1990:GUC
%O revised translation of: Uszkoreit, H., "Categorial Unification Grammars", In: Proceedings of COLING 1986, August 1986, Bonn.


%0 Conference Proceedings
%A Uszkoreit, Hans
%D 1990
%T Extraposition and Adjunct Attachment in Categorial Unification Grammar
%E Bahner, W.
%B Proceedings of the 14th International Congress of Linguists, August 10-15 1987
%C Berlin, Germany
%I Akademie Verlag Berlin
%! Extraposition and Adjunct Attachment in Categorial Unification Grammar
%1 www.coli.uni-sb.de/~hansu/publ.html
%3 j
%F Uszkoreit:1990:EAA


%0 Conference Proceedings
%A Uszkoreit, Hans
%D 1991
%T Adding Control Information to Declarative Grammars
%E ACL
%B 29th Annual Meeting of the Association of Computational Linguistics (ACLANNUAL '91), June 18-21
%C University of California, Berkeley, California, USA
%I ACL
%P 237-245
%! Adding Control Information to Declarative Grammars
%3 j
%F Uszkoreit:1991:ACIa


%0 Report
%A Uszkoreit, Hans
%D 1991
%T Adding Control Information to Declarative Grammars
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-91-29
%! Adding Control Information to Declarative Grammars
%3 j
%F Uszkoreit:1991:ACIb


%0 Report
%A Uszkoreit, Hans
%D 1991
%T Adding Control Information to Declarative Grammars
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 10
%8 June
%! Adding Control Information to Declarative Grammars
%3 j
%F Uszkoreit:1991:ACIc
%X Strategies are proposed for combining different kinds of constraints in declarative grammars with a detachable layer of control information. The added control information is the basis for parametrized dynamically controlled linguistic deduction, a form of linguistic processing that permits the implementation of plausible linguistic performance models without giving up the declarative formulation of linguistic competence. The information can be used by the linguistic processor for ordering the sequence in which conjuncts and disjuncts are processed, for mixing depth-first and breadth-first search, for cutting off undesired derivations, and for constraint-relaxation.


%0 Conference Proceedings
%A Uszkoreit, Hans
%D 1991
%T Strategies for Adding Control Information to Declarative Grammars
%B Proceedings of the 29th Annual Meeting of the Association of Computational Linguistics (ACL-ANNUAL'91), June 18-21
%C University of California, Berkeley, California, USA
%I ACL
%P 237-245
%! Strategies for Adding Control Information to Declarative Grammars
%2 Uszkoreit:1991:SAC.pdf
%3 j
%F Uszkoreit:1991:SAC
%X Strategies are proposed for combining different kinds of constraints in declarative grammars with a detachable layer of control information. The added control information is the basis for parametrized dynamically controlled linguistic deduction, a form of linguistic processing that permits the implementation of plausible linguistic performance models without giving up the declarative formulation of linguistic competence. The information can be used by the linguistic processor for ordering the sequence in which conjuncts and disjuncts are processed, fpr mixing depth-first and breadth-first search, for cutting off undesired derivations, and for contraint-relaxation.
%U http://acl.ldc.upenn.edu/P/P91/P91-1031.pdf


%0 Report
%A Uszkoreit, Hans
%D 1993
%T Towards Performance Models for Declarative Grammar Formalisms
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 29
%! Towards Performance Models for Declarative Grammar Formalisms
%3 j
%F Uszkoreit:1993:TPM


%0 Edited Proceedings
%A Uszkoreit, Hans
%D 1995
%T 33rd Annual Meeting of the Association for Computational Linguistics (ACL-ANNUAL '95). Proceedings of the Conference
%C Cambridge, USA
%I ACL
%! 33rd Annual Meeting of the Association for Computational Linguistics (ACL-ANNUAL '95). Proceedings of the Conference
%3 j
%F Uszkoreit:1995:AMA
%U http://xxx.unizar.es/cmp-lg/ACL-95-proceedings.html


%0 Book Section
%A Uszkoreit, Hans
%D 1996
%T Grammatikmodelle
%E Strube, Gerhard
%B Wörterbuch der Kognitionswissenschaft
%C Stuttgart
%I Klett-Cotta
%! Grammatikmodelle
%3 j
%F Uszkoreit:1996:G
%O Hauptartikel "Grammatikmodelle", sowie mehrere Lang- und Kurzartikel zum Themenbereich "Grammatiktheorie"


%0 Conference Proceedings
%A Uszkoreit, Hans
%D 1997
%T Sprache ohne Grenzen: Sprache auf dem World Wide Web
%B Tagungsband der Konferenz "Sprache ohne Grenzen"
%C München, Germany
%P 7-14
%! Sprache ohne Grenzen: Sprache auf dem World Wide Web
%3 j
%F Uszkoreit:1997:SGS
%U http://mulinex.dfki.de/Presentations/sog/sld001.html


%0 Book Section
%A Uszkoreit, Hans
%D 1997
%T Overview: Formal Tools and Methods
%E Cole, R. A.
%B Survey of the State of the Art in Human Language Technology
%C Cambridge
%I Cambridge University Press
%P 337-342
%! Overview: Formal Tools and Methods
%2 Uszkoreit:1997:OFT.pdf
%3 j
%F Uszkoreit:1997:OFT
%U http://www.dfki.de/~hansu/HLT-Survey.pdf


%0 Conference Proceedings
%A Uszkoreit, Hans
%D 1998
%T Cross-Lingual Information Retrieval: From Naive Concepts to Realistic Applications
%B 14th Twente Workshop on Language Technology (TWLT 14). Language Technology in Multimedia Information Retrieval, December 7-8
%C University of Twente, Enschede, The Netherlands
%P 1-7
%! Cross-Lingual Information Retrieval: From Naive Concepts to Realistic Applications
%3 j
%F Uszkoreit:1998:CLI


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


%0 Book Section
%A Uszkoreit, Hans
%D 1999
%T Sprachtechnologie für die Wissensgesellschaft: Herausforderungen und Chancen für die Computerlinguistik und die theoretische Sprachwissenschaft
%E Meyer-Krahmer, Frieder
%E Lange, Siegfried
%B Geisteswissenschaften und Innovationen
%I Physica Verlag
%P 137-174
%! Sprachtechnologie für die Wissensgesellschaft: Herausforderungen und Chancen für die Computerlinguistik und die theoretische Sprachwissenschaft
%3 j
%F Uszkoreit:1999:SWH


%0 Book Section
%A Uszkoreit, Hans
%D 2000
%T Sprache und Sprachtechnologie bei der Strukturierung digitalen Wissens
%E Kallmeyer, W.
%B Sprache in neuen Medien. Institut für Deutsche Sprache, Jahrbuch 1999
%C Berlin
%I De Gruyter
%! Sprache und Sprachtechnologie bei der Strukturierung digitalen Wissens
%3 j
%F Uszkoreit:2000:SSS


%0 Book Section
%A Uszkoreit, Hans
%D 2001
%T Die Email-Flut bannen - Kostensenkung im Call Center
%E DDV
%B TeleMedienServices Jahrbuch 2001. Service im Dialog
%C Würzburg
%I Max Schimmel Verlag
%! Die Email-Flut bannen - Kostensenkung im Call Center
%2 Uszkoreit:2001:EFB.pdf
%3 j
%F Uszkoreit:2001:EFB
%X In diesem Artikel werden Möglichkeiten der Kostensenkung im Call Center beschrieben1. Dabei liegt der Schwerpunkt auf Methoden und Technologien, die im Customer Relationship Management dabei helfen, das rapide anwachsende Email-Volumen zu bewältigen, ohne dass die Service-Qualität unter der Teilautomatisierung leidet. Es wird demonstriert, dass Fortschritte in der Automatisierung nur erreichbar sind, wenn neueste Methoden der Sprachtechnologie eingesetzt werden. Nahezu alle Softwareprodukte für das Email-Response Management (ERM), die heute auf dem Markt sind, nutzen die jüngsten Fortschritte in der Sprachtechnologie gar nicht oder nur sehr unzureichend aus.
%U http://www.uszkoreit.net/erm_hu.pdf


%0 Conference Proceedings
%A Uszkoreit, Hans
%D 2002
%T New Chances for Deep Linguistic Processing
%B Proceedings of the 19th International Conference on Computational Linguistics (COLING'02), August 24 - September 1
%I Morgan Kauffmann Press
%! New Chances for Deep Linguistic Processing
%3 j
%F Uszkoreit:2002:NCD
%X The Grammatical analysis with linguistically designed grammars has always been a central topic of investigation in theoretical computational linguistics. However, deep grammatical analysis has played a negligible role in the development of language technology applications. Deep parsers have been lacking efficiently and robustness. Building up coverage has been slow and costly. The few linguistic grammars that truly exhibit large coverage have caused a constant fight with extensive ambiguity. In my talk I will present recent developments that provide new challenges and opportunities for linguistic methods. Increased efficiency of deep parsing and the embedding of a selective deep analysis into a robust shallow regime for information extraction offer ways to employ deep parsing in an environment where it can improve results without ruining robustness. I will argue that such a selective utilization as we have realized it by an integration of HPSG parsing into a hybrid IE system comprised of statistical and FST components, also provides a promising direction for gradual, measurable controlled progress in the development of deep grammars and lexicons.


%0 Conference Proceedings
%A Uszkoreit, Hans
%A Backofen, Rolf
%A Busemann, Stephan
%A Diagne, Abdel Kader
%A Hinkelman, Elizabeth
%A Kasper, Walter
%A Kiefer, Bernd
%A Krieger, Hans-Ulrich
%A Netter, Klaus
%A Neumann, Günter
%A Oepen, Stephan
%A Spackman, Stephen P.
%D 1994
%T DISCO - An HPSG-Based NLP System and its Application for Appointment Scheduling
%B Proceedings of the 15th International Conference on Computational Linguistics (COLING'94), August 5-9
%C Kyoto, Japan
%V 1
%P 436-440
%! DISCO - An HPSG-Based NLP System and its Application for Appointment Scheduling
%2 Uszkoreit:1994:DHBa.pdf Uszkoreit:1994:DHBa.ps
%3 j
%F Uszkoreit:1994:DHBa
%X 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
%U 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


%0 Report
%A Uszkoreit, Hans
%A Backofen, Rolf
%A Busemann, Stephan
%A Diagne, Abdel Kader
%A Hinkelman, Elizabeth
%A Kasper, Walter
%A Kiefer, Bernd
%A Krieger, Hans-Ulrich
%A Netter, Klaus
%A Neumann, Günter
%A Oepen, Stefan
%A Spackmann, Stephen
%D 1994
%T DISCO - An HPSG-Based NLP System and its Application for Appointment Scheduling
%C Saarbrücken
%I DFKI
%S Research Report
%7 RR-94-38
%! DISCO - An HPSG-Based NLP System and its Application for Appointment Scheduling
%2 Uszkoreit:1994:DHBb.pdf Uszkoreit:1994:DHBb.ps
%3 j
%F Uszkoreit:1994:DHBb
%X 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.


%0 Report
%A Uszkoreit, Hans
%A Backofen, Rolf
%A Calder, Jo
%A Capstick, Joanne
%A Dini, Luca
%A Dörre, Jochen
%A Erbach, Gregor
%A Estival, Dominique
%A Manandhar, Suresh
%A Mineur, Anne-Marie
%A Oepen, Stefan
%D 1996
%T The EAGLES Formalisms Working Group - Final Report Expert Advisory Group on Language Engineering Standards
%7 LRE 61-100
%! The EAGLES Formalisms Working Group - Final Report Expert Advisory Group on Language Engineering Standards
%2 Uszkoreit:1996:EFW.pdf Uszkoreit:1996:EFW.ps
%3 j
%F Uszkoreit:1996:EFW
%U 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


%0 Journal Article
%A Uszkoreit, Hans
%A Brants, Th
%A Duchier, Denys
%A Krenn, Brigitte
%A Konieczny, Lars
%A Oepen, Stefan
%A Skut, Wojciech
%D 1998
%T Studien zur performanzorientierten Linguistik: Aspekte der Relativsatzextraposition im Deutschen
%B Kognitionswissenschaft
%V 7
%N 3
%P 129-133
%! Studien zur performanzorientierten Linguistik: Aspekte der Relativsatzextraposition im Deutschen
%3 j
%F Uszkoreit:1998:SPLa
%X Am Beispiel der Relativsatzextraposition im Deutschen zeigt das Papier wie Verfahren der sprachwissenschaftlichen Modellbildung, korpuslinguistischen Untersuchung und des psycholinguistischen Experiments in einem integrativen Forschungsansatz zusammenwirken, der auf ein verbessertes Verständnis und die linguistisch wie kognitiv adäquate Modellierung sprachlicher Performanzprobleme zielt. Ausgehend von der von Hawkins (1994) formulierten Theorie zur Wortstellung werden Hypothesen über die positionelle Verteilung von Relativsätzen formuliert und in Bezug auf Korpusdaten und Akzeptabilitätsmessungen überprüft. Alle beschriebenen empirischen Untersuchungen bestätigen den erwarteten Einfluss von Längenfaktoren auf die Relativsatzdistribution, zeigen gleichzeitig aber eine interessante Asymmetrie zwischen Produktions- und Rezeptionsdaten.


%0 Report
%A Uszkoreit, Hans
%A Brants, Thorsten
%A Duchier, Denys
%A Krenn, Brigitte
%A Konieczny, Lars
%A Oepen, Stephan
%A Skut, Wojciech
%D 1998
%T Studien zur performanzorientierten Linguistik. Aspekte der Relativsatzextraposition im Deutschen
%C Saarbrücken.
%I Universität des Saarlandes
%S CLAUS-Report
%7 99
%8 April
%! Studien zur performanzorientierten Linguistik. Aspekte der Relativsatzextraposition im Deutschen
%1 http://www.coli.uni-sb.de/claus/claus99.html
%2 Uszkoreit:1998:SPLb.pdf Uszkoreit:1998:SPLb.ps
%3 j
%F Uszkoreit:1998:SPLb
%X Am Beispiel der Relativsatzextraposition im Deutschen zeigt das Papier wie Verfahren der sprachwissenschaftlichen Modellbildung, korpuslinguistischen Untersuchung und des psycholinguistischen Experiments in einem integrativen Forschungsansatz zusammenwirken, der auf ein verbessertes Verständnis und die linguistisch wie kognitiv adäquate Modellierung sprachlicher Performanzprobleme zielt. Ausgehend von der von Hawkins (1994) formulierten Theorie zur Wortstellung werden Hypothesen über die positionelle Verteilung von Relativsätzen formuliert und in Bezug auf Korpusdaten und Akzeptabilitätsmessungen überprüft. Alle beschriebenen empirischen Untersuchungen bestätigen den erwarteten Einfluß von Längenfaktoren auf die Relativsatzdistribution, zeigen gleichzeitig aber eine interessante Asymmetrie zwischen Produktions- und Rezeptionsdaten. 
Ein gekürzte Fassung erscheint in Kognitionswissenschaft, Themenheft SFB 378, 1998.
%U http://www.coli.uni-sb.de/~thorsten/publications/Uszkoreit-ea-CLAUS99.pdf ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus99.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus99.dvi


%0 Edited Proceedings
%A Uszkoreit, Hans
%A Brants, Thorsten
%A Krenn, Brigitte
%D 1999
%T Linguistically Interpreted Corpora. Proceedings of the Workshop LINC-1999 at the 9th Conference of the European Chapter of the Association of Computational Linguistics
%C Bergen, Norway
%! Linguistically Interpreted Corpora. Proceedings of the Workshop LINC-1999 at the 9th Conference of the European Chapter of the Association of Computational Linguistics
%3 j
%F Uszkoreit:1999:LICb


%0 Book Section
%A Uszkoreit, Hans
%A Flickinger, Dan
%A Kasper, Walter
%A Sag, Ivan
%D 2000
%T Deep Linguistic Analysis with HPSG
%E Wahlster, W.
%B Verbmobil: Foundations of Speech-to-Speech Translation
%C Berlin
%I Springer
%P 216-237
%S Artificial Intelligence
%! Deep Linguistic Analysis with HPSG
%3 j
%F Uszkoreit:2000:DLA


%0 Book Section
%A Uszkoreit, Hans
%A Flickinger, Dan
%A Kasper, Walter
%A Sag, Ivan A.
%D 2000
%T Deep Linguistic Analysis with HPSG
%E Wahlster, Wolfgang
%B Verbmobil: Foundations of Speech-to-Speech Translation
%C Berlin
%I Springer
%P 216-237
%S Artificial Intelligence
%! Deep Linguistic Analysis with HPSG
%3 j
%F Uszkoreit:2000:DLAb


%0 Report
%A Uszkoreit, Hans
%A Jörg, Brigitte
%D to appear
%T A Virtual Information Center for Language Technology: Ontology, Datastructure, Realization
%B NORFA Yearbook
%C Copenhagen
%I CST Copenhagen
%! A Virtual Information Center for Language Technology: Ontology, Datastructure, Realization
%3 j
%F Uszkoreit:19xx:VIC


%0 Book Section
%A Uszkoreit, Hans
%A Zaenen, Annie
%D 1997
%T Grammar Formalisms
%E Cole, R. A.
%B Survey of the State of the Art in Human Language Technology
%C Cambridge
%I Cambridge University Press
%P 95-96
%! Grammar Formalisms
%2 Uszkoreit:1997:GF.pdf
%3 j
%F Uszkoreit:1997:GF
%U http://www.dfki.de/~hansu/HLT-Survey.pdf


%0 Conference Proceedings
%A van Genabith, Josef
%A Frank, Anette
%A Way, Andy
%D 2001
%T Treebank vs. X-bar based Automatic F-Structure Annotation
%E Butt, Miriam 
%E Holloway King, Tracy
%B Proceedings of the 6th International Lexical Functional Grammar Conference (LFG'01), June 25-27
%C Hong Kong
%I CSLI Online Publications
%! Treebank vs. X-bar based Automatic F-Structure Annotation
%2 Genabith:19xx:TVX.pdf
%F Genabith:19xx:TVX
%X Manual, large scale (computational) grammar development is time consuming, expensive and requires lots of linguistic expertise. More recently, a number of alternatives based on treebank resources (such as Penn-II, Susanne, AP treebank) have been explored. The idea is to automatically “induce” or rather read
off (P)CFG grammars from the parse annotated treebank resources and to use the treebank grammars thusobtained in (probabilistic) parsing or as a starting point for further grammar development. The approach is cheap, fast, automatic, large scale, “data driven” and based on real language resources. Treebankgrammars typically involve large sets of lexical tags and non-lexical categories as syntactic informationtends to be encoded in monadic category symbols. They feature flat rules (trees) that can “underspecify” attachment possibilities. Treebank grammars do not in general follow Xbar architectural design principles (this is not to say that treebank grammars do not have design principles). As a consequence, treebank grammars tend to have very large CFG rule bases (e.g. Penn-II > 17,000 CFG rules for about 1 million words of text) with often only minimally differing rules. Even though treebank grammars are large, they are still incomplete, exhibiting unabated rule accession rates. From a grammar engineering point of view, the size of the rule base poses problems for maintainability, extendability and, if a treebank grammar is to be used as a CF-base in a LFG grammar, for functional (feature-structure) annotations. From the point of view of theoretical linguistics, flat treebank trees and treebank grammars extracted from such trees do not express linguistic generalisations. From the perspective of empirical and corpus linguistics, flat trees are well-motivated as they allow underspecification of subtle and often time consuming attachment decisions. Indeed, it is sometimes doubted whether highly general Xbar schemata usefully scale to “real” language. In previous work we developed methodologies for automatic feature-structure annotation of grammars extracted from treebanks. Automatic annotation of “raw” treebank grammars is difficult as annotation rules often need to identify subsequences in the RHSs of flat treebank rules as they explicitly encode head, complement and modifier relations. Xbar-based CFG rules should substantially facilitate automatic feature-structure annotation of grammar rules. In the present paper we conduct a number of experiments to explore a space of possible grammars based on a small fragment of the AP treebank resource.
Starting with the original treebank fragment we automatically extract a CFG G. We then apply an automatic structure preserving grammar compaction step which generalises categories in the original treebank fragment and reduces the number of rules extracted, resulting in a generalised treebank fragment and in a compacted grammar Gc. The generalised fragment is then manually corrected to catch missed constituents (and the like) resulting in an automatically extracted, compacted and (effectively manually) corrected grammar Gc;m. Manual correction proceeds in the “spirit” of treebank grammars (we do not introduce Xbar analyses). We then explore how many of the manual correction steps on treebank trees can be achieved automatically. We develop, implement and test an automatic treebank “grooming” methodology which is applied to the generalised treebank fragment to yield a compacted and automatically corrected grammar Gc;a. Grammars Gc;m and Gc;a are very similar to compiled out “flat” LFG-82 style grammars. We explore regular expression based compaction (both manual and automatic) to relate Gc;m to a LFG-82 style grammar design. Finally, we manually recode a subsection of the generalised and manually corrected treebank fragment into “vanilla-flavour” Xbar based trees. From these we extract a compacted, manually corrected, Xbar-based grammar Gc;m;x. We evaluate our grammars and methods using standard labelled bracketing measures and according to how well they perform under automatic feature-structure annotation tasks.
%U http://csli-publications.stanford.edu/LFG/6/lfg01genabithfrankway.pdf


%0 Report
%A van Leusen, Noor
%D 1997
%T The Role of Inference in the resolution of corrections
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 93
%8 December
%! The Role of Inference in the resolution of corrections
%F Leusen:1997:RIR


%0 Report
%A van Noord, Gertjan
%D 1991
%T Head Corner Parsing
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 15
%8 December
%! Head Corner Parsing
%F Noord:1991:HCP
%X I describe a head-driven parser for a class of grammars that handle discontinuous constituency by a richer notion of string combination than ordinary concatenation. The parser is a generalization of the left-corner parser and can be used for grammars written in powerful formalisms such as non- concatenative versions of UCG and HPSG.


%0 Journal Article
%A van Noord, Gertjan 
%A Bouma, Gosse
%A Koeling, Rob
%A Nederhof, Mark-Jan
%D 1999
%T Robust Grammatical Analysis for Spoken Dialogue Systems
%B Natural Language Engineering
%V 5
%N 1
%P 45-93
%! Robust Grammatical Analysis for Spoken Dialogue Systems
%3 j
%F Noord:1999:RGA
%X We argue that grammatical analysis is a viable alternative to concept spotting for processing spoken input in a practical spoken dialogue system. We discuss the structure of the grammar, and a model for robust parsing which combines linguistic sources of information and statistical sources of information. We discuss test results suggesting that grammatical processing allows fast and accurate processing of spoken input.
%U http://odur.let.rug.nl/~vannoord/papers/nle/


%0 Book Section
%A van Noord, Gertjan
%A Neumann, Günter
%D 1987
%T Syntactic Generation
%E Cole, Ronald A.
%E Mariani, Joseph
%E Uszkoreit, Hans
%E Zaenen, Annie
%E Zue, Victor
%B Survey of the State of the Art in Human Language Technology
%C Cambridge
%I Cambridge University Press
%! Syntactic Generation
%1 http://cslu.cse.ogi.edu/HLTsurvey/HLTsurvey.html
%2 Noord:1987:SG.pdf Noord:1987:SG.ps
%3 j
%F Noord:1987:SG
%X In a natural language generation module, we often distinguish two components. On the one hand it needs
to be decided what should be said. This task is delegated to a planning component. Such a component
might produce an expression representing the content of the proposed utterance. On the basis of this
representation the syntactic generation component produces the actual output sentence(s). Although the
distinction between planning and syntactic generation is not uncontroversial, we will nonetheless
assume such an architecture here, in order to explain some of the issues that arise in syntactic
generation.
A (natural language) grammar is a formal device that defines a relation between (natural language)
utterances and their corresponding meanings. In practice this usually means that a grammar defines a
relation between strings and logical forms. During natural language understanding, the task is to arrive
at a logical form that corresponds to the input string. Syntactic generation can be described as the
problem to find the corresponding string for an input logical form.
We are thus making a distinction between the grammar which defines this relation, and the procedure
that computes the relation on the basis of such a grammar. In the current state of the art
unification-based (or more general: constraint-based) formalisms are used to express such grammars,
e.g., Lexical Functional Grammar (LFG) [Bre82], Head-Driven Phrase-Structure Grammar (HPSG)
[PS87] and constraint-based categorial frameworks (cf. [Usz86] and [ZKC87]).
Almost all modern linguistic theories assume that a natural language grammar not only describes the
correct sentences of a language, but that such a grammar also describes the corresponding semantic
structures of the grammatical sentences. Given that a grammar specifies the relation between phonology
and semantics it seems obvious that the generator is supposed to use this specification. For example,
Generalized Phrase Structure Grammars (GPSG) [GKPS85] provide a detailed description of the
semantic interpretation of the sentences licensed by the grammar. Thus one might assume that a
generator based on GPSG constructs a sentence for a given semantic structure, according to the semantic
interpretation rules of GPSG. Alternatively, [Bus90] presents a generator, based on GPSG, which does
not take as its input a logical form, but rather some kind of control expression which merely instructs the
grammatical component which rules of the grammar to apply. Similarly, in the conception of [GP90], a
generator is provided with some kind of deep structure which can be interpreted as a control expression
instructing the grammar which rules to apply. These approaches to the generation problem clearly solve
some of the problems encountered in generation---simply by pushing the problem into the conceptual
component (i.e., the planning component). In this overview we restrict the attention to the more
ambitious approach sketched above.
The success of the currently developed constraint-based theories is due to the fact that they are purely
declarative. Hence, it is an interesting objective---theoretically and practically---to use one and the same
grammar for natural language understanding and generation. In fact the potential for reversibility was a
primary motivation for the introduction of Martin Kay’s Functional Unification Grammar (FUG). In
recent years interest in such a reversible architecture has led to a number of publications.
%U http://www.dfki.de/~neumann/publications/new-ps/nlg-survey.ps.gz http://grid.let.rug.nl/~vannoord/papers/survey.ps


%0 Journal Article
%A Van Roy, Peter
%A Haridi, Seif
%A Brand, Per
%A Smolka, Gert
%A Mehl, Michael
%A Scheidhauer, Ralf
%D 1997
%T Mobile Objects in Distributed Oz
%B ACM Transactions on Programming Languages and Systems
%V 19
%N 5
%P 804-851
%8 September
%! Mobile Objects in Distributed Oz
%2 Roy:1997:MOD.pdf Roy:1997:MOD.ps
%F Roy:1997:MOD
%X Some of the most difficult questions to answer when designing a distributed application are related to mobility: what information to transfer between sites and when and how to transfer it. Network-transparent distribution, the property that a program's behavior is independent of how it is partitioned among sites, does not directly address these questions. Therefore we propose to extend all language entities with a network behavior that enables efficient distributed programming by giving the programmer a simple and predictable control over network communication patterns. In particular, we show how to give objects an arbitrary mobility behavior that is independent of the object's definition. In this way, the syntax and semantics of objects are the same regardless of whether they are used as stationary servers, mobile agents, or simply as caches. These ideas have been implemented in Distributed Oz, a concurrent object-oriented language that is state aware and has data flow synchronization. We prove that the implementation of objects in Distributed Oz is network transparent. To satisfy the predictability condition, the implementation avoids forwarding chains through intermediate sites. The implementation is an extension to the publicly available DFKI Oz 2.0 system.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/TOPLAS97.ps.gz


%0 Conference Proceedings
%A Van Roy, Peter
%A Mehl, Michael
%A Scheidhauer, Ralf
%D 1996
%T Integrating Efficient Records into Concurrent Constraint Programming
%E Kuchen, Herbert
%E Swierstra, S. Doaitse
%B 8th International Symposium on Programming Languages, Implementations, Logics, and Programs (PLILP '96), September 24-27
%C Aachen, Germany
%I Springer
%P 438-453
%S Lecture Notes in Computer Science
%7 1140
%! Integrating Efficient Records into Concurrent Constraint Programming
%2 Roy:1996:IER.pdf Roy:1996:IER.ps
%F Roy:1996:IER
%X We show how to implement efficient records in constraint logic programming (CLP) and its generalization concurrent constraint programming (CCP). Records can be naturally integrated into CCP as a new constraint domain. The implementation provides the added expressive power of concurrency and fine-grained constraints over records, yet does not pay for this expressivity when it is not used. In addition to traditional record operations, our implementation allows to compute with partially-known records. This fine granularity is useful for natural-language and knowledge-representation applications. The paper describes the implementation of records in the DFKI Oz system. Oz is a higher-order CCP language with encapsulated search. We show that the efficiency of records in CCP is competitive with modern Prolog implementation technology and that our implementation provides improved performance for natural-language applications.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/plilp96.ps.gz


%0 Conference Proceedings
%A Vasishth, Shravan
%D 1998
%T Monotonicity Constraints on Negative Polarity in Hindi
%E Bradshaw, Mary
%E Odden, David
%E Wyckoff, Derek
%B Working Papers in Linguistics
%I Ohio State University
%V 51
%P 201-220
%! Monotonicity Constraints on Negative Polarity in Hindi
%2 Vasishth:1998:MCN.pdf Vasishth:1998:MCN.ps
%F Vasishth:1998:MCN
%U ftp://ftp.ling.ohio-state.edu/pub/Students/Vasishth/Published/OSUWPLVol51-1998/osuwpl51.ps


%0 Conference Proceedings
%A Vasishth, Shravan
%D 1998
%T Word Order, Negation, and Negative Polarity in Hindi
%E Miller-Ockhuizen, Amanda
%E Levine, Robert
%E Gonsalves, Anthony J.
%B Working Papers in Linguistics
%I Ohio State University
%V 53
%P 108-131
%! Word Order, Negation, and Negative Polarity in Hindi
%2 Vasishth:1998:WON.pdf Vasishth:1998:WON.ps
%F Vasishth:1998:WON
%U ftp://ftp.ling.ohio-state.edu/pub/Students/Vasishth/Published/OSUWPLVol53-2000/osuwpl53.ps


%0 Conference Proceedings
%A Vasishth, Shravan
%D 2001
%T An Empirical Evaluation of Sentence Processing Models: Center Embeddings in Hindi
%E Daniels, Michael 
%E Dowty, David 
%E Feldman, Anna 
%E Metcalf, Vanessa
%B Working Papers in Linguistics
%I Ohio State University
%V 56
%P 159-181
%! An Empirical Evaluation of Sentence Processing Models: Center Embeddings in Hindi
%2 Vasishth:2001:EES.pdf Vasishth:2001:EES.ps
%F Vasishth:2001:EES
%U ftp://ftp.ling.ohio-state.edu/pub/Students/Vasishth/Published/OSUWPLVol56-2001/submission1.ps


%0 Conference Proceedings
%A Vasishth, Shravan
%D 2001
%T Quantificational Elements and Polarity Licensing in Japanese
%E Nakayama, Mineharu
%E Quinn, Charles J. Jr.
%B Japanese/Korean Linguistics
%I CSLI Publications
%V 9
%! Quantificational Elements and Polarity Licensing in Japanese
%2 Vasishth:2001:QEP.pdf
%F Vasishth:2001:QEP
%U ftp://ftp.ling.ohio-state.edu/pub/Students/Vasishth/Published/JapaneseKorean1999/jk99.html


%0 Journal Article
%A Vasishth, Shravan
%D 2002
%T Word Order, Negation, and Negative Polarity in Hindi
%B Journal of Language and Computation
%V 3
%! Word Order, Negation, and Negative Polarity in Hindi
%2 Vasishth:2002:WON.pdf
%F Vasishth:2002:WON
%O to appear
%U ftp://ftp.ling.ohio-state.edu/pub/Students/Vasishth/Published/JLAC2001/vasishth.pdf


%0 Master's Thesis
%A Vasishth, Shravan
%D 2002
%T An Abductive Inference Based Model of Human Sentence Parsing
%C Columbus
%I Ohio State University, Department of Computer and Information Science
%8 March
%! An Abductive Inference Based Model of Human Sentence Parsing
%2 Vasishth:2002:AIB.pdf Vasishth:2002:AIB.ps
%F Vasishth:2002:AIB
%U ftp://ftp.ling.ohio-state.edu/pub/Students/Vasishth/MSThesis/msthesis.ps


%0 Thesis
%A Vasishth, Shravan
%D 2002
%T Working Memory in Sentence Comprehension: Processing Hindi Center Embeddings
%C Columbus
%I Ohio State University, Department of Linguistics
%8 June
%! Working Memory in Sentence Comprehension: Processing Hindi Center Embeddings
%2 Vasishth:2002:WMS.pdf
%F Vasishth:2002:WMS
%O To appear in the Garland series, Routledge Press, NY
%U http://www.ling.ohio-state.edu/~vasishth/PhD/diss.pdf.gz http://www.ling.ohio-state.edu/~vasishth/PhD/diss.ps.gz


%0 Conference Proceedings
%A Vasishth, Shravan
%A Joseph, Brian D.
%D 2002
%T Constellations, Polysemy, and Hindi
%B Berkeley Linguistics Society Conference (BLS 28), February 15-18
%C University of California, Berkeley, USA
%! Constellations, Polysemy, and Hindi
%F Vasishth:2002:CPH
%U ftp://ftp.ling.ohio-state.edu/pub/Students/Vasishth/Published/BLS2002/vasishth.ps


%0 Conference Proceedings
%A Vasishth, Shravan
%A Kruijff, Geert-Jan M.
%D 2001
%T Processing as Abduction: A Sentence Processing Model
%E Daniels, Michael
%E Dowty, David
%E Feldman, Anna
%E Metcalf, Vanessa
%B Working Papers in Linguistics
%I Ohio State University
%V 56
%P 183-207
%! Processing as Abduction: A Sentence Processing Model
%2 Vasishth:2001:PAS.pdf Vasishth:2001:PAS.ps
%F Vasishth:2001:PAS
%U ftp://ftp.ling.ohio-state.edu/pub/Students/Vasishth/Published/OSUWPLVol56-2001/submission2.ps


%0 Report
%A Villiger, Claudia
%D 1995
%T Theme Discourse Topic, and Information Structuring in German Texts
%C Saarbrücken
%I Universität des Saarlandes
%S ESPRIT Basic Research Action: Dandelion
%7 EP6665; Deliverable R1.2.2c
%8 December
%! Theme Discourse Topic, and Information Structuring in German Texts
%F Villiger:1995:TDT


%0 Book Section
%A Villiger, Claudia
%A Rothkegel, Annely
%A Jakobs, Eva-Maria
%D 1999
%T Das versteht kein Mensch ... Verständliche Gestaltung von Hilfesystemen für Softwareprogramme
%E Jakobs, Eva-Maria
%E Knorr, Dagmar
%E Pogner, Karl-Heinz
%B Textproduktion. HyperText, Text, KonText
%C Frankfurt a. M
%I Peter Lang
%P 217-233
%S Textproduktion und Medium
%7 5
%! Das versteht kein Mensch ... Verständliche Gestaltung von Hilfesystemen für Softwareprogramme
%F Villiger:1999:VKM
%X Textverarbeitungsprogramme sind in der Regel erklärungsbedürftig. In unserem Beitrag untersuchen wir, wie Online-Hilfen den Nutzer bei der Lösung von Aufgaben mit der Textverarbeitungssoftware unterstützen, welche Probleme bei der Nutzung von Online-Hilfen auftreten und wodurch sie verursacht werden. Die Argumentation stützt sich auf eine Studie mit professionellen und semiprofessionellen Nutzern und formuliert abschließend Überlegungen zur verständlichen Gestaltung von Hilfesystemen.


%0 Conference Proceedings
%A Vintar, Spela
%A Buitelaar, Paul
%A Ripplinger, Bärbel
%A Sacaleanu, Bogdan
%A Raileanu, Diana
%A Prescher, Detlef
%D 2002
%T An Efficient and Flexible Format for Linguistic and Semantic Annotation
%B Proceedings of the 3rd International Conference on Language Resources and Evaluation (LREC'02), May 29-31
%C Las Palmas, Canary Islands, Spain
%! An Efficient and Flexible Format for Linguistic and Semantic Annotation
%2 Vintar:2002:EFF.pdf Vintar:2002:EFF.ps
%3 j
%F Vintar:2002:EFF
%X The paper describes an XML annotation format and tool developed within the MUCHMORE project. The annotation scheme was designed specifically for the purposes of Cross-Lingual Information Retrieval in the medical domain so as to allow both efficient and flexible access to layers of information. We use a parallel English-German corpus of medical abstracts and annotate it with linguistic information (tokenisation, part-of-speech tagging, lemmatisation and decomposition, phrase recognition, grammatical functions) as well as semantic information from various sources. The annotation of medical terms/concepts, semantic types and semantic relations is based on the Unified Medical Language System (UMLS). Additionally, we use EuroWordNet as a general-language resource in annotating word senses and to compare domain-specific and general language use. A major aim of the project is also to complement existing ontological resources by extracting new terms and new semantic relations. We present the annotation scheme, which is conceptually related to stand-off annotation, and describe our tool for automatic semantic annotation.
%U http://dfki.de/~paulb/lrec2002.dtd.ps http://www.dfki.de/dfkibib/publications/docs/lrec2002.dtd.final.pdf


%0 Book
%A Vogelgesang, Manfred
%D 1993
%T Die Mundart von Bliesmengen-Bolchen (Saarland)
%B Phonetica Saraviensia
%V 11
%P 180
%! Die Mundart von Bliesmengen-Bolchen (Saarland)
%F Vogelgesang:1993:MBB


%0 Journal Article
%A Volk, Martin
%A Ripplinger, Bärbel
%A Vintar, Špela
%A Buitelaar, Paul
%A Raileanu, Diana
%A Sacaleanu, Bogdan
%D 2002
%T Semantic Annotation for Concept-Based Cross-Language Medical Information Retrieval
%B International Journal of Medical Informatics
%V 67
%N 1-3
%P 97-112
%! Semantic Annotation for Concept-Based Cross-Language Medical Information Retrieval
%2 Volk:2002:SAC.pdf
%3 j
%F Volk:2002:SAC
%X We present a framework for concept-based cross-language information retrieval in the medical domain, which is under development in the MUCHMORE project. Our approach is based on using the Unified Medical Language System (UMLS) as the primary source of semantic data. Documents and queries are annotated with multiple layers of linguistic information. Linguistic processing includes part-of-speech tagging, morphological analysis, phrase recognition and the identification of medical terms and semantic relations between them. The paper describes experiments in monolingual and cross-language document retrieval, performed on a corpus of medical abstracts. Results show that linguistic processing, especially lemmatization and compound analysis for German, is a crucial step in achieving a good baseline performance. On the other hand, they show that semantic information, specifically the combined use of concepts and relations, increases the performance in monolingual and cross-language retrieval.
%U http://dfki.de/~paulb/jmi.pdf


%0 Conference Proceedings
%A Volk, Martin
%A Vintar, Spela
%A Buitelaar, Paul
%D 2003
%T Ontologies in Cross-Language Information Retrieval
%B Proceeding of the Workshop Ontologie-basiertes Wissensmanagement (WOW2003). Workshop auf der 2. Konferenz Professionelles Wissensmanagement - Erfahrungen und Visionen (WM2003), 2.-4. April 2003
%C Luzern, Schweiz
%! Ontologies in Cross-Language Information Retrieval
%3 j
%F Volk:2003:OCL


%0 Conference Proceedings
%A Wahlster, Wolfgang
%D 1993
%T VERBMOBIL-Translation of Face-to-Face Dialogs
%E Herzog, O.
%E Christaller, T.
%E Schütt, D.
%B Grundlagen und Anwendungen der Künstlichen Intelligenz. 17. Fachtagung für Künstliche Intelligenz, 13.-16. September
%C Humboldt-Universität Berlin, Germany
%I Springer
%P 393-402
%S Informatik Aktuell
%! VERBMOBIL-Translation of Face-to-Face Dialogs
%F Wahlster:1993:VTF


%0 Master's Thesis
%A Walter, Andreas
%D 2000
%T An Implementation of the Programming Language DML in Java: Compiler
%C Saarbrücken
%I Universität des Saarlandes, Fachbereich Informatik
%! An Implementation of the Programming Language DML in Java: Compiler
%2 Walter:2000:IPL.pdf Walter:2000:IPL.ps
%F Walter:2000:IPL
%X DML is an experimental language that has emerged from the developement of the Oz dialect Alice. DML is dynamically typed, functional, and concurrent. It supports transients and provides a distributed programming model. Subject of this work is the implementation of a compiler backend that translates DML programs to Java Virtual Machine code. Code-optimizing techniques and possibilities for the treatment of tail calls are described. Finally, the implemented compiler and the runtime environment of DML are compared to similar projects.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Walter:2000.ps.gz


%0 Conference Proceedings
%A Wirén, Mats
%D 1990
%T Incremental Parsing and Reason Maintenance
%E Karlgren, H.
%B 13th International Conference on Computational Linguistics (COLING '90), August 19-25
%C Helsinki, Finland
%P 287-292
%! Incremental Parsing and Reason Maintenance
%F Wiren:1990:IPR


%0 Thesis
%A Wirén, Mats
%D 1992
%T Studies in Incremental Natural-Language Analysis
%C Linköping
%I Linköping University, Department of Computer and Information Science
%! Studies in Incremental Natural-Language Analysis
%F Wiren:1992:SIN


%0 Conference Proceedings
%A Wirén, Mats
%D 1993
%T Bounded Incremental Parsing
%B 6th Twente Workshop on Language Technology (TWLT-6)
%C University of Twente, Enschede, The Netherlands
%P 145-156
%! Bounded Incremental Parsing
%F Wiren:1993:BIPa


%0 Report
%A Wirén, Mats
%D 1993
%T Bounded Incremental Parsing
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 36
%8 December
%! Bounded Incremental Parsing
%2 Wiren:1993:BIPb.pdf Wiren:1993:BIPb.ps
%F Wiren:1993:BIPb
%X This paper generalizes the notion of parsing as deduction to non-cumulative text production, in which changes can be made to already parsed material, for example, by a person using a grammar-checking text editor. The basic approach is to exploit the properties of a chart to determine which parts of the string need to be reanalysed in response to a change, thereby obtaining an incremental solution. An implementation of the proposed technique exists, which has been adapted to on-line processing under a simple text editor, thus providing a system which parses a text simultaneously as it is entered and edited.
%U ftp://ftp.coli.uni-sb.de/pub/claus/claus36.ps


%0 Conference Proceedings
%A Wirén, Mats
%D 1994
%T Minimal Change and Bounded Incremental Parsing
%E ACL
%B 15th International Conference on Computational Linguistics (COLING '94), August 5-9
%C Kyoto, Japan
%P 461-467
%! Minimal Change and Bounded Incremental Parsing
%F Wiren:1994:MCB


%0 Conference Proceedings
%A Wirén, Mats
%A Rönnquist, Ralph
%D 1993
%T Fully Incremental Parsing
%B 3rd International Workshop on Parsing Technologies (IWPT '93), August 10-13
%C Tilburg, The Netherlands and Durbuy, Belgium
%! Fully Incremental Parsing
%F Wiren:1993:FIPa


%0 Report
%A Wirén, Mats
%A Rönnquist, Ralph
%D 1993
%T Fully Incremental Parsing
%C Saarbrücken
%I Universität des Saarlandes
%S CLAUS-Report
%7 32
%8 June
%! Fully Incremental Parsing
%2 Wiren:1993:FIPb.pdf Wiren:1993:FIPb.ps
%F Wiren:1993:FIPb
%X This paper generalizes the notion of parsing as deduction to non-cumulative text production, in which changes can be made to already parsed material, for example, by a person using a grammar-checking text editor. The basic approach is to exploit the properties of a chart to determine which parts of the string need to be reanalysed in response to a change, thereby obtaining an incremental solution. An implementation of the proposed technique exists, which has been adapted to on-line processing under a simple text editor, thus providing a system which parses a text simultaneously as it is entered and edited.
%U ftp://ftp.coli.uni-sb.de/pub/claus/claus32.ps


%0 Journal Article
%A Wokurek, Wolfgang
%A Pützer, Manfred
%D 2002
%T Akustische Analyse normalstimmlicher und pathologischer Phonation
%! Akustische Analyse normalstimmlicher und pathologischer Phonation
%F Wokurek:2002:AAN
%O to appear


%0 Report
%A Worm, Karsten
%D 1995
%T An Experiment with LUDRs in Oz
%C Saarbrücken
%I Universität des Saarlandes
%S Vermobil Technisches Dokument
%7 30
%! An Experiment with LUDRs in Oz
%F Worm:1995:ELO


%0 Conference Proceedings
%A Worm, Karsten
%A Heinecke, Johannes
%D 1996
%T The Verbmobil Semantic Database
%E Gibbon, D.
%B Natural Language Processing and Speech Technology. Results of the 3rd KONVENS, October 7-9
%C Bielefeld, Germany
%I Mouton de Gruyter
%! The Verbmobil Semantic Database
%2 Worm:1996:VSD.pdf
%F Worm:1996:VSD


%0 Conference Proceedings
%A Worm, Karsten L.
%A Rupp, C. J.
%D 1998
%T Towards Robust Understanding of Speech by Combination of Partial Analyses
%B Proceedings of the 13th biennial European Conference on Artificial Intelligence (ECAI'98), August 23-28
%C Brighton, UK
%P 190-194
%! Towards Robust Understanding of Speech by Combination of Partial Analyses
%F Worm:1998:TRU


%0 Conference Proceedings
%A Würtz, Jörg
%D 1996
%T Constraint-Based Scheduling in Oz
%E Zimmermann, U.
%E Derigs, U.
%E Gaul, W.
%E Möhrig, R.
%E Schuster, K.-P.
%B Operations Research Proceedings 1996. Selected Papers of the Symposium on Operations Research (SOR '96), September 4-6
%C Technical University Braunschweig, Germany
%I Springer
%P 218-223
%! Constraint-Based Scheduling in Oz
%2 Wurtz:1996:CBS.pdf Wurtz:1996:CBS.ps
%F Wurtz:1996:CBS
%X It is discussed, how scheduling problems can be solved in the concurrent constraint programming language Oz. Oz is the first high-level constraint language, which offers an interface to invent new constraints in an efficient way using C++. Its multi-paradigm features including programmable search are unique in the field of constraint programming. Through the interface, algorithms from Operations Research and related fields can be incorporated. The algorithms can be combined through encapsulation into constraints and can communicate via shared variables. This is exemplified by the integration of new techniques based on edge-finding for job-shop and multi-capacitated scheduling. The viability of Oz as a platform for problem solving is also exemplified by a graphical scheduling workbench. The performance for job-shop problems is comparable to state-of-the-art scheduling tools.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/ConstraintScheduling97.ps.gz


%0 Conference Proceedings
%A Würtz, Jörg
%D 1996
%T Oz Scheduler: A Workbench for Scheduling Problems
%B 8th IEEE International Conference on Tools with Artificial Intelligence (ICTAI '96), November 16-19
%C Toulouse, France
%I IEEE Computer Society Press
%P 132-139
%! Oz Scheduler: A Workbench for Scheduling Problems
%2 Wurtz:1996:OSW.pdf Wurtz:1996:OSW.ps
%F Wurtz:1996:OSW
%X This paper describes the Oz Scheduler, a workbench for scheduling problems. Through a graphical interface, the user can freely combine the elements that define a scheduling strategy. Such elements include constraints with different popagation behavior or distribution and search strategies. Exploring the possible combinations can lead to better solutions. Recent and successful techniques for scheduling are incorporated. Resulting from the selections made, a constraint problem is generated dynamically. For this problem, the solution, statistics and the search can be inspected by several graphical tools. The functionality can be extended by sending messages to the Scheduler. The functionality and the implementation of the Oz Scheduler are discussed. The overall performance of the Scheduler for standard benchmarks is comparable to state-of-the-art special-purpose systems for scheduling. The implementation is based on the concurrent constraint language Oz.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/scheduler96.ps.gz


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


%0 Conference Proceedings
%A Würtz, Jörg
%A Müller, Tobias
%D 1996
%T Constructive Disjunction Revisited
%E Görz, G.
%E Hölldobler, S.
%B KI-96: Advances in Artificial Intelligence. 20th Annual German Conference on Artificial Intelligence, September 17-19
%C Dresden, Germany
%I Springer
%P 377-386
%S Lecture Notes in Artificial Intelligence
%7 1137
%! Constructive Disjunction Revisited
%2 Wurtz:1996:CDR.pdf Wurtz:1996:CDR.ps
%F Wurtz:1996:CDR
%X Finite Domain Programming is a technique for solving combinatorial problems like planning, scheduling, configuration or timetabling. Inevitably, these problems employ disjunctive constraints. A rather new approach to model those constraints is constructive disjunction, whereby common information is lifted from the alternatives, aiming for stronger pruning of the search space. We show where constructive disjunction provides for stronger pruning and where it fails to do so. For several problems, including a real-world college timetabling application, benefits and limitations of constructive disjunction are exemplified. As an experimental platform we use the concurrent constraint language Oz.
%U ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/KI96.ps.gz


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


%0 Conference Proceedings
%A Xu, Feiyu
%D 1998
%T Underspecified Treatment of Verb Phrase Ellipsis
%B Proceedings of the ESSLLI '98 Student Session, August 17-28
%C Saarbrücken, Germany
%! Underspecified Treatment of Verb Phrase Ellipsis
%2 Xu:1998:UTV.pdf Xu:1998:UTV.ps
%3 j
%F Xu:1998:UTV
%X This paper deals with the underspecified semantic representation of ellipsis and its resolution. We present an analysis to explain the distribution of stict and sloppy readings in the interaction of verb phrase ellipsis and anaphora. The analysis is integrated into a framwork that enables a unified and underspecified treatment of scope, anaphora, and VPE.
%U http://www.dfki.uni-sb.de/~feiyu/esslli.pdf ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ESSLLI-feiyu-98.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ESSLLI-feiyu-98.entry


%0 Conference Proceedings
%A Xu, Feiyu
%A Kurz, Daniela
%A Piskorski, Jakub
%A Schmeier, Sven
%D 2002
%T Term Extraction and Mining Term Relations from Free-Text Documents in the Financial Domain
%B Proceedings of the 5th International Conference on Business Information Systems (BIS'02), April 24-25
%C Poznan, Poland
%! Term Extraction and Mining Term Relations from Free-Text Documents in the Financial Domain
%2 Xu:2002:TEM.pdf
%3 j
%F Xu:2002:TEM
%X In this paper, we present an approach to learning domain relevant terms automatically. We took the financial domain as our experiment domain.
%O to appear
%U http://www.dfki.de/~feiyu/Bis2002.pdf


%0 Conference Proceedings
%A Xu, Feiyu
%A Kurz, Daniela
%A Piskorski, Jakub
%A Schmeier, Sven
%D 2002
%T A Domain Adaptive Approach to Automatic Acquisition of Domain Relevant Terms and their Relations with Bootstrapping
%B Proceedings of the 3rd International Conference on Language Resources an Evaluation (LREC'02), May 29-31
%C Las Palmas, Canary Islands, Spain
%! A Domain Adaptive Approach to Automatic Acquisition of Domain Relevant Terms and their Relations with Bootstrapping
%2 Xu:2002:DAA.pdf
%3 j
%F Xu:2002:DAA
%X In this paper, we present an unsupervised hybrid text-mining approach to automatic acquisition of domain relevant terms and their relations. We deploy the TFIDF-based term classification method to acquire domain relevant single-word terms. Further, we apply two strategies in order to learn lexico-syntatic patterns which indicate paradigmatic and domain relevant syntagmatic relations between the extracted terms. The first one uses an existing ontology as initial knowledge for learning lexico-syntactic patterns, while the second is based on different collocation acquisition methods to deal with the free-word order languages like German. This domain-adaptive method yields good results even when trained on relatively small training corpora. It can be applied to different real-world applications, which need domain-relevant ontology, for example, information extraction, information retrieval or text classification.
%U http://www.dfki.uni-sb.de/~feiyu/LREC_TermExtraction_final.pdf


%0 Conference Proceedings
%A Xu, Feiyu
%A Netter, Klaus
%A Stenzhorn, Holger
%D 2000
%T MIETTA - A Framework for Uniform and Multilingual Access to Structured Database and Web Information
%B Proceedings of the 5th International Workshop on Information Retrieval with Asian Languages (IRAL'00)
%C Hong Kong
%! MIETTA - A Framework for Uniform and Multilingual Access to Structured Database and Web Information
%2 Xu:2000:MFU.pdf
%3 j
%F Xu:2000:MFU
%X We describe a WWW-based information system called MIETTA, which allows uniform and multilingual access to heterogenous data sources in the tourism domain. The design of the search engine is based on a new crosslingual framework. The framework integrates a crosslingual retrieval strategy with a strategy using natural language techniques: information extraction and multilingual generation. The combination of information extraction and multilingual generation enables the multilingual presentation of the database content and free text crosslingual information retrieval of the structured data entries. We will demonstrate that the new framework is useful for domain specific and multilingual applications.
%U http://www.dfki.uni-sb.de/~feiyu/iral00.pdf


%0 Conference Proceedings
%A Xu, Feiyu
%A Netter, Klaus
%A Stenzhorn, Holger
%D 2000
%T A System for Uniform and Multilingual Access to Structured Database and Web Information in a Tourism Domain
%B Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics. Demo Session (ACL'00), October 3-6
%C Hong Kong
%! A System for Uniform and Multilingual Access to Structured Database and Web Information in a Tourism Domain
%2 Xu:2000:SUM.pdf
%3 j
%F Xu:2000:SUM
%X We present an information system, which was developed within the project MIETTA (Multilingual Information Extraction for Tourism and Travel Assistance), a project in the Language Engineering Sector of the Telematics Application Program of the European Commission. MIETTA facilitates multilingual information access in a number of languages (English, Finnish, French, German, Italian) to the tourist information (web documents and database information) provided by three different geographical regions: the German federal state of Saarland, the Finnish region around Turku and the Italian City of Rome. The challenge of the approach is to merge the technologies of crosslingual information retrieval (Jamie Carbonell et al, 1997) and natural language processing to achieve the following goals: · Provide full access to all information independent of the language the information was originally encoded in and independent of the query language; · Provide transparent natural language access to structured database information; · Provide hybrid and flexible query options to enable users to obtain maximally precise information.
%U http://www.dfki.de/~feiyu/acl00.pdf


%0 Conference Proceedings
%A Xu, Hui
%D 1999
%T English-Style and Chinese-Style Topic: A Uniform Semantic Analysis
%E Wu, Jhing-Fa Wang and Chung-Hsien
%B 13th Pacific Asia Conference on Language, Information and Computation (PACLIC 13), February 10-12
%C Taipei, Taiwan
%! English-Style and Chinese-Style Topic: A Uniform Semantic Analysis
%3 j
%F Xu:1999:ESC


%0 Conference Proceedings
%A Xu, Hui
%D 1999
%T DRT-Analysis for Topic-Comment Constructions in Chinese
%E Bunt, H.
%B 3rd International Workshop on Computational Semantics (IWCS-3), January 13-15
%C Tilburg, The Netherlands
%! DRT-Analysis for Topic-Comment Constructions in Chinese
%2 Xu:1999:DAT.pdf Xu:1999:DAT.ps
%3 j
%F Xu:1999:DAT
%U http://www.coli.uni-sb.de/~xu/iwcs_p.ps


%0 Conference Proceedings
%A Yao, Tian-Fang
%A Xu, Feiyu
%A Zhang, Dong-Mo
%A Li, Fang
%A Wang, Qian
%A Sheng, Huan-Ye
%D 2001
%T A Multilingual Information Retrieval Model based on Information Extraction and Text Generation
%B Proceedings of ICIP 2001
%C Shanghai
%! A Multilingual Information Retrieval Model based on Information Extraction and Text Generation
%2 Yao:2001:MIR.pdf
%3 j
%F Yao:2001:MIR
%X This paper proposes a multilingual information retrieval model which is principally based on information extraction and text generation techniques. The model embodies both the conciseness and accuracy of the retrieval results provided by information extraction technique, and the coherence and standardization of ones supplied by text generation technique. It synthesizes the advantages of both techniques. In this paper, we mainly present the information extraction techniques adopted in the model, including multilingual information extraction, concept based multilingual thesaurus, template automatic development, multilingual information retrieval and index etc. We build the model for providing the multilingual information retrieval means on Internet, which is accurate, quick and convenient and is used in a specific domain. Key words multilingual information retrieval, multilingual information extraction, concept based multilingual thesaurus, template automatic development, multilingual information retrieval and index.
%U http://www.dfki.de/~feiyu/YaoXu2001.pdf


%0 Report
%A Zaenen, Annie
%A Ericsson, Stinaand
%A Larsson, Staffan 
%A Mikheev, A.
%A Milward, David
%A Pinkal, Manfred
%A Poesio, Massimo
%A Rupp, C. J.
%A Worm, Karsten L.
%D 2000
%T Robust Interpretation and Dialogue Dynamics
%C Göteborg
%I Göteborg University, Department of Linguistics
%S Technical Report
%! Robust Interpretation and Dialogue Dynamics
%2 Zaenen:2000:RID.pdf
%F Zaenen:2000:RID
%U http://www.ling.gu.se/research/projects/trindi/private/deliverables/D5.2/D5.2.pdf


%0 Book Section
%A Zaenen, Annie
%A Uszkoreit, Hans
%D 1998
%T Overview
%E Varile, G.
%E Zampolli, A.
%B Survey of the State of the Art in Human Language Technology
%C Cambridge
%I Cambridge University Press
%P 95
%S Studies in Natural Language Processing
%! Overview
%2 Zaenen:1998:O.pdf
%3 j
%F Zaenen:1998:O


%0 Journal Article
%A Ziff, Donald A.
%A Spackmann, Stephen
%A Waclena, Keith
%D 1995
%T Funser: A Functional Server for Textual Information Retrieval
%B Journal of Functional Programming
%V 5
%N 3
%P 317-343
%! Funser: A Functional Server for Textual Information Retrieval
%2 Ziff:1995:FFS.pdf
%F Ziff:1995:FFS


%0 Report
%A Ziff, Donald A.
%A Waclena, Keith
%A Spackman, Stephen P.
%D 1991
%T CAL: Combinator Assembly Language
%C Chicago
%I University of Chicago Center for Information and Language Studies
%S Technical Report
%! CAL: Combinator Assembly Language
%2 Ziff:1991:CCA.pdf Ziff:1991:CCA.ps
%F Ziff:1991:CCA
%U http://www.lib.uchicago.edu/keith/cils-tr/tr91-02.ps


%0 Report
%A Ziff, Donald A.
%A Waclena, Keith
%A Spackman, Stephen P.
%D 1992
%T Using a Lazy Functional Language for Textual Information Retrieval
%C Chicago
%I University of Chicago Center for Information and Language Studies
%S Technical Report
%! Using a Lazy Functional Language for Textual Information Retrieval
%F Ziff:1992:ULF


%0 Book
%A Zindler, H.
%A Barry, William J.
%D 1975
%T Fehler-ABC: English-German
%C Stuttgart
%I Klett
%! Fehler-ABC: English-German
%F Zindler:1975:FAE


%0 Conference Proceedings
%A Benzmüller, Chris  
%A Fiedler, Armin 
%A Gabsdil, Malte
%A Horacek, Helmut 
%A Kruijff-Korbayova, Ivana 
%A Pinkal, Manfred  
%A Siekmann, Jörg  
%A Tsovaltzi, Dimitra 
%A Quoc Vo, Bao 
%A Wolska, Magdalena
%D 2003
%T A Wizard-of-Oz Experiment for Tutorial Dialogues in Mathematics
%B Proceedings of the AIED Workshop on Advanced Technologies for Mathematics Education
%C Sydney, Australia
%P 471-481
%! A Wizard-of-Oz Experiment for Tutorial Dialogues in Mathematics
%F Benzmuller:2003:WOE


%0 Conference Proceedings
%A Benzmüller, Chris
%A Fiedler, Armin
%A Gabsdil, Malte
%A Horacek, Helmut
%A Kruijff-Korbayova, Ivana
%A Pnikal, Manfred
%A Siekmann, Jörg
%A Tsovaltzi, Dimitra
%A Quoc Vo, Bao
%A Wolska, Magdalena
%D 2003
%T Tutorial Dialogs on Mathematical Proofs
%B IJCAI Workshop on Knowledge Representation and Automated Reasoning for E-Learning Systems
%C Acapulco
%! Tutorial Dialogs on Mathematical Proofs
%F Benzmuller:2003:TDM


%0 Report
%A Brinckmann, Caren
%D 1997
%T German in Eight Weeks -- A Crash Course for CHATR
%C Kyoto, Japan
%I ATR Interpreting Telecommunications Research Laboratories
%8 September
%! German in Eight Weeks -- A Crash Course for CHATR
%@ TR-IT-0236
%F Brinckmann:1997:GEWa
%X With all its different modules, CHATR is an extremely big
system. If the output doesn't sound quite right, there are
always several ways of improvement. As an example of what
can be achieved within eight weeks, this technical report
describes how to improve the German voice of CHATR,
focussing on the database, the lexicon and the prosody
prediction.


%0 Journal Article
%A Brinckmann, Caren
%A Trouvain, Jürgen
%D 2003
%T The Role of Duration Models and Symbolic Representation for Timing in Synthetic Speech
%B International Journal of Speech Technology
%V 6
%N 1
%P 21-23
%8 January
%! The Role of Duration Models and Symbolic Representation for Timing in Synthetic Speech
%F Brinckmann:2003:RDM
%X In order to determine priorities for the improvement of timing in synthetic speech this study looks at the role of segmental duration prediction and the role of phonological symbolic representation in the perceptual quality of a text-to-speech system. In perception experiments using German speech synthesis, two standard duration models (Klatt rules and CART) were tested. The input to these models consisted of a symbolic representation which was either derived from a database or a text-to-speech system. Results of the perception experiments show that different duration models can only be distinguished when the symbolic representation is appropriate. Considering the relative importance of the symbolic representation, post-lexical segmental rules were investigated with the outcome that listeners differ in their preferences regarding the degree of segmental reduction. As a conclusion, before fine-tuning the duration prediction, it is important to derive an appropriate phonological symbolic representation in order to improve timing in synthetic speech.
%U http://dx.doi.org/10.1023/A:1021043804581


%0 Conference Proceedings
%A Dienes, Peter
%A Dubey, Amit
%D 2003
%T Antecedent Recovery: Experiments with a Trace Tagger
%B In Proceedings of the 2003 Conference on Empirical Methods
in Natural Language Processing, EMNLP 2003
%C Sapporo, Japan
%! Antecedent Recovery: Experiments with a Trace Tagger
%F Dienes:2003:ARE
%X This paper explores the problem of finding non-local
dependencies.  First, we isolate a set of features useful for this task.  Second, we develop both a two-step approach which combines a trace tagger with a state-of-the-art
lexicalized parser and a one-step approach which finds
non-local dependencies while parsing. We find that the
former outperforms the latter because it makes better use of
the features we isolate.
%U http://www.coli.uni-sb.de/~dienes/dienes_dubey_emnlp03.ps.gz


%0 Conference Proceedings
%A Dienes, Peter
%A Dubey, Amit
%D 2003
%T Deep Syntactic Processing by Combining Shallow Methods
%B Proceedings of the 41st Annual Meeting of the Association
for Computational Linguistics, ACL 2003
%C Sapporo, Japan
%! Deep Syntactic Processing by Combining Shallow Methods
%F Dienes:2003:DSP
%X We present a novel approach for finding discontinuities that outperforms previously published results on this task. Rather than using a deeper grammar formalism, our system combines a simple unlexicalized PCFG parser with a shallow pre-processor.  This pre-processor, which we call a trace tagger, does surprisingly well on detecting where discontinuities can occur without using phase structure information.
%U http://www.coli.uni-sb.de/~dienes/dienes_dubey_acl03.ps.gz


%0 Book Section
%A Egg, Markus
%D 2002
%T Beginning Novels and Finishing Hamburgers - Remarks on the Semantics of to begin
%E Dölling, Johannes
%E Zybatow, Tatjana
%B Ereignisstrukturen
%C Leipzig
%I Universität Leipzig
%V 76
%S Linguistische Arbeitsberichte
%! Beginning Novels and Finishing Hamburgers - Remarks on the Semantics of to begin
%F Egg:2002:BNFb
%X Verbs like begin may take either a VP or an NP complement, but their meaning is pretty similar in both cases, e.g., for begin, the start of an eventuality is at stake. Pustejovsky's approach captures this similarity in terms of an invariant meaning of the verb, which entails a process or reinterpretation for the transitive variant of the verb. I will show that while the intuitions of this proposal are on the right track, its actual implementation suffers from a number of shortcomings. I will offer an analysis that preserves Pustejovsky's intuition but avoids these shortcomings. My analysis is based on an appropriate underspecifcation formalism.


%0 Journal Article
%A Egg, Markus
%D 2003
%T Beginning novels and finishing hamburgers - remarks on the semantics of {\em to begin\/}
%B Journal of Semantics
%V 20
%P 163-191
%! Beginning novels and finishing hamburgers - remarks on the semantics of {\em to begin\/}
%F Egg:2003:BNF


%0 Book Section
%A Egg, Markus
%A Striegnitz, Kristina
%D 2003
%T Type coercion from a natural language generation point of view
%E Härtel, Holden
%E Tappe, Heike
%B Mediating between Concepts and Grammar
%C Berlin
%I Mouton de Gruyter
%V 152
%P 323-348
%! Type coercion from a natural language generation point of view
%F Egg:2003:TCN
%U http://www.coli.uni-sb.de/~kris/papers/typegen.ps.gz


%0 Conference Proceedings
%A Erk, Katrin
%A Kowalski, Andrea
%A Pado, Sebastian
%A Pinkal, Manfred
%D 2003
%T Creating a Resource for Lexical Semantics
%B Proceedings of the Workshop on Frame Semantics, CIL-17
%C Prague, Czechia
%! Creating a Resource for Lexical Semantics
%F Erk:2003:CRLa
%U http://www.coli.uni-sb.de/~erk/OnlinePapers/CIL.ps


%0 Conference Proceedings
%A Erk, Katrin
%A Kowalski, Andrea
%A Pado, Sebastian
%A Pinkal, Manfred
%D 2003
%T Towards a Resource for Lexical Semantics: A Large German Corpus with Extensive Semantic Annotation
%B Proceedings of ACL-03
%C Sapporo, Japan
%! Towards a Resource for Lexical Semantics: A Large German Corpus with Extensive Semantic Annotation
%F Erk:2003:TRLa
%U http://www.coli.uni-sb.de/~erk/OnlinePapers/ACL03.ps


%0 Conference Proceedings
%A Erk, Katrin
%A Kowalski, Andrea
%A Pado, Sebastian
%A Pinkal, Manfred
%D 2003
%T Building a Resource for Lexical Semantics
%B Proceedings of the Workshop on Frame Semantics, XVII. International Congress of Linguists (CIL)
%C Prague, Czech Republic
%! Building a Resource for Lexical Semantics
%F Erk:2003:BRLa
%U http://www.coli.uni-sb.de/~erk/OnlinePapers/CIL.ps


%0 Conference Proceedings
%A Fliedner, Gerhard
%D 2003
%T Tools for Building a Lexical Semantic Annotation
%E Duchier, Denys
%B Prospects and Advances in the Syntax/Semantic Interface. Lorraine-Saarland Workshop Series.
%C Loria, Nancy
%P 5-9
%8 October 20-21
%! Tools for Building a Lexical Semantic Annotation
%F Fliedner:2003:TBLa


%0 Conference Proceedings
%A Forst, Martin
%A Bertomeu, Nuria
%A Crysmann, Berthold
%A Fouvry, Frederik
%A Hansen-Schirra, Silvia
%A Kordoni, Valia
%D 2004
%T Towards a dependency-based gold-standard for German parsers - The TiGer Dependency Bank
%B Proceedings of the LINC-04 Workshop
%C Geneva
%! Towards a dependency-based gold-standard for German parsers - The TiGer Dependency Bank
%F Forst:2004:TDB


%0 Conference Proceedings
%A Fouvry, Frederik
%D 2003
%T Constraint relaxation with weighted feature structures
%B IWPT 03. Proceedings. 8th International Workshop on Parsing Technologies [...]
%C LORIA (INRIA Lorraine), Nancy, France
%P 103-114
%8 April 23-25
%! Constraint relaxation with weighted feature structures
%F Fouvry:2003:CRW


%0 Conference Proceedings
%A Fouvry, Frederik
%D 2003
%T Lexicon acquisition with a large-coverage unification-based grammar
%B EACL 2003. 10th Conference of The European Chapter. Conference Companion
%C ACL, Budapest, Hungary
%P 87-90
%8 April 12-17
%! Lexicon acquisition with a large-coverage unification-based grammar
%X We describe how unknown lexical entries are processed in a unification-based framework with large-coverage grammars and how from their usage lexical entries are extracted. To keep the time and space usage during parsing within bounds, information from external sources like PoS taggers and morphological analysers is taken into account
when information is constructed for unknown words.
%F Fouvry:2003:LAL


%0 Book Section
%A Hajicova, Eva
%A Kruijff-Korbayova, Ivana
%D 1999
%T On the notion of topic
%E Hajicova, Eva
%E Hoskovec, Tomas
%E Leka, Oldich
%E Sgall, Petr
%E Skoumalova, Zdena
%C Amsterdam, the Netherlands
%V 3
%P 225-236
%! On the notion of topic
%F Hajicova:1999:NT


%0 Book Section
%A Hajicova, Eva
%A Kruijff-Korbayova, Ivana
%A Sgall, Petr
%D 1999
%T Prague Dependency Treebank: Restoration of Deletions
%E Matousek, Vaclav
%E Mautner, Pavel
%E Ocelikova, Jana
%E Sojka, Petr
%B Text, Speech and Dialogue - Second International Workshop, TSD'99, Plzen, Czech Republic, September 1999
%C Berlin
%I Springer
%V 1692
%P 44-49
%! Prague Dependency Treebank: Restoration of Deletions
%F Hajicova:1999:PDTb
%U http://shadow.ms.mff.cuni.cz/pdt/Corpora/PDT_1.0/References/tsd99-deletion.pdf


%0 Report
%A Hajicova, Eva
%A Sgall, Petr 
%A Uszkoreit, Hans
%A Oliva, Karel
%A Platek, Martin
%A Kubon, Vladislav
%A Hric, Jano
%A Bemova, Alevtina
%A Petkevic, Vladimir
%A Skoumalova, Hana
%A Rosen, Alexandr
%A Korbayova, Ivana
%D 1994
%T Adaptation and transfer of parsing techniques
%C Prague, Czech Republic
%I Charles University
%9 Deliverable of the joint project PECO 2824
%! Adaptation and transfer of parsing techniques
%F Hajicova:1994:ATP


%0 Journal Article
%A Hansen, Silvia
%A Klaumann, Mary
%A Neumann, Stella
%D 2002
%T How to overcome registerial translation problems
%B Revista Brasileira de Linguistica Aplicada
%V 2
%N 2
%P 15-23
%! How to overcome registerial translation problems
%F Hansen:2002:HOR


%0 Conference Proceedings
%A Hansen, Silvia
%A Teich, Elke
%D 2001
%T Multi-layer analysis of translation corpora: methodological issues and practical implications
%B Proceedings of EUROLAN 2001 Workshop on Multi-layer Corpus-based Analysis
%C lasi
%P 44-55
%! Multi-layer analysis of translation corpora: methodological issues and practical implications
%F Hansen:2001:MLA


%0 Conference Proceedings
%A Hansen-Schirra, Silvia
%D 2003
%T Linguistic enrichment and exploitation of the Translational English Corpus
%B Proceedings of the Corpus Linguistics 2003 conference
%C Lancaster
%! Linguistic enrichment and exploitation of the Translational English Corpus
%F Hansen-Schirra:2003:LEE


%0 Conference Proceedings
%A Hansen-Schirra, Silvia
%D 2004
%T Understanding the translation process: from theoretical assumptions to corpus-based and psycholinguistic evidence
%B Proceedings of the International Conference on Linguistic Evidence - Empirical, Theoretical, and Computational Perspectives
%C Tübingen
%! Understanding the translation process: from theoretical assumptions to corpus-based and psycholinguistic evidence
%F Hansen-Schirra:2004:UTP


%0 Conference Proceedings
%A Korbayova, Ivana
%D 1992
%T Automatic Document Dispatcher: A system for automatic analysis of document contents
%B Deppartment of Computers, Faculty of Electrical Engineering
%C Prague, Czechoslovakia
%I Czech Technical University
%! Automatic Document Dispatcher: A system for automatic analysis of document contents
%F Korbayova:1992:ADD


%0 Report
%A Korbayova, Ivana
%D 1993
%T Pronominal reference in the Plinius corpus
%C Enschede, Netherlands
%I Knowledge-Based Systems Group, Twente University
%! Pronominal reference in the Plinius corpus
%@ KBS-NOTE 93-030
%F Korbayova:1993:PRP


%0 Journal Article
%A Korbayova, Ivana
%D 1994
%T Contextual reference of noun phrases in Plinius: Part One
%B Prague Bulletin of Mathematical Linguistics
%N 61
%P 23-46
%! Contextual reference of noun phrases in Plinius: Part One
%F Korbayova:1994:CRN
%O Charles University, Prague, Czech Republic


%0 Journal Article
%A Korbayova, Ivana
%D 1995
%T Contextual reference of noun phrases in Plinius: Part Two
%B Prague Bulletin of Mathematical Linguistics
%V 62
%P 47-72
%! Contextual reference of noun phrases in Plinius: Part Two
%F Korbayova:1995:CRN
%O Charles University, Prague, Czech Republic


%0 Report
%A Korbayova, Ivana
%D 1996
%T Pronominal reference in the Plinius corpus
%C Enschede, Netherlands
%I Twente University
%9 Memoranda Informatica
%! Pronominal reference in the Plinius corpus
%@ UT-KBS-96-06
%F Korbayova:1996:PRP


%0 Report
%A Korbayova, Ivana
%D 1997
%T Final Report of a research project granted by the Open
Society Institute: A System for Analysis of Czech Texts
%C Prag, Czech Republic
%I Final Report of a research project granted by the Open Society Institute
%! Final Report of a research project granted by the Open
Society Institute: A System for Analysis of Czech Texts
%F Korbayova:1997:FRR


%0 Book Section
%A Kruijff, Geert-Jan
%A Kruijff-Korbayova, Ivana
%D 1999
%T Text structuring in a multilingual system for generation of instructions
%E Matousek, Vaclav
%E Mautner, Pavel
%E Ocelikova, Jana
%E Sojka, Petr
%B Proceedings of the Conference on Text, Speech and Dialogue (TSD'99), Marianske Lazne, Czech Republic
%P 89-94
%! Text structuring in a multilingual system for generation of instructions
%F Kruijff:1999:TSMb
%U http://www.coli.uni-sb.de/~korbay/Publications/tsd99-ts.ps.gz


%0 Conference Proceedings
%A Kruijff, Geert-Jan 
%A Kruijff-Korbayova, Ivana
%D 2001
%T A Hybrid Logis Fomralization of Information Structure Sensitive Discourse Interpretation
%E Matousek, Vaclav 
%E Mautner, Pavel 
%E Mouvcek, Roman 
%E Tauser, Karel
%B Proceedings of the 4th International Conference on Text, Speech and Dialogue (TSD'2001
%C Zelezna Ruda, Czech Republic
%I Springer Verlag
%P 31-38
%S Lecture Notes in Artificial Intelligence
%! A Hybrid Logis Fomralization of Information Structure Sensitive Discourse Interpretation
%F Kruijff:2001:HLFb
%U http://www.coli.uni-sb.de/~korbay/Publications/tsd01.ps.gz


%0 Book Section
%A Kruijff-Korbayova, Ivana
%A Bateman, John
%A Kruijff, Geert-Jan
%D 2002
%T Generation of Contextually Appropriate Word Order
%E van Deemter, Kees
%E Kibble, Rodger
%B Information Sharing
%I CSLI
%P 193-222
%! Generation of Contextually Appropriate Word Order
%F Kruijff-Korbayova:2002:GCAb


%0 Conference Proceedings
%A Kruijff-Korbayova, Ivana
%A Ericsson, Stina
%A Rodriguez, Kepa Joseba
%A Karagjosova, Elena
%D 2003
%T Producing Contextually Appropriate Intonation is an Information-State Based Dialogue System
%B Proceedings of the 10th Conference of the European Chapter of the Association for Computational Linguistics (EACL)
%C ACL, Budapest, Hungary
%P 227-234
%8 April 12-17
%! Producing Contextually Appropriate Intonation is an Information-State Based Dialogue System
%F Kruijff-Korbayova:2003:PCA


%0 Book Section
%A Kruijff-Korbayova, Ivana
%A Kruijff, Geert-Jan
%D 1999
%T Handling Word Order in a multilingual system for generation of  instructions
%E Matousek, Vaclav
%E Mautner, Pavel
%E Ocelikova, Jana
%E Sojka, Petr
%B Proceedings of the Conference on Text, Speech and Dialogue TSD'99 Marianske Laznve, Czech Republic
%I Springer-Verlag
%P 83-88
%! Handling Word Order in a multilingual system for generation of  instructions
%F Kruijff-Korbayova:1999:HWOb
%U http://www.coli.uni-sb.de/~korbay/Publications/tsd99-wo.ps.gz


%0 Journal Article
%A Kruijff-Korbayova, Ivana
%A Steedman, Mark
%D 2003
%T Discourse on Information Structure
%B Journal of Logic, Language and Information: Special Issue on Discourse and Information Structure
%V 12
%N 3
%P 249-259
%! Discourse on Information Structure
%F Kruijff-Korbayova:2003:DIS


%0 Book
%A Lerner, Jan
%A Dünges, Petra
%D 2003
%T Anaphern, Quantoren und Parallelität
%C Tübingen
%I Gunter Narr Verlag
%! Anaphern, Quantoren und Parallelität
%F Lerner:2003:AQPa


%0 Conference Proceedings
%A Neumann, Stella
%A Hansen-Schirra, Silvia
%D 2003
%T The challenge of working with multilingual corpora
%E Neumann, Stella
%E Hansen-Schirra, Silvia
%B Proceedings of the Workshop "Multilingual Corpora: Linguistic Requirements and Technical Perspectives"
%C Lancaster
%! The challenge of working with multilingual corpora
%F Neumann:2003:CWM


%0 Conference Proceedings
%A Neumann, Stella
%A Hansen-Schirra, Silvia
%D 2003
%T Proceedings of the Workshop "Multilingual Corpora: Linguistic Requirements and Technical Perspectives"
%C Lancaster
%! Proceedings of the Workshop "Multilingual Corpora: Linguistic Requirements and Technical Perspectives"
%F Neumann:2003:PWM


%0 Conference Proceedings
%A Pado, Sebastian
%A Lapata, Mirella
%D 2003
%T Constructing Vector Space Models from Parsed Corpora
%B Proceedings of ACL-03
%C Sapporo, Japan
%! Constructing Vector Space Models from Parsed Corpora
%F Pado:2003:CVS
%U http://www.coli.uni-sb.de/~pado/pub/acl03/dv_acl03.pdf


%0 Conference Proceedings
%A Pado, Sebastian
%A Lapata, Mirella
%D 2003
%T Constructing Semantic Space Models from Parsed Corpora
%B Proceedings of ACL-03
%C Sapporo, Japan
%! Constructing Semantic Space Models from Parsed Corpora
%F Pado:2003:CSS


%0 Journal Article
%A Pinkal, Manfred
%D 2003
%T Am Anfang war das Wort
%B Bibel im Dialog, Evangelische Studentinnen- und Studentengemeinde Saarbrücken (Hrsg.), Röhrig Universitätsverlag, St. Ingbert
%P 34-47
%! Am Anfang war das Wort
%F Pinkal:2003:AWW


%0 Report
%A Speel, Piet-Hein 
%A Korbayova, Ivana
%D 1992
%T Inferences making use of relations of the Plinius ontology
%C Enschede, the Netherlands
%I Knowledge-Based Systems Group, University Twente
%! Inferences making use of relations of the Plinius ontology
%@ KBS-NOTE 92-050
%F Speel:1992:IMU


%0 Journal Article
%A ter Haar, Laudy 
%A Korbayova, Ivana
%A van der Vet, Paul
%A Andernach, Toine
%D 1996
%T Using domain knowledege in resolving pronominal anaphora in plinius
%B Belgian Journal of Linguistics
%V 10
%P 11-35
%! Using domain knowledege in resolving pronominal anaphora in plinius
%F Haar:1996:UDK
%O Presented at the Conference Anaphoric Relations and (in)coherence, Antwerp, December 1--3, 1994.


%0 Conference Proceedings
%A Uszkoreit, Hans
%A Jörg, Brigitte
%A Erbach, Gregor
%D 2003
%T An Ontology-based Knowledge Portal for Language Technology
%B Proceedings of ENABLER/ELSNET Workshop "International Roadmap for Language Resources"
%C Paris
%! An Ontology-based Knowledge Portal for Language Technology
%F Uszkoreit:2003:OBKa
%U http://www.coli.uni-sb.de/~erbach/pub/COLLATE-EnablerElsnet03.pdf


%0 Journal Article
%A Warner, Natasha
%A Weber, Andrea
%D 2001
%T Perceptual consequences of unintended epenthetic stops.
%B Journal of Phonetics
%V 29
%P 53-87
%! Perceptual consequences of unintended epenthetic stops.
%F Warner:2001:PCU


%0 Conference Proceedings
%A Warner, Natasha
%A Weber, Andrea
%D 2002
%T Stop epenthesis at syllable boundaries.
%B Proceedings of the 7th International Conference on Spoken
Language Processing
%C Adam's Mark Hotel, Denver, Colorado
%P 1121-1124
%! Stop epenthesis at syllable boundaries.
%F Warner:2002:SES


%0 Conference Proceedings
%A Weber, Andrea
%D 1998
%T Listening to non-native language which violates native assimilation rules.
%E Duez, D.
%B Proceedings of the European Scientific Communication Association workshop: Sound patterns of Spontaneous Speech
%C Aix-en-Provence, France: La Baume-les -Aix
%P 101-104
%! Listening to non-native language which violates native assimilation rules.
%F Weber:1998:LNN


%0 Conference Proceedings
%A Weber, Andrea
%D 1999
%T Help or hindrance: How violation of different assimilation rules affects spoken-language processing.
%B 137th meeting of the Acoustical Society of America
%C Berlin, Germany
%! Help or hindrance: How violation of different assimilation rules affects spoken-language processing.
%F Weber:1999:HHH


%0 Conference Proceedings
%A Weber, Andrea
%D 2000
%T Phonotactic and acoustic cues for word segmentation in English.
%E Yuan, B.
%E Huang, T.
%E Tang, X.
%B Proceedings of the 6th International Conference on Spoken Language Processing
%C Beijing International
Convention Center, Beijing, China
%V 3
%P 782-785
%! Phonotactic and acoustic cues for word segmentation in English.
%F Weber:2000:PAC


%0 Conference Proceedings
%A Weber, Andrea
%D 2000
%T The role of phonotactics in the segmentation of native and non-native continuous speech.
%E Cutler, A.
%E McQueen, J.
%E Zondervan, R.
%B Proceedings of the Workshop on Spoken Access Processes
%C Max
Planck Institute for Psycholinguistics, Nijmengen, the Netherlands
%P 143-146
%! The role of phonotactics in the segmentation of native and non-native continuous speech.
%F Weber:2000:RPS


%0 Journal Article
%A Weber, Andrea
%D 2001
%T Help or hindrance: How violation of different assimilation rules affects spoken-language processing.
%B Language and Speech
%V 44
%P 95-118
%! Help or hindrance: How violation of different assimilation rules affects spoken-language processing.
%F Weber:2001:HHH


%0 Book
%A Weber, Andrea
%D 2001
%T Language-specific listening: the case of phonetic sequences.
Ph.D. Dissertation, University of Nijmegen (Max Planck Institute
series in Psycholinguistics, 16), The Netherlands
%C Wageningen:
Ponsen & Looijen bv.
%! Language-specific listening: the case of phonetic sequences.
Ph.D. Dissertation, University of Nijmegen (Max Planck Institute
series in Psycholinguistics, 16), The Netherlands
%F Weber:2001:LSL


%0 Journal Article
%A Weber, Andrea
%D 2002
%T Assimilation violation and spoken-language processing: 
A supplementary report.
%B Language and Speech
%V 45
%P 37-46
%! Assimilation violation and spoken-language processing: 
A supplementary report.
%F Weber:2002:AVS


%0 Journal Article
%A Weber, Andrea
%A Cutler, Anne
%D 2004
%T Lexical competition in non-native spoken-word recognition.
%B Journal of Memory and Language
%V 50
%P 1-25
%! Lexical competition in non-native spoken-word recognition.
%F Weber:2004:LCN


%0 Conference Proceedings
%A Weber, Andrea
%A Smits, Roel
%D 2003
%T Consonant and vowel confusion patterns by American English listeners.
%B Proceedings of the 15th International Congress of Phonetic Sciences
%C Palau de Congressos,Barcelone, Spain
%P 1437-1440
%! Consonant and vowel confusion patterns by American English listeners.
%F Weber:2003:CVC


%0 Conference Proceedings
%A Wolska, Magdalena 
%A Kruijff-Korbayova, Ivana
%D 2003
%T Issues in the interpretation of input in mathematical dialogs
%E Duchier, Denys
%B Prospects and advances in the syntax/semantics interface. Lorraine-Saarland Workshop Series proceedings.
%C Nancy, France
%P 45-50
%8 october
%! Issues in the interpretation of input in mathematical dialogs
%F Wolska:2003:III


%0 Conference Proceedings
%A Fliedner, Gerhard
%D 2003
%T Tools for Building a Lexical Semantic Annotation
%B Proceedings of the Lorraine-Saarland Workshop ``Prospects and Advances in
  the Syntax/Semantics Interface"
%C Nancy, France
%P 5--9
%! Tools for Building a Lexical Semantic Annotation
%F Fliedner:2003:TBLb
%U http://www.loria.fr/~duchier/Lorraine-Saarland/fliedner.pdf


%0 Book Section
%A Fliedner, Gerhard
%D 2004
%T Korrekturprogramme
%E Carstensen, K.-U.
%E Ebert, Ch.
%E Endriss, C.
%E Jekat, S.
%E Klabunde, R.
%E Langer, H.
%B Computerlinguistik und Sprachtechnologie. Eine Einführung
%C Heidelberg
%I Spektrum Akademischer Verlag
%! Korrekturprogramme
%F Fliedner:2004:K


%0 Conference Proceedings
%A Fliedner, Gerhard
%D 2004
%T Issues in Evaluating a Question Answering System
%B Proceedings of LREC Workshop ``User-Oriented Evaluation of Knowledge
  Discovery Systems''
%C Lisbon
%P 8--12
%! Issues in Evaluating a Question Answering System
%F Fliedner:2004:IEQ


%0 Conference Proceedings
%A Fliedner, Gerhard
%D 2004
%T Towards Using FrameNet for Question Answering
%B Proceedings of the LREC 2004 Workshop ``Building Lexical Resources from
  Semantically Annotated Corpora''
%C Lisbon
%P 61--65
%! Towards Using FrameNet for Question Answering
%F Fliedner:2004:TUF


%0 Conference Proceedings
%A Baldewein, Ulrike
%A Erk, Katrin
%A Pado, Sebastian
%A Prescher, Detlef
%D 2004
%T Semantic Role Labelling with Similarity-Based Generalization Using
  EM-based Clustering
%B Proceedings of Senseval'04
%C Barcelona
%! Semantic Role Labelling with Similarity-Based Generalization Using
  EM-based Clustering
%F Baldewein:2004:SRLb
%U http://www.coli.uni-sb.de/~erk/OnlinePapers/senseval.ps


%0 Conference Proceedings
%A Baldewein, Ulrike
%A Erk, Katrin
%A Pado, Sebastian
%A Prescher, Detlef
%D 2004
%T Semantic Role Labelling for Chunk Sequences
%B Proceedings of the CoNLL'04 shared task
%C Boston
%! Semantic Role Labelling for Chunk Sequences
%F Baldewein:2004:SRLa
%U http://www.coli.uni-sb.de/~erk/OnlinePapers/conll.ps


%0 Conference Proceedings
%A Erk, Katrin
%A Pado, Sebastian
%D 2004
%T A powerful and versatile XML Format for representing role-semantic
  annotation
%B Proceedings of LREC-2004
%C Lisbon
%! A powerful and versatile XML Format for representing role-semantic
  annotation
%F Erk:2004:PVX
%U http://www.coli.uni-sb.de/~pado/pub/lrec04/salsatiger.pdf


%0 Conference Proceedings
%A Ellsworth, Michael
%A Erk, Katrin
%A Kingsbury, Paul
%A Pado, Sebastian
%D 2004
%T PropBank, SALSA, and FrameNet: How Design Determines Product
%B Proceedings of the LREC 2004 Workshop on Building Lexical Resources from
  Semantically Annotated Corpora
%C Lisbon
%! PropBank, SALSA, and FrameNet: How Design Determines Product
%F Ellsworth:2004:PSF
%U http://www.coli.uni-sb.de/~erk/OnlinePapers/pb-fn.ps


%0 Conference Proceedings
%A Heid, Ulrich
%A Voormann, Holger
%A Milde, Jan-Torsten
%A Gut, Ulrike
%A Erk, Katrin
%A Pado, Sebastian
%D 2004
%T Querying both time-aligned and hierarchical corpora with NXT search
%B Proceedings of LREC-2004
%C Lisbon
%! Querying both time-aligned and hierarchical corpora with NXT search
%F Heid:2004:QBT
%U http://www.coli.uni-sb.de/~pado/pub/lrec04/lrec04nxtsearch.pdf


%0 Conference Proceedings
%A Frank, Anette
%A Erk, Katrin
%D 2004
%T Towards an LFG Syntax-Semantics Interface for Frame Semantics Annotation
%B Fifth International Conference on Intelligent Text Processing and
  Computational Linguistics (CICLing-2004)
%! Towards an LFG Syntax-Semantics Interface for Frame Semantics Annotation
%F Frank:2004:TLS


%0 Conference Proceedings
%A Erk, Katrin
%A Kowalski, Andrea
%A Pinkal, Manfred
%D 2003
%T A Corpus Resource for Lexical Semantics
%B Proceedings of IWCS5
%C Tilburg
%! A Corpus Resource for Lexical Semantics
%F Erk:2003:CRLb
%U http://www.coli.uni-sb.de/~erk/OnlinePapers/LexProj.ps


%0 Conference Proceedings
%A Erk, Katrin
%A Niehren, Joachim
%D 2003
%T Well-Nested Parallelism Constraints for Ellipsis Resolution
%B Proceedings of EACL'03
%C Budapest
%! Well-Nested Parallelism Constraints for Ellipsis Resolution
%F Erk:2003:WNP
%U http://www.ps.uni-sb.de/Papers/abstracts/wellnested.html"


%0 Conference Proceedings
%A Erk, Katrin
%A Kowalski, Andrea
%A Pado, Sebastian
%D 2003
%T The SALSA Annotation Tool
%B Proceedings of the 6th Lorraine-Saarland Workshop
%C Nancy
%! The SALSA Annotation Tool
%F Erk:2003:SAT
%U http://www.coli.uni-sb.de/~erk/OnlinePapers/lorrainesaarland.ps


%0 Thesis
%A Erk, Katrin
%D 2002
%T Parallelism Constraints in Underspecified Semantics
%B Saarland University
%! Parallelism Constraints in Underspecified Semantics
%F Erk:2002:PCU
%U http://www.ps.uni-sb.de/Papers/abstracts/disserk.html


%0 Edited Proceedings
%A Bender, Emily M.
%A Flickinger, Dan
%A Fouvry, Frederik
%A Siegel, Melanie
%D 2003
%T A Workshop on Ideas and Strategies for Multilingual Grammar Development during the 5th European Summer School for Logic, Language and Information
%C Vienna, Austria
%! A Workshop on Ideas and Strategies for Multilingual Grammar Development during the 5th European Summer School for Logic, Language and Information
%F Bender:2003:WIS
%U http://www.dfki.uni-sb.de/~siegel/esslli03/Proceedings.ps
  http://www.coli.uni-sb.de/~fouvry/publications/multigram:03.ps.bz2


%0 Book Section
%A Egg, Markus
%D 2004
%T Rhetorische w-Fragen
%E und Nikolas Ruge, Maxi Krause
%B Das war echt spitze! Zur Exklamation im heutigen Deutsch
%C Tübingen
%I Stauffenburg
%P 139-150
%! Rhetorische w-Fragen
%F Egg:2004:RWF


%0 Conference Proceedings
%A Soudi, Abdelhadi
%A Eisele, Andreas
%D 2004
%T Generating an Arabic full-form lexicon for bidirectional morphology lookup
%B Proceedings of LREC
%C Lisbon
%8 June
%! Generating an Arabic full-form lexicon for bidirectional morphology lookup
%F Soudi:2004:GAF


%0 Conference Proceedings
%A Callmeier, Ulrich
%A Eisele, Andreas
%A Schäfer, Ulrich
%A Siegel, Melanie
%D 2004
%T The Deep Thought Core Achitecture Framework
%B Proceedings of LREC
%C Lisbon
%8 June
%! The Deep Thought Core Achitecture Framework
%F Callmeier:2004:DTC


%0 Conference Proceedings
%A Gabsdil, Malte
%A Lemon, Oliver
%D 2004
%T Combining Acoustic and Pragmatic Features to Predict Recognition Performance
  in Spoken Dialogue Systems
%B Proceedings of the 42nd Annual Meeting of the Association for Computational
  Linguistics (ACL-04)
%! Combining Acoustic and Pragmatic Features to Predict Recognition Performance
  in Spoken Dialogue Systems
%F Gabsdil:2004:CAP


%0 Conference Proceedings
%A Gabsdil, Malte
%D 2004
%T Combining Acoustic Confidences and Pragmatic Plausibility for Classifying
  Spoken Chess Move Instructions
%E Strube, Michael
%E Sidner, Candy
%B Proceedings of the 5th SIGdial Workshop on Discourse and Dialogue
%P 27--30
%! Combining Acoustic Confidences and Pragmatic Plausibility for Classifying
  Spoken Chess Move Instructions
%F Gabsdil:2004:CAC


%0 Conference Proceedings
%A Gabsdil, Malte
%D 2003
%T Classifying Recognition Results for Spoken Dialogue Systems
%B Proceedings of the Student Research Workshop at the 41st ACL
%C Sapporo, Japan
%! Classifying Recognition Results for Spoken Dialogue Systems
%F Gabsdil:2003:CRR


%0 Conference Proceedings
%A Gabsdil, Malte
%D 2003
%T Clarification in Spoken Dialogue Systems
%B Proceedings of the 2003 AAAI Spring Symposium. Workshop on Natural Language
  Generation in Spoken and Written Dialogue
%C Stanford, CA
%P 28--35
%! Clarification in Spoken Dialogue Systems
%F Gabsdil:2003:CSD


%0 Conference Proceedings
%A Gabsdil, Malte
%A Bos, Johan
%D 2003
%T Combining Acoustic Confidence Scores with Deep Semantic Analysis for
  Clarification Dialogues
%B Proceedings of the Fifth International Workshop on Computational Semantics
  IWCS-5
%C Tilburg
%! Combining Acoustic Confidence Scores with Deep Semantic Analysis for
  Clarification Dialogues
%F Gabsdil:2003:CAC


%0 Conference Proceedings
%A Pado, Sebastian
%A Lapata, Mirella
%D 2003
%T Constructing Semantic Space Models from Parsed Corpora
%B Proceedings of ACL-03
%C Sapporo, Japan
%! Constructing Semantic Space Models from Parsed Corpora
%F Pado:2003:CSSb


%0 Conference Proceedings
%A Pado, Sebastian
%A Boleda Torrent, Gemma
%D 2003
%T Towards a better understanding of frame element assignment errors
%E Duchier, Denys
%E Kruijff, Geert-Jan
%B Proceedings of the Workshop on Prospects and Advances in the
  Syntax/Semantics Interface
%C Nancy, France
%! Towards a better understanding of frame element assignment errors
%F Pado:2003:TBU


%0 Conference Proceedings
%A Heid, U.
%A Voormann, H.
%A Milde, J.
%A Gut, U.
%A Erk, K.
%A Pado, S.
%D 2004
%T Querying both time-aligned and hierarchical corpora with NXT search
%B Proceedings of LREC-2004
%C Lisbon, Portugal
%! Querying both time-aligned and hierarchical corpora with NXT search
%F Heid:2004:QBTb


%0 Conference Proceedings
%A Erbach, Gregor
%D 2004
%T Mapping, Measuring, and Modelling the Diffusion of Linguistic Material on
  the Internet
%B Proceedings of the First International Workshop on the Emergence and
  Evolution of Linguistic Communication
%C Kanazawa
%! Mapping, Measuring, and Modelling the Diffusion of Linguistic Material on
  the Internet
%F Erbach:2004:MMM
%U http://purl.org/net/gregor/pub/eelc04/Erbach-EELC2004-ExtendedAbstract.pdf


%0 Journal Article
%A Knöferle, Pia
%A Crocker, Matthew
%A Pickering, Martin
%A Scheepers, Christoph
%D accepted for publication
%T The influence of the immediate visual context on incremental thematic
  role-assignment: evidence from eye-movements in depicted events.
%B Cognition
%! The influence of the immediate visual context on incremental thematic
  role-assignment: evidence from eye-movements in depicted events.
%F Knoferle:19xx:IIV


%0 Journal Article
%A Crocker, Matthew
%D to appear
%T Rational models of comprehension: addressing the performance paradox
%B to appear in: A. Culter (ed) Psycholinguistic Crossroads, Lawrence Erlbaum
  Associates, Hillsdale, NJ.
%! Rational models of comprehension: addressing the performance paradox
%F Crocker:19xx:RMC


%0 Journal Article
%A Crocker, Matthew
%A Keller, Frank
%D to appear
%T Probabilistic Grammars as Models of Gradience in Language Processing
%B To appear in: G. Fanselow et al (eds), Gradedness. Oxford University Press.
%! Probabilistic Grammars as Models of Gradience in Language Processing
%F Crocker:19xx:PGM


%0 Journal Article
%A Andreeva, Bistra
%A Barry, John W.
%D 2001
%T Cross-language Similarities and Differences in Spontaneous Speech Patterns
%B Journal of the International Phonetik Association
%V 31
%N 1
%P 51-66
%! Cross-language Similarities and Differences in Spontaneous Speech Patterns
%F Barry:2001:CLSb


%0 Book Section
%A Andreeva, Bistra
%A Avgustinova, Tanya
%A Barry, William J.
%D 2001
%T Current Issues in Formal Slavic Linguistics
%E Zybatow, G.
%E Junghanns, U.
%E Mehlhorn, G.
%E Szucsish, L.
%I Peter Lang
%P 353-364
%! Current Issues in Formal Slavic Linguistics
%F Andreeva:2001:CIF


%0 Book Section
%A Andreeva, Bistra
%A Barry, William J.
%D 2002
%T Current Approaches in Formal Slavic Linguistics
%E Kosta, P.
%E Frasek, J.
%I Peter Lang
%P 139-147
%! Current Approaches in Formal Slavic Linguistics
%F Andreeva:2002:CAF


%0 Conference Proceedings
%A Barry, William J.
%A Andreeva, Bistra
%A Russo, Michella
%A Dimitrova, Snezhina
%A Kostadinova, Tanja
%D 2003
%T Do Rhythm Measures Tell us Anything about Language Type?
%E M.J.Solé, D. Recasens
%E Romero, J.
%B Proc. of the 15th International Congress of Phonetic Sciences (ICPhS)
%P 2693-2696
%! Do Rhythm Measures Tell us Anything about Language Type?
%F Barry:2003:DRM


%0 Conference Proceedings
%A Andreeva, Bistra,
%A Koreman, Jacques
%A Barry, William J.
%D 2003
%T Phonatory demarcations of intonation phrases in Bulgarian
%E Solé, M.J. 
%E Recasens, D.
%E Romero, J.
%B Proc. of the 15th International Congress of Phonetic Sciences (ICPhS),
  Barcelona
%P 611-614
%! Phonatory demarcations of intonation phrases in Bulgarian
%F Andreeva:2003:PDIa


%0 Conference Proceedings
%A Baumann, Stefan
%A Hadelich, Kerstin
%D 2003
%T On the Perception of Intonationally Marked Givenness after Auditory and
  Visual Priming
%B Proceedings of the AAI workshop "Prosodic Interfaces", Nantes
%P 21-26
%! On the Perception of Intonationally Marked Givenness after Auditory and
  Visual Priming
%F Baumann:2003:PIM


%0 Conference Proceedings
%A Baumann, Stefan
%A Hadelich, Kerstin
%D 2003
%T Accent Type and Givenness: An Experiment with Auditory and Visual Priming
%B Proceedings of the 15th ICPhS, Barcelona
%P 1811-1814
%! Accent Type and Givenness: An Experiment with Auditory and Visual Priming
%F Baumann:2003:ATG


%0 Conference Proceedings
%A Baumann, Stefan
%A Grice, Martine
%D 2004
%T Accenting Accessible Information
%B SpeechProsody 2004, Nara, Japan
%P 21-24
%! Accenting Accessible Information
%F Baumann:2004:AAI


%0 Conference Proceedings
%A Baumann, Stefan
%A Brinckmann, Caren
%A Silvia Hansen-Schirra, Geert-Jan Kruijff
%A Kruijff-Korbayova, Ivana
%A Neumann, Stella
%A Teich, Elke
%D 2004
%T Multi-Dimensional Annotation of Linguistic Corpora for Investigating
  Information Structure
%B Frontiers in Corpus Annotation 2004, NAACL/HLT Conference Workshop, Boston
%! Multi-Dimensional Annotation of Linguistic Corpora for Investigating
  Information Structure
%F Baumann:2004:MDA


%0 Conference Proceedings
%A Oepen, Stephan
%A Bender, Emily M.
%A Callmeier, Uli
%A Flickinger, Dan
%A Siegel, Melanie
%D 2002
%T Parallel Distributed Grammar Engineering for Practical Applications.
%B Proceedings of the 19th International Conference on Computational
  Linguistics
%C Taipei, Taiwan
%! Parallel Distributed Grammar Engineering for Practical Applications.
%F Oepen:2002:PDGb


%0 Conference Proceedings
%A Callmeier, Ulrich
%A Eisele, Andreas
%A Schäfer, Ulrich
%A Siegel, Melanie
%D 2004
%T The DeepThought Core Architecture Framework
%B Proceedings of LREC 04
%C Lisbon, Portugal
%! The DeepThought Core Architecture Framework
%F Callmeier:2004:DCA


%0 Conference Proceedings
%A Bender, Emily M.
%A Siegel, Melanie
%D 2004
%T Implementing the Syntax of Japanese Numeral Classifiers
%B Proceedings of IJCNLP 04
%! Implementing the Syntax of Japanese Numeral Classifiers
%F Bender:2004:ISJ


%0 Book Section
%A Lerner, Jean-Yves
%A Pinkal, Manfred
%D 2004
%T Comparatives and Nested Quantifications
%E Gutiérrez-Rexach, Javier
%B Semantics: Critical Concepts in Linguistics
%I London/New York: Routledge Publishing Co.
%V V, Operators and Sentence Types
%N Part A
%P 70 - 87
%! Comparatives and Nested Quantifications
%F Lerner:2004:CNQ


%0 Book
%A Lerner, Jan
%A Dünges, Petra
%D 2003
%T Anaphern, Quantoren und Parallelität
%B Tübinger Beiträge zur Linguistik
%C Tübingen
%I Gunter Narr Verlag
%! Anaphern, Quantoren und Parallelität
%F Lerner:2003:AQPb
%X Allein als Einführung in die Thematik der Interaktion elliptischer und
  anaphorischer Konstruktionen und in die umfangreiche Literatur zum Thema ist
  dies Buch höchst lesenswert. Lerner gehört vermutlich weltweit zu den
  besten Kennern der linguistischen Literatur zu diesem Forschungsbereich.Der
  eigentliche Kern der Arbeit ist jedoch Lerners eigene Theorie des
  Rekonstruktionsprozesses, die zunächst für die Ellipse entwickelt und dann
  auf Konstruktionen mit Sachverhaltsanaphern und Fokuspartikeln erweitert
  wird. Ihre deskriptive Abdeckung ist beeindruckend. Die Kollektion der
  behandelten Problemfälle, die sich aus der Interaktion von Parallelismus,
  Anaphern und Quantoren ergeben, ist wohl einzigartig. Manfred Pinkal
%U LernerDuenges%3A2003%3AAQP.pdf, http://www.narr.de/


%0 Book Section
%A Gardent, Claire
%A Manuélian, Hélène
%A Striegnitz, Kristina
%A Amoia, Marilisa
%D 2004
%T Generating Definite Descriptions: Non incrementality, inference and data
%E Pechman, T.
%E Habel, C.
%B Multidisciplinary Approaches to Language Production
%C Berlin
%I Mouton de Gruyter
%P 53--85
%! Generating Definite Descriptions: Non incrementality, inference and data
%F Gardent:2004:GDD
%U http://www.coli.uni-sb.de/~kris/papers/spp-book.ps.gz


%0 Conference Proceedings
%A Striegnitz, Kristina
%D 2004
%T Two Kinds of Alternative Sets and a Marking Principle --- When to Say
  "also"
%B Proceedings of the Third International Conference on Natural Language
  Generation (INLG04)
%! Two Kinds of Alternative Sets and a Marking Principle --- When to Say
  "also"
%F Striegnitz:2004:TKA
%O Presented in the Student Session of INLG04
%U http://www.coli.uni-sb.de/~kris/papers/inlg2004.pdf


%0 Journal Article
%A Koller, Alexander
%A Debusmann, Ralph
%A Gabsdil, Malte
%A Striegnitz, Kristina
%D 2004
%T Put my galakmid coin into the dispenser and kick it: Computational
  Linguistics and Theorem Proving in a Computer Game
%B Journal of Logic, Language and Information: Special Issue on ICoS-3
%V 13
%N 2
%P 187--206
%! Put my galakmid coin into the dispenser and kick it: Computational
  Linguistics and Theorem Proving in a Computer Game
%F Koller:2004:PMG
%U http://www.coli.uni-sb.de/~kris/papers/kluwer2004.ps.gz


%0 Conference Proceedings
%A Althaus, Ernst
%A Karamanis, Nikiforos
%A Koller, Alexander
%D 2004
%T Computing Locally Coherent Discourses
%B Proceedings of the 42nd ACL
%C Barcelona
%! Computing Locally Coherent Discourses
%F Althaus:2004:CLC


%0 Conference Proceedings
%A Fuchss, Ruth
%A Koller, Alexander
%A Niehren, Joachim
%A Thater, Stefan
%D 2004
%T Minimal Recursion Semantics as Dominance Constraints: Translation,
  Evaluation, and Analysis
%B Proceedings of the 42nd ACL
%C Barcelona
%! Minimal Recursion Semantics as Dominance Constraints: Translation,
  Evaluation, and Analysis
%F Fuchss:2004:MRSa


%0 Conference Proceedings
%A Debusmann, Ralph
%A Duchier, Denys
%A Koller, Alexander
%A Kuhlmann, Marco
%A Smolka, Gert
%A Thater, Stefan
%D 2004
%T A Relational Syntax-Semantics Interface Based on Dependency Grammar
%B Proceedings of the 20th COLING
%C Geneva
%! A Relational Syntax-Semantics Interface Based on Dependency Grammar
%F Debusmann:2004:RSS


%0 Conference Proceedings
%A Dienes, Peter
%A Koller, Alexander
%A Kuhlmann, Marco
%D 2003
%T Statistical A* Dependency Parsing
%B Proceedings of the Workshop on Prospects and Advances in the
  Syntax/Semantics Interface
%C Nancy
%! Statistical A* Dependency Parsing
%F Dienes:2003:SDP


%0 Conference Proceedings
%A Braun, Bettina
%A Ladd, D. Robert
%D 2003
%T Prosodic Correlates of Contrastive and Non-Contrastive Themes in German
%B Proceedings of the 8th European Conference on Speech Communication and
  Technology
%C Geneva
%P 789-792
%8 September
%! Prosodic Correlates of Contrastive and Non-Contrastive Themes in German
%F Braun:2003:PCC


%0 Conference Proceedings
%A Braun, Bettina
%D 2004
%T Answers to the Perception of Thematic Contrast and Questions Regarding the
  Perception of Thematic "Non-Contrast"
%B Proceedings of the 2nd International Conference on Speech Prosody
%C Nara, Japan
%8 March
%! Answers to the Perception of Thematic Contrast and Questions Regarding the
  Perception of Thematic "Non-Contrast"
%F Braun:2004:APT


%0 Conference Proceedings
%A Koller, Alexander
%A Kruijff, Geert-Jan M.
%D 2004
%T Talking Robots With LEGO MindStorms
%B Proceedings of the 20th COLING
%C Geneva, Switzerland
%! Talking Robots With LEGO MindStorms
%F Koller:2004:TRL


%0 Conference Proceedings
%A Kruijff, Geert-Jan M.
%A Baldridge, Jason
%D 2004
%T Generalizing Dimensionality in Combinatory Categorial Grammar
%B Proceedings of the 20th COLING
%C Geneva, Switzerland
%! Generalizing Dimensionality in Combinatory Categorial Grammar
%F Kruijff:2004:GDC


%0 Conference Proceedings
%A Kruijff-Korbayová, Ivana
%A Kruijff, Geert-Jan M.
%D 2004
%T Discourse-Level Annotation for Investigating Information Structure
%B Proceedings of the ACL Workshop on Discourse Annotation
%C Barcelona, Spain
%! Discourse-Level Annotation for Investigating Information Structure
%F Kruijff-Korbayova:2004:DLA


%0 Conference Proceedings
%A Kruijff, Geert-Jan M.
%D 2003
%T 3-Phase Grammar Learning
%B Proceedings of the Workshop on Ideas and Strategies for Multilingual Grammar
  Development
%C Vienna Austria
%! 3-Phase Grammar Learning
%F Kruijff:2003:PGL


%0 Conference Proceedings
%A Baldridge, Jason
%A Kruijff, Geert-Jan M.
%D 2003
%T Multi-Modal Combinatory Categorial Grammar
%B Proceedings EACL'03
%C Budapest Hungary
%! Multi-Modal Combinatory Categorial Grammar
%F Baldridge:2003:MMC


%0 Conference Proceedings
%A Kruijff, Geert-Jan M.
%A Duchier, Denys
%D 2003
%T Information Structure in Topological Dependency Grammar
%B Proceedings EACL'03
%C Budapest Hungary
%! Information Structure in Topological Dependency Grammar
%F Kruijff:2003:IST


%0 Edited Book
%A Kruijff, Geert-Jan M.
%A Oehrle, Richard T.
%D 2003
%T Resource Sensitivity, Binding, and Anaphora
%C Dordrecht, The Netherlands
%I Kluwer Academic Publishers
%! Resource Sensitivity, Binding, and Anaphora
%F Kruijff:2003:RSB


%0 Book Section
%A Kruijff, Geert-Jan M.
%D 2003
%T Binding across boundaries
%E Kruijff, Geert-Jan M.
%E Oehrle, Richard T.
%B Resource Sensitivity, Binding, and Anaphora
%C Dordrecht, The Netherlands
%I Kluwer Academic Publishers
%P 123-158
%! Binding across boundaries
%F Kruijff:2003:BAB


%0 Book Section
%A Kruijff, Geert-Jan M.
%D 2002
%T Formulating a category of informativity
%E Hasselgard, Hilde
%E Johansson, Stig
%E Behrens, Bergljot
%E Fabricius-Hansen, Cathrine
%B Information Structure in a Cross-Linguistic Perspective
%C Amsterdam New York
%I Rodopi
%P 129-146
%! Formulating a category of informativity
%F Kruijff:2002:FCI


%0 Journal Article
%A Kordoni, Valia
%A Neu, Julia
%D 2004
%T Creating multi-purpose linguistic resources for Modern Greek: a deep Modern
  Greek Grammar
%B Proceedings of the 4th International Conference on Language Resources and
  Evaluation (LREC 2004)
%! Creating multi-purpose linguistic resources for Modern Greek: a deep Modern
  Greek Grammar
%3 j
%F Kordoni:2004:CMP


%0 Conference Proceedings
%A Braun, Christian
%D 2003
%T Parsing German text for syntacto-semantic structures
%E Duchier, D.
%B Prospects and Advances in the Syntax/Semantics Interface
%C Nancy, Frankreich
%P 99--102
%! Parsing German text for syntacto-semantic structures
%F Braun:2003:PGT


%0 Conference Proceedings
%A Kordoni, Valia
%A Neu, Julia
%D 2004
%T Deep Analysis of Modern Greek
%B Proceedings of the First International Joint Conference on Natural Language
  Processing (IJCNLP-04)
%C Sanya City, Hainan Island, China
%8 March 22-24, 2004
%! Deep Analysis of Modern Greek
%F Kordoni:2004:DAM
%U http://www.rcl.cityu.edu.hk/ijcnlp04/


%0 Conference Proceedings
%A Zheng, Zhiping
%A Huang, Huiyan
%A Schmeier, Sven
%D 2002
%T Deploying Web-based Question Answering System to Local Archive
%B Fifth International Conference on TEXT, SPEECH and DIALOGUE (TSD 2002)
%C Brno, Czech Republic.
%8 September, 2002
%! Deploying Web-based Question Answering System to Local Archive
%F Zheng:2002:DWB


%0 Conference Proceedings
%A Zheng, Zhiping
%A Erbach., Gregor
%D 2002
%T Specialized search in linguistics and languages.
%B XI International Conference on Computing (CIC 2002).
%C Mexico City, Mexico.
%8 November, 2002
%! Specialized search in linguistics and languages.
%F Zheng:2002:SSL


%0 Edited Proceedings
%A Tianfang Yao, Wei Ding
%A Erbach, Gregor
%D 2003
%T CHINERS: A Chinese Named Entity Recognition System for the Sports Domain.
%C Sapporo, Japan
%I ACL 2003
%V Proc. of the Second SIGHAN Workshop on Chinese Language Processing (ACL 2003
  Workshop)
%! CHINERS: A Chinese Named Entity Recognition System for the Sports Domain.
%F Yao:2003:CCNb


%0 Conference Proceedings
%A Kordoni, Valia
%D 2004
%T Between shifts and alternations: ditransitive constructions
%E Mueller, Stefan
%B Proceedings of the 11th International Conference on Head-Driven Phrase
  Structure Grammar (HPSG 2004)
%C Stanford
%I CSLI Publications
%! Between shifts and alternations: ditransitive constructions
%3 j
%F Kordoni:2004:BSA


%0 Conference Proceedings
%A Zheng, Zhiping
%D 2003
%T Question Answering Using Web News as Knowledge Base
%B The Eleventh Conference of the European Chapter of the Association for
  Computational Linguistics (EACL 2003).
%C Budapest, Hungary.
%8 April, 2003.
%! Question Answering Using Web News as Knowledge Base
%F Zheng:2003:QAU


%0 Edited Proceedings
%A Tianfang Yao, Wei Ding
%A Erbach, Gregor
%D 2002
%T Repairing Errors for Chinese Word Segmentation and Part-of-Speech Tagging
%C Beijing, China
%I IEEE and Hebei University
%V Proc. of the First International Conference on Machine Learning and
  Cybernetics 2002 (ICMLC 2002)
%! Repairing Errors for Chinese Word Segmentation and Part-of-Speech Tagging
%F Yao:2002:RECb


%0 Conference Proceedings
%A Zheng, Zhiping
%A Erbach, Gregor
%D 2003
%T Using Specialized Knowledge in Automated Web Document Summarization
%B The Fifth International Conference on Enterprise Information Systems (ICEIS
  2003).
%C Angers, France
%8 April, 2003
%! Using Specialized Knowledge in Automated Web Document Summarization
%F Zheng:2003:USK


%0 Conference Proceedings
%A Kordoni, Valia
%D 2004
%T Modern Greek ditransitives in LMT
%E Butt, Miriam
%E King, Tracy Holloway
%B Proceedings of the 9th International Lexical Functional Grammar Conference
  (LFG 2004)
%C Stanford
%! Modern Greek ditransitives in LMT
%F Kordoni:2004:MGD


%0 Conference Proceedings
%A Zheng, Zhiping
%D 2003
%T AnswerBus News Engine
%B The Twelfth International World Wide Web Conference (WWW 2003)
%C Budapest, Hungary
%8 May, 2003
%! AnswerBus News Engine
%F Zheng:2003:ANE


%0 Edited Proceedings
%A Tianfang Yao, Wei Ding
%A Erbach, Gregor
%D 2002
%T Correcting Word Segmentation and Part-Of-Speech Tagging Errors for Chinese
  Named Entity Recognition
%C Dordrecht, The Netherlands
%I Kluwer Academic Publishers
%V In Günter Hommel and Sheng Huanye (Eds.): The Internet Challenge: Technology
  and Applications
%! Correcting Word Segmentation and Part-Of-Speech Tagging Errors for Chinese
  Named Entity Recognition
%F Yao:2002:CWSb


%0 Conference Proceedings
%A Schofield, Edward James
%A Zheng, Zhiping
%D 2003
%T A Speech Interface for Open-Domain Question-Answering
%B 41st Annual Meeting of the Association for Computational Linguistics (ACL
  2003).
%C Sapporo, Japan
%8 July
%! A Speech Interface for Open-Domain Question-Answering
%F Schofield:2003:SIO


%0 Book Section
%A Kordoni, Valia
%D to appear
%T Prepositional Arguments in a Multilingual Context
%E Saint-Dizier, Patrick
%B Special Issue on Prepositions
%C The Netherlands
%I Kluwer Academic Publishers
%! Prepositional Arguments in a Multilingual Context
%3 j
%F Kordoni:19xx:PAM


%0 Conference Proceedings
%A Kordoni, Valia
%D 2004
%T Modelling the semantics of alternating verbs
%E Heyde-Zybatow, Tatjana
%B Proceedings of the Workshop on Event Structures in Linguistic Form and
  Interpretation
%C Leipzig
%! Modelling the semantics of alternating verbs
%3 j
%F Kordoni:2004:MSA
%U http://www.uni-leipzig.de/~event04/


%0 Conference Proceedings
%A Kordoni, Valia
%D 2003
%T The key role of semantics in the development of large-scale grammars of
  natural language
%B Proceedings of EACL 03, 10th Conference of the European Chapter of the
  Association for Computational Linguistics
%C Budapest, Hungary
%V Conference Companion
%P 111-114
%8 April 12-17
%! The key role of semantics in the development of large-scale grammars of
  natural language
%F Kordoni:2003:KRS
%U http://www.conferences.hu/EACL03/


%0 Conference Proceedings
%A Kordoni, Valia
%A Neu, Julia
%D 2003
%T Deep Grammar Development for Modern Greek
%E Bender, Emily
%E Flickinger, Dan
%E Fouvry, Frederik
%E Siegel, Melanie
%B Proceedings of the Workshop on "Ideas and Strategies for Multilingual
  Grammar Development", ESSLLI 2003 (15th European Summer School in Logic
  Language and Information)
%P 65-72
%! Deep Grammar Development for Modern Greek
%F Kordoni:2003:DGD
%U http://www.dfki.uni-sb.de/~siegel/esslli/


%0 Conference Proceedings
%A Kordoni, Valia
%D 2003
%T Valence Alternations in German: an LMT Analysis
%E Butt, Miriam
%E King, Tracy Holloway
%B Proceedings of the LFG03 Conference, University at Albany, State University
  of New York
%C Stanford
%I CSLI Publications
%P 250-268
%! Valence Alternations in German: an LMT Analysis
%3 j
%F Kordoni:2003:VAG
%X http://cslipublications.stanford.edu/LFG/8/lfg03kordoni-abs.html
%U http://cslipublications.stanford.edu/LFG/8/lfg03-toc.html


%0 Conference Proceedings
%A Kordoni, Valia
%D 2003
%T Strategies for annotation of large corpora of multilingual spontaneous
  speech data
%E Hansen-Schirra, Silvia
%E Neumann, Stella
%B Proccedings of the Workshop on Multilingual Corpora: Linguistic Requirements
  and Technical Perspectives
%C Lancaster, UK
%P 53-57
%! Strategies for annotation of large corpora of multilingual spontaneous
  speech data
%3 j
%F Kordoni:2003:SAL
%U http://www.coli.uni-sb.de/muco03/Proceedings.htm


%0 Conference Proceedings
%A Kordoni, Valia
%A Neu, Julia
%D 2003
%T Building multi-purpose linguistics resources for Modern Greek: a deep Modern
  Greek Grammar
%E Karkaletsis, Vangelis
%E Piperidis, Stelios
%B Proceedings of the Workshop on Balkan Language Resources and Tools
%C Thessaloniki, Greece
%I 1st Balkan Conference on Informatics - BCI 2003
%8 November 21
%! Building multi-purpose linguistics resources for Modern Greek: a deep Modern
  Greek Grammar
%F Kordoni:2003:BMP
%U http://www.iit.demokritos.gr/skel/bci03_workshop/pages/programme.html


%0 Conference Proceedings
%A Kordoni, Valia
%D 2003
%T Syntax-Semantics Interface in Lexicalist Theories
%E Duchier, Denys
%E Kruijff, Geert-Jan
%B Proceedings of the Workshop on Prospects and Advances in the
  Syntax/Semantics Interface
%C Nancy
%8 October 20-21
%! Syntax-Semantics Interface in Lexicalist Theories
%3 j
%F Kordoni:2003:SSI
%U http://www.loria.fr/~duchier/Lorraine-Saarland/


%0 Conference Proceedings
%A Kordoni, Valia
%D 2003
%T A Robust Deep Analysis of Indirect Prepositional Arguments
%E Saint-Dizier, Patrick
%B Proceedings of the ACL-SIGSEM workshop: The Linguistic Dimensions of
  Prepositions and their Use in Computational Linguistics Formalisms and
  Applications
%C Toulouse, France
%8 September 4-6
%! A Robust Deep Analysis of Indirect Prepositional Arguments
%3 j
%F Kordoni:2003:RDA
%U http://www.irit.fr/recherches/ILPL/prepW/prepW.html


%0 Conference Proceedings
%A Kordoni, Valia
%A Shimada, Atsuko
%D 2003
%T Japanese "Verbal Noun and suru" Constructions
%E Beermann, Dorothee
%B Proceedings of the Workshop on Multi-verb Constructions in Constraint-Based
  Grammar in macro- and micro-typological perspectives (TROSS 03)
%C NTNU, Trondheim, Norway
%8 June 23-27
%! Japanese "Verbal Noun and suru" Constructions
%3 j
%F Kordoni:2003:JVN
%U http://edvarda.hf.ntnu.no/ling/tross/TROSS03-toc.html


%0 Conference Proceedings
%A Kordoni, Valia
%D 2002
%T Derivational vs. Nonderivational Linguistic Models in the 20th and 21st
  Centuries
%B Proceedings of the International Linguistics Conference "Reviewing
  Linguistic Thought: Perspectives into the 21st Century"
%C Department of Language and Linguistics, Faculty of English Studies, School
  of Philosophy
%8 May 21-24
%! Derivational vs. Nonderivational Linguistic Models in the 20th and 21st
  Centuries
%3 j
%F Kordoni:2002:DVN


%0 Thesis
%A Kordoni, Valia
%D 2001
%T Psych Verb Constructions in Modern Greek: a semantic analysis in the
  Hierarchical Lexicon
%B University of Essex
%C Colchester, UK
%! Psych Verb Constructions in Modern Greek: a semantic analysis in the
  Hierarchical Lexicon
%3 j
%F Kordoni:2001:PVC
%U http://www.coli.uni-sb.de/~kordoni/thesis.html


%0 Conference Proceedings
%A Kordoni, Valia
%D 2001
%T Learning Modern Greek psychological predicates
%B Proceedings of CLIN 2001, Twelfth Meeting of Computational Linguistics in
  the Netherlands
%C Enschede, The Netherlands
%8 November 30
%! Learning Modern Greek psychological predicates
%3 j
%F Kordoni:2001:LMG
%U http://parlevink.cs.utwente.nl/Conferences/Clin2001/program_schedule.html


%0 Conference Proceedings
%A Kordoni, Valia
%D 2001
%T Modern Greek Negation
%B Proceedings of the Western Conference on Linguistics (WECOL) 2001
%C Seattle, Washington, USA
%8 October 26-28
%! Modern Greek Negation
%3 j
%F Kordoni:2001:MGN


%0 Conference Proceedings
%A Agnihotri, Rama Kant
%A Mahajan, Anoop
%A Vasishth, Shravan
%A Fanselow, Gisbert
%A Schleswesky, Matthias
%D 2003
%T More isn't always better: A surprising constraint on retrieval cues in human
  sentence parsing
%B Proceedings of Architectures and Mechanisms for Language Processing
  conference
%C Glasgow, UK
%! More isn't always better: A surprising constraint on retrieval cues in human
  sentence parsing
%F Agnihotri:2003:MIA


%0 Conference Proceedings
%A Kruijff, Geert-Jan M.
%A Vasishth, Shravan
%D 2003
%T Quantifying word order freedom in natural language: Implications for
  sentence processing
%B Proceedings of Architectures and Mechanisms for Language Processing
  conference
%C Glasgow, UK
%! Quantifying word order freedom in natural language: Implications for
  sentence processing
%F Kruijff:2003:QWO


%0 Book
%A Vasishth, Shravan
%D 2003
%T Working memory in sentence comprehension: Processing Hindi center
  embeddings
%C New York
%I Garland Press
%! Working memory in sentence comprehension: Processing Hindi center
  embeddings
%F Vasishth:2003:WMS
%O In the series Outstanding Dissertations in Linguistics, edited by Laurence
  Horn


%0 Journal Article
%A Vasishth, Shravan
%D 2003
%T Word order, negation, and negative polarity in Hindi
%B Research on Language and Computation
%V 2:1
%P 127-146
%! Word order, negation, and negative polarity in Hindi
%F Vasishth:2003:WON


%0 Master's Thesis
%A Vasishth, Shravan
%D 2002
%T An Abductive Inference Based Model of Human Sentence Parsing
%C Columbus, OH
%I Computer and Information Science, Ohio State University
%! An Abductive Inference Based Model of Human Sentence Parsing
%F Vasishth:2002:AIBb


%0 Conference Proceedings
%A Vasishth, Shravan
%D 2002
%T Distance effects or similarity-based interference?: A model comparison
  perspective
%B Proceedings of Architectures and Mechanisms for Language Processing
  conference
%C Tenerife, Canary Islands, Spain
%! Distance effects or similarity-based interference?: A model comparison
  perspective
%F Vasishth:2002:DES


%0 Conference Proceedings
%A Vasishth, Shravan
%D 2003
%T Processing noncanonical constructions in free word order languages
%B Proceedings of Architectures and Mechanisms for Language Processing
  conference
%C Glasgow, UK
%! Processing noncanonical constructions in free word order languages
%F Vasishth:2003:PNC


%0 Conference Proceedings
%A Vasishth, Shravan
%D 2003
%T The role of decay and activation in human sentence processing
%B Proceedings of Architectures and Mechanisms for Language Processing
  conference
%C Glasgow, UK
%! The role of decay and activation in human sentence processing
%F Vasishth:2003:RDA


%0 Conference Proceedings
%A Vasishth, Shravan
%D 2003
%T The referential (in)accessibility of definite/indefinite subjects and
  objects
%B Proceedings of the CUNY Sentence Processing conference
%C MIT, Boston
%! The referential (in)accessibility of definite/indefinite subjects and
  objects
%F Vasishth:2003:RAD


%0 Conference Proceedings
%A Vasishth, Shravan
%D 2003
%T Decay and interference in human sentence processing: Parsing in a unified
  theory of cognition
%B Proceedings of the CUNY Sentence Processing conference
%C MIT, Boston
%! Decay and interference in human sentence processing: Parsing in a unified
  theory of cognition
%F Vasishth:2003:DIH


%0 Conference Proceedings
%A Vasishth, Shravan
%A Cramer, Irene
%A Scheepers, Christoph
%A Wagner, Joel
%D 2003
%T Can increasing head-dependent distance facilitate processing?
%B Proceedings of the CUNY Sentence Processing conference
%C MIT, Boston
%! Can increasing head-dependent distance facilitate processing?
%F Vasishth:2003:CIH


%0 Conference Proceedings
%A Vasishth, Shravan
%D 2003
%T Quantifying processing difficulty in human sentence parsing: The role of
  decay, activation, and similarity-based interference
%B Proceedings of the EucoCogSci conference
%C Osnabrueck, Germany
%! Quantifying processing difficulty in human sentence parsing: The role of
  decay, activation, and similarity-based interference
%F Vasishth:2003:QPD


%0 Conference Proceedings
%A Vasishth, Shravan
%D 2003
%T Discourse context sometimes fails to neutralize default word order
  preferences: The interaction between working memory constraints and
  information structure
%B Proceedings of the EucoCogSci conference
%C Osnabrueck, Germany
%! Discourse context sometimes fails to neutralize default word order
  preferences: The interaction between working memory constraints and
  information structure
%F Vasishth:2003:DCS


%0 Conference Proceedings
%A Vasishth, Shravan
%A Lewis, Richard
%D 2004
%T Sentence processing in ACT-R
%B Proceedings of the ACL workshop on incremental parsing
%C Barcelona, Spain
%! Sentence processing in ACT-R
%F Vasishth:2004:SPA


%0 Conference Proceedings
%A Vasishth, Shravan
%A Kruijff, Geert-Jan M.
%D 2001
%T Processing as abduction: a sentence processing model
%E Daniels, Michael
%E Dowty, David
%E Feldman, Anna
%E Metcalf, Vanessa
%B OSUWPL, Volume 56
%C Ohio State University
%P 183--207
%! Processing as abduction: a sentence processing model
%F Vasishth:2001:PASb


%0 Conference Proceedings
%A Avgustinova, T.
%A Uszkoreit, H.
%D 2003
%T Towards a typology of agreement phenomena.
%E Griffin, W. E.
%B The Role of Agreement in Natural Language: TLS 5 Proceedings.
%C Austin, TX,
%V Texas Linguistics Forum 53
%P 167-180
%! Towards a typology of agreement phenomena.
%F Avgustinova:2003:TTA


%0 Conference Proceedings
%A Koller, Alexander
%A Niehren, Joachim
%A Thater, Stefan
%D 2003
%T Bridging the Gap between Underspecification Formalisms: Hole Semantics as
  Dominance Constraints
%B Proceedings of the 10th Conference of The European Chapter of the
  Association for Computational Linguistics
%C Budapest, Hungary
%P 195--202
%! Bridging the Gap between Underspecification Formalisms: Hole Semantics as
  Dominance Constraints
%F Koller:2003:BGB


%0 Book Section
%A Avgustinova, T.
%D 2003
%T Syntactic Structures and Morphological Informations
%I Mouton de Gruyter, Berlin / New York (Interface Explorations 7)
%P 1-24
%! Syntactic Structures and Morphological Informations
%F Avgustinova:2003:SSM


%0 Conference Proceedings
%A Niehren, Joachim
%A Thater, Stefan
%D 2003
%T Bridging the Gap between Underspecification Formalisms: Minimal Recursion
  Semantics as Dominance Constraints
%B Proceedings of the 41st Annual Meeting of the Association for Computational
  Linguistics
%C Sapporo, Japan
%P 367--374
%! Bridging the Gap between Underspecification Formalisms: Minimal Recursion
  Semantics as Dominance Constraints
%F Niehren:2003:BGB


%0 Conference Proceedings
%A Fuchss, Ruth
%A Niehren, Joachim
%A Thater, Stefan
%D 2003
%T Minimal Recursion Semantics as Dominance Constraints: A Preliminary
  Evaluation
%B Prospects and Advances in the Syntax/Semantics Interface
%C Nancy, France
%P 51--55
%! Minimal Recursion Semantics as Dominance Constraints: A Preliminary
  Evaluation
%F Fuchss:2003:MRS


%0 Conference Proceedings
%A Bering, Ch.
%A Drozdzynski, W.
%A Erbach, G.
%A Guasch, C.
%A Homola, P.
%A Lehmann, S.
%A Li, H.
%A Krieger, H-U.
%A Piskorski, J.
%A Schäfer, U.
%A Shimada, A.
%A Siegel, M.
%A Xu, F.
%A Ziegler-Eisele, D.
%D 2003
%T Corpora and Evaluation Tools for Multilingual Named Entity Grammar
  Development
%E Neumann, S.
%E Hansen-Schirra, S.
%B Proceedings of the Workshop on Multilingual Corpora, Corpus Linguistics
  Conference
%C Lancaster
%! Corpora and Evaluation Tools for Multilingual Named Entity Grammar
  Development
%F Bering:2003:CET


%0 Master's Thesis
%A Amoia, Marilisa
%D 2003
%T Generation of definite descriptions with set constraints
%C Saarbrücken, Saarland
%I Universität des Saarlandes
%9 Diplomarbeit
%! Generation of definite descriptions with set constraints
%F Amoia:2003:GDD


%0 Master's Thesis
%A Brockmann, Carsten
%D 2002
%T Evaluating and Combining Approaches to Selectional Preference
%C Saarbrücken, Saarland
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! Evaluating and Combining Approaches to Selectional Preference
%F Brockmann:2002:ECA


%0 Master's Thesis
%A Burchardt, Aljoscha
%A Stephan, Walter
%D 2002
%T BuGS: Tableau Machine for Language Understanding
%C Im Stadtwald, 66123 Saarbrücken, Saarland
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! BuGS: Tableau Machine for Language Understanding
%F Burchardt:2002:BTM


%0 Master's Thesis
%A Crispi, Claudia
%D 2002
%T Linguistische Fragmentkombination und Annotation auf der Basis von
  Chunk-Parsing
%C Im Stadtwald, 66123 Saarbrücken, Saarland
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! Linguistische Fragmentkombination und Annotation auf der Basis von
  Chunk-Parsing
%F Crispi:2002:LFA


%0 Master's Thesis
%A Detemple, Philipp
%D 2001
%T Natürlichsprachliche Bedienung im Kraftfahrzeug - Erweiterung des
  Dialogkonzeptes um eine Komponente zur Steuerung von Mensch-Maschine-Dialogen
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! Natürlichsprachliche Bedienung im Kraftfahrzeug - Erweiterung des
  Dialogkonzeptes um eine Komponente zur Steuerung von Mensch-Maschine-Dialogen
%F Detemple:2001:NBI


%0 Master's Thesis
%A Debusman, Ralph
%D 2001
%T A declarative grammar formalism for dependency grammar
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! A declarative grammar formalism for dependency grammar
%F Debusman:2001:DGF


%0 Master's Thesis
%A Dege, Christopher
%D 2003
%T Integration prosodischer Information in Phonetisierung mit
  Entscheidungsbäumen
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! Integration prosodischer Information in Phonetisierung mit
  Entscheidungsbäumen
%F Dege:2003:IPI


%0 Master's Thesis
%A Fliedner, Gerd
%D 2001
%T Überprüfung und Korrektur von Nominalkongruenzen im Deutschen
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! Überprüfung und Korrektur von Nominalkongruenzen im Deutschen
%2 Fliedner:2001:UKN.pdf
%F Fliedner:2001:UKN


%0 Master's Thesis
%A Földesi, Christine
%D 2003
%T A Ner-system for Dutch
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! A Ner-system for Dutch
%F Foldesi:2003:NSD


%0 Master's Thesis
%A Fuchss, Ruth
%D 2004
%T Minimal Recursion Semantics as Dominance Constraints: Translation,
  Evaluation and Analysis
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! Minimal Recursion Semantics as Dominance Constraints: Translation,
  Evaluation and Analysis
%F Fuchss:2004:MRS


%0 Master's Thesis
%A Gabsdil, Malte
%D 2001
%T Interpreting Answers in dialogue
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! Interpreting Answers in dialogue
%F Gabsdil:2001:IAD


%0 Conference Proceedings
%A Busemann, S.
%A Drozdzynski, W.
%A Krieger, H-U.
%A Piskorski, J.
%A Schäfer, U.
%A Uszkoreit, H.
%A F., Xu
%D 2003
%T Integrating Information Extraction and Automatic Hyperlinking
%B Proceedings of ACL-2003, 41st Annual Meeting of the Association for
  Computational Linguistics
%C Sapporo, Japan
%! Integrating Information Extraction and Automatic Hyperlinking
%F Busemann:2003:IIE


%0 Master's Thesis
%A Freihat, Abdelhakim
%D 2003
%T Linguistische Realisierung von Aggregationskostrukten für multilinguale
  Texte und mathematische Formeln
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! Linguistische Realisierung von Aggregationskostrukten für multilinguale
  Texte und mathematische Formeln
%F Freihat:2003:LRA


%0 Master's Thesis
%A Jäger, Tilman
%D 2002
%T AntEx: Ein diagnostizierbares, domänenadaptives Eigennamenerkennungssystem
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! AntEx: Ein diagnostizierbares, domänenadaptives Eigennamenerkennungssystem
%F Jager:2002:ADD


%0 Master's Thesis
%A Klöckner, Kerstin
%D 2002
%T Arbeitsgedächtnis oder Erfahrenheit: Experimentelle Evidenzen und ihre
  netzwerkbasierte Simulation zu deutschen Subjekt- und Objektrelativsätzen
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! Arbeitsgedächtnis oder Erfahrenheit: Experimentelle Evidenzen und ihre
  netzwerkbasierte Simulation zu deutschen Subjekt- und Objektrelativsätzen
%F Klockner:2002:AEE


%0 Master's Thesis
%A Korthals, Christian
%D 2002
%T Unsupervised Learning of Word Order Rules
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! Unsupervised Learning of Word Order Rules
%F Korthals:2002:ULW


%0 Master's Thesis
%A Mohr, Sibylle
%D 2004
%T Cross-linguale, textuelle Frage-Antwort-Verarbeitung: Linguistische Methoden
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! Cross-linguale, textuelle Frage-Antwort-Verarbeitung: Linguistische Methoden
%F Mohr:2004:CLT


%0 Master's Thesis
%A Müller, Christian
%D 2001
%T Symptome von Zeitdruck und kognitiver Belastung in gesprochener Sprache:
  eine experimentelle Untersuchung
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! Symptome von Zeitdruck und kognitiver Belastung in gesprochener Sprache:
  eine experimentelle Untersuchung
%F Muller:2001:SZK


%0 Master's Thesis
%A Neis, Holger
%A Schlarb, Hubert
%D 2003
%T Cross-linguale, textuelle Frage-Antwort-Verarbeitung: Algorithmische
  Methoden
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! Cross-linguale, textuelle Frage-Antwort-Verarbeitung: Algorithmische
  Methoden
%F Neis:2003:CLT


%0 Conference Proceedings
%A Drozdzynski, W.
%A Homola, P.
%A Piskorski, J.
%D 2003
%T Adapting SproUT to processing Baltic ans Slavonic Languages
%B Proceedings of IESL'03 Workshop held in conjunction with the RANLP Recent
  Advances in Natural Language Processing 2003 conference
%C Borovets, Bulgaria
%! Adapting SproUT to processing Baltic ans Slavonic Languages
%F Drozdzynski:2003:ASP


%0 Master's Thesis
%A Pfleger, Norbert
%D 2002
%T Discourse Processing for Multimodal Dialogues and its Application in
  SmartKom
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! Discourse Processing for Multimodal Dialogues and its Application in
  SmartKom
%F Pfleger:2002:DPM


%0 Master's Thesis
%A Raileanu, Diana
%D 2002
%T Semantic Tagging of Medical Texts with GermaNet
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! Semantic Tagging of Medical Texts with GermaNet
%F Raileanu:2002:STM


%0 Master's Thesis
%A Rinck, Matthias
%D 2002
%T Ein Metaregelformalismus für TG/2
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! Ein Metaregelformalismus für TG/2
%F Rinck:2002:MT


%0 Conference Proceedings
%A Ourioupina, O.
%D 2002
%T Extracting Geographical Knowledge from the Internet
%B Proceedings of the ICDM-AM International Workshop on Active Mining 2002
%! Extracting Geographical Knowledge from the Internet
%F Ourioupina:2002:EGK


%0 Master's Thesis
%A Sacaleanu, Bogdan
%D 2001
%T Domain Specific Tuning and Extension of Lexical Semantic Resources
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! Domain Specific Tuning and Extension of Lexical Semantic Resources
%F Sacaleanu:2001:DST


%0 Conference Proceedings
%A Uryupina, Olga
%D 2003
%T High-precision Identification of Discourse New and Unique Noun Phrases
%B Proceedings of the ACL Student Workshop
%C Sapporo
%! High-precision Identification of Discourse New and Unique Noun Phrases
%F Uryupina:2003:HPI


%0 Conference Proceedings
%A Rupp, C. J.
%D 2003
%T Prototyping Dialogues for Information Access
%B Proceedings of the 7th workshop on the Semantics and Pragmatics of Dialogue
  (DiaBruck 2003)
%C Saarbrücken
%! Prototyping Dialogues for Information Access
%F Rupp:2003:PDI


%0 Conference Proceedings
%A Uryupina, Olga
%D 2003
%T Semi-supervised learning of Geographical gazetteers from the Internet
%B Proceedings of the HLT-NAACL Workshop on the Analysis of Geographic
  References
%C Edmonton, Kanada
%! Semi-supervised learning of Geographical gazetteers from the Internet
%F Uryupina:2003:SSL


%0 Conference Proceedings
%A Yao, T.
%A Ding, W.
%A Erbach, G.
%D 2002
%T Correcting word segmentation and part-of-speech tagging errors for Chinese
  named entity recognition
%E Hommel, Günter
%E Huanye, Shen
%B The Internet Challenge: Technology and Applications
%C Dordrecht
%I Kluwer Academic Publishers
%P 29-36
%! Correcting word segmentation and part-of-speech tagging errors for Chinese
  named entity recognition
%F Yao:2002:CWSa


%0 Conference Proceedings
%A Yao, T.
%A Ding, W.
%A Erbach, G.
%D 2002
%T Repairing Errors for Chinese Word Segmentation and Part-of-speech Tagging
%B Proceedings of the First International Conference on Machine Learning and
  Cybernetics 2002 (ICMLC 2002)
%C Beijing
%P 1881-1886
%! Repairing Errors for Chinese Word Segmentation and Part-of-speech Tagging
%F Yao:2002:RECa


%0 Conference Proceedings
%A Yao, T.
%A Ding, W.
%A Erbach, G.
%D 2003
%T CHINERS: A Chinese Named Entity Recognition System for the Sports Domain
%B Proceedings of the Second SIGHAN Workshop on Chinese Language Processing
  (ACL 2003 Workshop)
%C Sapporo, Japan
%! CHINERS: A Chinese Named Entity Recognition System for the Sports Domain
%F Yao:2003:CCNa


%0 Thesis
%A Avgustinova, Tania
%D 2002
%T Shared Grammatical Resources for Slavic Languages. Selected topic in
  multilingual grammar design with special reference to Slavic morphosyntax
%B Universität des Saarlandes
%C Saarbrücken
%9 Habilitationsschrift
%! Shared Grammatical Resources for Slavic Languages. Selected topic in
  multilingual grammar design with special reference to Slavic morphosyntax
%F Avgustinova:2002:SGR


%0 Master's Thesis
%A Sauer, Joachim
%D 2002
%T Textsorten-adaptives Template-Merging - Steigerung der Performanz durch
  Anaphern-Resolution
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! Textsorten-adaptives Template-Merging - Steigerung der Performanz durch
  Anaphern-Resolution
%F Sauer:2002:TAT


%0 Master's Thesis
%A Scheffler, Tatjana
%D 2003
%T Generation with TAG - A Semantics Interface and Syntactic Realizer
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! Generation with TAG - A Semantics Interface and Syntactic Realizer
%F Scheffler:2003:GTS


%0 Master's Thesis
%A Paris, Garance
%D 2002
%T Interaction between tag set designe and multilingual information extraction
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Bachelor's thesis
%! Interaction between tag set designe and multilingual information extraction
%F Paris:2002:IBT


%0 Master's Thesis
%A Paris, Garance
%D 2004
%T Lexical Gender and Non-Native Spoken Word Recognition
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%! Lexical Gender and Non-Native Spoken Word Recognition
%F Paris:2004:LGN


%0 Master's Thesis
%A Sonntag, Daniel
%D 2001
%T Dekomposition
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! Dekomposition
%F Sonntag:2001:D


%0 Master's Thesis
%A Stenzhorn, Holger
%D 2002
%T XtraGen. A Natural Language Generation System Using Java and XML
  Technologies
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! XtraGen. A Natural Language Generation System Using Java and XML
  Technologies
%F Stenzhorn:2002:XNL


%0 Master's Thesis
%A Thater, Stefan
%D 2001
%T Parsing and Generation with Tree Description
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! Parsing and Generation with Tree Description
%F Thater:2001:PGT


%0 Master's Thesis
%A Walter, Joachim
%D 2003
%T Der Einsatz von Generierungstechniken in einem natürlichsprachlichen
  Dialogsystem
%C Saarbrücken, Germany
%I Computerlinguistik, Universität des Saarlandes
%9 Diplomarbeit
%! Der Einsatz von Generierungstechniken in einem natürlichsprachlichen
  Dialogsystem
%F Walter:2003:EGE


%0 Journal Article
%A Koreman, Jacques
%A Pützer, Manfred
%A Just, Manfred
%D 2004
%T Correlates of varying vocal fold adduction deficiencies in perception and
  production: methodological and practical considerations
%B Folia Phoniatr. Logop.
%! Correlates of varying vocal fold adduction deficiencies in perception and
  production: methodological and practical considerations
%F Koreman:2004:CVV
%O accepted


%0 Conference Proceedings
%A Andreeva, B.
%A Koreman, J.
%A Barry, W.J.
%D 2003
%T Phonatory demarcations of intonation phrases in Bulgarian
%E Solé, M.J.
%E Recasens, D.
%E J., Romero
%B Proc. of the 15th Int. Congress of Phonetic Sciences (ICPhS)
%P 611-614
%! Phonatory demarcations of intonation phrases in Bulgarian
%F Andreeva:2003:PDIb


%0 Conference Proceedings
%A Koreman, Jacques
%D 2003
%T The perception of articulation rate
%E Solé, M.~J.
%E Recasens, D.
%E Romero, J.
%B Proc. of the 15th Int. Congress of Phonetic Sciences (ICPhS)
%P 1711-1714
%! The perception of articulation rate
%F Koreman:2003:PAR


%0 Conference Proceedings
%A Koreman, J.
%A Pützer, M.
%D 2003
%T The usability of preceptual ratings of voice quality
%E Schade, G.
%E F., Müller
%E Wittenberg, Th.
%E M., Hess
%B Proc. of the 6th Int. Conf. on Advances in Quantitative Laryngology, Voice
  and Speech Research (AQL)
%I IRB Verlag, Stuttgart, Germany
%! The usability of preceptual ratings of voice quality
%F Koreman:2003:UPR

%0 Journal Article
%A Schaffar, Wolfram
%A Chen, Lansun
%D 2001
%T Yes-no question in Mandarin and the theory of focus
%B Linguistics
%V 39
%N 5
%P 837-870
%! Yes-no question in Mandarin and the theory of focus
%F Schaffar:2001:YNQ

%0 Book
%A Woirgardt-Kobayashi, Ryuko
%A Hoppstädter, Andrea
%D 2001
%T Gewalt in der Schule-kulturell bestimmt? Ein Vergleich der Situation in
  Japan und Deutschland
%I Verlag Dr. Kovac
%! Gewalt in der Schule-kulturell bestimmt? Ein Vergleich der Situation in
  Japan und Deutschland
%F Woirgardt-Kobayashi:2001:GSK

%0 Book
%A Woirgardt-Kobayashi, Ryuko
%D 2002
%T Enjoksai: Schülerinnenprostitution in Japan - Gewalt oder Emanzipation? Ein
  Beitrag zur Geschlechterforschung
%I
%! Enjoksai: Schülerinnenprostitution in Japan - Gewalt oder Emanzipation? Ein
  Beitrag zur Geschlechterforschung
%F Woirgardt-Kobayashi:2002:ESJ

%0 Conference Proceedings
%A Benzmüller, Christoph
%A Fiedler, Armin
%A Gabsdil, Malte
%A Horacek, Helmut
%A Kruijff-Korbayová, Ivana
%A Tsovaltzi, Dimitra
%A Vo, Bao~Quoc
%A Wolska, Magdalena
%D 2003
%T Towards a Principled Approach to Tutoring Mathematical Proofs
%E Harrer, Andreas
%E Gaßner, Katrin
%B Proceedings of the KI-03 Workshop on Expressive Media and Intelligent Tools
  for Learning
%C Hamburg, Germany
%! Towards a Principled Approach to Tutoring Mathematical Proofs
%F Benzmuller:2003:TPA

%0 Conference Proceedings
%A Kunz, Kerstin
%A Hansen-Schirra, Silvia
%D 2003
%T Coreference annotation of the TIGER treebank
%B Proceedings of the Workshop Treebanks and Linguistic Theories 2003
%C Vaxjo
%P 221-224
%! Coreference annotation of the TIGER treebank
%F Kunz:2003:CAT

%0 Conference Proceedings
%A Teich, Elke
%A Hansen, Silvia
%D 2001
%T Methods and techniques for a multi-level analysis of multilingual corpora
%B Proceedings of the Corpus Linguistics 2001 conference
%C Lancaster
%P 572-580
%! Methods and techniques for a multi-level analysis of multilingual corpora
%F Teich:2001:MTM

%0 Conference Proceedings
%A Abdel Rahman, R. 
%A Melinger, A.
%D 2003
%T Phonological co-activation of semantic competitors and associates in picture naming
%B The 13th Conference of the European Society of Cognitive Psychology
%C Granada, Spain
%! Phonological co-activation of semantic competitors and associates in picture naming
%F Rahman:2003:PCA

%0 Conference Proceedings
%A Abdel Rahman, R. 
%A Melinger, A.
%D 2003
%T Phonologische Ko-Aktivierung bei Multipler Bild-Wort Interferenz (Phonologial co-activation with picture-multiple-word-interference) (poster)
%B The 45th Tagung experimentell arbeitender Psychologen (TeaP)
%C Kiel, Germany
%! Phonologische Ko-Aktivierung bei Multipler Bild-Wort Interferenz (Phonologial co-activation with picture-multiple-word-interference) (poster)
%F Rahman:2003:PKA


%0 Conference Proceedings
%A Amit Dubey 
%A Keller, Frank
%D 2003
%T Parsing German with Sister-head Dependencies
%B ACL
%C Sapporo, Japan
%! Parsing German with Sister-head Dependencies
%F Dubey:2003:PGS

%0 Conference Proceedings
%A Asudeh, Ash 
%A Keller, Frank
%D 2001
%T Experimental Evidence for a Predication-based Binding Theory
%E Andronis, Mary
%E Ball, Christopher
%E Elston, Heidiand
%E Neuvel, Sylvain
%B The 37th Meeting of the Chicago Linguistic Society
%C Chicago
%V 1: The Main Session
%P 1-14
%! Experimental Evidence for a Predication-based Binding Theory
%F Asudeh:2001:EEP


%0 Conference Proceedings
%A Baldewein, Ulrike 
%A Frank Keller
%D 2004
%T Modelling Attachment Decisions with a Probabilistic Parser: The Case of Head-Final Structures
%B CogSci Conference
%! Modelling Attachment Decisions with a Probabilistic Parser: The Case of Head-Final Structures
%F Baldewein:2004:MAD

%0 Conference Proceedings
%A Crocker, Matthew
%D 2002
%T Parsing as Prediction: Evidence from SVO and OVS constructions in German
%B The 6th Konferenz zur Verarbeitung natürlicher Sprache (KONVENS 2002)
%C Saarbrücken, Germany
%P 3-6
%8 September
%! Parsing as Prediction: Evidence from SVO and OVS constructions in German
%F Crocker:2002:PPE

%0 Conference Proceedings
%A Crocker, Matthew
%D 2002
%T Expectations in incremental language comprehension: The role of context and experience
%B The European Society of Philosophy and Psychology (ESPP-2002)
%C Lyon, France
%8 July
%! Expectations in incremental language comprehension: The role of context and experience
%F Crocker:2002:EIL


%0 Book Section
%A Crocker, Matthew
%D 2004 (to appear)
%T Rational models of comprehension: addressing the performance paradox
%E Culter, Anne
%B Psycholinguistic Interelationships (tentative)
%C Hillsdale, NJ.
%I Lawrence Erlbaum Associates
%! Rational models of comprehension: addressing the performance paradox
%F Crocker:2004:RMC

%0 Book Section
%A Crocker, Matthew 
%A Frank Keller
%D 2005 (to appear)
%T Probabilistic Grammars as Models of Gradience in Language Processing
%E G. Fanselow
%E et al
%B Gradedness
%I Oxford University Press
%! Probabilistic Grammars as Models of Gradience in Language Processing
%F Crocker:2005:PGM


%0 Conference Proceedings
%A Dienes, Peter 
%A Dubey, Amit
%D 2003
%T Deep Processing by Combining Shallow Methods
%B ACL
%C Sapporo, Japan
%! Deep Processing by Combining Shallow Methods
%F Dienes:2003:DPC


%0 Conference Proceedings
%A Dubey, Amit 
%A Keller, Frank
%D 2003
%T Probabilistic Parsing for German using Sister-Head Dependencies
%B The 41st Annual Meeting of the Association for Computational Linguistics
%C Sapporo, Japan
%P 96-103
%! Probabilistic Parsing for German using Sister-Head Dependencies
%F Dubey:2003:PPG


%0 Conference Proceedings
%A Fissaha, S.
%A Olejnik, D.
%A Kornberger, R.
%A Müller, K. 
%A Prescher, D.
%D 2003
%T Experiments in German treebank parsing
%E Matousek, V.
%E Mautner, P.
%B Text, Speech and Dialogue, 6th International Conference, TSD 2003
%C Ceske Budejovice, Czech Republic
%I Springer
%V 2807
%P 50-57
%! Experiments in German treebank parsing
%F Fissaha:2003:EGT


%0 Conference Proceedings
%A Hadelich, Kerstin
%A Matthew Crocker 
%A Christoph Scheepers
%D 2002
%T Powerful pictures: Priming planning or production or both? (poster)
%B AMLaP-2002
%C Tenerife, Spain
%8 September
%! Powerful pictures: Priming planning or production or both? (poster)
%F Hadelich:2002:PPP

%0 Conference Proceedings
%A Hadelich, Hadelich
%A Matthew Crocker 
%A Christoph Scheepers
%D 2003
%T Patients first: Visual versus syntactic priming in German (poster)
%B The Annual CUNY Conference on Sentence Processing
%C Boston, MA
%8 March
%! Patients first: Visual versus syntactic priming in German (poster)
%F Hadelich:2003:PFV


%0 Conference Proceedings
%A Hadelich, Kerstin
%A Holly Branigan
%A Martin Pickering 
%A Matthew Crocker
%D 2004
%T Effects of visual and verbal Feedback on Alignment (poster)
%B The Annual CUNY Conference on Sentence Processing
%C College Park, MD.
%8 March
%! Effects of visual and verbal Feedback on Alignment (poster)
%F Hadelich:2004:EVV


%0 Conference Proceedings
%A Kamide, Yuki
%A Christoph Scheepers
%A Gerry Altmann 
%A Matthew Crocker
%D 2002
%T Integration of syntactic and semantic information in predictive processing: Anticipatory eye-movements in German sentence processing
%B The Annual CUNY Conference on Sentence Processing
%C New York, NY
%8 March
%! Integration of syntactic and semantic information in predictive processing: Anticipatory eye-movements in German sentence processing
%F Kamide:2002:ISS


%0 Journal Article
%A Kamide, Y.
%A Scheepers, C. 
%A Altmann, G. T. M.
%D 2003
%T Integration of syntactic and semantic information in predictive processing: Cross-linguistic evidence from German and English
%B Journal of Psycholinguistic Research
%V 32 (1)
%P 37-55
%! Integration of syntactic and semantic information in predictive processing: Cross-linguistic evidence from German and English
%F Kamide:2003:ISS


%0 Journal Article
%A Keller, Frank 
%A Alexopoulou, Theodora
%D 2001
%T Phonology Competes with Syntax: Experimental Evidence for the Interaction of Word Order and Accent Placement in the Realization of Information Structure
%B Cognition
%V 79
%N 3
%P 301-372
%! Phonology Competes with Syntax: Experimental Evidence for the Interaction of Word Order and Accent Placement in the Realization of Information Structure
%F Keller:2001:PCS

%0 Journal Article
%A Keller, Frank
%D 2001
%T Experimental Evidence for Constraint Competition in Gapping Constructions
%B Competition in Syntax
%P 211-248
%! Experimental Evidence for Constraint Competition in Gapping Constructions
%F Keller:2001:EEC


%0 Conference Proceedings
%A Keller, Frank 
%A Asudeh, Ash
%D 2001
%T Constraints on Linguistic Coreference: Structural vs. Pragmatic Factors
%E Moore, Johanna D.
%E Stenning, Keith
%B The 23rd Annual Conference of the Cognitive Science Society
%C Mahawah, NJ
%I Lawrence Erlbaum
%P 483-488
%! Constraints on Linguistic Coreference: Structural vs. Pragmatic Factors
%F Keller:2001:CLC


%0 Journal Article
%A Keller, Frank 
%A Asudeh, Ash
%D 2002
%T Probabilistic Learning Algorithms and Optimality Theory
%B Linguistic Inquiry
%V 33
%N 2
%P 225-244
%! Probabilistic Learning Algorithms and Optimality Theory
%F Keller:2002:PLA


%0 Conference Proceedings
%A Keller, F.
%A Scheepers, C.
%A Becker, S. 
%A Foeldesi, C.
%D 2002
%T Context effects on verb frame bias
%B The 8th Annual Conference on Architectures and Mechanisms for Language Processing (AMLaP-2002)
%C Tenerife, Spain
%! Context effects on verb frame bias
%F Keller:2002:CEV


%0 Conference Proceedings
%A Keller, Frank
%D 2003
%T A probabilistic parser as a model of global processing difficulty
%B The 25th Annual Conference of the Cognitive Science Society
%C Mahawah, NJ
%I Erlbaum
%P 646-651
%! A probabilistic parser as a model of global processing difficulty
%F Keller:2003:PPM


%0 Journal Article
%A Keller, Frank 
%A Lapata, Mirella
%D 2003
%T Using the Web to Obtain Frequencies for Unseen Bigrams
%B Computational Linguistics
%V 29
%N 3
%P 459-484
%! Using the Web to Obtain Frequencies for Unseen Bigrams
%F Keller:2003:UWO


%0 Conference Proceedings
%A Knoeferle, Pia
%A Crocker, Matthew
%A Scheepers, Christoph 
%A Pickering, Martin
%D 2002
%T Anticipatory eye movements in initially ambiguous sentences
%B AMLaP-2002
%C Tenerife, Spain
%8 September
%! Anticipatory eye movements in initially ambiguous sentences
%F Knoeferle:2002:AEM


%0 Conference Proceedings
%A Knoeferle, Pia
%A Crocker, Matthew
%A Scheepers, Christoph 
%A Pickering, Martin
%D 2003
%T The interaction of mental representations from linguistic and visual input: A processing account of role assignment in visual worlds
%B AMLaP-2003
%C Glasgow, Scotland
%8 August
%! The interaction of mental representations from linguistic and visual input: A processing account of role assignment in visual worlds
%F Knoeferle:2003:IMR


%0 Conference Proceedings
%A Knoeferle, Pia
%A Crocker, Matthew
%A Scheepers, Christoph 
%A Pickering, Martin
%D 2003
%T Eye-movements on Images as a Measure of Disambiguation and Reinterpretation in Online Sentence Comprehension: a cross-linguistic comparison
%B European Conference on Eye Movements
%C Dundee, UK
%8 August
%! Eye-movements on Images as a Measure of Disambiguation and Reinterpretation in Online Sentence Comprehension: a cross-linguistic comparison
%F Knoeferle:2003:EMI


%0 Conference Proceedings
%A Knoeferle, Pia
%A Crocker, Matthew
%A Scheepers, Christoph 
%A Pickering, Martin
%D 2003
%T Actions and Roles: Using depicted events for disambiguation and reinterpretation in German and English
%B The 25th Annual Conference of the Cognitive Science Society
%C Boston, USA
%8 July
%! Actions and Roles: Using depicted events for disambiguation and reinterpretation in German and English
%F Knoeferle:2003:ARU


%0 Conference Proceedings
%A Knoeferle, Pia
%A Crocker, Matthew
%A Scheepers, Christoph
%A Pickering, Martin 
%A Sturt, Patrick
%D 2003
%T Visual events, role (re-)assignments, and word-order ambiguity in German and English (poster)
%B The Annual CUNY Conference on Sentence Processing
%C Boston, MA
%8 March
%! Visual events, role (re-)assignments, and word-order ambiguity in German and English (poster)
%F Knoeferle:2003:VER


%0 Conference Proceedings
%A Knoeferle, Pia
%A Crocker, Matthew
%A Scheepers, Christoph 
%A Pickering, Martin
%D 2003
%T Using Depicted Role-Relations for Rapid Disambiguation and Reinterpretation in Online Sentence Comprehension (poster)
%B The Conference of the European Society for Cognitive Psychology (ESCOP)
%C Granada, Spain
%8 September
%! Using Depicted Role-Relations for Rapid Disambiguation and Reinterpretation in Online Sentence Comprehension (poster)
%F Knoeferle:2003:UDR


%0 Journal Article
%A Knoeferle, Pia
%A Crocker, Matthew
%A Pickering, Martin 
%A Scheepers, Christoph
%D 2004
%T The influence of the immediate visual context on incremental thematic role-assignment: evidence from eye-movements in depicted events
%B Cognition
%V in press
%! The influence of the immediate visual context on incremental thematic role-assignment: evidence from eye-movements in depicted events
%F Knoeferle:2004:IIV


%0 Conference Proceedings
%A Knoeferle, Pia 
%A Crocker, Matthew
%D 2004
%T Stored knowledge versus depicted events: what guides auditory sentence comprehension?
%B The 26th Annual Conference of the Cognitive Science Society
%C Chicago, USA
%8 August
%! Stored knowledge versus depicted events: what guides auditory sentence comprehension?
%F Knoeferle:2004:SKV



%0 Conference Proceedings
%A Knoeferle, Pia 
%A Crocker, Matthew
%D 2004
%T When Linguistic Experience Competes with Scene Information in Sentence Comprehension (poster)
%B The Annual CUNY Conference on Sentence Processing
%C College Park, MD.
%8 March
%! When Linguistic Experience Competes with Scene Information in Sentence Comprehension (poster)
%F Knoeferle:2004:WLE


%0 Conference Proceedings
%A Knoeferle, Pia
%A Crocker, Matthew 
%A Scheepers, Christoph
%D 2004
%T The influence of depicted event scenes on written comprehension of locally ambiguous sentences (poster)
%B The Annual CUNY Conference on Sentence Processing
%C College Park, MD.
%8 March
%! The influence of depicted event scenes on written comprehension of locally ambiguous sentences (poster)
%F Knoeferle:2004:IDE


%0 Journal Article
%A Lapata, M.
%A Keller, F. 
%A Schulte im Walde, S.
%D 2001
%T Verb frame frequency as a predictor of verb bias
%B Journal  of Psycholinguistic Reseach
%V 30(4)
%P 419-435
%! Verb frame frequency as a predictor of verb bias
%F Lapata:2001:VFF


%0 Conference Proceedings
%A Lapata, Maria
%A Keller, Frank 
%A McDonald, Scott
%D 2001
%T Evaluating Smoothing Algorithms against Plausibility Judgments
%B The 39th Annual Meeting of the Association for Computational Linguistics and the 10th Conference of the European Chapter of the Association for Computational Linguistics
%C Toulouse
%P 346-353
%! Evaluating Smoothing Algorithms against Plausibility Judgments
%F Lapata:2001:ESA


%0 Journal Article
%A Lapata, M.
%A Keller, F.  
%A Scheepers, C.
%D 2003
%T Intra-sentential context effects on the interpretation of logical metonymy
%B Cognition Science
%V 27
%P 649-668
%! Intra-sentential context effects on the interpretation of logical metonymy
%F Lapata:2003:ISC


%0 Journal Article
%A Lapata, Mirella
%A Keller, Frank 
%A Scheepers, Christoph
%D 2003
%T Intra-sentential Context Effects on the Interpretation of Logical Metonymy
%B Cognitive Science
%V 27:4
%P 649-668
%! Intra-sentential Context Effects on the Interpretation of Logical Metonymy
%F Lapata:2003:ISCa


%0 Conference Proceedings
%A Mayberry, Marshall R. 
%A Miikulainen, R.
%D 2003
%T Incremental nonmonotonic parsing through semantic self-organization
%B The 25th Annual Conference of the Cognitive Science Society
%C Mahawah, NJ
%I Erlbaum
%P 798-803
%! Incremental nonmonotonic parsing through semantic self-organization
%F Mayberry:2003:INP


%0 Conference Proceedings
%A Mayberry, Marshall R. 
%A Crocker, Matthew
%D 2004
%T Incrementality, prediction, and attention in a scaleable network model of linguistic competence and performance
%B The Annual CUNY Conference on Sentence Processing
%C College Park, MD
%8 March
%! Incrementality, prediction, and attention in a scaleable network model of linguistic competence and performance
%F Mayberry:2004:IPA


%0 Conference Proceedings
%A Mayberry, Marshall R.
%D 2004
%T Generating Semantic Graphs through Self-Organization
%B AAAI Symposium on Compositional Connectionism in Cognitive Science
%C Washington, D. C.
%8 Oktober
%! Generating Semantic Graphs through Self-Organization
%F Mayberry:2004:GSG


%0 Conference Proceedings
%A Melinger, A 
%A Kita, S.
%D 2002 (in press)
%T Does gesture help processes of speech production?: Evidence for conceptual level facilitation
%B The Berkeley Linguistics Society Annual Meeting
%C Berkeley, USA
%! Does gesture help processes of speech production?: Evidence for conceptual level facilitation
%F Melinger:2002:DGH


%0 Journal Article
%A Melinger, Alissa
%D 2003
%T Morphological structure in the lexical representation of prefixed words: Evidence from speech errors
%B Language and Cognitive Processes
%V 18 (3)
%P 335-362
%! Morphological structure in the lexical representation of prefixed words: Evidence from speech errors
%F Melinger:2003:MSL


%0 Conference Proceedings
%A Melinger, A. 
%A Dobel, C.
%D 2003
%T Lexically driven syntactic priming (poster)
%B The 6th Symposium on Psycholinguistics
%C Barcelona, Spain
%! Lexically driven syntactic priming (poster)
%F Melinger:2003:LDS


%0 Journal Article
%A Melinger, A. 
%A Abdel Rahman, R.
%D 2004
%T Investigating the interplay between semantic and phonological distractor effects in picture naming
%B Brain and Language
%V 90
%P 213-220
%! Investigating the interplay between semantic and phonological distractor effects in picture naming
%F Melinger:2004:IIB


%0 Journal Article
%A Melinger, A. 
%A Levelt, W.
%D 2004 (accepted)
%T Gesture and the communicative intention of the speaker
%B Gesture
%! Gesture and the communicative intention of the speaker
%F Melinger:2004:GCI


%0 Conference Proceedings
%A Melinger, A. 
%A Kita, S.
%D 2004 (in press)
%T When input and output diverge: Mismatches in speech, gesture and image
%B Proceedings of the 26th Annual Meeting of the Cognitive Science Society
%C Chicago
%! When input and output diverge: Mismatches in speech, gesture and image
%F Melinger:2004:WIO


%0 Conference Proceedings
%A Muckel, Sandra
%A Scheepers, Christoph
%A Crocker, Matthew 
%A Müller, Karin
%D 2002
%T Anticipating German particle verb meanings: Effects of lexical frequency and plausibility
%B AMLaP-2002
%C Tenerife, Spain
%8 September
%! Anticipating German particle verb meanings: Effects of lexical frequency and plausibility
%F Muckel:2002:AGP


%0 Conference Proceedings
%A Scheepers, Christoph 
%A Crocker, Matthew
%D 2002
%T Constituent order priming from reading to listening
%B AMLaP-2002
%C Tenerife, Spain
%8 September
%! Constituent order priming from reading to listening
%F Scheepers:2002:COP


%0 Journal Article
%A Scheepers, Christoph
%D 2003
%T Syntactic priming of relative clause attachments: Persistence of structural configuration in sentence production
%B Cognition
%V 89
%P 179-205
%! Syntactic priming of relative clause attachments: Persistence of structural configuration in sentence production
%F Scheepers:2003:SPR


%0 Conference Proceedings
%A Scheepers, Christoph
%A Muckel, Sandra 
%A Crocker, Matthew
%D 2003
%T Anticipation of Particle Verb Meanings in Visual Worlds (poster)
%B European Conference on Eye Movements
%C Dundee, UK
%8 August
%! Anticipation of Particle Verb Meanings in Visual Worlds (poster)
%F Scheepers:2003:APV


%0 Conference Proceedings
%A Scheepers, Christoph
%A Muckel, Sandra
%A Crocker, Matthew 
%A Müller, Karin
%D 2003
%T On-line interpretation of German particle verb constructions (poster)
%B The Annual CUNY Conference on Sentence Processing
%C Boston, MA
%8 March
%! On-line interpretation of German particle verb constructions (poster)
%F Scheepers:2003:LIG


%0 Book Section
%A Scheepers, Christoph 
%A Crocker, Matthew
%D 2004
%T Constituent Order Priming from Reading to Listening: A Visual-World Study
%E M. Carreiras
%E C. Clifton, Jr.
%B The On-line Study of Sentence Comprehension: Eyetracking, ERP and Beyond (in press)
%C UK
%I Psychology Press
%! Constituent Order Priming from Reading to Listening: A Visual-World Study
%F Scheepers:2004:COP


%0 Conference Proceedings
%A Weber, Andrea
%A Grice, Martine 
%A  Crocker, Matthew
%D 2003
%T Effects of prosody on the resolution of word order ambiguities (poster)
%B AMLaP-2003
%C Glasgow, Scotland
%8 August
%! Effects of prosody on the resolution of word order ambiguities (poster)
%F Weber:2003:EPR


%0 Conference Proceedings
%A Weber, Andrea
%A Braun, Bettina 
%A  Crocker, Matthew
%D 2004
%T Adjectival modifiers and reference resolution: when prosodic focus matters (poster)
%B The Annual CUNY Conference on Sentence Processing
%C College Park, MD.
%8 March
%! Adjectival modifiers and reference resolution: when prosodic focus matters (poster)
%F Weber:2004:AMR