% % GENERATED FROM https://www.coli.uni-saarland.de % by : anonymous % IP : coli2006.lst.uni-saarland.de % at : Mon, 05 Feb 2024 15:41:12 +0100 GMT % % Selection : Year = 1997 % @TechReport{Alexandersson_et_al:1997, AUTHOR = {Alexandersson, Jan and Becker, Tilman and Finkler, Wolfgang and Kasper, Walter and Kilger, Anne and Karger, Reinhard and Krieger, Hans-Ulrich and Maier, Elisabeth and Reithinger, Norbert and Siegel, Melanie and Uszkoreit, Hans and Wahlster, Wolfgang}, TITLE = {Abschlussbericht Verbmobil TP 6, 7, 8, 9, 10, 11, 15; TP 9 - Spontansprachliche inkrementelle Generierung; TP 10 - Übersetzungsorientierte Dialogverarbeitung; TP 6, 7, 8, 11, 15 - Syntax, Semantik, Architektur}, YEAR = {1997}, NUMBER = {R:S 97-226}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report}, INSTITUTION = {German Research Center for Artificial Intelligence (DFKI)}, URL = {ftp://ftp.dfki.uni-kl.de/pub/Publications/FinalReports/1997/vm6-15.ps.gz}, ABSTRACT = {In this document we present the results of the Verbmobil activities at the DFKI related with generation (sub-project 9), dialogue (sub-project 10), linguistic analysis and innovative architectures (sub-projects 6-15). The projects contributed successfully to the implemented Forschungsprototyp 1.0 and the INTARC-prototype of an incremental architecture, delivering robust, efficient and flexible software modules. The implementations are based on theoretical results gained during the first phase of Verbmobil. The theoretical and practical results were reported in numerous publications and talks at major international conferences.}, ANNOTE = {COLIURL : Alexandersson:1997:AVT.pdf Alexandersson:1997:AVT.ps} } @Article{Andreeva_Barry:1997, AUTHOR = {Andreeva, Bistra and Barry, William J.}, TITLE = {Intonation von Checks in der Sofia-Varietaet des Bulgarischen}, YEAR = {1997}, JOURNAL = {PHONUS}, VOLUME = {4}, PAGES = {1-14}, URL = {https://www.coli.uni-saarland.de/Phonetics/Research/PHONUS_research_reports/Phonus4/Andreeva_PHONUS4.ps.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Andreeva:1997:ICS.pdf Andreeva:1997:ICS.ps} } @InCollection{Avgustinova:1997, AUTHOR = {Avgustinova, Tania}, TITLE = {An HPSG Approach to the Syntax of Bulgarian Relatives}, YEAR = {1997}, BOOKTITLE = {Formale Slavistik}, PAGES = {177-191}, EDITOR = {Junghanns, Uwe and Zybatow, Gerhild}, SERIES = {Leipziger Schriften zur Kultur-, Literatur-, Sprach- und Übersetzungswissenschaft; 7}, ADDRESS = {Frankfurt am Main}, PUBLISHER = {Vervuert Verlag} } @InProceedings{Avgustinova:1997_1, AUTHOR = {Avgustinova, Tania}, TITLE = {Clustering Clitics in Bulgarian Nominal Constituents}, YEAR = {1997}, BOOKTITLE = {2nd European Conference on Formal Description of Slavic Languages (FDSL 2), November 20-22}, EDITOR = {Kosta, Peter and Unger, M.}, ADDRESS = {Potsdam, Germany}, URL = {https://www.coli.uni-saarland.de/~tania/ta-pub/np-clitics-fdsl2.pdf}, ANNOTE = {COLIURL : Avgustinova:1997:CCB.pdf} } @PhdThesis{Avgustinova:1997_2, AUTHOR = {Avgustinova, Tania}, TITLE = {Word Order and Clitics in Bulgarian}, YEAR = {1997}, ADDRESS = {Saarbrücken}, SCHOOL = {Universität des Saarlandes, Department of Slavistics, Computational Linguistics}, NOTE = {Dissertation in Computational Linguistics and Language Technology, Volume 5} } @TechReport{Avgustinova:1997_3, AUTHOR = {Avgustinova, Tania}, TITLE = {Determinedness Constraints on Clitic Replication}, YEAR = {1997}, MONTH = {March}, NUMBER = {87}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {The proposed typology of Bulgarian articled and non-articled noun phrases provides criteria for determining which nominal material can be replicated by a clitic pronoun under the appropriate verb-lexeme specific, syntactic and communicative conditions. The main claim is that only nominal material used as identifying specific description of a given object is replicable in Bulgarian. Non-articled noun phrases that are categorising or non-specific descriptions as well as articled noun phrases that are generic or non-specific descriptions completely lack replication potential.} } @InCollection{Avgustinova_Oliva:1997, AUTHOR = {Avgustinova, Tania and Oliva, Karel}, TITLE = {On the Nature of the Wackernagel Position in Czech}, YEAR = {1997}, BOOKTITLE = {Formale Slavistik}, PAGES = {25-47}, EDITOR = {Junghanns, Uwe and Zybatow, Gerhild}, SERIES = {Leipziger Schriften zur Kultur-, Literatur-, Sprach- und Übersetzungswissenschaft; 7}, ADDRESS = {Frankfurt am Main}, PUBLISHER = {Vervuert Verlag} } @InProceedings{Avgustinova_Oliva:1997_1, AUTHOR = {Avgustinova, Tania and Oliva, Karel}, TITLE = {The Proper Treatment of Binding in HPSG (in general) and in Czech (in particular)}, YEAR = {1997}, BOOKTITLE = {30th Poznan Linguistic Meeting. Workshop on Slavic Languages in HPSG, May 1-3}, ADDRESS = {Poznan, Poland} } @InProceedings{Avgustinova_Skut:1997, AUTHOR = {Avgustinova, Tania and Skut, Wojciech}, TITLE = {Encoding Common Slavic Linguistic Knowledge in HPSG}, YEAR = {1997}, BOOKTITLE = {2nd European Conference on Formal Description of Slavic Languages (FDSL2), November 20-22}, EDITOR = {Kosta, Peter and Unger, M.}, ADDRESS = {Potsdam, Germany} } @InProceedings{Avgustinova_Skut:1997_1, AUTHOR = {Avgustinova, Tania and Skut, Wojciech}, TITLE = {Panslavism Revisited}, YEAR = {1997}, BOOKTITLE = {30th Poznan Linguistic Meeting. Workshop on Slavic Languages in HPSG, May 1-3}, ADDRESS = {Poznan, Poland} } @Article{Barry:1997, AUTHOR = {Barry, William J.}, TITLE = {Another R-tickle}, YEAR = {1997}, JOURNAL = {Journal of the International Phonetic Association}, VOLUME = {27}, NUMBER = {1-2}, PAGES = {35-45} } @Article{Barry_Pützer:1997, AUTHOR = {Barry, William J. and Pützer, Manfred}, TITLE = {Zur phonetischen Basis der Fortis-Lenis-Opposition bei Plosiven in moselfränkischen und rheinfränkischen Dialekten sowie Übergangsgebieten im germanophonen Lothringen (Frankreich)}, YEAR = {1997}, JOURNAL = {Zeitschrift für Dialektologie und Linguistik}, VOLUME = {64}, NUMBER = {2}, PAGES = {155-178} } @Proceedings{Tilman_et_al:1997, TITLE = {DFKI Workshop on Natural Language Generation}, YEAR = {1997}, NUMBER = {D-97-06}, EDITOR = {Becker, Tilman and Busemann, Stephan and Finkler, Wolfgang}, SERIES = {DFKI Document}, ADDRESS = {Saarbrücken}, PUBLISHER = {DFKI}, URL = {ftp://ftp.dfki.uni-kl.de/pub/Publications/Documents/1997/D-97-06.tar.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Becker:1997:DWN.tar} } @Proceedings{Tilman_Hans-Ulrich:1997, TITLE = {Proceedings of the Fifth Meeting on Mathematics of Language - MOL5}, YEAR = {1997}, NUMBER = {D-97-02}, EDITOR = {Becker, Tilman and Krieger, Hans-Ulrich}, SERIES = {DFKI Document}, ADDRESS = {Saarbrücken}, PUBLISHER = {DFKI}, URL = {ftp://ftp.dfki.uni-kl.de/pub/Publications/Documents/1997/D-97-02.tar.gz}, ABSTRACT = {The Fifth Meeting on Mathematics of Language (MOL5) covers all areas of study that deal with the mathematical properties of natural language. These areas include, but are not limited to, mathematical models of syntax, semantics and phonology; computational complexity of linguistic frameworks/theories and models of natural language processing; mathematical theories of language learning; parsing theory; and quantitative models of language. The 1997 meeting takes place in the wonderfully located Schloss Dagstuhl, the International Meeting and Research Center for Computer Science near Saarbrücken, Germany.}, ANNOTE = {COLIURL : Becker:1997:PFM.tar} } @Article{Benzmüller:1997, AUTHOR = {Benzmüller, Ralf}, TITLE = {SAMPA als Eingabeformat für die Sprachausgabe Logox}, YEAR = {1997}, JOURNAL = {PHONUS}, VOLUME = {3}, PAGES = {61-81}, URL = {ftp://ftp.coli.uni-sb.de/pub/people/ralf/logox+SAMPA.ps.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Benzmuller:1997:SES.pdf Benzmuller:1997:SES.ps} } @Article{Benzmüller_Grice:1997, AUTHOR = {Benzmüller, Ralf and Grice, Martine}, TITLE = {Trainingsmaterialien zur Etikettierung deutscher Intonation mit GToBI}, YEAR = {1997}, JOURNAL = {PHONUS}, VOLUME = {3}, PAGES = {9-34}, URL = {https://www.coli.uni-saarland.de/Phonetics/Research/PHONUS_research_reports/Phonus3/BenzmuellerGrice_PHONUS3.ps.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Benzmuller:1997:TED.pdf} } @TechReport{Blackburn_Bos:1997, AUTHOR = {Blackburn, Patrick and Bos, Johan}, TITLE = {Representation and Inference for Natural language. A First Course in Computational Semantics}, YEAR = {1997}, MONTH = {August}, NUMBER = {90}, PAGES = {50}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS Report}, INSTITUTION = {Universität des Saarlandes}, URL = {http://www.iccs.informatics.ed.ac.uk/~jbos/comsem/download/volume1.ps.gz}, ABSTRACT = {These are the course notes for Representation and Inference for Natural Language: A First Course in Computational Semantics, which will be given in the second week of ESSLLI97, Aix-en-Provence, by Patrick Blackburn and Johan Bos. The course is an introduction to computational semantics in Prolog. It introduces some fundamental techniques for computing semantic representations for natural language, and working with the result. Both the underlying theory, and their implementation in Prolog, are discussed. We believe that the reader who masters these techniques will be in a good position to appreciate (and critically assess) ongoing developments in computational semantics.}, ANNOTE = {COLIURL : Blackburn:1997:RIN.pdf Blackburn:1997:RIN.ps} } @Article{Blackburn_de Rijke:1997, AUTHOR = {Blackburn, Patrick and de Rijke, Maarten}, TITLE = {Why Combine Logics?}, YEAR = {1997}, JOURNAL = {Studia Logica. An International Journal for Symbolic Logic}, VOLUME = {59}, NUMBER = {1}, PAGES = {5-27}, NOTE = {but published later} } @Article{Blackburn_de Rijke:1997_1, AUTHOR = {Blackburn, Patrick and de Rijke, Maarten}, TITLE = {Zooming In, Zooming Out}, YEAR = {1997}, JOURNAL = {Journal of Logic, Language and Information}, VOLUME = {6}, PAGES = {5-31} } @InCollection{Blackburn_et_al:1997, AUTHOR = {Blackburn, Patrick and de Rijke, Maarten and Vennema, Ide}, TITLE = {Relational Methods in Logic, Language and Information}, YEAR = {1997}, BOOKTITLE = {Relational Methods in Computer Science}, PAGES = {211-225}, EDITOR = {Brink, C. and Kahl, W. and Schmidt, G.}, SERIES = {Advances in Computing Sciences}, ADDRESS = {Berlin}, PUBLISHER = {Springer} } @InProceedings{Brants:1997, AUTHOR = {Brants, Thorsten}, TITLE = {Internal and External Tagsets in Part-of-Speech Tagging}, YEAR = {1997}, BOOKTITLE = {5th European Conference on Speech Communication and Technology (EUROSPEECH'97), September 22-25}, VOLUME = {5}, PAGES = {2787-2790}, EDITOR = {Kokkinakis, G. and Fakotakis, N. and Dermatas, E.}, ADDRESS = {Rhodes, Greece}, URL = {https://www.coli.uni-saarland.de/~thorsten/eurospeech97/}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Brants:1997:IET.pdf} } @TechReport{Brants_et_al:1997, AUTHOR = {Brants, Thorsten and Hendriks, Roland and Kramp, Sabine and Krenn, Brigitte and Preis, Cordula and Skut, Wojciech and Uszkoreit, Hans}, TITLE = {Das NEGRA-Annotationsschema}, YEAR = {1997}, ADDRESS = {Saarbrücken}, TYPE = {Negra Project Report}, INSTITUTION = {Universität des Saarlandes}, URL = {https://www.coli.uni-saarland.de/sfb378/negra-corpus/negra-corpus.html}, ABSTRACT = {Das vorliegende Annotierschema entstand während des Aufbaus des NEGRA-Korpus. Nach drei Jahren Arbeit (wobei der Aufbau des Korpus nur ein Teilaspekt des Projektes war) liegen 20,000 annotierte Sätze (ca. 350,000 Tokens) sowie diese mehrfach überarbeitete Version des Schemas vor.} } @InProceedings{Brants_et_al:1997_1, AUTHOR = {Brants, Thorsten and Skut, Wojciech and Krenn, Brigitte}, TITLE = {Tagging Grammatical Functions}, YEAR = {1997}, BOOKTITLE = {Conference on Empirical Methods in Natural Language Processing (EMNLP '97)}, ADDRESS = {Providence, Rhode Island, USA}, URL = {https://www.coli.uni-saarland.de/~thorsten/emnlp97/}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Brants:1997:TGF.pdf} } @InProceedings{Bredenkamp_et_al:1997, AUTHOR = {Bredenkamp, Andrew and Declerck, Thierry and Fouvry, Frederik and Music, Bradley and Theofilidis, Axel}, TITLE = {Linguistic Engineering Using ALEP}, YEAR = {1997}, BOOKTITLE = {Proceedings of Recent Advantages in Natural Language Processing (RANLP '97), September 11-13}, ADDRESS = {Sofia, Bulgaria}, URL = {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}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Bredenkamp:1997:LEU.pdf Bredenkamp:1997:LEU.ps} } @InProceedings{Busemann:1997, AUTHOR = {Busemann, Stephan}, TITLE = {Putting Semantic-Head-Driven Generation to the Limits: Experiments with Multi-Purpose Semantic Representations}, YEAR = {1997}, BOOKTITLE = {DFKI Workshop on Natural Language Generation, April 1997}, NUMBER = {D-97-06}, PAGES = {8-14}, EDITOR = {Becker, Tilman and Busemann, Stephan and Finkler, Wolfgang}, SERIES = {DFKI Document}, ADDRESS = {Saarbrücken, Germany}, PUBLISHER = {DFKI}, URL = {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}, ANNOTE = {COLIURL : Busemann:1997:PSH.pdf Busemann:1997:PSH.ps Busemann:1997:PSH.dvi} } @InProceedings{Busemann_et_al:1997, AUTHOR = {Busemann, Stephan and Declerck, Thierry and Diagne, Abdel Kader and Dini, Luca and Klein, Judith and Schmeier, Sven}, TITLE = {Natural Language Dialogue Service for Appointment Scheduling Agents}, YEAR = {1997}, BOOKTITLE = {Proceedings of the 5th Conference on Applied Natural Language Processing (ANLP'97), March 31 - April 3}, PAGES = {25-32}, EDITOR = {Jacobs, Paul}, ADDRESS = {Washington D. C., USA}, PUBLISHER = {Morgan Kaufmann Publishers}, URL = {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}, ABSTRACT = {Appointment scheduling is a problem faced daily by many people and organizations. Cooperating agent systems have been developed to automate this task partially. In order to extend the circle of participants as far as possible we advocate for the use of natural language transmitted by email. We describe Cosma, a fully implemented German language server for existing appointment scheduling agent systems. Cosma can cope with multiple dialogues in parallel, and accounts for differences in dialogue behaviour between human and machine agents. NL coverage of the sublanguage is achieved through both corpus-based grammar development and the use of message extraction techniques.}, NOTE = {HU}, ANNOTE = {COLIURL : Busemann:1997:NLDa.pdf Busemann:1997:NLDa.ps} } @TechReport{Busemann_et_al:1997_1, AUTHOR = {Busemann, Stephan and Declerck, Thierry and Diagne, Abdel Kader and Dini, Luca and Klein, Judith and Schmeier, Sven}, TITLE = {Natural Language Dialogue Service for Appointment Scheduling Agents}, YEAR = {1997}, NUMBER = {RR-97-02}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://ftp.dfki.uni-kl.de/pub/Publications/ResearchReports/1997/RR-97-02.ps.gz}, ABSTRACT = {Appointment scheduling is a problem faced daily by many people and organizations. Cooperating agent systems have been developed to automate this task partially. In order to extend the circle of participants as far as possible we advocate for the use of natural language transmitted by email. We describe Cosma, a fully implemented German language server for existing appointment scheduling agent systems. Cosma can cope with multiple dialogues in parallel, and accounts for differences in dialogue behaviour between human and machine agents. NL coverage of the sublanguage is achieved through both corpus-based grammar development and the use of message extraction techniques.}, ANNOTE = {COLIURL : Busemann:1997:NLDb.pdf Busemann:1997:NLDb.ps} } @TechReport{Busemann_et_al:1997_2, AUTHOR = {Busemann, Stephan and Declerck, Thierry and Diagne, Abdel Kader and Hinkelman, Elizabeth and Uszkoreit, Hans}, TITLE = {Cooperative Schedule Management Agent. Abschlussbericht COSMA}, YEAR = {1997}, NUMBER = {R:S97-216}, ADDRESS = {Saarbrücken}, TYPE = {DFKI-Report}, INSTITUTION = {DFKI}, URL = {http://www.dfki.de/dfkibib/publications/docs/cosma-abschluss.pdf}, ANNOTE = {COLIURL : Busemann:1997:CSM.pdf} } @InProceedings{Busemann_Horacek:1997, AUTHOR = {Busemann, Stephan and Horacek, Helmut}, TITLE = {Generating Air-Quality Reports from Environmental Data}, YEAR = {1997}, BOOKTITLE = {DFKI Workshop on Natural Language Generation}, NUMBER = {D-97-06}, PAGES = {15-21}, EDITOR = {Becker, Tilman and Busemann, Stephan and Finkler, Wolfgang}, SERIES = {DFKI Document}, ADDRESS = {Saarbrücken, Germany}, PUBLISHER = {DFKI}, URL = {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}, ANNOTE = {COLIURL : Busemann:1997:GAQ.pdf Busemann:1997:GAQ.ps Busemann:1997:GAQ.dvi} } @Book{Ronald A._et_al:1997, TITLE = {Survey of the State of the Art in Human Language Technology}, YEAR = {1997}, EDITOR = {Cole, Ronald A. and Mariani, Joseph and Uszkoreit, Hans and Varile, Giovanni and Zaenen, Annie and Zue, Victor and Zampolli, Antonio}, ADDRESS = {Cambridge}, PUBLISHER = {Cambridge University Press and Giardini}, URL = {also as Web edition: http://www.dfki.de/~hansu/HLT-Survey.pdf}, ANNOTE = {COLIURL : Cole:1997:SSA.pdf} } @InProceedings{Crysmann:1997, AUTHOR = {Crysmann, Berthold}, TITLE = {The Conspiracy of Quantification and Linear Precedence in European Portuguese Proclisis}, YEAR = {1997}, BOOKTITLE = {Eastern States Conference on Linguistics (ESCOL '97), November 21-23}, EDITOR = {Austin, J. and Lawson, A.}, ADDRESS = {Yale University, New Haven, USA}, PUBLISHER = {CLC Publications}, URL = {https://www.coli.uni-saarland.de/~crysmann/papers/Conspire.html}, ABSTRACT = {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.} } @InProceedings{Crysmann:1997_1, AUTHOR = {Crysmann, Berthold}, TITLE = {Cliticization in European Portuguese Using Parallel Morpho-Syntactic Constraints}, YEAR = {1997}, BOOKTITLE = {Lexical Functional Grammar Conference (LFG'97), June 19-21}, EDITOR = {Butt, Miriam and Holloway King, Tracy}, ADDRESS = {University of California, San Diego, USA}, PUBLISHER = {CSLI Publications}, URL = {http://csli-publications.stanford.edu/LFG/2/crysmann-lfg97.pdf http://csli-publications.stanford.edu/LFG/2/crysmann-lfg97.ps}, ANNOTE = {COLIURL : Crysmann:1997:CEP.pdf Crysmann:1997:CEP.ps} } @InProceedings{De Kuthy:1997, AUTHOR = {De Kuthy, Kordula}, TITLE = {On the Extractibility from Subjects in German - An Example for Lexicalized Constraints on UDCs}, YEAR = {1997}, BOOKTITLE = {Proceedings of the 2nd ESSLLI Student Session, August 11-22}, EDITOR = {Drewery, Alice and Kruijff, Geert-Jan M. and Zuber, Richard}, ADDRESS = {Aix-en-Provence, France}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/De_Kuthy97.ps.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Kuthy:1997:ESG.pdf Kuthy:1997:ESG.ps} } @InProceedings{Declerck:1997, AUTHOR = {Declerck, Thierry}, TITLE = {Investigation on the Reusability of LFG-Based Grammar Resource}, YEAR = {1997}, BOOKTITLE = {Proceedings of the 2nd Annual Lexical-Functional Grammar Conference}, ADDRESS = {San Diego, USA}, URL = {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}, ANNOTE = {COLIURL : Declerck:1997:IRL.pdf Declerck:1997:IRL.ps} } @InProceedings{Declerck:1997_1, AUTHOR = {Declerck, Thierry}, TITLE = {An Interface between Text Structures and Linguistic Descriptions}, YEAR = {1997}, BOOKTITLE = {Proceedings of the Datalingvistisk Forening (DALF'97), June 9-10}, PAGES = {8-22}, EDITOR = {Christoffersen, Ellen and Music, Bradley}, ADDRESS = {Kolding, Denmark}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/declerck97_dalf.ps.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Declerck:1997:IBT.pdf Declerck:1997:IBT.ps} } @InProceedings{Declerck_Klein:1997, AUTHOR = {Declerck, Thierry and Klein, Judith}, TITLE = {Ein Email-Korpus zur Entwicklung und Evaluierung der Analysekomponente eines Terminvereinbarungssystems}, YEAR = {1997}, BOOKTITLE = {6. Fachtagung der Sektion Computerlinguistik der Deutschen Gesellschaft für Sprachwissenschaft (DGfS/CL 97): Integrative Ansätze in der Computerlinguistik, 08.-10. Oktober}, ADDRESS = {Heidelberg, Germany}, URL = {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}, ANNOTE = {COLIURL : Declerck:1997:EKE.pdf Declerck:1997:EKE.ps} } @InProceedings{Declerck_Klein:1997_1, AUTHOR = {Declerck, Thierry and Klein, Judith}, TITLE = {Semantic Tagging and NLP Applications}, YEAR = {1997}, BOOKTITLE = {Proceedings of the SIGLEX Workshop: Tagging Text with Lexical Semantics, April 4-5}, ADDRESS = {Washington D. C., USA} } @InProceedings{Declerck_Maas:1997, AUTHOR = {Declerck, Thierry and Maas, Heinz Dieter}, TITLE = {The Integration of a Part-of-Speech Tagger into the ALEP Platform}, YEAR = {1997}, BOOKTITLE = {Proceedings of the 3rd ALEP User Group Workshop, March 6-7}, ADDRESS = {Saarbrücken, Germany}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dieter_aug_1997.ps.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Declerck:1997:IPS.pdf Declerck:1997:IPS.ps} } @InProceedings{Declerck_et_al:1997, AUTHOR = {Declerck, Thierry and Ramírez Bustamante, Flora and Sánchez León, Fernando}, TITLE = {Grammar Checking and Preprocessing in ALEP}, YEAR = {1997}, BOOKTITLE = {3rd ALEP User Group Workshop, March 6-7}, ADDRESS = {Saarbrücken, Germany} } @InProceedings{Declerck_et_al:1997_1, AUTHOR = {Declerck, Thierry and Theofilidis, Axel and Schmidt, Paul}, TITLE = {Grammar Modularization for Efficient Processing: Language Engineering Devices and their Instantiation}, YEAR = {1997}, BOOKTITLE = {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}, ADDRESS = {Heidelberg, Germany}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dgfs_alep_1997.ps.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Declerck:1997:GME.pdf Declerck:1997:GME.ps} } @InProceedings{Egg_Kohlhase:1997, AUTHOR = {Egg, Markus and Kohlhase, Michael}, TITLE = {Underspecification of Quantifier Scope}, YEAR = {1997}, BOOKTITLE = {6. Fachtagung der Sektion Computerlinguistik der Deutschen Gesellschaft für Sprachwissenschaft, 08.-10. Oktober}, ADDRESS = {Heidelberg, Germany} } @InProceedings{Egg_Kohlhase:1997_1, AUTHOR = {Egg, Markus and Kohlhase, Michael}, TITLE = {Dynamic Control of Quantifier Scope}, YEAR = {1997}, BOOKTITLE = {11th Amsterdam Colloquium}, EDITOR = {Dekker, Paul}, ADDRESS = {Amsterdam, The Netherlands}, PUBLISHER = {ILLC} } @PhdThesis{Erbach:1997, AUTHOR = {Erbach, Gregor}, TITLE = {Bottom-Up Earley Deduction for Preference-Driven Natural Language Processing}, YEAR = {1997}, ADDRESS = {Saarbrücken}, SCHOOL = {Universität des Saarlandes, Department of Computational Linguistics}, URL = {https://www.coli.uni-saarland.de/~erbach/pub/diss/erbach-diss.pdf}, ABSTRACT = {The thesis discusses the processing of principle-based grammars such as HPSG, with an application to best-first processing for disambiguation, selection of paraphrases and possibly also handling ill-formed input. Grammars are treated as a definite clause programs, to which program transformation and deduction techniques can be applied. In particular, the view of constraint logic programming is adopted, which abstracts away from the handling of constraints (which is regarded as a service provided by the constraint solver) and concentrates on resolution strategies. The contributions of the thesis are the following: A constraint language supporting sorted feature terms, Prolog terms, multi-dimensional inheritance, finite domains, by compilation to Prolog terms. The constraint language has been extended with external constraint solvers for set constraints, LP constraints, guarded constraints. A partial deduction system for compiling a principle-based grammar into a set of grammar rules. Partial deduction can be applied selectively through control information in the program, which makes it possible to do experimental work in order to determine the selection of goals to which partial deduction is best applied in order to bring the greatest performance improvement. Bottom-Up Earley deduction as a deduction system which generalises bottom-up chart parsing to a wider class of grammars/programs than just those with a context-free backbone. Bottom-up Earley deduction is better suited for handling discontinuous constituency than its top-down counterpart, it allows best-first search based on bottom-up information (e.g. tag probabilities), and provides different indexing schemes for different modes of combination of items. The correctness, completeness and termination properties of the algorithm have been shown. A generalised linguistic deduction system, which allows combination of different deduction strategies via control annotations, and which is tightly integrated with the underlying programming language in order to achieve efficiency. A fully incremental algorithm for bottom-up Earley deduction has been specified, which can cope efficiently with a change in the query by re-using intermediate deduction results as much as possible. Augmentation of a definite clause language with preference values. We have discussed how preference values from a variety of sources can be combined.}, ANNOTE = {COLIURL : Erbach:1997:BED.pdf} } @InProceedings{Erbach_et_al:1997, AUTHOR = {Erbach, Gregor and Neumann, Günter and Uszkoreit, Hans}, TITLE = {MULINEX - Multilingual Indexing, Navigation and Editing Extensions for the World Wide Web}, YEAR = {1997}, BOOKTITLE = {Proceedings of the 3rd DELOS Workshop - Cross-Language Information Retrieval, March 5-7}, PAGES = {17-24}, ADDRESS = {Zurich, Switzerland}, PUBLISHER = {European Research Consortium for Informatics and Mathematics}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mulinex-aaai97.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mulinex-aaai97.entry}, ANNOTE = {COLIURL : Erbach:1997:MMIa.pdf Erbach:1997:MMIa.ps} } @InProceedings{Erbach_et_al:1997_1, AUTHOR = {Erbach, Gregor and Neumann, Günter and Uszkoreit, Hans}, TITLE = {MULINEX - Multilingual Indexing, Navigation and Editing Extensions for the World Wide Web}, YEAR = {1997}, BOOKTITLE = {2nd Tbilisi Symposium in Language, Logic and Computation}, EDITOR = {Ginzburg, J. and Khasidashvili, Y. and Vogel, K. and Lévy, J.-J. and Vallduví, E.}, PUBLISHER = {CSLI Publications}, ANNOTE = {COLIURL : Erbach:1997:MMIb.pdf} } @InProceedings{Erbach_et_al:1997_2, AUTHOR = {Erbach, Gregor and Neumann, Günter and Uszkoreit, Hans}, TITLE = {MULINEX - Multilingual Indexing, Navigation and Editing Extensions for the World Wide Web}, YEAR = {1997}, BOOKTITLE = {Cross-Language Text and Speech Retrieval - Papers from the 1997 AAAI Spring Symposium}, PAGES = {22-28}, EDITOR = {Hull, David and Oard, Doug}, ADDRESS = {Menlo Park}, PUBLISHER = {AAAI Press}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mulinex-aaai97.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mulinex-aaai97.entry}, ANNOTE = {COLIURL : Erbach:1997:MMIc.pdf Erbach:1997:MMIc.ps} } @InProceedings{Erbach_et_al:1997_3, AUTHOR = {Erbach, Gregor and Neumann, Günter and Uszkoreit, Hans}, TITLE = {MULINEX: Design and Evaluation of a Psychological Experiment on the Effectiveness of Document Summarisation for the Retrieval of Multilingual WWW Documents}, YEAR = {1997}, BOOKTITLE = {Proceedings of the AAAI Spring Symposium Intelligent Text Summarisation''}, SERIES = {Cross-Language Text and Speech Retrieval}, ADDRESS = {Stanford}, PUBLISHER = {AAAI Press}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mulinex-aaai98.ps.gz}, ABSTRACT = {Since for the foreseeable future, retrieval will be an interactive task of the user looking through lists of potentially relevant documents, adequate support through various types of information is very important. A psychological experiment was conducted to examine the extent to which different types of automatically generated summaries aid retrieval and systematically evaluate user needs and behaviour in the area of cross-language retrieval for the WWW.}, ANNOTE = {COLIURL : Erbach:1997:MDE.pdf Erbach:1997:MDE.ps} } @InCollection{Gardent:1997, AUTHOR = {Gardent, Claire}, TITLE = {Sloopy Identity}, YEAR = {1997}, BOOKTITLE = {Logical Aspects of Computational Linguistics}, VOLUME = {1328}, PAGES = {188-207}, EDITOR = {Retoré, C.}, SERIES = {LNAI}, ADDRESS = {Berlin}, PUBLISHER = {Springer}, ABSTRACT = {Although sloppy interpretation is usually accounted for by theories of ellipsis, it often arises in non-elliptical contexts. In this paper, a theory of sloppy interpretation is provided which captures this fact. The underlying idea is that sloppy interpretation results from a semantic constraint on parallel structures and the theory is shown to predict sloppy readings for deaccented and paycheck sentences as well as relational-, event-, and one-anaphora. It is further shown to capture the interaction of sloppy/strict ambiguity with quantification and binding.} } @TechReport{Gardent:1997_1, AUTHOR = {Gardent, Claire}, TITLE = {Parallelism, HOU and Deaccenting}, YEAR = {1997}, MONTH = {January}, NUMBER = {85}, PAGES = {29}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus85.ps}, ABSTRACT = {We generalise (Dalrymple, Shieber and Pereira 1991)'s treatment of ellipsis to deaccenting and show that the resulting account has three main advantages. First, it predicts the interpretive similarities between ellipsis and deaccenting. Second, it captures the interaction of deaccenting and anaphora. Third, it yields a uniform treatment of sloppy identity and of its interaction with both ellipsis and deaccenting.}, ANNOTE = {COLIURL : Gardent:1997:PHD.pdf Gardent:1997:PHD.ps} } @TechReport{Gardent:1997_2, AUTHOR = {Gardent, Claire}, TITLE = {Sloppy Identity}, YEAR = {1997}, MONTH = {March}, NUMBER = {88}, PAGES = {20}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus88.ps}, ABSTRACT = {Although sloppy interpretation is usually accounted for by theories of ellipsis, it often arises in non-elliptical contexts. In this paper, a theory of sloppy interpretation is provided which captures this fact. The underlying idea is that sloppy interpretation results from a semantic constraint on parallel structures and the theory is shown to predict sloppy readings for deaccented and paycheck sentences as well as relational-, event-, and one-anaphora. It is further shown to capture the interaction of sloppy/strict ambiguity with quantification and binding. Finally, it is compared with other approaches to sloppy identity, in particular (Dalrymple, Shieber and Pereira 1991, Hardt 1996) and (Fiengo and May 1994).}, ANNOTE = {COLIURL : Gardent:1997:SIB.pdf Gardent:1997:SIB.ps} } @TechReport{Gardent:1997_3, AUTHOR = {Gardent, Claire}, TITLE = {Discourse Tree Adjoining Grammar}, YEAR = {1997}, MONTH = {April}, NUMBER = {89}, PAGES = {23}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus89.ps}, ABSTRACT = {It is generally agreed that discourse has a recursive structure and that this structure affects the semantic interpretation of discourse. Despite this consensus however, relatively few proposals give a precise specification of how the syntax of discourse relates to its semantics. In this paper, we use a variant of Feature-Based Tree Adjoining Grammars to construct discourse structure. We then show that it provides a natural account of the relation between discourse syntax and discourse semantics, and in particular that it captures some interesting cases of semantic ambiguity in discourse.}, ANNOTE = {COLIURL : Gardent:1997:DTA.pdf Gardent:1997:DTA.ps} } @InProceedings{Gardent_Kohlhase:1997, AUTHOR = {Gardent, Claire and Kohlhase, Michael}, TITLE = {Computing Parallelism in Discourse}, YEAR = {1997}, BOOKTITLE = {15th International Joint Conference on Artificial Intelligence (IJCAI '97), August 23-29}, VOLUME = {2}, PAGES = {1016-1021}, ADDRESS = {Nagoya, Japan}, PUBLISHER = {Morgan Kaufmann Publishers}, ABSTRACT = {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.} } @InProceedings{Grice_et_al:1997, AUTHOR = {Grice, Martine and Savino, Michelina and Refice, Mario}, TITLE = {Can Pitch Accent Type Convey Information-Status in yes-no Questions}, YEAR = {1997}, BOOKTITLE = {35th Annual Meeting of the Association for Computational Linguistics (ACL '97). Workshop on Concept to Speech Generation Systems, July 7-12}, PAGES = {29-38}, ADDRESS = {Madrid, Spain} } @Article{Grice_et_al:1997_1, AUTHOR = {Grice, Martine and Savino, Michelina and Refice, Mario}, TITLE = {The Intonation of Questions in Bari Italian: Do Speakers Replicate their Spontaneous Speech when Reading?}, YEAR = {1997}, JOURNAL = {PHONUS}, VOLUME = {3}, PAGES = {1-7}, URL = {https://www.coli.uni-saarland.de/Phonetics/Research/PHONUS_research_reports/Phonus3/Grice_PHONUS3.ps.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Grice:1997:IQB.pdf} } @InCollection{Hajicová_Kruijff-Korbayová:1997, AUTHOR = {Hajicová, Eva and Korbayova, Ivana}, TITLE = {On the Notion of Topic}, YEAR = {1997}, BOOKTITLE = {Prague Linguistic Circle Papers}, VOLUME = {3}, PAGES = {225-236}, EDITOR = {Hajicová, Eva and Hoskovec, Tomás and Leška, Oldrich and Sgall, Petr and Skoumalová, Zdena}, ADDRESS = {Amsterdam}, PUBLISHER = {John Benjamins Publishers} } @InProceedings{Haridi_et_al:1997, AUTHOR = {Haridi, Seif and Van Roy, Peter and Smolka, Gert}, TITLE = {An Overview of the Design of Distributed Oz}, YEAR = {1997}, BOOKTITLE = {2nd International Symposium on Parallel Symbolic Computation (PASCO '97), July 20-22}, PAGES = {176-187}, ADDRESS = {Maui, Hawaii, USA}, PUBLISHER = {ACM Press}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/PASCO97.ps.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Haridi:1997:ODD.pdf Haridi:1997:ODD.ps} } @PhdThesis{Henz:1997, AUTHOR = {Henz, Martin}, TITLE = {Objects in Oz}, YEAR = {1997}, ADDRESS = {Saarbrücken}, SCHOOL = {Universität des Saarlandes, Fachbereich Informatik}, ABSTRACT = {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.} } @Book{Henz:1997_1, AUTHOR = {Henz, Martin}, TITLE = {Objects for Concurrent Constraint Programming}, YEAR = {1997}, VOLUME = {426}, SERIES = {The Kluwer International Series in Engineering and Computer Science}, ADDRESS = {Boston}, PUBLISHER = {Kluwer Acdemic Publishers}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Diss-Henz.ps.gz}, ANNOTE = {COLIURL : Henz:1997:OCC.pdf Henz:1997:OCC.ps} } @InProceedings{Hutter_Kohlhase:1997, AUTHOR = {Hutter, Dieter and Kohlhase, Michael}, TITLE = {A Coloured Version of the Lambda-Calculus}, YEAR = {1997}, BOOKTITLE = {14th International Conference on Automated Deduction (CADE-14), July 13-17}, NUMBER = {1249}, PAGES = {291-305}, EDITOR = {McCune, W.}, SERIES = {Lecture Notes in Artificial Intelligence}, ADDRESS = {James Cook University, Townsville, Australia}, PUBLISHER = {Springer} } @TechReport{Jaspars:1997, AUTHOR = {Jaspars, Jan}, TITLE = {Minimal Logics for Reasoning with Ambiguous Expressions}, YEAR = {1997}, MONTH = {December}, NUMBER = {94}, PAGES = {27}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus94.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus94.dvi}, ABSTRACT = {Alshawi and Crouch defined a simple multi-valued truth-conditional semantics for quasi logical form, a representation language for underspecified expressions. We incorporate this so-called monotonic semantics within the setting of plain propositional logic, and investigate the underlying calculi. It turns out that evaluation of ambiguous expressions with respect to a partial disambiguation, that is, possible readings maybe excluded on the moment of interpretation, yields the most attractive notion of validity in this setting. Besides the fact that it satisfies characteristic criteria of 'ambiguous reasoning', the underlying logic is also a suitable candidate as a minimal calculus for this task. Natural extensions of the calculus correspond to intuitive constraints on partial disambiguations. The paper presents this calculus and different extensions in a special Gentzen format, well-equipped for reasoning with 'multiple readings'. Two technical appendices contain the completeness proofs for the various calculi.}, ANNOTE = {COLIURL : Jaspars:1997:MLR.pdf Jaspars:1997:MLR.ps} } @TechReport{Kerber_Kohlhase:1997, AUTHOR = {Kerber, Manfred and Kohlhase, Michael}, TITLE = {Reasoning without Believing: On the Mechanization of Presuppositions and Partiality}, YEAR = {1997}, MONTH = {September}, NUMBER = {CSRP-97-23}, ADDRESS = {Birmingham}, TYPE = {Technical Report}, INSTITUTION = {University of Birmingham, School of Computer Science}, URL = {ftp://ftp.cs.bham.ac.uk/pub/tech-reports/1997/CSRP-97-23.ps.gz}, ABSTRACT = {It is well-known that many relevant aspects of everyday reasoning based on natural language cannot be adequately expressed in classical first-order logic. In this paper we address two of the problems, firstly that of so-called presuppositions, expressions from which it is possible to draw implicit conclusion, which classical logic normally does not warrant, and secondly the related problem of partiality and the adequate treatment of undefined expressions. In natural language, presuppositions are quite common, they can, however, only insufficiently be modeled in classical first-order logic. For instance, in the case of universal quantification one normally uses restrictions in natural language and presupposes that these restrictions are non-empty, while in classical logic it is only assumed that the whole universe is non-empty. On the other hand, all constants mentioned in classical logic are presupposed to exist, while it makes no problems to speak about hypothetical objects in everyday language. Similarly, undefined expressions can be handled in natural language discourses and utterances are not only classified into the two categories 'true' and 'false'. This has led to the development of various better-suited many-valued logics. By combining different approaches we can now give a static description of presuppositions and undefinedness within the same framework. Additionally, we have developed an efficient mechanization of the induced consequence relation (which has been missing in the literature) by combining methods from many-valued truth-functional logics and sort techniques developed for search control in automated theorem proving.}, ANNOTE = {COLIURL : Kerber:1997:RBM.pdf Kerber:1997:RBM.ps} } @TechReport{Kiefer_et_al:1997, AUTHOR = {Kiefer, Bernd and Netter, Klaus and Neumann, Günter and Uszkoreit, Hans}, TITLE = {PARADICE - Parameterizable Discourse Core Engine}, YEAR = {1997}, NUMBER = {R:S97-223}, ADDRESS = {Saarbrücken}, TYPE = {DFKI-Report}, INSTITUTION = {DFKI}, URL = {http://www.dfki.de/dfkibib/publications/docs/Kiefer_1997_PPDCE.pdf}, ANNOTE = {COLIURL : Kiefer:1997:PPD.pdf} } @InProceedings{Klein_et_al:1997, AUTHOR = {Klein, Judith and Busemann, Stephan and Declerck, Thierry}, TITLE = {Diagnostic Evaluation of Shallow Parsing Through an Annotated Reference Corpus}, YEAR = {1997}, BOOKTITLE = {Proceedings of the Workshop on Evaluation in Speech and Language Technology (SALT) on Evaluation in Speech and Language Technology, June 17-18}, PAGES = {121-128}, ADDRESS = {University of Sheffield, Sheffield, UK}, URL = {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}, ANNOTE = {COLIURL : Klein:1997:DES.pdf Klein:1997:DES.ps} } @InProceedings{Kohlhase_Kuschert:1997, AUTHOR = {Kohlhase, Michael and Kuschert, Susanna}, TITLE = {Dynamic Lambda Calculus}, YEAR = {1997}, BOOKTITLE = {5th Meeting on Mathematics of Language (MOL5), August 25-28}, PAGES = {85-92}, ADDRESS = {Schloss Dagstuhl, Germany}, URL = {http://www.dfki.de/events/mol/papers/kuschert.ps}, ANNOTE = {Kohlhase:1997:DLC} } @TechReport{Kohlhase_Kuschert:1997_1, AUTHOR = {Kohlhase, Michael and Kuschert, Susanna}, TITLE = {Dynamic Lambda Calculus}, YEAR = {1997}, MONTH = {September}, NUMBER = {91}, PAGES = {29}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS Report}, INSTITUTION = {Universität des Saarlandes}, URL = {http://ftp.coli.uni-sb.de/claus91.ps http://ftp.coli.uni-sb.de/claus91.dvi}, ABSTRACT = {The goal of this paper is to lay a logical foundation for discourse theories by providing an algebraic foundation of compositional formalisms for discourse semantics as an analogon to the simply typed Lambda-calculus. Just as that can be specialized to type theory by simply providing a special type for truth values and postulating the quantifiers and connectives as constants with fixed semantics, the proposed dynamic Lambda-calculus DLC can be specialized to Lambda-DRT by essentially the same measures, yielding a much more principled and modular treatment of Lambda-DRT than before, which is also expected to provide a conceptually simple basis for studying higher-order unification for compositional discourse theories. N.B.: After printing we realised that alpha-conversion as defined here is not yet correct; we will publish an improved version soon.}, ANNOTE = {COLIURL : Kohlhase:1997:DLCb.pdf} } @Article{Konieczny_et_al:1997, AUTHOR = {Konieczny, Lars and Hemforth, Barbara and Scheepers, Christoph and Strube, Gerhard}, TITLE = {The Role of Lexical Heads in Parsing: Evidence from German}, YEAR = {1997}, JOURNAL = {Language and Cognitive Processes}, VOLUME = {12}, PAGES = {307-348} } @Article{Koreman_et_al:1997, AUTHOR = {Koreman, Jacques and Andreeva, Bistra and Barry, William J.}, TITLE = {Relational Phonetic Features for Consonant Identification in a Hybrid ASR System}, YEAR = {1997}, JOURNAL = {PHONUS}, VOLUME = {3}, PAGES = {83-110}, URL = {https://www.coli.uni-saarland.de/Phonetics/Research/PHONUS_research_reports/Phonus3/Koreman_PHONUS3.ps.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Koreman:1997:RPF.pdf} } @Article{Koreman_Pützer:1997, AUTHOR = {Koreman, Jacques and Pützer, Manfred}, TITLE = {Finding Correlates of Vocal Fold Adduction Deficiencies}, YEAR = {1997}, JOURNAL = {PHONUS}, VOLUME = {3}, PAGES = {155-178}, URL = {https://www.coli.uni-saarland.de/Phonetics/Research/PHONUS_research_reports/Phonus3/KoremanPuetzer_PHONUS3.ps.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Koreman:1997:FCV.pdf} } @Proceedings{Steven_et_al:1997, TITLE = {Spoken Language Translation. Proceedings of a Workshop sponsored by the Association of Computational Linguistics and by the European Network in Language and Speech (ELSNET)}, YEAR = {1997}, EDITOR = {Krauwer, Steven and Arnold, Doug and Kasper, Walter and Rayner, Manny and Somers, Harold}, ADDRESS = {Madrid} } @InProceedings{Kruijff-Korbayová:1997, AUTHOR = {Korbayova, Ivana}, TITLE = {Czech Noun Phrases in File Change Semantics}, YEAR = {1997}, BOOKTITLE = {9th European Summer School in Logic, Language, and Information (ESSLLI '97), Student Session, August 11-22}, PAGES = {107-118}, EDITOR = {Drewery, Alice and Kruijff, Geert-Jan M. and Zuber, Richard}, ADDRESS = {Aix-en-Provence, France} } @Article{Kruijff-Korbayová_Hajicová:1997, AUTHOR = {Korbayova, Ivana and Hajicová, Eva}, TITLE = {Topics and Centers: A Comparison of the Salience-Based Approach and the Centering Theory}, YEAR = {1997}, JOURNAL = {Prague Bulletin of Mathematical Linguistics}, VOLUME = {67}, PAGES = {25-50}, URL = {https://www.coli.uni-saarland.de/~korbay/Publications/pbml67.ps}, NOTE = {Charles University, Prague, Czech Republic}, ANNOTE = {COLIURL : Kruijff-Korbayova:1997:TCC.pdf Kruijff-Korbayova:1997:TCC.ps} } @InProceedings{Kruijff-Korbayová_Kruijff:1997, AUTHOR = {Korbayova, Ivana and Kruijff, Geert-Jan M.}, TITLE = {Topic-Focus articulation in SDRT}, YEAR = {1997}, BOOKTITLE = {Proceedings of the 11th Amsterdam Colloquium, December 17-20}, PAGES = {43-48}, EDITOR = {Dekker, Paul and Stokhof, Martin and Venema, Yde}, ADDRESS = {ILLC/ Department of Philosophy, University of Amsterdam, Amsterdam}, PUBLISHER = {Universiteit van Amsterdam}, ANNOTE = {COLIURL : Kruijff-Korbayova:1997:TFS.pdf Kruijff-Korbayova:1997:TFS.ps} } @InCollection{Kuschert:1997, AUTHOR = {Kuschert, Susanna}, TITLE = {Akkommodation bei Anaphernresolution?}, YEAR = {1997}, BOOKTITLE = {Intelligente Informationsverarbeitung. Tagungsband der 3. Fachtagung der Gesellschaft für Kognitionswissenschaft}, EDITOR = {Krause, W. and Kotkamp, U. and Goertz, R.}, ADDRESS = {Leverkusen}, PUBLISHER = {Deutscher Universitäts-Verlag GmbH} } @TechReport{Kuschert:1997_1, AUTHOR = {Kuschert, Susanna}, TITLE = {Accomodation during Anaphora Resolution}, YEAR = {1997}, MONTH = {December}, NUMBER = {92}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS Report}, INSTITUTION = {Universität des Saarlandes} } @InProceedings{Lieske_et_al:1997, AUTHOR = {Lieske, Christian and Bos, Johan and Gambäck, Björn and Emele, Martin and Rupp, Christopher J.}, TITLE = {Giving Prosody a Meaning}, YEAR = {1997}, BOOKTITLE = {Proceedings of the 5th European Conference on Speech Communication and Technology}, VOLUME = {3}, PAGES = {1431-1434}, EDITOR = {Kokkinakis, G. and Fakotakis, N. and Dermatas, E.}, ADDRESS = {Rhodes, Greece} } @InProceedings{Marasek_Pützer:1997, AUTHOR = {Marasek, Krzysztof and Pützer, Manfred}, TITLE = {Electroglotto-Graphical Differentiation of Pathological Voice Qualities}, YEAR = {1997}, BOOKTITLE = {Proceedings of Larynx, June 16-18}, PAGES = {91-94}, ADDRESS = {Marseille, France} } @InProceedings{Morris_et_al:1997, AUTHOR = {Morris, Andrew C. and Bloothooft, Gerrit and Barry, William J. and Andreeva, Bistra and Koreman, Jacques}, TITLE = {Human and Machine Identification of Consonantal Place of Articulation from Vocalic Transition Segments}, YEAR = {1997}, BOOKTITLE = {5th European Conference on Speech Communication and Technology (EUROSPEECH '97), September 22-25}, VOLUME = {4}, PAGES = {2123-2126}, EDITOR = {Kokkinakis, G. and Fakotakis, N. and Dermatas, E.}, ADDRESS = {Rhodes, Greece} } @TechReport{Müller_Niehren:1997, AUTHOR = {Müller, Martin and Niehren, Joachim}, TITLE = {Entailment of Set Constraints is not Feasible}, YEAR = {1997}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report}, INSTITUTION = {Universität des Saarlandes, Programming Systems Lab}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/inesInfeas.ps.gz}, ABSTRACT = {Set constraints are inclusions between expressions denoting sets of trees. They have been used extensively for type inference and program analysis. At the lower end of the expressiveness scale there are atomic set constraints and Ines constraints (inclusions over non-empty sets) for both of which a cubic time satisfiability test is known. Recently, there has been increasing interest in entailment tests for set constraints. We prove that the entailment problem of atomic set constraints is coNP-hard. We also show that the entailment problem of Ines constraints is coNP-hard. This corrects a claim of polynomial complexity presented at CP'96. Our results suggest that a complete entailment test is not feasible even for simple classes of set constraints.}, ANNOTE = {COLIURL : Muller:1997:ESC.pdf Muller:1997:ESC.ps} } @InProceedings{Müller_et_al:1997, AUTHOR = {Müller, Martin and Niehren, Joachim and Podelski, Andreas}, TITLE = {Ordering Constraints over Feature Trees}, YEAR = {1997}, BOOKTITLE = {3rd International Conference on Principles and Practice of Constraint Programming (CP '97), October 29 - November 1}, NUMBER = {1330}, PAGES = {297-311}, EDITOR = {Smolka, Gert}, SERIES = {Lecture Notes in Computer Science}, ADDRESS = {Schloss Hagenberg, Austria}, PUBLISHER = {Springer}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/FTSub97.ps.gz}, ABSTRACT = {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)$.}, ANNOTE = {COLIURL : Muller:1997:OCF.pdf Muller:1997:OCF.ps} } @TechReport{Müller_et_al:1997_1, AUTHOR = {Müller, Martin and Niehren, Joachim and Smolka, Gert}, TITLE = {Typed Concurrent Programming with Logic Variables}, YEAR = {1997}, MONTH = {September}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report}, INSTITUTION = {Universität des Saarlandes, Programming Systems Lab}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/plain-report-97.ps.gz}, ABSTRACT = {We present a concurrent higher-order programming language called Plain and a concomitant static type system. Plain is based on logic variables and computes with possibly partial data structures. The data structures of Plain are procedures, cells, and records. Plain's type system features record-based subtyping, bounded existential polymorphism, and access modalities distinguishing between reading and writing.}, ANNOTE = {COLIURL : Muller:1997:TCP.pdf Muller:1997:TCP.ps} } @TechReport{Müller:1997, AUTHOR = {Müller, Stefan}, TITLE = {Scrambling in German - Extraction into the Mittelfeld}, YEAR = {1997}, NUMBER = {RR-97-06}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dfki-report-97-06.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dfki-report-97-06.entry}, ANNOTE = {COLIURL : Muller:1997:SGE.pdf Muller:1997:SGE.ps} } @TechReport{Müller:1997_1, AUTHOR = {Müller, Stefan}, TITLE = {Yet Another Paper about Partial Verb Phrase Fronting in German}, YEAR = {1997}, NUMBER = {RR-97-07}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dfki-report-97-07.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dfki-report-97-07.entry}, ANNOTE = {COLIURL : Muller:1997:YAP.pdf Muller:1997:YAP.ps} } @PhdThesis{Müller:1997_2, AUTHOR = {Müller, Stefan}, TITLE = {Spezifikation und Verarbeitung deutscher Syntax in Head-Driven Phrase Structure Grammar}, YEAR = {1997}, ADDRESS = {Saarbrücken}, SCHOOL = {Universität des Saarlandes} } @TechReport{Müller:1997_3, AUTHOR = {Müller, Stefan}, TITLE = {Complement Extraction Lexical Rules and Argument Attraction}, YEAR = {1997}, NUMBER = {RR-97-08}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dfki-report-97-08.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/dfki-report-97-08.entry}, ANNOTE = {COLIURL : Muller:1997:CEL.pdf Muller:1997:CEL.ps} } @InProceedings{Müller:1997_4, AUTHOR = {Müller, Stefan}, TITLE = {Subsumption or Unification - An HPSG-Analysis for Free Relative Clauses in German}, YEAR = {1997}, BOOKTITLE = {6. Fachtagung der Sektion Computerlinguistik der Deutschen Gesellschaft für Sprachwissenschaft (DGfS/CL 97): Sektion Computerlinguistik, 08.-10. Oktober}, ADDRESS = {Heidelberg, Germany} } @InProceedings{Müller:1997_5, AUTHOR = {Müller, Stefan}, TITLE = {An HPSG-Analysis for Free Relative Clauses in German}, YEAR = {1997}, BOOKTITLE = {Proceedings of the Formal Grammar 1997. Linguistic Aspects of Logical and Computational Perspectives on Language, August 9-10}, PAGES = {179-188}, ADDRESS = {Aix-En-Provence, France}, PUBLISHER = {Kruijff,Geert-Jan Morrill, Glyn V. Oehrle, Richard T.}, URL = {http://www.dfki.de/~stefan/PS/fg.ps}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Muller:1997:HAF.pdf Muller:1997:HAF.ps} } @InProceedings{Müller_Müller:1997, AUTHOR = {Müller, Tobias and Müller, Martin}, TITLE = {Finite Set Constraints in Oz}, YEAR = {1997}, BOOKTITLE = {12. Workshop Logische Programmierung (WLP '97), 17.-19. September}, PAGES = {104-115}, EDITOR = {Bry, François and Freitag, B. and Seipel, D.}, ADDRESS = {Ludwig-Maximilians-Universität München, Germany}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/TMMM97a.ps.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Muller:1997:FSC.pdf Muller:1997:FSC.ps} } @InProceedings{Müller_Würtz:1997, AUTHOR = {Müller, Tobias and Würtz, Jörg}, TITLE = {Extending a Concurrent Constraint Language by Propagators}, YEAR = {1997}, BOOKTITLE = {International Logic Programming Symposium (ILPS '97), October 12-17}, PAGES = {149-163}, EDITOR = {Maluszynski, J.}, ADDRESS = {Port Jefferson, Long Island N.Y., USA}, PUBLISHER = {MIT Press}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/mueller97.ps.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Muller:1997:ECC.pdf Muller:1997:ECC.ps} } @TechReport{Muskens:1997, AUTHOR = {Muskens, Reinhard}, TITLE = {Program Semantics and Classical Logic}, YEAR = {1997}, MONTH = {January}, NUMBER = {86}, PAGES = {29}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus86.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus86.dvi}, ABSTRACT = {In the tradition of Denotational Semantics one usually lets program constructs take their denotations in reflexive domains, i.e. in domains where self-application is possible. For the bulk of programming constructs, however, working with reflexive domains is an unnecessary complication. In this paper we shall use the domains of ordinary classical type logic to provide the semantics of a simple programming language containing choice and recursion. We prove that the rule of Scott Induction holds in this new setting, prove soundness of a Hoare calculus relative to our semantics, give a direct calculus C on programs, and prove that the denotation of any program P in our semantics is equal to the union of the denotations of all those programs L such that P follows from L in our calculus and L does not contain recursion or choice.}, ANNOTE = {COLIURL : Muskens:1997:PSC.pdf Muskens:1997:PSC.ps} } @InProceedings{Nederhof:1997, AUTHOR = {Nederhof, Mark-Jan}, TITLE = {Regular Approximations of CFLs: A Grammatical View}, YEAR = {1997}, BOOKTITLE = {International Workshop on Parsing Technologies (IWPT '97), September 17-20}, ADDRESS = {Boston, USA} } @InProceedings{Nederhof_Satta:1997, AUTHOR = {Nederhof, Mark-Jan and Satta, Giorgio}, TITLE = {A Variant of Earley Parsing}, YEAR = {1997}, BOOKTITLE = {Advances in Artificial Intelligence. 5th Conference of the Italian Association for Artificial Intelligence (AI*IA 97), September 17-19}, NUMBER = {1321}, PAGES = {84-95}, EDITOR = {Lenzerini, Maurizio}, SERIES = {Lecture Notes in Artificial Intelligence}, ADDRESS = {Rome, Italy}, PUBLISHER = {Springer Verlag}, URL = {http://lanl.arxiv.org/PS_cache/cmp-lg/pdf/9808/9808017.pdf}, ANNOTE = {COLIURL : Nederhof:1997:VEP.pdf} } @Proceedings{Klaus_et_al:1997, TITLE = {Computational Environments for Grammar Development and Linguistic Engineering (ACL'97 - EACL'97 Workshop), July 7-12}, YEAR = {1997}, EDITOR = {Netter, Klaus and Estival, Dominique and Lavelli, Alberto and Pianesi, Fabio}, ADDRESS = {Madrid, Spain} } @InProceedings{Neumann:1997, AUTHOR = {Neumann, Günter}, TITLE = {Applying Explanation-Based Learning to Control and Speeding-Up Natural Language Generation}, YEAR = {1997}, BOOKTITLE = {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}, ADDRESS = {Madrid, Spain}, PUBLISHER = {Morgan Kaufmann Publishers}, URL = {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}, ANNOTE = {COLIURL : Neumann:1997:AEB.pdf Neumann:1997:AEB.ps} } @InProceedings{Neumann:1997_1, AUTHOR = {Neumann, Günter}, TITLE = {Methoden zur intelligenten Informationsextraktion im Internet}, YEAR = {1997}, BOOKTITLE = {Proceedings of the 20th European Congress Fair for Technical Communication ONLINE'97}, PAGES = {208-215}, ADDRESS = {Hamburg, Germany}, URL = {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}, ANNOTE = {COLIURL : Neumann:1997:MII.gz} } @TechReport{Neumann:1997_2, AUTHOR = {Neumann, Günter}, TITLE = {An On-line Learning Method to Speed-Up Natural Language Processing}, YEAR = {1997}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report}, INSTITUTION = {DFKI}, URL = {http://www.dfki.de/~neumann/publications/new-ps/incr-ebl.ps.gz}, ANNOTE = {COLIURL : Neumann:1997:LLM.pdf Neumann:1997:LLM.ps} } @InProceedings{Neumann_et_al:1997, AUTHOR = {Neumann, Günter and Backofen, Rolf and Baur, Judith and Becker, Markus and Braun, Christian}, TITLE = {An Information Extraction Core System for Real World German Text Processing}, YEAR = {1997}, BOOKTITLE = {Proceedings of the 5th Conference on Applied Natural Language Processing (ANLP '97), March 31 - April 3}, PAGES = {208-215}, EDITOR = {Jacobs, Paul}, ADDRESS = {Washington D.C., USA}, PUBLISHER = {Morgan Kaufmann Publishers}, URL = {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}, ANNOTE = {COLIURL : Neumann:1997:IEC.pdf Neumann:1997:IEC.ps} } @InProceedings{Niehren_et_al:1997, AUTHOR = {Niehren, Joachim and Müller, Martin and Podelski, Andreas}, TITLE = {Inclusion Constraints over Non-Empty Sets of Trees}, YEAR = {1997}, BOOKTITLE = {7th International Joint Conference CAAP/ FASE. Theory and Practice of Software Development (TAPSOFT '97), April 14-18}, NUMBER = {1214}, PAGES = {217-231}, EDITOR = {Bidoit, M. and Dauchet, M.}, SERIES = {Lecture Notes in Computer Science}, ADDRESS = {Lille, France}, PUBLISHER = {Springer}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/ines97.ps.gz}, ABSTRACT = {We present a new constraint system called Ines. Its constraints are conjunctions of inclusions $t_1subseteq 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.}, ANNOTE = {COLIURL : Niehren:1997:ICN.pdf Niehren:1997:ICN.ps} } @InProceedings{Niehren_et_al:1997_1, AUTHOR = {Niehren, Joachim and Pinkal, Manfred and Ruhrberg, Peter}, TITLE = {On Equality up-to Constraints over Finite Trees, Context Unification and One-Step Rewriting}, YEAR = {1997}, BOOKTITLE = {14th International Conference on Automated Deduction (CADE 14), July 13-17}, NUMBER = {1249}, PAGES = {34-48}, EDITOR = {McCune, W.}, SERIES = {Lecture Notes in Computer Science}, ADDRESS = {Townsville, Australia}, PUBLISHER = {Springer}, URL = {Full version available from http://www.ps.uni-sb.de/Papers/abstracts/fullContext.html}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Niehren:1997:ECF.pdf Niehren:1997:ECF.ps} } @InProceedings{Niehren_et_al:1997_2, AUTHOR = {Niehren, Joachim and Pinkal, Manfred and Ruhrberg, Peter}, TITLE = {A Uniform Approach to Underspecification and Parallelism}, YEAR = {1997}, BOOKTITLE = {35th Annual Meeting of the Association of Computational Linguistics (ACL), July 7-12}, PAGES = {410-417}, EDITOR = {Cohen, P. R. and Wahlster, Wolfgang}, ADDRESS = {Madrid, Spain}, PUBLISHER = {ACL}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Ellipses.ps.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Niehren:1997:UAU.pdf Niehren:1997:UAU.ps} } @InProceedings{Oliva:1997, AUTHOR = {Oliva, Karel}, TITLE = {Techniques for Accelerating a Grammar-Checker}, YEAR = {1997}, BOOKTITLE = {5th Conference on Applied Natural Language Processing (ANLP '97), March 31 - April 3}, PAGES = {155-158}, EDITOR = {Jacobs, Paul}, ADDRESS = {Washington D.C., USA}, PUBLISHER = {Morgan Kaufmann Publishers} } @InCollection{Pinkal:1997, AUTHOR = {Pinkal, Manfred}, TITLE = {Leben in virtuellen Welten. Neue Medien und Künstliche Intelligenz}, YEAR = {1997}, BOOKTITLE = {Die verlorene Leiblichkeit. Nachdenklichkeiten über ein Gegenwartsproblem im Umkreis der Theologie Paul Tillichs}, PAGES = {27-38}, EDITOR = {Akademie, Evangelische}, ADDRESS = {Bad Boll} } @InProceedings{Pinkal:1997_1, AUTHOR = {Pinkal, Manfred}, TITLE = {Constraints for Semantic Underspecification}, YEAR = {1997}, BOOKTITLE = {Context-Dependence in the Analysis of Linguistic Meaning. Proceedings of the Workshops in Prague and Bad Teinach. Volume 2: Comments and Replies, February}, PAGES = {155-166}, EDITOR = {Kamp, Hans and Partee, B.}, ADDRESS = {Bad Teichnach, Germany and Prague, Czech Republic} } @TechReport{Podelski_et_al:1997, AUTHOR = {Podelski, Andreas and Charatonik, Witold and Müller, Martin}, TITLE = {Set-Based Error Diagnosis of Concurrent Constraint Programs}, YEAR = {1997}, MONTH = {December}, ADDRESS = {Saarbrücken}, TYPE = {Technical Report}, INSTITUTION = {Universität des Saarlandes}, URL = {http://www.ps.uni-sb.de/Paper/abstracts/Diagnosis-97.html ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Diagnosis-97.ps.gz}, ABSTRACT = {We present an automated method for the static prediction of the run-time error 'deadlock or failure' in concurrent constraint programs. The method is based on a new set-based analysis of reactive logic programs which computes an approximation of the greatest-model semantics. Semantically, the method is based on the connection between the inevitability of 'deadlock or failure' in concurrent constraint programs, finite failure in logic programming and the greatest-model semantics over infinite trees.}, ANNOTE = {COLIURL : Podelski:1997:SBE.pdf Podelski:1997:SBE.ps} } @Article{Podelski_Smolka:1997, AUTHOR = {Podelski, Andreas and Smolka, Gert}, TITLE = {Situated Simplification}, YEAR = {1997}, JOURNAL = {Theoretical Computer Science}, VOLUME = {173}, PAGES = {209-233} } @InProceedings{Popov:1997, AUTHOR = {Popov, Konstantin}, TITLE = {A Parallel Abstract Machine for the Thread-Based Concurrent Constraint Language Oz}, YEAR = {1997}, BOOKTITLE = {Workshop On Parallism and Implementation Technology for (Constraint) Logic Programming Languages}, EDITOR = {de Castro Dutra, I. and Santos Costa, V. and Silva, F. and Pontelli, E. and Gupta, G.}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/Others/pamoz.ps.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Popov:1997:PAM.pdf Popov:1997:PAM.ps} } @Article{Pützer:1997, AUTHOR = {Pützer, Manfred}, TITLE = {Zu Transkriptionskonventionen bei Plosiven im Übergangsgebiet zwischen moselfränkischen und rheinfränkischen Dialekten im germanophonen Lothringen (Frankreich)}, YEAR = {1997}, JOURNAL = {PHONUS}, VOLUME = {3}, PAGES = {25-60}, URL = {https://www.coli.uni-saarland.de/Phonetics/Research/PHONUS_research_reports/Phonus3/Puetzer_PHONUS3.ps.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Putzer:1997:TPI.pdf} } @InProceedings{Pützer:1997_1, AUTHOR = {Pützer, Manfred}, TITLE = {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}, YEAR = {1997}, BOOKTITLE = {Proceedings of the Second Workshop on: Divergence and Convergence of Dialects Across Political Borders, March 13-15}, PAGES = {97-105}, ADDRESS = {Ghent, Belgium} } @Article{Pützer_Koreman:1997, AUTHOR = {Pützer, Manfred and Koreman, Jacques}, TITLE = {A German Database of Patterns of Pathological Vocal Fold Vibration}, YEAR = {1997}, JOURNAL = {PHONUS}, VOLUME = {3}, PAGES = {143-153}, URL = {https://www.coli.uni-saarland.de/Phonetics/Research/PHONUS_research_reports/Phonus3/PuetzerKoreman_PHONUS3.ps.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Putzer:1997:GDP.pdf} } @InProceedings{Ramírez Bustamante_et_al:1997, AUTHOR = {Ramírez Bustamante, Flora and Sánchez León, Fernando and Declerck, Thierry}, TITLE = {Correccion grammatical y preprocesamiento}, YEAR = {1997}, BOOKTITLE = {Proceedings of the Lenguaje Natural, Revista numero 21, July}, ADDRESS = {Madrid, Spain}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/sepln1997_dec.ps.gz}, ABSTRACT = {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).}, ANNOTE = {COLIURL : Bustamante:1997:CGPa.pdf Bustamante:1997:CGPa.ps} } @InProceedings{Ramírez Bustamante_et_al:1997_1, AUTHOR = {Ramírez Bustamante, Flora and Sánchez León, Fernando and Declerck, Thierry}, TITLE = {Correccion grammatical y preprocesamiento}, YEAR = {1997}, BOOKTITLE = {Lenguaje Natural, Revista numero 21, July}, ADDRESS = {Madrid, Spain}, URL = {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}, ANNOTE = {COLIURL : Bustamante:1997:CGP.pdf Bustamante:1997:CGP.ps} } @InProceedings{Ramírez Bustamante_et_al:1997_2, AUTHOR = {Ramírez Bustamante, Flora and Sánchez León, Fernando and Declerck, Thierry}, TITLE = {Grammar Checking and Preprocessing in ALEP}, YEAR = {1997}, BOOKTITLE = {Proceedings of the 3rd ALEP User Group Workshop, March 6-7}, ADDRESS = {Saarbrücken, Germany}, URL = {http://www.iai.uni-sb.de/alep/papers/checking.ps.gz}, ANNOTE = {COLIURL : Bustamante:1997:GCP.pdf Bustamante:1997:GCP.ps} } @InProceedings{Refice_et_al:1997, AUTHOR = {Refice, Mario and Savino, Michelina and Grice, Martine}, TITLE = {A Contribution to the Estimation of Naturalness in the Intonation of Italian Spontaneous Speech}, YEAR = {1997}, BOOKTITLE = {5th European Conference on Speech Communication and Technology (EUROSPEECH '97), September 22-25}, PAGES = {783-786}, ADDRESS = {Rhodes, Greece} } @Article{Rhie_et_al:1997, AUTHOR = {Rhie, Sung Ja and Barry, William J. and Koreman, Jacques}, TITLE = {Syllable Structure and Duration in the Realisation of German Rhythm by Korean Learners}, YEAR = {1997}, JOURNAL = {PHONUS}, VOLUME = {3}, PAGES = {111-141}, URL = {https://www.coli.uni-saarland.de/Phonetics/Research/PHONUS_research_reports/Phonus3/Rhie_PHONUS3.ps.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Rhie:1997:SSD.pdf} } @Article{Schmitt_Villiger:1997, AUTHOR = {Schmitt, Michael and Villiger, Claudia}, TITLE = {Sprachwissenschaft im Netz - Strukturkriterien für ein Virtuelles Linguistisches Museum}, YEAR = {1997}, JOURNAL = {Sprache und Datenverarbeitung}, VOLUME = {21}, NUMBER = {1}, PAGES = {41-52} } @InProceedings{Schulte:1997, AUTHOR = {Schulte, Christian}, TITLE = {Programming Constraint Inference Engines}, YEAR = {1997}, BOOKTITLE = {3rd International Conference on Principles and Practice of Constraint Programming (CP '97), October 29 - November 1}, NUMBER = {1330}, PAGES = {519-533}, EDITOR = {Smolka, Gert}, SERIES = {Lecture Notes in Computer Science}, ADDRESS = {Schloß Hagenberg, Austria}, PUBLISHER = {Springer}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Engines.ps.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Schulte:1997:PCI.pdf Schulte:1997:PCI.ps} } @InProceedings{Schulte:1997_1, AUTHOR = {Schulte, Christian}, TITLE = {Oz Explorer: A Visual Constraint Programming Tool}, YEAR = {1997}, BOOKTITLE = {14th International Conference on Logic Programming (ICLP '97), June}, PAGES = {286-300}, EDITOR = {Naish, L.}, ADDRESS = {Leuven, Belgium}, PUBLISHER = {MIT Press}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Explorer.ps.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Schulte:1997:OEV.pdf Schulte:1997:OEV.ps} } @Book{Siegel:1997, AUTHOR = {Siegel, Melanie}, TITLE = {Die maschinelle Übersetzung aufgabenorientierter japanisch-deutscher Dialoge. Lösungen für Translation Mismatches}, YEAR = {1997}, ADDRESS = {Berlin}, PUBLISHER = {Logos Verlag} } @InProceedings{Skut_et_al:1997, AUTHOR = {Skut, Wojciech and Brants, Thorsten and Krenn, Brigitte and Uszkoreit, Hans}, TITLE = {Annotating Unrestricted German Text}, YEAR = {1997}, BOOKTITLE = {6. Fachtagung der Sektion Computerlinguistik der Deutschen Gesellschaft für Sprachwissenschaft (DGfS/CL 97), 8.-10. Oktober}, ADDRESS = {Heidelberg, Germany}, URL = {https://www.coli.uni-saarland.de/~thorsten/publications/Skut-ea-DGfS97.pdf https://www.coli.uni-saarland.de/~thorsten/publications/Skut-ea-DGfS97.ps.gz}, ANNOTE = {COLIURL : Skut:1997:AUG.pdf Skut:1997:AUG.ps} } @InProceedings{Skut_et_al:1997_1, AUTHOR = {Skut, Wojciech and Krenn, Brigitte and Brants, Thorsten and Uszkoreit, Hans}, TITLE = {An Annotation Scheme for Free Word Order Languages}, YEAR = {1997}, BOOKTITLE = {Proceedings of the 5th Conference on Applied Natural Language Processing (ANLP'97), March 31 - April 3}, EDITOR = {Jacobs, Paul}, ADDRESS = {Washington D.C., USA}, PUBLISHER = {Morgan Kaufmann Publishers}, URL = {https://www.coli.uni-saarland.de/~thorsten/publications/Skut-ea-ANLP97.pdf https://www.coli.uni-saarland.de/~thorsten/publications/Skut-ea-ANLP97.ps.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Skut:1997:ASF.pdf Skut:1997:ASF.ps} } @InProceedings{Strom_et_al:1997, AUTHOR = {Strom, Volker and Elsner, Aanja and Hess, Wolfgang and Kasper, Walter and Klein, Alexandra and Krieger, Hans-Ulrich and Spilker, Jörg and Weber, Hans and Görz, Günther}, TITLE = {On the Use of Prosody in a Speech-to-Speech Translator}, YEAR = {1997}, BOOKTITLE = {Proceedings of the 5th Biennial European Conference on Speech Communication and Technology (Eurospeech'97), September 22-25}, PAGES = {1479-1482}, ADDRESS = {Rhodes, Greece}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/eurospeech_paper.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/eurospeech97.entry}, ABSTRACT = {In this paper a speech-to-speech translator from German to English is presented. Beside the traditional processing steps it takes advantage of acoustically detected prosodic phrase boundaries and focus. The prosodic phrase boundaries reduce search space during syntactic parsing and rule out analysis trees during semantic parsing. The prosodic focus faciliates a shallow translation based on the best word chain in cases where the deep analysis fails.}, ANNOTE = {COLIURL : Strom:1997:UPS.ps} } @InProceedings{Uszkoreit:1997, AUTHOR = {Uszkoreit, Hans}, TITLE = {Sprache ohne Grenzen: Sprache auf dem World Wide Web}, YEAR = {1997}, BOOKTITLE = {Tagungsband der Konferenz Sprache ohne Grenzen}, PAGES = {7-14}, ADDRESS = {München, Germany}, URL = {http://mulinex.dfki.de/Presentations/sog/sld001.html} } @InCollection{Uszkoreit:1997_1, AUTHOR = {Uszkoreit, Hans}, TITLE = {Overview: Formal Tools and Methods}, YEAR = {1997}, BOOKTITLE = {Survey of the State of the Art in Human Language Technology}, PAGES = {337-342}, EDITOR = {Cole, Ronald A.}, ADDRESS = {Cambridge}, PUBLISHER = {Cambridge University Press}, URL = {http://www.dfki.de/~hansu/HLT-Survey.pdf}, ANNOTE = {COLIURL : Uszkoreit:1997:OFT.pdf} } @InCollection{Uszkoreit_Zaenen:1997, AUTHOR = {Uszkoreit, Hans and Zaenen, Annie}, TITLE = {Grammar Formalisms}, YEAR = {1997}, BOOKTITLE = {Survey of the State of the Art in Human Language Technology}, PAGES = {95-96}, EDITOR = {Cole, Ronald A.}, ADDRESS = {Cambridge}, PUBLISHER = {Cambridge University Press}, URL = {http://www.dfki.de/~hansu/HLT-Survey.pdf}, ANNOTE = {COLIURL : Uszkoreit:1997:GF.pdf} } @TechReport{van Leusen:1997, AUTHOR = {van Leusen, Noor}, TITLE = {The Role of Inference in the resolution of corrections}, YEAR = {1997}, MONTH = {December}, NUMBER = {93}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes} } @Article{Van Roy_et_al:1997, AUTHOR = {Van Roy, Peter and Haridi, Seif and Brand, Per and Smolka, Gert and Mehl, Michael and Scheidhauer, Ralf}, TITLE = {Mobile Objects in Distributed Oz}, YEAR = {1997}, JOURNAL = {ACM Transactions on Programming Languages and Systems}, VOLUME = {19}, NUMBER = {5}, PAGES = {804-851}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/TOPLAS97.ps.gz}, ABSTRACT = {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.}, ANNOTE = {COLIURL : Roy:1997:MOD.pdf Roy:1997:MOD.ps} } @TechReport{Brinckmann:1997, AUTHOR = {Brinckmann, Caren}, TITLE = {German in Eight Weeks -- A Crash Course for CHATR}, YEAR = {1997}, MONTH = {September}, NUMBER = {TR-IT-0236}, ADDRESS = {Brinckmann:1997:GEWa}, INSTITUTION = {ATR Interpreting Telecommunications Research Laboratories}, ABSTRACT = {With all its different modules, CHATR is an extremely big system. If the output doesn't sound quite right, there are always several ways of improvement. As an example of what can be achieved within eight weeks, this technical report describes how to improve the German voice of CHATR focussing on the database, the lexicon and the prosody prediction.} } @TechReport{Korbayova:1997, AUTHOR = {Korbayova, Ivana}, TITLE = {Final Report of a research project granted by the Open Society Institute: A System for Analysis of Czech Texts}, YEAR = {1997}, INSTITUTION = {Final Report of a research project granted by the Open Society Institute} }