% % GENERATED FROM https://www.coli.uni-saarland.de % by : anonymous % IP : coli2006.lst.uni-saarland.de % at : Mon, 05 Feb 2024 15:41:11 +0100 GMT % % Selection : Year = 2001 % @InProceedings{Althaus_et_al:2001, AUTHOR = {Althaus, Ernst and Duchier, Denys and Koller, Alexander and Mehlhorn, Kurt and Niehren, Joachim and Thiel, Sven}, TITLE = {An Efficient Algorithm for the Configuration Problem of Dominance Graphs}, YEAR = {2001}, BOOKTITLE = {12th ACM-SIAM Symposium on Discrete Algorithms (SODA), January 7-9}, ADDRESS = {Washington D.C., USA}, PUBLISHER = {ACM Press}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/dom-graph.ps.gz}, ABSTRACT = {Dominance constraints are logical tree descriptions originating from automata theory that have multiple applications in computational linguistics. The satisfiability problem of dominance constraints is NP-complete. In most applications, however, only emph(normal) dominance constraints are used. The satisfiability problem of normal dominance constraints can be reduced in linear time to the configuration problem of dominance graphs, as shown recently. In this paper, we give a polynomial time algorithm testing configurability of dominance graphs (and thus satisfiability of normal dominance constraints). Previous to our work no polynomial time algorithms were known.}, ANNOTE = {COLIURL : Althaus:2001:EAC.pdf Althaus:2001:EAC.ps} } @InCollection{Andreeva_et_al:2001, AUTHOR = {Andreeva, Bistra and Avgustinova, Tania and Barry, William J.}, TITLE = {Link-Associated and Focus-Associated Accent Patterns in Bulgarian}, YEAR = {2001}, BOOKTITLE = {Current Issues in Formal Slavic Linguistics}, VOLUME = {5}, PAGES = {353-364}, EDITOR = {Zybatow, Gerhild and Junghanns, Uwe and Mehlhorn, Grit and Szucsich, Luka}, SERIES = {Linguistik International}, ADDRESS = {Frankfurt/Main, Germany}, PUBLISHER = {Peter Lang GmbH, Europäischer Verlag der Wissenschaften} } @InCollection{Avgustinova:2001, AUTHOR = {Avgustinova, Tania}, TITLE = {Distinguishing Argument Structure, Syntactic Dependents and Valence in HPSG: Relevance for Slavic}, YEAR = {2001}, BOOKTITLE = {Current Issues in Formal Slavic Linguistics}, VOLUME = {5}, PAGES = {554-567}, EDITOR = {Zybatow, Gerhild and Junghanns, Uwe and Mehlhorn, Grit and Szucsich, Luka}, SERIES = {Linguistik International}, ADDRESS = {Frankfurt am Main}, PUBLISHER = {Peter Lang GmbH, Europäischer Verlag der Wissenschaften}, URL = {https://www.coli.uni-saarland.de/~tania/ta-pub/ta-hpsg-fdsl3.pdf}, ANNOTE = {COLIURL : Avgustinova:2001:DAS.pdf} } @Misc{Avgustinova:2001_1, AUTHOR = {Avgustinova, Tania}, TITLE = {Review of: Stump, Gregory T.: Inflectional Morphology. A Theory of Paradigm Structure. Cambridge Studies in Linguistics 93. Cambridge: Cambridge University Press, 2001}, YEAR = {2001}, URL = {http://linguistlist.org/issues/12/12-1861.html#1}, ANNOTE = {COLIURL : Avgustinova:2001:RSG.pdf} } @Misc{Avgustinova:2001_2, AUTHOR = {Avgustinova, Tania}, TITLE = {Review of: Corbett, Greville G.: Number. Cambridge Textbooks in Linguistics. Cambridge: Cambridge University Press, 2000}, YEAR = {2001}, URL = {http://www.linguistlist.org/issues/12/12-1357.html}, ANNOTE = {COLIURL : Avgustinova:2001:RCG.pdf} } @Misc{Avgustinova:2001_3, AUTHOR = {Avgustinova, Tania}, TITLE = {Review of: Levine, Robert D.; Green, Georgina M. (Eds.): Studies in Contemporary Phrase Structure Grammar. Cambridge: Cambridge University Press, 1999}, YEAR = {2001}, URL = {http://linguistlist.org/issues/12/12-492.html}, ANNOTE = {COLIURL : Avgustinova:2001:RLR.pdf} } @InProceedings{Avgustinova:2001_4, AUTHOR = {Avgustinova, Tania}, TITLE = {Russian Infinitival Existential Constructions from an HPSG Perspective}, YEAR = {2001}, BOOKTITLE = {4th European Conference on Formal Description of Slavic Languages (FDSL4), November 28-30}, ADDRESS = {Potsdam}, NOTE = {to appear} } @InProceedings{Avgustinova_Uszkoreit:2001, AUTHOR = {Avgustinova, Tania and Uszkoreit, Hans}, TITLE = {Towards a Typology of Agreement Phenomena}, YEAR = {2001}, BOOKTITLE = {The Role of Agreement in Natural Languages. Texas Linguistic Society Conference (TLS'2001), March 2-4}, EDITOR = {Griffin, W.}, ADDRESS = {Austin, Texas, USA}, PUBLISHER = {Lincom Europa}, URL = {https://www.coli.uni-saarland.de/~tania/ta-pub/TA-HU-TLS-2001-agreement.pdf}, ABSTRACT = {Agreement phenomena are instances of co-variation of linguistic forms which is typically realised as feature congruity, i.e. compatibility of values of identical grammatical categories of syntactically combined linguistic items. Agreement is a relatively well-researched topic, especially in Slavic linguistics, cf. (Corbett, 2000a). However, the investigations have mainly concentrated on the linguistic items themselves (as agreement sources) and on the relevant properties of these items (in terms of agreement features and conditions). The nature of the relations holding between the agreeing items has not received proper attention yet.}, ANNOTE = {COLIURL : Avgustinova:2001:TTA.pdf} } @InProceedings{Avgustinova_Uszkoreit:2001_1, AUTHOR = {Avgustinova, Tania and Uszkoreit, Hans}, TITLE = {Reconsidering the Relations in Constructions with Non-Verbal Predicates}, YEAR = {2001}, BOOKTITLE = {4th European Conference on Formal Description of Slavic Languages (FDSL4), November 28-30}, ADDRESS = {Potsdam, Germany} } @Article{Barry_Andreeva:2001, AUTHOR = {Barry, William J. and Andreeva, Bistra}, TITLE = {Cross-Language Similarities and Differences in Spontaneous Speech Patterns}, YEAR = {2001}, JOURNAL = {Journal of the International Phonetic Association}, VOLUME = {31}, NUMBER = {1} } @InProceedings{Barry_et_al:2001, AUTHOR = {Barry, William J. and Nielsen, Claus and Andersen, Ove}, TITLE = {Must Diphone Synthesis be so Unnatural?}, YEAR = {2001}, BOOKTITLE = {7th European Conference on Speech Communication and Technology (EUROSPEECH '01), September 3-7}, EDITOR = {Dalsgaard, Paul and Lindberg, Borge and Benner, Henrik}, ADDRESS = {Aalborg, Denmark} } @Article{Baum_et_al:2001, AUTHOR = {Baum, Micha and Erbach, Gregor and Kommenda, Markus}, TITLE = {Spracherkennung: Kommunikation mit Maschinen}, YEAR = {2001}, JOURNAL = {Funkschau}, VOLUME = {1/ 2001}, PAGES = {26-29}, URL = {http://www.dfki.de/dfkibib/publications/docs/funkschau.pdf}, ANNOTE = {COLIURL : Baum:2001:SKM.pdf} } @InProceedings{Baumann_Trouvain:2001, AUTHOR = {Baumann, Stefan and Trouvain, Jürgen}, TITLE = {On the Prosody of German Telephone Numbers}, YEAR = {2001}, BOOKTITLE = {7th European Conference on Speech Communication and Technology (EUROSPEECH '01), September 3-7}, PAGES = {557-560}, EDITOR = {Dalsgaard, Paul and Lindberg, Borge and Benner, Henrik}, ADDRESS = {Aalborg, Denmark}, ABSTRACT = {Spoken telephone numbers are prosodically structured. This is reflected on various levels, such as grouping, wording and accenting. Realisation strategies employed by German speakers are used to model the prosody of telephone number production. In a listening preference test using synthetic speech two strategies used by commercial inquiry systems proved to be less acceptable than the versions based on the proposed models. These models are proposed for use in speech-synthesis-based telephone number inquiry services.}, ANNOTE = {COLIURL : Baumann:2001:PGT.pdf} } @Article{Bertsch_Nederhof:2001, AUTHOR = {Bertsch, Eberhard and Nederhof, Mark-Jan}, TITLE = {Size/ Lookahead Tradeoff for LL(k)-Grammars}, YEAR = {2001}, JOURNAL = {Information Processing Letters}, VOLUME = {80}, PAGES = {125-129}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof01d.ps.gz}, ABSTRACT = {For a family of languages a precise tradeoff relationship between the size of LL(k) grammars and the length k of lookahead is demonstrated.}, ANNOTE = {COLIURL : Bertsch:2001:SLT.pdf Bertsch:2001:SLT.ps} } @InProceedings{Bertsch_Nederhof:2001_1, AUTHOR = {Bertsch, Eberhard and Nederhof, Mark-Jan}, TITLE = {On the Complexity of some Extensions of RCG Parsing}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 7th International Workshop on Parsing Technologies (IWPT'01), October 17-19}, PAGES = {66-77}, ADDRESS = {Beijing, China}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof01c.ps.gz}, ABSTRACT = {We consider the parsing problem for range concatenation grammars (RCGs). Two new applications of RCG parsing are studied. The first is the parsing of finite automata, the second is string-to-string transduction, with an extension of RCGs. We show that these problems are undecidable in general, but become tractable for subclasses of the formalism.}, ANNOTE = {COLIURL : Bertsch:2001:CSE.pdf Bertsch:2001:CSE.ps} } @InCollection{Blackburn_et_al:2001, AUTHOR = {Blackburn, Patrick and Bos, Johan and Kohlhase, Michael and de Nivelle, Hans}, TITLE = {Inference and Computational Semantics}, YEAR = {2001}, BOOKTITLE = {Computing Meaning}, VOLUME = {2}, NUMBER = {77}, PAGES = {11-28}, EDITOR = {Bunt, Harry and Muskens, Reinhard and Thijsse, Elias}, SERIES = {Studies in Linguistics and Philosophie}, ADDRESS = {Dordrecht}, PUBLISHER = {Kluwer Academic Publishers} } @InProceedings{Bodirsky_et_al:2001, AUTHOR = {Bodirsky, Manuel and Erk, Katrin and Koller, Alexander and Niehren, Joachim}, TITLE = {Beta Reduction Constraints}, YEAR = {2001}, BOOKTITLE = {12th International Conference on Rewriting Techniques and Applications (RTA'01), May 22-24}, PAGES = {31-46}, EDITOR = {Middeldorp, Aart}, SERIES = {Lecture Notes in Computer Science}, ADDRESS = {Utrecht, The Netherlands}, PUBLISHER = {Springer-Verlag}, URL = {https://www.coli.uni-saarland.de/~koller/papers/beta.ps.gz}, ABSTRACT = {The constraint language for lambda structures (CLLS) can model lambda terms that are known only partially. In this paper, we introduce beta reduction constraints to describe beta reduction steps between partially known lambda terms. We show that beta reduction constraints can be expressed in an extension of CLLS by group parallelism. We then extend a known semi-decision procedure for CLLS to also deal with group parallelism and thus with beta-reduction constraints.}, ANNOTE = {COLIURL : Bodirski:2001:BRC.pdf Bodirsky:2001:BRC.ps} } @InProceedings{Bodirsky_et_al:2001_1, AUTHOR = {Bodirsky, Manuel and Erk, Katrin and Koller, Alexander and Niehren, Joachim}, TITLE = {Underspecified Beta Reduction}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 39th Annual Meeting of the Association of Computational Linguistics (ACL'01), July 6-11}, PAGES = {74-81}, ADDRESS = {Toulouse, France}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/usp-beta.ps.gz https://www.coli.uni-saarland.de/~koller/papers/usp-beta.ps.gz}, ABSTRACT = {For ambiguous sentences, traditional semantics construction produces large numbers of higher-order formulas, which must then be beta-reduced individually. Underspecified versions can produce compact descriptions of all readings, but it is not known how to perform beta reduction on these descriptions. We show how to do this using beta reduction constraints in the constraint language for $lambda$-structures (CLLS).}, ANNOTE = {COLIURL : Bodirski:2001:UBR.pdf Bodirsky:2001:UBR.ps} } @InProceedings{Bos:2001, AUTHOR = {Bos, Johan}, TITLE = {DORIS 2001: Underspecification, Resolution and Inference for Discourse Representation Structures}, YEAR = {2001}, BOOKTITLE = {Proceedings of the Workshop on Inference in Compuational Semantics (ICoS-3), June 18-19}, EDITOR = {Blackburn, Patrick and Kohlhase, Michael}, ADDRESS = {Siena, Italy}, URL = {https://www.coli.uni-saarland.de/~bos/doris2001.pdf}, ANNOTE = {COLIURL : Bos:2001:DUR.pdf} } @InProceedings{Brinckmann_Trouvain:2001, AUTHOR = {Brinckmann, Caren and Trouvain, Jürgen}, TITLE = {On the Role of Duration Prediction and Symbolic Representation for the Evaluation of Synthetic Speech}, YEAR = {2001}, BOOKTITLE = {Proceedings 4th ISCA Tutorial and Research Workshop on Speech Synthesis}, PAGES = {35--40}, ADDRESS = {Pitlochry, Scotland}, URL = {https://www.coli.uni-saarland.de/~cabr/ssw4}, ABSTRACT = {In order to determine priorities for the improvement of timing in synthetic speech this study looks at the role of segmental duration prediction and the role of phonological symbolic representation in listeners' preferences. In perception experiments using German speech synthesis, two standard duration models (Klatt rules and CART) were tested. The input to these models consisted of symbolic strings which were either derived from a database or a text-to-speech system. Results of the perception experiments show that different duration models can only be distinguished when the symbolic string is appropriate. Considering the relative importance of the symbolic representation, ``post-lexical'' segmental rules were investigated with the outcome that listeners differ in their preferences regarding the degree of segmental reduction. As a conclusion, before fine-tuning the duration prediction, it is important to calculate an appropriate phonological symbolic representation in order to improve timing in synthetic speech.}, ANNOTE = {Brinckmann:2001:RDP} } @InCollection{Bruder_et_al:2001, AUTHOR = {Bruder, Ilvio and Düsterhöft, Antje and Becker, Markus and Bedersdorfer, Jochen and Neumann, Günter}, TITLE = {GETESS: Constructing a Linguistic Search Index for an Internet Search Engine}, YEAR = {2001}, BOOKTITLE = {Natural Language Processing and Information Systems}, PAGES = {227-238}, EDITOR = {Bouzeghoub, Mokrane and Kedad, Zoubida and Métais, Elisabeth}, ADDRESS = {Berlin}, PUBLISHER = {Springer}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nldb.ps.gz}, ABSTRACT = {In this paper we illustrate how Internet documents can be automatically analyzed in order to capture the content of a document in a more detailed way than usually. The result of the document analysis is called abstract and will be used as a linguistic search index for the Internet search engine GETESS. We show how the linguistic analysis system SMES can be used for a Harvest based search engine for constructing a linguistic search index. Further, we denote how the linguistic index can be exploited for answering user search inqueries.}, ANNOTE = {COLIURL : Bruder:2001:GCL.pdf Bruder:2001:GCL.ps} } @InProceedings{Buitelaar:2001, AUTHOR = {Buitelaar, Paul}, TITLE = {The SENSEVAL-II Panel on Domains, Topics and Senses}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 2nd International Workshop on Evaluating Word Sense Disambiguation Systems (SENSEVAL-II)}, ADDRESS = {Toulouse}, URL = {http://dfki.de/~paulb/senseval2.ps}, ABSTRACT = {An important aspect of sense disambiguation is the wider semantic space (domain, topic) in which the ambiguous word occurs. This may be most clearly illustrated by some cross-lingual examples, as they would appear in (machine) translation. Consider for instance the English word housing. In a more general 'sense', this translates in German into Wohnung. In an engineering setting however it translates into Gehaeuse. Also verbs may be translated differently (i.e. have a different sense) according to the semantic space in which they occur. For instance, English warming up translates into erhitzen in a more general sense, but into aufwaermen in the sports domain. Because of the apparent relevance then of domains or topics on sense disambiguation, a panel was organized at SENSEVAL-2 to discuss some current and previous work in this area. The paper presents a more extended overview based on the relevant literature, besides giving a summary of the discussion that developed after the panel presentations.}, ANNOTE = {COLIURL : Buitelaar:2001:SIP.pdf Buitelaar:2001:SIP.ps} } @InProceedings{Buitelaar_et_al:2001, AUTHOR = {Buitelaar, Paul and Alexandersson, Jan and Jaeger, Tilman and Lesch, Stephan and Pfleger, Norbert and Raileanu, Diana and von den Berg, Tanja and Klöckner, Kerstin and Neis, Holger and Schlarb, Hubert}, TITLE = {An Unsupervised Semantic Tagger Applied to German}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 3rd Conference on Recent Advances in Natural Language Processing (RANLP'01), September 5-7}, ADDRESS = {Tzigov Chark, Bulgaria}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ranlp01.ps ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/ranlp01.pdf http://dfki.de/~paulb/ranlp01.pdf}, ABSTRACT = {We describe an unsupervised semantic tagger, applied to German, but which could be used with any language for which a corresponding XNet (WordNet, GermaNet, e tc.), POS tagger and morphological analyzer are available. Disambiguation is per formed by comparing co-occurrence weights on pairs of semantic classes (synsets from GermaNet). Precision is around 67% at a recall of around 65% (for all ambig uous words -- 81% for all words at a recall of 80%). Our results show the influe nce of context size and of semantic class frequency in the training corpus.}, ANNOTE = {COLIURL : Buitelaar:2001:UST.pdf Buitelaar:2001:UST.ps} } @InProceedings{Buitelaar_Sacaleanu:2001, AUTHOR = {Buitelaar, Paul and Sacaleanu, Bogdan}, TITLE = {Ranking and Selecting Synsets by Domain Relevance}, YEAR = {2001}, BOOKTITLE = {Proceedings of the WordNet and Other Lexical Resources: Applications, Extensions and Customizations. NAACL Workshop}, ADDRESS = {Pittsburgh}, URL = {http://dfki.de/~paulb/lexres.pdf}, ABSTRACT = {The paper presents a novel method for domain specific sense assignment. The method determines the domain specific relevance of GermaNet synsets on the basis of the relevance of their constituent terms that co-occur within representative domain corpora. The approach is task independent and completely automatic. Experiments show results on three selected domains: business, soccer and medical.}, ANNOTE = {COLIURL : Buitelaar:2001:RSS.pdf} } @InProceedings{Busemann:2001, AUTHOR = {Busemann, Stephan}, TITLE = {Language Generation for Cross-Lingual Document Summarisation}, YEAR = {2001}, BOOKTITLE = {Proceedings of the International Workshop on Innovative Language Technology and Chinese Information Processing (ILT&CIP '01)}, EDITOR = {Sheng, Hyanye}, ADDRESS = {Shanghai}, PUBLISHER = {Science Press}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/musi-nlg.entry ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/musi-nlg.pdf}, ANNOTE = {COLIURL : Busemann:2001:LGC.pdf} } @MastersThesis{Callmeier:2001, AUTHOR = {Callmeier, Ulrich}, TITLE = {Efficient Parsing with Large-Scale Unification Grammars}, YEAR = {2001}, ADDRESS = {Saarbrücken, Germany}, SCHOOL = {Universität des Saarlandes, Informatik}, TYPE = {Diplomarbeit} } @InProceedings{Copestake_et_al:2001, AUTHOR = {Copestake, Ann and Carroll, John and Flickinger, Dan and Malouf, Robert and Oepen, Stephan}, TITLE = {Using an Open-Source Unification-Based System for CL/ NLP Teaching}, YEAR = {2001}, BOOKTITLE = {Proceedings of the EACL/ ACL Workshop on Sharing Tools and Resources for Research and Education}, ADDRESS = {Toulouse, France}, URL = {http://www.cogs.susx.ac.uk/lab/nlp/carroll/papers/acl01-workshop-lkb.pdf}, ABSTRACT = {We demonstrate the opensource LKB system which has been used to teach the fundamentals of constraintbased grammar development to several groups of students.}, ANNOTE = {COLIURL : Copestake:2001:UOS.pdf} } @Article{Corley_et_al:2001, AUTHOR = {Corley, Steffan and Corley, Martin and Keller, Frank and Crocker, Matthew W. and Trewin, Shari}, TITLE = {Finding Syntactic Structure in Unparsed Corpora: The GSEARCH Corpus Query System}, YEAR = {2001}, JOURNAL = {Computers and the Humanities}, VOLUME = {35}, PAGES = {81-94} } @InCollection{Crouch_et_al:2001, AUTHOR = {Crouch, Richard and Frank, Anette and van Genabith, Josef}, TITLE = {Glue, Underspecification and Translation}, YEAR = {2001}, BOOKTITLE = {Computing Meaning Volume 2}, EDITOR = {Bunt, Harry}, PUBLISHER = {Kluwer Academic Publishers}, URL = {http://www2.parc.com/istl/members/crouch/iwcs3.pdf}, ABSTRACT = {This paper sketches how one can construct Underspecified Discourse Representation Structures (UDRSs) (Reyle, 1993) via glue semantics (Dalrymple et al. 1999). In most cases, UDRSs are constructed in linear time, analogously to the linear time construction of skeleton-modifier representations presented in (Gupta and Lamping, 1998). We show how this encoding can be used in ambiguity preserving, transfer-based machine translation, where it reduces problems with structural misalignment, such as head-switching problem.}, ANNOTE = {COLIURL : Crouch:2001:GUT.pdf} } @InProceedings{Crouch_et_al:2001_1, AUTHOR = {Crouch, Richard and Frank, Anette and van Genabith, Josef}, TITLE = {Linear Logic based Transfer and Structural Misalignment}, YEAR = {2001}, BOOKTITLE = {4th International Workshop on Comutational Semantics (IWCS-4), January 10-12}, EDITOR = {Bunt, Harry and van der Sluis, Ielka and Thijsse, Elias}, ADDRESS = {Tilburg, The Netherlands}, URL = {http://www.dfki.de/~frank/papers/iwcs4.ps}, ABSTRACT = {Genabith, Frank and Dorna, 1998) described an approach to ambiguity preserving machine translation, where transfer takes place on the glue language meaning constructors of (Dalrymple et al. 1996). Unfortunately, it did not deal with structural misalignment problems, such as embedded head switching, in a fully satisfactory way. This paper proposes the use of a fragment of linear logic as a transfer formalism, and shows how it provides a more general and satisfactory solution to the difficulties encountered by (Genabith, Frank and Dorna, 1998).}, ANNOTE = {COLIURL : Crouch:2001:LLB.pdf Crouch:2001:LLB.ps} } @InCollection{Crysmann:2001, AUTHOR = {Crysmann, Berthold}, TITLE = {Syntactic Transparency of Pronominal Affixes}, YEAR = {2001}, BOOKTITLE = {Grammatical Interfaces in HPSG}, PAGES = {77-96}, EDITOR = {Cann, Ronnie and Grover, Claire and Miller, Philip}, ADDRESS = {Stanford}, PUBLISHER = {CSLI Publications}, URL = {https://www.coli.uni-saarland.de/~crysmann/papers/SynTran.html}, ABSTRACT = {Approaches to bound pronominals in HPSG reflect a strict dichotomy between postlexical clitics and lexical (or phrasal) affixes, a distinction already drawn in cliticisation theories developed by Miller (1992) or Halpern (1995). Motivated by the rigorous application of the diagnostic criteria suggested in Zwicky and Pullum (1983) and Miller (1992), clitics in Romance languages are treated as lexical afixes, whose morphological and morphosyntactic properties are derived entirely within the lexicon (Miller and Sag 1997; Monachesi (1996). Weak pronominals in Polish (Kupsc 1999) and second position clitics in Serbo-Croat (Penn 1999), however, enjoy a much higher degree of syntactic transparency, favouring an analysis in terms of linearisation approaches. In this paper, I will suggest that European Portuguese (EP) represents a transitional type, where clitics have already acquired the morphological properties of lexical affixes, yet, ``the rules governing clitic placement seem to relate more to syntax than to prosody or morphology'' (Spencer 1991, p. 365). I will argue that the distinction between constituent structure and order domains, as drawn in linearisation-based variants of HPSG, provides the necessary tools to model the syntax of transparent affixes, relating EP clitics to both their Romance and Slavic counterparts.} } @InCollection{Crysmann:2001_1, AUTHOR = {Crysmann, Berthold}, TITLE = {Clitics and Coordination in Linear Structure}, YEAR = {2001}, BOOKTITLE = {Clitics in Phonology, Morphology, and Syntax}, VOLUME = {36}, PAGES = {121-159}, EDITOR = {Gerlach, B. and Grijzenhout, J.}, SERIES = {Linguistics Today}, ADDRESS = {Amsterdam}, PUBLISHER = {John Benjamins}, URL = {https://www.coli.uni-saarland.de/~crysmann/papers/ClCoord.html}, ABSTRACT = {In the context of lexicalist studies of Romance cliticisation, the development and rigorous application of diagnostic criteria (Zwicky and Pullum, 1983; Miller, 1992) as to their lexical or syntactic status has always enjoyed a central role. As a result, there is a vast body of evidence in French and Italian (Miller 1992; Miller and Sag, 1997; Monachesi, 1996) that weak pronominals in these languages resemble ordinary bound affixes much more than true postlexical clitics. In particular, syntactic, semantic, morphological, and phonological criteria jointly militate against the view of Romance clitics as proper inhabitants of the syntactic world. As a side effect, the distinction between lexical affixes and postlexical clitics (Halpern, 1995) is seen as a strict dichotomy, with little or no room for true morpho-syntactic hybrids. I will argue in this paper that transitional types do indeed occur, which are characterised by the fact that one group of criteria (e.g. morphological criteria) positively suggest syntactic opacity, while almost all syntactic criteria demand a degree of transparency. Based on data from clitic placement and coordination, however, I will suggest that the syntactic transparency is highly superficial in nature, and thus favours an account in terms of word order variation. This perspective will also prove to make appropriate predictions in the context of semantic idiosyncrasies.} } @InProceedings{Debusmann:2001, AUTHOR = {Debusmann, Ralph}, TITLE = {Topological Dependency Trees: A Constraint-based Account of Linear Precedence}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics (ACL 2001), July 9-11}, PAGES = {180-187}, ADDRESS = {Toulouse, France}, PUBLISHER = {Morgan Kaufmann Publishers}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/rade-acl2001.ps.gz}, ABSTRACT = {Linear precedence in so-called free word order languages remains challenging for modern grammar formalisms. To address this issue, we describe a new framework for dependency grammar, with a modular decomposition of immediate dependency and linear precedence. Our approach distinguishes two orthogonal yet mutually constraining structures: a syntactic dependency tree (ID tree) and a topological dependency tree (LP tree). The ID tree is non-projective, and even non-ordered, and its edges are labeled by syntactic roles. The LP tree is projective, partially ordered, and its edges are labeled by topological fields. The shape of the LP tree is a flattening of the ID tree's obtained by allowing nodes to 'climb up'. Our theory of ID/LP trees is formulated in terms of (a) lexicalized constraints and (b) principles governing e.g. climbing conditions. We illustrate it with a detailed account of word order phenomena in the verbal complex of German verb final sentences.}, ANNOTE = {COLIURL : Debusmann:2001:TDT.pdf Debusmann:2001:TDT.ps} } @InProceedings{Debusmann:2001_1, AUTHOR = {Debusmann, Ralph}, TITLE = {Movement as well-formedness Conditions}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 13th ESSLLI Student Session, August 13-24}, ADDRESS = {Helsinki, Finland}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Debusmann-ESSLLI-01.pdf}, ABSTRACT = {We introduce a new formulation of dependency grammar recently suggested in (Duchier and Debusmann, 2001) (henceforth DD). DD shares with GB (Chomsky, 1986) a notion of movement. In GB, movement is carried out by tree transformations. In DD, it is the effect of well-formedness conditions on dependency trees and does not involve transformations. We illustrate both kinds of movement by showing how both theories analyze German verb-second clauses. Then, we point out the similarities between GB and DD, and raise the question whether GB's transformational notion of movement could be replaced by DD's constraint-based account of movement.}, ANNOTE = {COLIURL : Debusmann:2001:MWF.pdf} } @MastersThesis{Debusmann:2001_2, AUTHOR = {Debusmann, Ralph}, TITLE = {A Declarative Grammar Formalism for Dependency Grammar}, YEAR = {2001}, ADDRESS = {Saarbrücken}, SCHOOL = {Universität des Saarlandes, Department of Computational Linguistics}, URL = {http://www.ps.uni-sb.de/~rade/papers/da.pdf}, ABSTRACT = {Beginning with the groundbreaking work of Chomsky in the 1950s, syntactians have concentrated mostly on the English language. But English is not a typical natural language: in particular, its word order is very rigid, as opposed to most other languages which exhibit freer word order. The phrase structure-based approach employed for the analysis of English runs into severe problems when confronted with freer word order languages. Aside from the mainstream, linguists in Eastern Europe and Japan have pursued an approach to syntax which seemed better suited for the analysis of freer word order languages: dependency grammar. The key asset of dependency grammar is that it allows for a clean separation of syntactic dependency and surface word order. Unfortunately, none of the frameworks for dependency grammar has really caught on. We suggest two reasons for their failure: 1. many of the dependency-based frameworks lack proper formalization and, perhaps surprisingly, 2. most of them lack a realistic and workable account of word order. In this thesis, we try to remedy these problems in the setting of a constraint-based approach to dependency grammar based on (Duchier 1999). We present a new account of word order for dependency grammar couched in a declarative grammatical formalism called Topological Dependency Grammar (TDG). TDG allows to cleanly separate the two levels of syntactic dependency and surface word order, which greatly facilitates the conception of grammars for freer word order languages. In addition, we can efficiently parse with TDG grammars: using a reduction described in (Duchier 2000), we achieved an efficient parser implementation using modern constraint programming techniques.}, ANNOTE = {COLIURL : Debusmann:2001:DGF.pdf} } @InProceedings{Declerck:2001, AUTHOR = {Declerck, Thierry}, TITLE = {Extending NLP Tools Repositories for the Interaction with Language Data Resources Repositories}, YEAR = {2001}, BOOKTITLE = {Proceedings of the ACL/ EACL Workshop on Sharing Tools and Resources, July 7}, ADDRESS = {Toulouse, France}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/aclnlp01_dec.ps.gz}, ABSTRACT = {This short paper presents some motivations behind the organization of the ACL/EACL01 Workshop on Sharing Tools and Resources for Research and Education'', concentrating o n the possible connection of Tools and Resources repositories. Taking some papers print ed in this volume and the ACL Natural Language Software Registry as a basis, we outline some of the steps to be done on the side of NLP tool repositories in order to achieve this goal.}, ANNOTE = {COLIURL : Declerck:2001:ENT.pdf Declerck:2001:ENT.ps} } @InProceedings{Declerck_Neumann:2001, AUTHOR = {Declerck, Thierry and Neumann, Günter}, TITLE = {A Cascaded Shallow Approach to Reference Resolution}, YEAR = {2001}, BOOKTITLE = {Proceedings of the EuroConference on Recent Advances in NLP (RANLP'01), September 5-7}, ADDRESS = {Tzigov Chark, Bulgaria}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/rrm-ranlp.ps.gz}, ANNOTE = {COLIURL : Declerck:2001:CSA.pdf Declerck:2001:CSA.ps} } @InProceedings{Declerck_Wittenburg:2001, AUTHOR = {Declerck, Thierry and Wittenburg, Peter}, TITLE = {XML and NLP: Their Interaction and their Role for HLT Applications}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 1st NLP and XML Workshop, November 30}, ADDRESS = {Tokyo, Japan}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nlprs01_dec.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nlprs01_dec.entry}, ANNOTE = {COLIURL : Declerck:2001:XNT.pdf Declerck:2001:XNT.ps} } @InProceedings{Declerck_Wittenburg:2001_1, AUTHOR = {Declerck, Thierry and Wittenburg, Peter}, TITLE = {MUMIS - A Multimedia Indexing and Searching Environment}, YEAR = {2001}, BOOKTITLE = {1st International Workshop on MultiMedia Annotation (MMA '01), January 30-31}, ADDRESS = {Tokyo, Japan}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mma01_dec.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/mma01_dec.entry}, ANNOTE = {COLIURL : Declerck:2001:MMI.pdf Declerck:2001:MMI.ps} } @InProceedings{Declerck_et_al:2001, AUTHOR = {Declerck, Thierry and Wittenburg, Peter and Cunningham, Hamish}, TITLE = {The Automatic Generation of Formal Annotations in a Multimedia Indexing and Searching Environment}, YEAR = {2001}, BOOKTITLE = {Proceedings of the ACL/ EACL Workshop on Human Language Technology and Knowledge Management, July 6-7}, ADDRESS = {Toulouse, France}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/aclhlt01_dec.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/aclhlt01_dec.entry}, ANNOTE = {COLIURL : Declerck:2001:AGF.pdf Declerck:2001:AGF.ps} } @InProceedings{Dipper_et_al:2001, AUTHOR = {Dipper, Stefanie and Brants, Thorsten and Lezius, Wolfgang and Plaehn, Oliver and Smith, George}, TITLE = {The TIGER Treebank}, YEAR = {2001}, BOOKTITLE = {3rd Workshop on Linguistically Interpreted Corpora (LINC '01), August 29}, ADDRESS = {Leuven, Belgium}, URL = {http://www.ims.uni-stuttgart.de/projekte/TIGER/paper/linc2001-abstract-tiger.ps.gz http://www.ims.uni-stuttgart.de/projekte/TIGER/paper/linc2001-abstract-tiger.pdf}, ANNOTE = {COLIURL : Dipper:2001:TT.pdf Dipper:2001:TT.ps} } @InCollection{Duchier_Gardent:2001, AUTHOR = {Duchier, Denys and Gardent, Claire}, TITLE = {Tree Descriptions, Constraints and Incrementality}, YEAR = {2001}, BOOKTITLE = {Computing Meaning, Volume 2}, VOLUME = {77}, PAGES = {205-227}, EDITOR = {Bunt, Harry and Muskens, Reinhard and Thijsse, Elias}, SERIES = {Studies In Linguistics And Philosophy}, ADDRESS = {Dordrecht}, PUBLISHER = {Kluwer Academic Publishers}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/iwcs3-book.ps.gz}, ABSTRACT = {In extitA Constraint-Based Treatment of Descriptions, we presented a constraint-based method for enumerating the models satisfying a given tree description and described its application to the underspecified semantic representation of discourse advocated by Gardent \& Webber (1998). In this paper, we indicate how the approach may be further extended to support discourse level extitincremental processing. extbfKeywords: incremental processing, underspecified representations, tree descriptions, dominance constraints, constraint programming, discourse semantics.}, ANNOTE = {COLIURL : Duchier:2001:TDC.pdf Duchier:2001:TDC.ps} } @Article{Dünges:2001, AUTHOR = {Dünges, Petra}, TITLE = {Eventualities in Time - The Localization of Eventualities in the Platonist and the Reductionist Picture of Time}, YEAR = {2001}, JOURNAL = {Grammars}, VOLUME = {4}, NUMBER = {1}, PAGES = {69-83}, ABSTRACT = {This paper addresses the general question of how eventualities should be localized in time. The answer given here is mainly inspired by the model theory of Discourse Representation Theory (DRT) as presented in From Discourse to Logic by Kamp and Reyle. We show that there is a mathematical problem concerning the localization function used in that book. And we propose a remedy for this problem. The general picture that emerges should be interesting not only for DRT but for other theories using an eventuality-based semantics as well. For related questions see the CLAUS report 104 Eventualities in Time at https://www.coli.uni-saarland.de/.}, NOTE = {This paper has been printed before in Grammars 3(1):21-35, 2000. It was incorrectly printed, however, and so a corrected reprint took place} } @Article{Egg_et_al:2001, AUTHOR = {Egg, Markus and Koller, Alexander and Niehren, Joachim}, TITLE = {The Constraint Language for Lambda Structures}, YEAR = {2001}, JOURNAL = {Journal of Logic, Language, and Information}, VOLUME = {10}, NUMBER = {4}, PAGES = {457-485}, URL = {https://www.coli.uni-saarland.de/~koller/papers/clls.ps.gz}, ANNOTE = {COLIURL : Egg:2001:CLL.pdf Egg:2001:CLL.ps} } @Article{Egg_et_al:2001_1, AUTHOR = {Egg, Markus and Pinkal, Manfred and Pustejovsky, James}, TITLE = {Editorial}, YEAR = {2001}, JOURNAL = {Journal of Logic, Language and Information (Special Issue on Underspecification)}, VOLUME = {10}, NUMBER = {4}, PAGES = {411-416} } @InProceedings{Eisele_Ziegler-Eisele:2001, AUTHOR = {Eisele, Andreas and Ziegler-Eisele, Dorothea}, TITLE = {Towards a Road Map on Human Language Technology: Natural Language Processing. Report on the Second Elsnet Roadmap Workshop}, YEAR = {2001}, URL = {http://utrecht.elsnet.org/roadmap/docs/rm-eisele-v2.pdf}, ABSTRACT = {This document summarizes contributions and discussions from two workshops that took place in November 2000 and July 2001. It presents some visions of NLP-related applications that may become reality within ten years from now. It investigates the technological requirements that must be met in order to make these visions realistic and sketches milestones that may help to measure our progress towards these goals.}, ANNOTE = {COLIURL : Eisele:2001:TRM.pdf} } @InProceedings{Erk_Koller:2001, AUTHOR = {Erk, Katrin and Koller, Alexander}, TITLE = {VP Ellipsis by Tree Surgery}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 13th Amsterdam Colloquium, December 17-19}, ADDRESS = {Amsterdam}, URL = {https://www.coli.uni-saarland.de/~koller/papers/jigsaw.ps.gz}, ABSTRACT = {We present jigsaw parallelism constraints, a flexible formal tool for replacing parts of trees with other trees. Jigsaw constraints extend the Constraint Language for Lambda Structures, a language used in underspecified semantics to declaratively describe scope, ellipsis, and their interaction, and can be used to improve the coverage of ellipses represented by CLLS.}, ANNOTE = {COLIURL : Erk:2001:VET.pdf Erk:2001:VET.ps} } @InCollection{Fliedner:2001, AUTHOR = {Fliedner, Gerhard}, TITLE = {Korrekturprogramme}, YEAR = {2001}, BOOKTITLE = {Computerlinguistik und Sprachtechnologie. Eine Einführung}, PAGES = {411-417}, EDITOR = {Carstensen, K.-U. and Ebert, Ch. and Endriss, C. and Jekat, S. and Klabunde, R. and Langer, H.}, ADDRESS = {Heidelberg}, PUBLISHER = {Spektrum Akademischer Verlag} } @InProceedings{Frank:2001, AUTHOR = {Frank, Anette}, TITLE = {Treebank Conversion. Converting the NEGRA Treebank to an LTAG Grammar}, YEAR = {2001}, BOOKTITLE = {Proceedings of the Workshop on Multi-layer Corpus-based Analysis. Workshop held as part of the EUROLAN 2001 Summer Institute on Creation and Exploitation of Annotated Language Resources, July 30 - August 11}, ADDRESS = {Iasi, Romania}, URL = {http://www.dfki.de/~frank/papers/tbc-eurolan01.pdf}, ABSTRACT = {We present a method for rule-based structure conversion of existing treebanks, which aims at the extraction of linguistically sound, corpus-based grammars in a specific grammatical framework. We apply this method to the NEGRA treebank to derive an LTAG grammar of German. We describe the methodology and tools for structure conversion and LTAG extraction. The conversion and grammar extraction process imports linguistic generalisations that are missing the in original treebank. This supports the extraction of a linguistically sound grammar with maximal generalisation, as well as grammar induction techniques to capture unseen data in stochastic parsing. We further illustrate the flexibility of our conversion method by deriving an alternative representation in terms of topological field marking from the NEGRA treebank, which can be used as input for stochastic topological parsing approaches. On a broader perspective our approach contributes to a better understanding on where corpuslinguistics and theoretical linguistics can meet and enrich each other.}, ANNOTE = {COLIURL : Frank:2001:TCC.pdf} } @InProceedings{Frank_van Genabith:2001, AUTHOR = {Frank, Anette and van Genabith, Josef}, TITLE = {LL-based Semantics for LTAG - and what it teaches us about LFG and LTAG}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 6th International Lexical Functional Grammar Conference (LFG'01), June 25-27}, EDITOR = {Butt, Miriam and Holloway King, Tracy}, ADDRESS = {Hong Kong}, PUBLISHER = {CSLI Online Publications}, URL = {http://csli-publications.stanford.edu/LFG/6/lfg01frankgenabith.pdf}, ABSTRACT = {We review existing appoaches to semantics construction in LTAG (Lexicalised Tree Adjoining Grammar) based on the notion of derivation (tree)s. We argue that derivation structures in LTAG are not appropriate to guide semantic composition, due to a non-isomorphism, in LTAG between the syntactic operation of adjunction on the one hand, and the semantic operations of complementation and modifcation, on the other. Linear Logic based glue semantics, as developed within the LFG framework (cf. Dalrymple (1999)), allows for flexible coupling of syntactic and semantic structure. We investigate application of glue semantics to LTAG syntax, using as underlying structure the derived tree, which is more appropriate for principle-based semantics construction. We show how Linear Logic based semantics construction helps to bridge the non-isomorphism between syntactic and semantic operations in LTAG. The glue approach captures non-tree local dependencies in control and modifcation structures, and extends to the treatment of scope ambiguity with quantified NPs and VP modifers. Finally, glue semantics applies successfully to the adjunction-based analysis of long-distance dependencies in LTAG, which differs signifcantly from the f-structure based analysis in LFG.}, ANNOTE = {COLIURL : Frank:2001:LBS.pdf} } @MastersThesis{Gabsdil:2001, AUTHOR = {Gabsdil, Malte}, TITLE = {Interpreting Questions and Answers in a Prototype Dialogue System}, YEAR = {2001}, ADDRESS = {Saarbrücken}, SCHOOL = {Universität des Saarlandes, Computerlinguistik}, URL = {https://www.coli.uni-saarland.de/~gabsdil/papers/msc01.ps.gz}, ANNOTE = {COLIURL : Gabsdil:2001:IQA.pdf Gabsdil:2001:IQA.ps} } @InProceedings{Gabsdil_et_al:2001, AUTHOR = {Gabsdil, Malte and Koller, Alexander and Striegnitz, Kristina}, TITLE = {Building a Text Adventure on Description Logic}, YEAR = {2001}, BOOKTITLE = {KI-2001 Workshop on Applications of Description Logics, September 18}, VOLUME = {44}, EDITOR = {Görz, Günther and Haarslev, V. and Lutz, C. and Möller, R.}, ADDRESS = {Vienna, Austria}, PUBLISHER = {CEUR Workshop Proceedings}, URL = {http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-44/Gabsdil-et-al.ps.gz}, ABSTRACT = {We describe an engine for a computer game which employs techniques from computational linguistics and theorem proving based on description logic. We show how we represent a world model as a DL knowledge base and then illustrate how we use it in the computational linguistics modules with the examples of analyzing and generating referring expressions.}, ANNOTE = {COLIURL : Gabsdil:2001:BTA.pdf Gabsdil:2001:BTA.ps} } @InProceedings{Gabsdil_et_al:2001_1, AUTHOR = {Gabsdil, Malte and Koller, Alexander and Striegnitz, Kristina}, TITLE = {Playing with Description Logic}, YEAR = {2001}, BOOKTITLE = {2nd Workshop on Methods for Modalities (M4M). Application Description, November 29-30}, ADDRESS = {University of Amsterdam, The Netherlands}, URL = {https://www.coli.uni-saarland.de/~kris/papers/m4m2.ps.gz}, ABSTRACT = {We describe an engine for a computer game which has at its core a description logic knowledge base and employs techniques from computational linguistics for its natural language user interface. We show how we represent the state of the game as a DL knowledge base, how we model changes in the world, and how the computational linguistics modules access the knowledge base to analyze the input wrt. the context and produce contextually appropriate output.}, ANNOTE = {COLIURL : Gabsdil:2001:PDL.pdf Gabsdil:2001:PDL.ps} } @InProceedings{Gardent_Striegnitz:2001, AUTHOR = {Gardent, Claire and Striegnitz, Kristina}, TITLE = {Generating Indirect Anaphora}, YEAR = {2001}, BOOKTITLE = {4th International Workshop on Computational Semantics (IWCS-4), January 10-12}, ADDRESS = {Tilburg, The Netherlands}, URL = {https://www.coli.uni-saarland.de/cl/projects/indigen/papers/iwcs4.ps.gz}, ABSTRACT = {Much information in natural language can be left implicit. From the generation perspective, this raises the problem of how to model the processes and in particular, the reasoning, underlying such implicitness. In this paper, we concentrate on the generation of one of the many natural language constructs supporting implicitness namely, indirect anaphora. We first summarize the inferences governing the use of indirect anaphors. We then show how indirect anaphors can be generated within a generation architecture which interleaves sentence realization with contextual reasoning.}, ANNOTE = {COLIURL : Gardent:2001:GIA.pdf Gardent:2001:GIA.ps} } @InProceedings{Gardent_Thater:2001, AUTHOR = {Gardent, Claire and Thater, Stefan}, TITLE = {Generating with a Grammar Based on Tree Descriptions: a Constraint-Based Approach}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics (ACL'01), July 9-11}, EDITOR = {Bird, Steven}, ADDRESS = {Toulouse, France}, URL = {ftp://ftp.coli.uni-sb.de/pub/people/claire/eacl01.ps}, ABSTRACT = {While the generative view of language processing builds bigger units out of smaller ones by means of rewriting steps, the axiomatic view eliminates in-valid linguistic structures out of a set of possible structures by means of well-formedness principles. We present a generator based on the axiomatic view and argue that when combined with a TAG-like grammar and a flat seman-tics, this axiomatic view permits avoiding drawbacks known to hold either of top-down or of bottom-up generators.}, ANNOTE = {COLIURL : Gardent:2001:GGB.pdf Gardent:2001:GGB.ps} } @Article{Grice:2001, AUTHOR = {Grice, Martine}, TITLE = {Review of: Hirst, Di Cristo (eds.): Intonation Systems: A Survey of Twenty Languages}, YEAR = {2001}, JOURNAL = {Journal of Linguistics}, VOLUME = {37}, PAGES = {593-625} } @InCollection{Grice_et_al:2001, AUTHOR = {Grice, Martine and D'Imperio, Mariapaola and Savino, Michelina and Avesani, Cinzia}, TITLE = {Towards a Strategy for ToBI Labeling Varieties of Italian}, YEAR = {2001}, BOOKTITLE = {Prosodic Typology and Transcription: A Unified Approach. Papers presented at the 1999 ICPhS satellite workshop on Intonation: Models and ToBI Labeling}, EDITOR = {Jun, S.-A.}, PUBLISHER = {Oxford University Press} } @InProceedings{Karagjosova:2001, AUTHOR = {Karagjosova, Elena}, TITLE = {Interpreting Utterances with Modal Particles}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 4th International Workshop on Computational Semantics (IWCS-4), January 10-12}, ADDRESS = {Tilburg, The Netherlands}, URL = {http://coli.uni-sb.de/~elka/Papers/Tilburg_final.ps}, ANNOTE = {COLIURL : Karagjosova:2001:IUM.pdf Karagjosova:2001:IUM.ps} } @InProceedings{Karagjosova:2001_1, AUTHOR = {Karagjosova, Elena}, TITLE = {Modal Particles and the Common Ground: Meaning and Functions of German ja, doch, eben/halt and auch}, YEAR = {2001}, BOOKTITLE = {Proceedings 5th Workshop on Formal Semantics and Pragmatics of Dialogue (BI-DIALOG), June 14-16}, EDITOR = {Kühnlein, Peter and Rieser, Hannes and Zeevat, Henk}, ADDRESS = {Bielefeld, Germany}, URL = {http://coli.uni-sb.de/~elka/Papers/bi-dial-final.ps}, ANNOTE = {COLIURL : Karagjosova:2001:MPC.pdf Karagjosova:2001:MPC.ps} } @InProceedings{Karagjosova:2001_2, AUTHOR = {Karagjosova, Elena}, TITLE = {Towards a Comprehensive Meaning of German doch}, YEAR = {2001}, BOOKTITLE = {Proceedings of the ESSLLI 2001 Student Session, August 13-24}, ADDRESS = {Helsinki, Finland}, URL = {http://coli.uni-sb.de/~elka/Papers/elena_karagjosova.ps}, ANNOTE = {COLIURL : Karagjosova:2001:TCM.pdf Karagjosova:2001:TCM.ps} } @InCollection{Kiefer_Krieger:2001, AUTHOR = {Kiefer, Bernd and Krieger, Hans-Ulrich}, TITLE = {A Context-Free Approximation of Head-Driven Phrase Structure Grammar}, YEAR = {2001}, BOOKTITLE = {Efficiency in Unification-Based Processing}, PUBLISHER = {CSLI Lecture Notes}, ABSTRACT = {We present a context-free approximation of unification-based grammars, such as HPSG or PATR-II. The theoretical underpinning is established through a least fixpoint construction over a certain monotonic function. In order to reach a finite fixpoint, the concrete implementation can be parameterized in several ways, either by specifying a finite iteration depth, by using different restrictors, or by making the symbols of the CFG more complex adding annotations à la GPSG. We also present several methods that speed up the approximation process and help to limit the size of the resulting CF grammar.} } @Article{Klettke_et_al:2001, AUTHOR = {Klettke, Meike and Bietz, Mathias and Bruder, Ilvio and Heuer, Andreas and Priebe, Denny and Neumann, Günter and Becker, Markus and Bedersdorfer, Jochen and Uszkoreit, Hans and Maedche, Alexander and Staab, Steffen and Studer, Rudi}, TITLE = {GETESS-Ontologien, objektrelationale Datenbanken und Textanalyse als Bausteine einer semantischen Suchmaschine}, YEAR = {2001}, JOURNAL = {Datenbank-Spektrum}, VOLUME = {1}, NUMBER = {1}, PAGES = {14-24}, URL = {http://www.dfki.de/~neumann/publications/new-ps/getess-db-spektrum.pdf}, ABSTRACT = {In diesem Artikel wird dargestellt, wie Verfahren aus der Wissensrepräsentation, der Computerlinguistik, dem Information Retrieval und aus dem Bereich Datenbanken eingesetzt werden können, um für Suchmaschinen und in Dokumentenserver neue Funktionalitäten bereitzustellen.}, ANNOTE = {COLIURL : Klettke:2001:GOO.pdf} } @InProceedings{Kordoni:2001, AUTHOR = {Kordoni, Valia}, TITLE = {Linking Experiencer-Subject Psych Verb Constructions in Modern Greek}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 7th International Conference on Head-Driven Phrase Structure Grammar (HPSG'00), July 22-23}, PAGES = {198-213}, EDITOR = {Flickinger, Dan and Kathol, Andreas}, ADDRESS = {University of California, Berkeley, USA}, PUBLISHER = {CSLI Publications}, URL = {http://cslipublications.stanford.edu/HPSG/HPSG00/hpsg00kordoni.pdf}, ABSTRACT = {This paper focuses on the semantic properties and the syntactic behaviour of Modern Greek (hence MG) Experiencer-Subject Psych Verb Constructions (hence ESPVCs). MG ESPVCs include verbs like miso (hate), agapo (love), or latrevo (adore), which feature a nominative experiencer in agreement with the verb and an accusative theme (see examples (1)-(3)). MG ESPVCs include also predicates like fovame (fear), which feature an experiencer-subject in agreement with the verb and either an accusative theme (example (4)), or a theme as the object of a prepositional phrase (example (5)). We should underline here that examples (4) and (5) below convey the same meaning. That is, they do NOT differ semantically. 1. O Gianis misi to sholio. 2. the Gianis.N hate.3S the school.A 3. John hates school. 4. 5. O Gianis agapa tin Maria. 6. the Gianis.N loves.3S the Maria.A 7. John loves Mary. 8. 9. O Gianis latrevi tin musiki. 10. the Gianis.N adore.3S the music.A 11. John adores music. 12. 13. I Maria fovate tis kategides. 14. the Maria.N fear.3S the storms.A 15. Mary is afraid of the storms. 16. 17. I Maria fovate me tis kategides. 18. the Maria.N fear.3S with the storms.A 19. Mary is afraid of the storms. 20. The challenge that constructions like the ones in (4) and (5) pose lies on the split syntactic realization of the experienced (hence EXPD) semantic role (i.e., the theme), which in constructions like (4) is syntactically realized as the object of the sentence, while in constructions like (5) it is syntactically realized as the object of a prepositional phrase. Our aim is to propose a unified linking account of the MG ESPVCs. This unified account 1. is based on the assumption that the individual denoted by the object NP (or PP) of the MG ESPVCs is entailed to be semantically underspecified, and 2. makes use of Wechsler's (1995) Notion Rule, Davis and Koenig's (2000) linking theory, as well as Markantonatou and Sadler's (1996) proposal for the linking of indirect arguments.}, ANNOTE = {COLIURL : Kordoni:2001:LES.pdf} } @InProceedings{Kordoni:2001_1, AUTHOR = {Kordoni, Valia}, TITLE = {Optimal Linking for Modern Greek Psych Verb Constructions}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 6th International Lexical Functional Grammar Conference (LFG'01), June 25-27}, PAGES = {184-200}, EDITOR = {Butt, Miriam and Holloway King, Tracy}, ADDRESS = {Hong Kong}, PUBLISHER = {CSLI Publications}, URL = {http://cslipublications.stanford.edu/LFG/6/lfg01kordoni.pdf}, ABSTRACT = {This paper focuses on the semantic properties and the syntactic behaviour of MG ESPVCs like the following: I Maria fovate tis kategides. the Maria.N fear.3S the storms.A Mary is afraid of the storms. I Maria fovate me tis kategides. the Maria.N fear.3S with the storms Mary is afraid of the storms. I Maria.N fovate ton Giani. the Maria.N fear.3S the John.A Mary is afraid of John. I Maria.N fovate me ton Giani. the Maria.N fear.3S with the John.A Mary is afraid of John. We account for the semantic and syntactic properties of the constructions in (1)-(4) by relying on the linking architecture that Butt, Dalrymple, and Frank (1997) have proposed as an alternative to the fully deterministic principles of standard LMT. We show that the optimal linking theory makes the correct predictions for the linking of the EXPR (experiencer) and the EXPD (experienced) semantic arguments of Modern Greek (MG) Experiencer-Subject Psych Verb Constructions (ESPVCs) and predicts that the variant of MG ESPVCs which realizes syntactically the EXPD (experienced) semantic argument as an accusative NP (examples (1) and (3)) ranks higher (is more optimal) than the variant which realizes syntactically the EXPD (experienced) semantic argument as the complement of a PP phrase (examples (2) and (4)). This ranking reflects in a way the fact that in order to express the meaning Mary is afraid of the storms native speakers prefer the construction in (1), rather than the one in (2), which is also mirrored in the rate of the marked variant of MG ESPVCs ((2) and (4)) in the Greek ECI corpus (5,568%).}, ANNOTE = {COLIURL : Kordoni:2001:OLM.pdf} } @InProceedings{Korthals:2001, AUTHOR = {Korthals, Christian}, TITLE = {Self Embedded Relative Clauses in a Corpus of German Newspaper Texts}, YEAR = {2001}, BOOKTITLE = {6th ESSLLI Student Session, August 13-24}, PAGES = {179-190}, EDITOR = {Striegnitz, Kristina}, ADDRESS = {Helsinki, Finland}, URL = {https://www.coli.uni-saarland.de/~kris/esslli/proc.ps.gz}, ABSTRACT = {The distribution of center self-embeddings and extrapositions in German is assumed to minimize memory load during parsing. Self-embedded relative clauses were semi-automatically analysed in a treebank of German newspaper texts. Clause length and especially extraposition distance are found as the main distinctive parameters.}, ANNOTE = {COLIURL : Korthals:2001:SER.pdf Korthals:2001:SER.ps} } @Article{Krieger:2001, AUTHOR = {Krieger, Hans-Ulrich}, TITLE = {Greatest Model Semantics for Typed Feature Structures}, YEAR = {2001}, JOURNAL = {Grammars}, VOLUME = {4}, NUMBER = {2}, PAGES = {139-165}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/2001_krieger_grammars.entry} } @InProceedings{Kruijff:2001, AUTHOR = {Kruijff, Geert-Jan M.}, TITLE = {Categorial-Hybrid Logical Grammar}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 13th Amsterdam Colloquium, December 17-19}, PAGES = {138-143}, EDITOR = {Van Rooy, Robert and Stokhof, Martin}, ADDRESS = {Amsterdam} } @InCollection{Kruijff_Kruijff-Korbayová:2001, AUTHOR = {Kruijff, Geert-Jan M. and Korbayova, Ivana}, TITLE = {A Hybrid Logic Formalization of Information Structure Sensitive Discourse Interpretation}, YEAR = {2001}, BOOKTITLE = {Text, Speech and Dialogue, 4th International Conference, TSD 2001, Zelezna Ruda, Czech Republic, September 11-13}, VOLUME = {2166}, PAGES = {31-38}, EDITOR = {Matousek, Václav and Mautner, Pavel and Moucek, Roman and Tauser, Karel}, SERIES = {Lecture Notes in Artificial Intelligence}, ADDRESS = {Berlin}, PUBLISHER = {Springer}, URL = {https://www.coli.uni-saarland.de/~korbay/Publications/tsd01.ps.gz}, ANNOTE = {COLIURL : Kruijff:2001:HLF.pdf Kruijff:2001:HLF.ps} } @InProceedings{Kruijff_et_al:2001, AUTHOR = {Kruijff, Geert-Jan M. and Korbayova, Ivana and Bateman, John and Teich, Elke}, TITLE = {Linear Order as Higher-Level Decision: Information Structure in Strategic and Tactical Generation}, YEAR = {2001}, BOOKTITLE = {8th European Workshop on Natural Language Generation (ACL/EACL 2001 Workshop), July 6-7}, PAGES = {74-83}, EDITOR = {Horacek, Helmut}, ADDRESS = {Toulouse, France}, URL = {https://www.coli.uni-saarland.de/~korbay/Publications/enlg-01.ps.gz https://www.coli.uni-saarland.de/~korbay/Publications/enlg-01.pdf}, ANNOTE = {COLIURL : Kruijff:2001:LOH.pdf Kruijff:2001:LOH.ps} } @InProceedings{Kruijff-Korbayová:2001, AUTHOR = {Korbayova, Ivana}, TITLE = {Information Structure and the Semantics of otherwise}, YEAR = {2001}, BOOKTITLE = {Information Structure, Discourse Structure and Discourse Semantics, ESSLLI 2001 Workshop Proceedings, August 20-24}, PAGES = {61-78}, EDITOR = {Korbayova, Ivana and Steedman, Mark}, ADDRESS = {Helsinki, Finland}, PUBLISHER = {The University of Helsinki}, URL = {https://www.coli.uni-saarland.de/~korbay/esslli01-wsh/Proceedings/24-Korbay-Webber.ps.gz}, ANNOTE = {COLIURL : Kruijff-Korbayova:2001:ISS.pdf Kruijff-Korbayova:2001:ISS.ps} } @Article{Kruijff-Korbayová:2001_1, AUTHOR = {Korbayova, Ivana}, TITLE = {Review of: McCawley, James D.: The Syntactic Phenomena of English (Second Edition). Chicago University Press.}, YEAR = {2001}, JOURNAL = {Journal of Logic, Language and Information}, VOLUME = {10}, NUMBER = {2}, PAGES = {263-266} } @Proceedings{Ivana_Mark:2001, TITLE = {Information Structure, Discourse Structure and Discourse Semantics. ESSLLI 2001 Workshop Proceedings, August 20-24}, YEAR = {2001}, EDITOR = {Korbayova, Ivana and Steedman, Mark}, ADDRESS = {Helsinki, Finland}, PUBLISHER = {The University of Helsinki} } @InProceedings{Kruijff-Korbayová_Webber:2001, AUTHOR = {Korbayova, Ivana and Webber, Bonnie}, TITLE = {Concession, Implicature, and Alternative Sets}, YEAR = {2001}, BOOKTITLE = {4th International Workshop on Computational Semantics (IWCS-4), January 10-12}, PAGES = {227-248}, EDITOR = {Bunt, Harry}, ADDRESS = {Tilburg, The Netherlands}, URL = {https://www.coli.uni-saarland.de/~korbay/Publications/iwcs-2001.ps.gz}, ANNOTE = {COLIURL : Kruijff-Korbayova:2001:CIA.pdf Kruijff-Korbayova:2001:CIA.ps} } @TechReport{Lerner:2001, AUTHOR = {Lerner, Jan}, TITLE = {Anaphern und Quantoren im elliptischen Rekonstruktionsverfahren}, YEAR = {2001}, MONTH = {December}, NUMBER = {115}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, ABSTRACT = {Man kann die VP-Ellipse als rein semantisches Phänomen auffassen. Das bedeutet, daß man für die elidierte VP ein Denotat durch Zugriff auf die Bedeutung des Antezedens-Satzes bekommt. Einer zweiten Auffassung zufolge ist eine elliptische Konstruktion eine syntaktische Struktur, die implizites, d.h. phonetisch nicht realisiertes Material enthält. Unsere Arbeit besteht aus einem kritischen und einem konstruktiven Teil. Im kritischen Teil erläutern wir an konkreten Problemen die Lösungen, die bestimmte Theorien bieten können. Im konstruktiven Teil entwickeln wir eine Theorie, die die Idee aufgibt, daß Sätze mit VP-Ellipse Strukturen enthalten, die bis auf phonetisch nicht realisiertes Material vollständig sind. Wir nehmen an, daß diese Sätze interpretiert werden müssen. Der Rekonstruktionsprozeß findet sowohl auf der syntaktischen als auch auf der semantischen Ebene statt. Zuerst wird eine syntaktische Struktur rekonstruiert, die bezüglich der Skopushierarchie zwischen Quantoren und bezüglich der Koreferenz-Beziehungen nicht determiniert ist. Daraus wird eine semantische Proto-Repräsentation abgeleitet, die semantisch unterspezifiziert ist. Die semantische Ergänzung dieser Struktur erfolgt durch Regeln, die Parallelität zwischen dem Antezedens-Satz und dem elidierten Satz gewährleisten. Unsere Theorie ist auch auf Sachverhaltsanaphorik und auf Konstruktionen mit fokussierenden Gradpartikeln anwendbar.}, NOTE = {in collaboration with Petra Dünges} } @InCollection{Mohri_Nederhof:2001, AUTHOR = {Mohri, Mehryar and Nederhof, Mark-Jan}, TITLE = {Regular Approximation of Context-Free Grammars through Transformation}, YEAR = {2001}, BOOKTITLE = {Robustness in Language and Speech Technology}, PAGES = {153--163}, EDITOR = {Junqua, Jean-Claude and van Noord, Gertjan}, ADDRESS = {Dordrecht}, PUBLISHER = {Kluwer Academic Publishers}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof01b.ps.gz}, ABSTRACT = {We present an algorithm for approximating context-free languages with regular languages. The algorithm is based on a simple transformation that applies to any context-free grammar and guarantees that the result can be compiled into a finite automaton. The resulting grammar contains at most one new nonterminal for any nonterminal symbol of the input grammar. The result thus remains readable and if necessary modifiable. We extend the approximation algorithm to the case of weighted context-free grammars. We also report experiments with several grammars showing that the size of the minimal deterministic automata accepting the resulting approximations is of practical use for applications such as speech recognition.}, ANNOTE = {COLIURL : Mohri:2001:RAC.pdf Mohri:2001:RAC.ps} } @Article{Müller_et_al:2001, AUTHOR = {Müller, Martin and Niehren, Joachim and Treinen, Ralf}, TITLE = {The First-Order Theory of Ordering Constraints over Feature Trees}, YEAR = {2001}, JOURNAL = {Discrete Mathematics and Theoretical Computer Science}, VOLUME = {4}, NUMBER = {2}, PAGES = {193-234}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/FTSubTheory-98.ps.gz}, ABSTRACT = {The system FT$_leq$ of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. We investigate the first-order theory of FT$_leq$ and its fragments in detail, both over finite trees and over possibly infinite trees. We prove that the first-order theory of FT$_leq$ is undecidable, in contrast to the first-order theory of FT which is well-known to be decidable. We show that the entailment problem of FT$_leq$ with existential quantification is PSPACE-complete. So far, this problem has been shown decidable, coNP-hard in case of finite trees, PSPACE-hard in case of arbitrary trees, and cubic time when restricted to quantifier-free entailment judgments. To show PSPACE-completeness, we show that the entailment problem of FT$_leq$ with existential quantification is equivalent to the inclusion problem of non-deterministic finite automata.}, ANNOTE = {COLIURL : Muller:2001:FOT.pdf} } @InCollection{Müller:2001, AUTHOR = {Müller, Stefan}, TITLE = {Case in German - Towards an HPSG-Analysis}, YEAR = {2001}, BOOKTITLE = {Constraint-Based Approaches to Germanic Syntax}, VOLUME = {7}, PAGES = {217-255}, EDITOR = {Kiss, Tibor and Meurers, Detmar}, SERIES = {Studies in Constraint-Based Lexicalism}, ADDRESS = {Stanford}, PUBLISHER = {CSLI}, URL = {http://www.dfki.de/~stefan/PS/csli-case.ps.gz}, ABSTRACT = {In Tibor Kiss and Detmar Meurers (Eds): Constraint-based Approaches to Germanic Syntax, Studies in Constraint-Based Lexicalism, No. 7. Stanford: CSLI-Publications, pages 217-255. The case theory that is developed in the paper builds on work done by Heinz and Matiasek (1994). Their approach is improved in such a way that case assignent in coherent constructions like (1) works properly. (1) Er sieht den Mann den Wagen reparieren. he sees the manacc the caracc repair 'He sees the man repairing the car.' With the type hierarchy of Heinz and Matiasek it is impossible to describe the phenomenon Kongruenzkasus. Sentences like (2) and (3) cannot be analyzed. (2) a. Sie nannte ihn einen Lügner. She called himacc a liaracc b. Er wurde ein Lügner genannt. henom was a liarnom called 'He was called a liar.' (3) a. Ich sehe ihn als meinen Freund an. I see himacc as my friendacc PRFX 'I regard him as my friend.' b. Er wird als mein Freund angesehen. In the paper, I propose a more structured case feature and appropriate lexical entries to analyze these sentences. Apart from that it is explained how the case assignment in adjectival and participal environments works and the case assignment to non-realized subjects as in (4) will be explaind. (4) Ich habe den Männern erlaubt, einer nach dem anderen wegzulaufen.}, ANNOTE = {COLIURL : Muller:2001:CGT.pdf Muller:2001:CGT.ps} } @InProceedings{Nederhof:2001, AUTHOR = {Nederhof, Mark-Jan}, TITLE = {Approximating Context-Free by Rational Transduction for Example-Based MT}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 39th Annual Meeting and 10th Conference of the European Chapter, Workshop proceedings: Data-Driven Machine Translation, July 5-11}, PAGES = {25-32}, ADDRESS = {Toulouse, France}, PUBLISHER = {Morgan Kaufmann Publishers}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof01.ps.gz}, ABSTRACT = {Existing studies show that a weighted context-free transduction of reasonable quality can be effectively learned from examples. This paper investigates the approximation of such transduction by means of weighted rational transduction. The advantage is increased processing speed, which benefits real-time applications involving spoken language.}, ANNOTE = {COLIURL : Nederhof:2001:ACFa.pdf Nederhof:2001:ACFa.ps} } @InProceedings{Nederhof:2001_1, AUTHOR = {Nederhof, Mark-Jan}, TITLE = {Approximating Context-Free by Rational Transduction for Example-Based MT}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 39th Annual Meeting and 10th Conference of the European Chapter, Workshop proceedings: Data-Driven Machine Translation, July 5-11}, PAGES = {25-32}, EDITOR = {ACL}, ADDRESS = {Toulouse, France}, PUBLISHER = {Morgan Kaufmann Publishers}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof01.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof01.entry}, ANNOTE = {COLIURL : Nederhof:2001:ACF.pdf Nederhof:2001:ACF.ps} } @InCollection{Neumann:2001, AUTHOR = {Neumann, Günter}, TITLE = {Informationsextraktion}, YEAR = {2001}, BOOKTITLE = {Computerlinguistik und Sprachtechnologie - Eine Einführung}, PAGES = {448-455}, EDITOR = {Klabunde, R.}, ADDRESS = {Heidelberg}, PUBLISHER = {Spektrum Akademischer Verlag}, URL = {http://www.dfki.de/~neumann/publications/new-ps/ie.pdf}, ANNOTE = {COLIURL : Neumann:2001:I.pdf} } @InProceedings{Neumann_Declerck:2001, AUTHOR = {Neumann, Günter and Declerck, Thierry}, TITLE = {Domain Adaptive Information Extraction}, YEAR = {2001}, BOOKTITLE = {Proceedings of the International Workshop on Innovative Language Technology and Chinese Information Processing (ILT & CIP '01), April}, ADDRESS = {Shanghai}, URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/smes-shanghai2001.ps.gz}, ANNOTE = {COLIURL : Neumann:2001:DAI.pdf Neumann:2001:DAI.ps} } @InProceedings{Oliva:2001, AUTHOR = {Oliva, Karel}, TITLE = {Nekteré aspekty komplexity ceského slovního neporádku (Some Aspects of the Complexity of Word Disorder in Czech)}, YEAR = {2001}, BOOKTITLE = {Ceština - univerzália a specifika 3 (sborník konference v Brne 16-18.11.2000)}, ADDRESS = {Brno} } @InCollection{Pinkal:2001, AUTHOR = {Pinkal, Manfred}, TITLE = {Geleitwort}, YEAR = {2001}, BOOKTITLE = {Computerlinguistik und Sprachtechnologie - Eine Einführung}, PAGES = {v}, EDITOR = {Klabunde, R. and Carstensen, K.-U. and Ebert, Ch. and Enriss, D. and Jekat, S. and Langer, H.}, ADDRESS = {Heidelberg}, PUBLISHER = {Spektrum Akademischer Verlag} } @InProceedings{Prescher:2001, AUTHOR = {Prescher, Detlef}, TITLE = {Novel Properties and Well-Tried Performance of EM-Based Multivariate Clustering}, YEAR = {2001}, BOOKTITLE = {Proceedings of the EuroConference on Recent Advances in Natural Language Processing (RANLP-01), September 5-7}, PAGES = {216-222}, ADDRESS = {Tzigov Chark, Bulgaria}, URL = {http://www.dfki.de/~prescher/papers/bib/2001ranlp.prescher.pdf}, ABSTRACT = {We present three novel properties for EM-based multivariate clustering: simplified re-estimation formulas, a simple pruning technique, and a novel invariance property preserving the characteristics of the given empirical distribution. Evaluation on two tasks shows: EM-based multivariate clustering models require only twice the storage space of the original sample, and these models yield reliable estimates for unknown data. Moreover we refer to selected experiments showing that EM-based multivariate clustering improves several real-world applications.}, ANNOTE = {COLIURL : Prescher:2001:NPW.pdf} } @TechReport{Prescher:2001_1, AUTHOR = {Prescher, Detlef}, TITLE = {Inside-Outside Estimation Meets Dynamic EM - GOLD}, YEAR = {2001}, NUMBER = {RR-01-02}, ADDRESS = {Saarbrücken}, TYPE = {Research Report}, INSTITUTION = {DFKI}, URL = {http://www.dfki.de/~prescher/papers/bib/2001dfki_report.prescher.pdf}, ABSTRACT = {It is an interesting fact that most of the stochastic models used by linguists can be interpreted as probabilistic context-free grammars. In this paper, this result will be accompanied by the formal proof that the inside-outside algorithm, the standard training method for probabilistic context-free grammars, can be regarded as a dynamic-programming variant of the EM algorithm. Even if this result is considered in isolation this means that most of the probabilistic models used by linguists are trained by a version of the EM algorithm. However, this result is even more interesting when considered in a theoretical context because the well-known convergence behavior of the inside-outside algorithm has been confirmed by many experiments but it seems that it never has been formally proved. Furthermore, being a version of the EM algorithm, the inside-outside algorithm also inherits the good convergence behavior of EM. We therefore contend that the as yet imperfect line of argumentation can be transformed into a coherent proof.}, ANNOTE = {COLIURL : Prescher:2001:IOEa.pdf} } @InProceedings{Prescher:2001_2, AUTHOR = {Prescher, Detlef}, TITLE = {Inside-Outside Estimation Meets Dynamic EM}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 7th International Workshop on Parsing Technologies (IWPT-01), October 17-19}, PAGES = {241-244}, ADDRESS = {Beijing, China}, URL = {http://www.dfki.de/~prescher/papers/bib/2001iwpt.prescher.pdf}, ABSTRACT = {It is an interesting fact that most of the stochastic models used by linguists can be interpreted as probabilistic context-free grammars. In this paper, this result will be accompanied by the formal proof that the inside-outside algorithm, the standard training method for probabilistic context-free grammars, can be regarded as a dynamic-programming variant of the EM algorithm. Even if this result is considered in isolation this means that most of the probabilistic models used by linguists are trained by a version of the EM algorithm. However, this result is even more interesting when considered in a theoretical context because the well-known convergence behavior of the inside-outside algorithm has been confirmed by many experiments but it seems that it never has been formally proved. Furthermore, being a version of the EM algorithm, the inside-outside algorithm also inherits the good convergence behavior of EM. We therefore contend that the as yet imperfect line of argumentation can be transformed into a coherent proof.}, ANNOTE = {COLIURL : Prescher:2001:IOEb.pdf} } @Article{Pützer:2001, AUTHOR = {Pützer, Manfred}, TITLE = {Multiparametrische Stimmqualitäts-erfassung männlicher und weiblicher Normalstimmen}, YEAR = {2001}, JOURNAL = {Folia Phoniatr. Logop.}, VOLUME = {53}, PAGES = {73-84} } @Article{Pützer_et_al:2001, AUTHOR = {Pützer, Manfred and Erriquez, Attilio and Barry, William J. and Just, Manfred}, TITLE = {Differenzierte Stimmprofile zur männlichen und weiblichen Normalstimme}, YEAR = {2001}, JOURNAL = {Aktuelle phoniatrisch-pädaudiologische Aspekte}, VOLUME = {8}, PAGES = {71-75} } @InProceedings{Pützer_et_al:2001_1, AUTHOR = {Pützer, Manfred and Erriquez, Attilio and Barry, William J. and Just, Manfred}, TITLE = {Differenzierte Stimmprofile zur männlichen und weiblichen Normalstimme}, YEAR = {2001}, BOOKTITLE = {17. Wissenschaftliche Jahrestagung der Deutschen Gesellschaft für Phoniatrie und Pädaudiologie, 6.-8. Oktober}, ADDRESS = {Tübingen, Germany} } @Book{Pützer_et_al:2001_2, AUTHOR = {Pützer, Manfred and Till, Adolphe and Helleringer, Julien}, TITLE = {Wörterbuch der Mundart von St. Avold. Dictionnaire du parler francique de Saint-Avold}, YEAR = {2001}, ADDRESS = {Metz, France}, PUBLISHER = {Édition Serpenoise} } @InProceedings{Schröder:2001, AUTHOR = {Schröder, Marc}, TITLE = {Emotional Speech Synthesis - A Review}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 7th European Conference on Speech Communication and Technology (EUROSPEECH'01)}, VOLUME = {1}, PAGES = {561-564}, EDITOR = {Dalsgaard, Paul and Lindberg, Borge and Benner, Henrik}, ADDRESS = {Aalborg}, PUBLISHER = {Kommunik Grafiske Losninger A/S}, URL = {http://www.dfki.de/~schroed/articles/schroeder2001.pdf}, ABSTRACT = {Attempts to add emotion effects to synthesised speech have existed for more than a decade now. Several prototypes and fully operational systems have been built based on different synthesis techniques, and quite a number of smaller studies have been conducted. This paper aims to give an overview of what has been done in this field, pointing out the inherent properties of the various synthesis techniques used, summarising the prosody rules employed, and taking a look at the evaluation paradigms. Finally, an attempt is made to discuss interesting directions for future development.}, ANNOTE = {COLIURL : Schroder:2001:ESS.pdf} } @InProceedings{Schröder_et_al:2001, AUTHOR = {Schröder, Marc and Cowie, Roddy and Douglas-Cowie, Ellen and Westerdijk, Machiel and Gielen, Stan}, TITLE = {Acoustic Correlates of Emotion Dimensions in View of Speech Synthesis}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 7th European Conference on Speech Communication and Technology (EUROSPEECH'01)}, VOLUME = {1}, PAGES = {87--90}, EDITOR = {Dalsgaard, Paul and Lindberg, Borge and Benner, Henrik}, ADDRESS = {Aalborg}, PUBLISHER = {Kommunik Grafiske Losninger A/S}, URL = {http://www.dfki.de/~schroed/articles/schroeder_etal2001.pdf}, ABSTRACT = {In a database of emotional speech, dimensional descriptions of emotional states have been correlated with acoustic variables. Many stable correlations have been found. The predictions made by linear regression widely agree with the literature. The numerical form of the description and the choice of acoustic variables studied are particularly well suited for future implementation in a speech synthesis system, possibly allowing for the expression of gradual emotional states.}, ANNOTE = {COLIURL : Schroder:2001:ACE.pdf} } @InProceedings{Schröder_Trouvain:2001, AUTHOR = {Schröder, Marc and Trouvain, Jürgen}, TITLE = {The German Text-to-Speech Synthesis System MARY: A Tool for Research, Development and Teaching}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 4th ISCA Tutorial and Research Workshop on Speech Synthesis, August 29 - September 1}, PAGES = {131-136}, ADDRESS = {Perthshire, Scotland}, URL = {http://www.ssw4.org/papers/112.pdf}, ABSTRACT = {The German Text-to-Speech Synthesis system Mary is presented. An interface allowing to access and modify intermediate processing steps without the need for a technical understanding of the system is described, along with examples of how this interface can be put to use in research, development and teaching.}, ANNOTE = {COLIURL : Schroder:2001:GTS.pdf Schroder:2001:GTS.ps} } @InCollection{Schulte im Walde_et_al:2001, AUTHOR = {Schulte im Walde, Sabine and Schmid, Helmut and Rooth, Mats and Riezler, Stefan and Prescher, Detlef}, TITLE = {Statistical Grammar Models and Lexicon Acquisition}, YEAR = {2001}, BOOKTITLE = {Linguistic Form and its Computation}, ADDRESS = {Stanford}, PUBLISHER = {CSLI Publications}, URL = {http://www.dfki.de/~prescher/papers/bib/2001csli.schulte_im_walde.schmid.rooth.riezler.prescher.pdf}, ANNOTE = {COLIURL : Walde:2001:SGM.pdf} } @InCollection{Siegel_Scherf:2001, AUTHOR = {Siegel, Melanie and Scherf, Oliver}, TITLE = {Nihongo Keitaiso Kaiseki (Analysis of Japanese Morphology)}, YEAR = {2001}, BOOKTITLE = {Gengogaku to Nihongo Kyooiku -Jitsuyooteki Gengo Kenkyuu no Koochiku o Mezashite (Linguistics and Japanese Language Education - Aiming at Constructing Practical Theoies of Linguistics)}, ADDRESS = {Tokyo, Japan}, PUBLISHER = {Kurosio Shuppan}, URL = {http://www.dfki.de/~siegel/jap-mor.doc}, ANNOTE = {COLIURL : Siegel:2001:NKK.pdf} } @InProceedings{Siegel_et_al:2001, AUTHOR = {Siegel, Melanie and Xu, Feiyu and Neumann, Günter}, TITLE = {Customizing GermaNet for the Use in Deep Linguistic Processing}, YEAR = {2001}, BOOKTITLE = {Workshop on WordNet and Other Lexical Resources: Applications, Extensions and Customizations. 2nd Meeting of the North American Chapter of the Association for Computational Linguistics (NAACL '01), June 2-7}, PAGES = {165-167}, ADDRESS = {Pittsburgh, Philadelphia, USA}, URL = {http://www.dfki.de/~siegel/short-Naacl2001.doc http://www.dfki.uni-sb.de/~feiyu/NAACL2001.pdf}, ANNOTE = {COLIURL : Siegel:2001:CGU.pdf} } @InProceedings{Steedman_Kruijff-Korbayová:2001, AUTHOR = {Steedman, Mark and Korbayova, Ivana}, TITLE = {Introduction: Two dimensions of Information Structure in Relation to Discourse Structure and Discourse Semantics}, YEAR = {2001}, BOOKTITLE = {Information Structure, Discourse Structure and Discourse Semantics, ESSLLI 2001 Workshop Proceedings, August 20-24}, PAGES = {1-6}, EDITOR = {Korbayova, Ivana and Steedman, Mark}, ADDRESS = {Helsinki, Finland}, PUBLISHER = {The University of Helsinki}, URL = {https://www.coli.uni-saarland.de/~korbay/esslli01-wsh/Proceedings/proc-for-cdrom.pdf}, ANNOTE = {COLIURL : Steedman:2001:ITD.pdf} } @InProceedings{Striegnitz:2001, AUTHOR = {Striegnitz, Kristina}, TITLE = {Model Checking for Contextual Reasoning in NLG}, YEAR = {2001}, BOOKTITLE = {Proceedings of Inference in Computational Semantics (ICoS-3), June 18-23}, PAGES = {101-115}, EDITOR = {Blackburn, Patrick and Kohlhase, Michael}, ADDRESS = {Siena, Italy}, URL = {https://www.coli.uni-saarland.de/cl/projects/indigen/papers/icos3.ps.gz}, ABSTRACT = {Presupposition triggers, such as e.g. 'the', 'too', 'another', impose constraints on the context they are used in. A violation of these constraints results in an infelicitous utterance. A natural language generation system therefore has to reason on the context to check that they are satisfied. We argue that this kind of contextual reasoning is essentially a model checking task and demonstrate this for a variety of presupposition triggers. To account for the influence of some background knowledge, we propose to embed queries to a description logic knowledge base in a first order model checking algorithm.}, ANNOTE = {COLIURL : Striegnitz:2001:MCC.pdf Striegnitz:2001:MCC.ps} } @Proceedings{Kristina:2001, TITLE = {Proceedings of the ESSLLI'01 Student Session, August 13-24}, YEAR = {2001}, EDITOR = {Striegnitz, Kristina}, ADDRESS = {Helsinki, Finland}, URL = {https://www.coli.uni-saarland.de/~kris/esslli/proc.ps.gz}, ANNOTE = {COLIURL : Striegnitz:2001:PES.pdf Striegnitz:2001:PES.ps} } @Article{Sturt_et_al:2001, AUTHOR = {Sturt, Patrick and Pickering, Martin J. and Scheepers, Christoph and Crocker, Matthew W.}, TITLE = {The Preservation of Structure in Language Comprehension: Is Reanalysis the last Resort?}, YEAR = {2001}, JOURNAL = {Journal of Memory and Language}, VOLUME = {45}, PAGES = {283-307} } @InProceedings{Teich_Hansen:2001, AUTHOR = {Teich, Elke and Hansen, Silvia}, TITLE = {Towards an integrated representation of multiple layers of linguistic annotation in multilingual corpora}, YEAR = {2001}, BOOKTITLE = {Online Proceedings of Computing Arts 2001: Digital Resources for Research in the Humanities, September 26-28}, ADDRESS = {Sydney, Australia}, URL = {https://www.coli.uni-saarland.de/~hansen/hansen_teich.pdf}, ANNOTE = {COLIURL : Teich:2001:TIR.pdf} } @InProceedings{Teich_et_al:2001, AUTHOR = {Teich, Elke and Hansen, Silvia and Fankhauser, Peter}, TITLE = {Representing and querying multi-layer annotated corpora}, YEAR = {2001}, BOOKTITLE = {Proceedings of IRCS Workshop on Linguistic Databases 2001, December 11-13}, EDITOR = {Bird, Steven and Buneman, Peter and Liberman, Mark}, ADDRESS = {University of Pennsylvania, Philadelphia, USA}, URL = {https://www.coli.uni-saarland.de/~hansen/teich-etal.pdf}, ABSTRACT = {The goal of the present paper is to review the methods employed in multi-layer corpus representation and querying and to identify the more fundamental issues involved in the task. Asking questions such as: What are the linguistic requirements on multi-layer corpora? Do the data structures commonly employed mirror the needs of linguistic representation appropriately? Should different layers of annotation be kept separate, or should and can they be merged? How and at which granularity can we align/integrate multiple layers of annotation? If expressively more powerful data structures than trees/forests are required, then what kinds of mechanisms are needed to query such data structures?, we propose an XML-based approach to the representation and querying of multi-layer corpora.}, ANNOTE = {COLIURL : Teich:2001:RQM.pdf} } @InProceedings{Trouvain:2001, AUTHOR = {Trouvain, Jürgen}, TITLE = {Phonetic Aspects of Speech-Laughs''}, YEAR = {2001}, BOOKTITLE = {Conference on Orality & Gestuality (ORAGE), June 18-22}, PAGES = {634-639}, ADDRESS = {Aix-en-Provence, France}, ABSTRACT = {This study examines laughter co-occurring speech, so-called speech-laughs in a corpus of German spontaneous dialogues. Against a common expectation the majority of labelled laughs are speech-laughs. The phonetic characteristics for this type of laughter is an additional aspiration (different for voiced and unvoiced sounds) which is sometimes accompanied by a vibrato voice quality and a duration of two syllables. In a perception test the hypothesis of an acoustic continuum from smile to laugh has been rejected. The results and the problems are discussed in the context of paralinguistic phonetics.}, ANNOTE = {COLIURL : Trouvain:2001:PAS.pdf Trouvain:2001:PAS.ps} } @InProceedings{Trouvain_et_al:2001, AUTHOR = {Trouvain, Jürgen and Koreman, Jacques and Erriquez, Attilio}, TITLE = {Articulation Rate Measures and their Relations to Phone Classification of Spontaneous and Read German Speech}, YEAR = {2001}, BOOKTITLE = {ISCA Workshop on ``Adaptation Methods for Speech Recognition'', August 29-30}, PAGES = {150-158}, ADDRESS = {Sophia Antipolis, France}, URL = {https://www.coli.uni-saarland.de/~trouvain/trouvain_et_al_01.ps.gz}, ABSTRACT = {This paper evaluates articulation rate measures and rate characteristics of read and spontaneous speech on the basis of a manually labelled database for German. The results of phone classification experiments for three different articulation rates only partially confirm our expectations. Phonetic explanations are suggested.}, ANNOTE = {COLIURL : Trouvain:2001:ARM.pdfTrouvain:2001:ARM.ps} } @InCollection{Uszkoreit:2001, AUTHOR = {Uszkoreit, Hans}, TITLE = {Die Email-Flut bannen - Kostensenkung im Call Center}, YEAR = {2001}, BOOKTITLE = {TeleMedienServices Jahrbuch 2001. Service im Dialog}, EDITOR = {DDV}, ADDRESS = {Würzburg}, PUBLISHER = {Max Schimmel Verlag}, URL = {http://www.uszkoreit.net/erm_hu.pdf}, ABSTRACT = {In diesem Artikel werden Möglichkeiten der Kostensenkung im Call Center beschrieben1. Dabei liegt der Schwerpunkt auf Methoden und Technologien, die im Customer Relationship Management dabei helfen, das rapide anwachsende Email-Volumen zu bewältigen, ohne dass die Service-Qualität unter der Teilautomatisierung leidet. Es wird demonstriert, dass Fortschritte in der Automatisierung nur erreichbar sind, wenn neueste Methoden der Sprachtechnologie eingesetzt werden. Nahezu alle Softwareprodukte für das Email-Response Management (ERM), die heute auf dem Markt sind, nutzen die jüngsten Fortschritte in der Sprachtechnologie gar nicht oder nur sehr unzureichend aus.}, ANNOTE = {COLIURL : Uszkoreit:2001:EFB.pdf} } @InProceedings{van Genabith_et_al:2001, AUTHOR = {van Genabith, Josef and Frank, Anette and Way, Andy}, TITLE = {Treebank vs. X-bar based Automatic F-Structure Annotation}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 6th International Lexical Functional Grammar Conference (LFG'01), June 25-27}, EDITOR = {Butt, Miriam and Holloway King, Tracy}, ADDRESS = {Hong Kong}, PUBLISHER = {CSLI Online Publications}, URL = {http://csli-publications.stanford.edu/LFG/6/lfg01genabithfrankway.pdf}, ABSTRACT = {Manual, large scale (computational) grammar development is time consuming, expensive and requires lots of linguistic expertise. More recently, a number of alternatives based on treebank resources (such as Penn-II, Susanne, AP treebank) have been explored. The idea is to automatically “induce” or rather read off (P)CFG grammars from the parse annotated treebank resources and to use the treebank grammars thusobtained in (probabilistic) parsing or as a starting point for further grammar development. The approach is cheap, fast, automatic, large scale, “data driven” and based on real language resources. Treebankgrammars typically involve large sets of lexical tags and non-lexical categories as syntactic informationtends to be encoded in monadic category symbols. They feature flat rules (trees) that can “underspecify” attachment possibilities. Treebank grammars do not in general follow Xbar architectural design principles (this is not to say that treebank grammars do not have design principles). As a consequence, treebank grammars tend to have very large CFG rule bases (e.g. Penn-II > 17,000 CFG rules for about 1 million words of text) with often only minimally differing rules. Even though treebank grammars are large, they are still incomplete, exhibiting unabated rule accession rates. From a grammar engineering point of view, the size of the rule base poses problems for maintainability, extendability and, if a treebank grammar is to be used as a CF-base in a LFG grammar, for functional (feature-structure) annotations. From the point of view of theoretical linguistics, flat treebank trees and treebank grammars extracted from such trees do not express linguistic generalisations. From the perspective of empirical and corpus linguistics, flat trees are well-motivated as they allow underspecification of subtle and often time consuming attachment decisions. Indeed, it is sometimes doubted whether highly general Xbar schemata usefully scale to “real” language. In previous work we developed methodologies for automatic feature-structure annotation of grammars extracted from treebanks. Automatic annotation of “raw” treebank grammars is difficult as annotation rules often need to identify subsequences in the RHSs of flat treebank rules as they explicitly encode head, complement and modifier relations. Xbar-based CFG rules should substantially facilitate automatic feature-structure annotation of grammar rules. In the present paper we conduct a number of experiments to explore a space of possible grammars based on a small fragment of the AP treebank resource. Starting with the original treebank fragment we automatically extract a CFG G. We then apply an automatic structure preserving grammar compaction step which generalises categories in the original treebank fragment and reduces the number of rules extracted, resulting in a generalised treebank fragment and in a compacted grammar Gc. The generalised fragment is then manually corrected to catch missed constituents (and the like) resulting in an automatically extracted, compacted and (effectively manually) corrected grammar Gc;m. Manual correction proceeds in the “spirit” of treebank grammars (we do not introduce Xbar analyses). We then explore how many of the manual correction steps on treebank trees can be achieved automatically. We develop, implement and test an automatic treebank “grooming” methodology which is applied to the generalised treebank fragment to yield a compacted and automatically corrected grammar Gc;a. Grammars Gc;m and Gc;a are very similar to compiled out “flat” LFG-82 style grammars. We explore regular expression based compaction (both manual and automatic) to relate Gc;m to a LFG-82 style grammar design. Finally, we manually recode a subsection of the generalised and manually corrected treebank fragment into “vanilla-flavour” Xbar based trees. From these we extract a compacted, manually corrected, Xbar-based grammar Gc;m;x. We evaluate our grammars and methods using standard labelled bracketing measures and according to how well they perform under automatic feature-structure annotation tasks.}, ANNOTE = {COLIURL : Genabith:19xx:TVX.pdf} } @InProceedings{Vasishth:2001, AUTHOR = {Vasishth, Shravan}, TITLE = {An Empirical Evaluation of Sentence Processing Models: Center Embeddings in Hindi}, YEAR = {2001}, BOOKTITLE = {Working Papers in Linguistics}, VOLUME = {56}, PAGES = {159-181}, EDITOR = {Daniels, Michael and Dowty, David and Feldman, Anna and Metcalf, Vanessa}, PUBLISHER = {Ohio State University}, URL = {ftp://ftp.ling.ohio-state.edu/pub/Students/Vasishth/Published/OSUWPLVol56-2001/submission1.ps}, ANNOTE = {COLIURL : Vasishth:2001:EES.pdf Vasishth:2001:EES.ps} } @InProceedings{Vasishth:2001_1, AUTHOR = {Vasishth, Shravan}, TITLE = {Quantificational Elements and Polarity Licensing in Japanese}, YEAR = {2001}, BOOKTITLE = {Japanese/Korean Linguistics}, VOLUME = {9}, EDITOR = {Nakayama, Mineharu and Quinn, Charles J. Jr.}, PUBLISHER = {CSLI Publications}, URL = {ftp://ftp.ling.ohio-state.edu/pub/Students/Vasishth/Published/JapaneseKorean1999/jk99.html}, ANNOTE = {COLIURL : Vasishth:2001:QEP.pdf} } @InProceedings{Vasishth_Kruijff:2001, AUTHOR = {Vasishth, Shravan and Kruijff, Geert-Jan M.}, TITLE = {Processing as Abduction: A Sentence Processing Model}, YEAR = {2001}, BOOKTITLE = {Working Papers in Linguistics}, VOLUME = {56}, PAGES = {183-207}, EDITOR = {Daniels, Michael and Dowty, David and Feldman, Anna and Metcalf, Vanessa}, PUBLISHER = {Ohio State University}, URL = {ftp://ftp.ling.ohio-state.edu/pub/Students/Vasishth/Published/OSUWPLVol56-2001/submission2.ps}, ANNOTE = {COLIURL : Vasishth:2001:PAS.pdf Vasishth:2001:PAS.ps} } @InProceedings{Yao_et_al:2001, AUTHOR = {Yao, Tianfang and Xu, Feiyu and Zhang, Dong-Mo and Li, Fang and Wang, Qian and Sheng, Huan-Ye}, TITLE = {A Multilingual Information Retrieval Model based on Information Extraction and Text Generation}, YEAR = {2001}, BOOKTITLE = {Proceedings of ICIP 2001}, ADDRESS = {Shanghai}, URL = {http://www.dfki.de/~feiyu/YaoXu2001.pdf}, ABSTRACT = {This paper proposes a multilingual information retrieval model which is principally based on information extraction and text generation techniques. The model embodies both the conciseness and accuracy of the retrieval results provided by information extraction technique, and the coherence and standardization of ones supplied by text generation technique. It synthesizes the advantages of both techniques. In this paper, we mainly present the information extraction techniques adopted in the model, including multilingual information extraction, concept based multilingual thesaurus, template automatic development, multilingual information retrieval and index etc. We build the model for providing the multilingual information retrieval means on Internet, which is accurate, quick and convenient and is used in a specific domain. Key words multilingual information retrieval, multilingual information extraction, concept based multilingual thesaurus, template automatic development, multilingual information retrieval and index.}, ANNOTE = {COLIURL : Yao:2001:MIR.pdf} } @InProceedings{Hansen_Teich:2001, AUTHOR = {Hansen, Silvia and Teich, Elke}, TITLE = {Multi-layer analysis of translation corpora: methodological issues and practical implications}, YEAR = {2001}, BOOKTITLE = {Proceedings of EUROLAN 2001 Workshop on Multi-layer Corpus-based Analysis}, PAGES = {44-55}, ADDRESS = {lasi} } @InProceedings{Kruijff_Kruijff-Korbayova:2001_1, AUTHOR = {Kruijff, Geert-Jan M. and Kruijff-Korbayova, Ivana}, TITLE = {A Hybrid Logis Fomralization of Information Structure Sensitive Discourse Interpretation}, YEAR = {2001}, BOOKTITLE = {Proceedings of the 4th International Conference on Text, Speech and Dialogue (TSD'2001}, PAGES = {31-38}, EDITOR = {Matousek, Václav and Mautner, Pavel and Mouvcek, Roman and Tauser, Karel}, SERIES = {Lecture Notes in Artificial Intelligence}, ADDRESS = {Zelezna Ruda, Czech Republic}, PUBLISHER = {Springer Verlag}, URL = {https://www.coli.uni-saarland.de/~korbay/Publications/tsd01.ps.gz} } @Article{Warner_Weber:2001, AUTHOR = {Warner, Natasha and Weber, Andrea}, TITLE = {Perceptual consequences of unintended epenthetic stops.}, YEAR = {2001}, JOURNAL = {Journal of Phonetics}, VOLUME = {29}, PAGES = {53-87} } @Book{Weber:2001, AUTHOR = {Weber, Andrea}, TITLE = {Language-specific listening: the case of phonetic sequences. Ph.D. Dissertation, University of Nijmegen (Max Planck Institute series in Psycholinguistics, 16), The Netherlands}, YEAR = {2001}, ADDRESS = {Wageningen: Ponsen & Looijen bv.} } @Article{Weber:2001_1, AUTHOR = {Weber, Andrea}, TITLE = {Help or hindrance: How violation of different assimilation rules affects spoken-language processing.}, YEAR = {2001}, JOURNAL = {Language and Speech}, VOLUME = {44}, PAGES = {95-118} } @InProceedings{Vasishth_Kruijff:2001_1, AUTHOR = {Vasishth, Shravan and Kruijff, Geert-Jan M.}, TITLE = {Processing as abduction: a sentence processing model}, YEAR = {2001}, BOOKTITLE = {OSUWPL, Volume 56}, PAGES = {183--207}, EDITOR = {Daniels, Michael and Dowty, David and Feldman, Anna and Metcalf, Vanessa}, ADDRESS = {Ohio State University} } @InBook{Andreeva_et_al:2001_1, AUTHOR = {Andreeva, Bistra and Avgustinova, Tania and Barry, William J.}, TITLE = {Current Issues in Formal Slavic Linguistics}, YEAR = {2001}, PAGES = {353-364}, EDITOR = {Zybatow, Gerhild and Junghanns, Uwe and Mehlhorn, Grit and Szucsish, L.}, PUBLISHER = {Peter Lang}, CHAPTER = {Link-associated and focus-associated accent patterns in Bulgarian} } @Article{Schaffar_Chen:2001, AUTHOR = {Schaffar, Wolfram and Chen, Lansun}, TITLE = {Yes-no question in Mandarin and the theory of focus}, YEAR = {2001}, JOURNAL = {Linguistics}, VOLUME = {39}, NUMBER = {5}, PAGES = {837-870}, URL = {Schaffar:2001:YNQ} } @Book{Woirgardt-Kobayashi_Hoppstädter:2001, AUTHOR = {Woirgardt-Kobayashi, Ryuko and Hoppstädter, Andrea}, TITLE = {Gewalt in der Schule-kulturell bestimmt? Ein Vergleich der Situation in Japan und Deutschland}, YEAR = {2001}, PAGES = {Woirgardt-Kobayashi:2001:GSK}, PUBLISHER = {Verlag Dr. Kovac} } @PhdThesis{Kordoni:2001_2, AUTHOR = {Kordoni, Valia}, TITLE = {Psych Verb Constructions in Modern Greek: a semantic analysis in the Hierarchical Lexicon}, YEAR = {2001}, ADDRESS = {Colchester, UK}, ORGANIZATION = {Kordoni:2001:PVC}, SCHOOL = {University of Essex}, URL = {https://www.coli.uni-saarland.de/~kordoni/thesis.html} } @InProceedings{Kordoni:2001_3, AUTHOR = {Kordoni, Valia}, TITLE = {Learning Modern Greek psychological predicates}, YEAR = {2001}, MONTH = {30 November}, BOOKTITLE = {Proceedings of CLIN 2001, Twelfth Meeting of Computational Linguistics in the Netherlands}, ADDRESS = {Enschede, The Netherlands}, ORGANIZATION = {Department of Computer Science, University of Twente}, URL = {http://parlevink.cs.utwente.nl/Conferences/Clin2001/program_schedule.html} } @InProceedings{Kordoni:2001_4, AUTHOR = {Kordoni, Valia}, TITLE = {Modern Greek Negation}, YEAR = {2001}, MONTH = {26 October}, BOOKTITLE = {Proceedings of the Western Conference on Linguistics (WECOL) 2001}, ADDRESS = {Seattle, Washington, USA}, ORGANIZATION = {University of Washington, Department of Linguistics}, URL = {Kordoni:2001:MGN} } @MastersThesis{Detemple:2001, AUTHOR = {Detemple, Philipp}, TITLE = {Natürlichsprachliche Bedienung im Kraftfahrzeug - Erweiterung des Dialogkonzeptes um eine Komponente zur Steuerung von Mensch-Maschine-Dialogen}, YEAR = {2001}, ADDRESS = {Saarbrücken, Germany}, SCHOOL = {Computerlinguistik, Universität des Saarlandes}, TYPE = {Diplomarbeit} } @MastersThesis{Debusman:2001, AUTHOR = {Debusman, Ralph}, TITLE = {A declarative grammar formalism for dependency grammar}, YEAR = {2001}, ADDRESS = {Saarbrücken, Germany}, SCHOOL = {Computerlinguistik, Universität des Saarlandes}, TYPE = {Diplomarbeit} } @MastersThesis{Fliedner:2001_1, AUTHOR = {Fliedner, Gerd}, TITLE = {Überprüfung und Korrektur von Nominalkongruenzen im Deutschen}, YEAR = {2001}, ADDRESS = {Saarbrücken, Germany}, SCHOOL = {Computerlinguistik, Universität des Saarlandes}, TYPE = {Diplomarbeit}, ANNOTE = {COLIURL : Fliedner:2001:UKN.pdf} } @MastersThesis{Gabsdil:2001_1, AUTHOR = {Gabsdil, Malte}, TITLE = {Interpreting Answers in dialogue}, YEAR = {2001}, ADDRESS = {Saarbrücken, Germany}, SCHOOL = {Computerlinguistik, Universität des Saarlandes}, TYPE = {Diplomarbeit} } @MastersThesis{Müller:2001_1, AUTHOR = {Müller, Christian}, TITLE = {Symptome von Zeitdruck und kognitiver Belastung in gesprochener Sprache: eine experimentelle Untersuchung}, YEAR = {2001}, ADDRESS = {Saarbrücken, Germany}, SCHOOL = {Computerlinguistik, Universität des Saarlandes}, TYPE = {Diplomarbeit} } @MastersThesis{Sacaleanu:2001, AUTHOR = {Sacaleanu, Bogdan}, TITLE = {Domain Specific Tuning and Extension of Lexical Semantic Resources}, YEAR = {2001}, ADDRESS = {Saarbrücken, Germany}, SCHOOL = {Computerlinguistik, Universität des Saarlandes}, TYPE = {Diplomarbeit} } @MastersThesis{Sonntag:2001, AUTHOR = {Sonntag, Daniel}, TITLE = {Dekomposition}, YEAR = {2001}, ADDRESS = {Saarbrücken, Germany}, SCHOOL = {Computerlinguistik, Universität des Saarlandes}, TYPE = {Diplomarbeit} } @MastersThesis{Thater:2001, AUTHOR = {Thater, Stefan}, TITLE = {Parsing and Generation with Tree Description}, YEAR = {2001}, ADDRESS = {Saarbrücken, Germany}, SCHOOL = {Computerlinguistik, Universität des Saarlandes}, TYPE = {Diplomarbeit} } @InProceedings{Teich_Hansen:2001_1, AUTHOR = {Teich, Elke and Hansen, Silvia}, TITLE = {Methods and techniques for a multi-level analysis of multilingual corpora}, YEAR = {2001}, BOOKTITLE = {Proceedings of the Corpus Linguistics 2001 conference}, PAGES = {572-580}, ADDRESS = {Lancaster} } @InProceedings{Asudeh_Keller:2001, AUTHOR = {Asudeh, Ash and Keller, Frank}, TITLE = {Experimental Evidence for a Predication-based Binding Theory}, YEAR = {2001}, BOOKTITLE = {The 37th Meeting of the Chicago Linguistic Society}, VOLUME = {1: The Main Session}, PAGES = {1-14}, EDITOR = {Andronis, Mary and Ball, Christopher and Elston}, ADDRESS = {Chicago} } @Article{Keller_Alexopoulou:2001, AUTHOR = {Keller, Frank and Alexopoulou, Theodora}, TITLE = {Phonology Competes with Syntax: Experimental Evidence for the Interaction of Word Order and Accent Placement in the Realization of Information Structure}, YEAR = {2001}, JOURNAL = {Cognition}, VOLUME = {79}, NUMBER = {3}, PAGES = {301-372} } @Article{Keller:2001, AUTHOR = {Keller, Frank}, TITLE = {Experimental Evidence for Constraint Competition in Gapping Constructions}, YEAR = {2001}, JOURNAL = {Competition in Syntax}, PAGES = {211-248} } @InProceedings{Keller_Asudeh:2001, AUTHOR = {Keller, Frank and Asudeh, Ash}, TITLE = {Constraints on Linguistic Coreference: Structural vs. Pragmatic Factors}, YEAR = {2001}, BOOKTITLE = {The 23rd Annual Conference of the Cognitive Science Society}, PAGES = {483-488}, EDITOR = {Moore, Johanna D. and Stenning, Keith}, ADDRESS = {Mahawah, NJ}, PUBLISHER = {Lawrence Erlbaum} } @Article{Lapata_et_al:2001, AUTHOR = {Lapata, Mirella and Keller, Frank and Schulte im Walde, Sabine}, TITLE = {Verb frame frequency as a predictor of verb bias}, YEAR = {2001}, JOURNAL = {Journal of Psycholinguistic Reseach}, VOLUME = {30(4)}, PAGES = {419-435} } @InProceedings{Lapata_et_al:2001_1, AUTHOR = {Lapata, Mirella and Keller, Frank and McDonald, Scott}, TITLE = {Evaluating Smoothing Algorithms against Plausibility Judgments}, YEAR = {2001}, BOOKTITLE = {The 39th Annual Meeting of the Association for Computational Linguistics and the 10th Conference of the European Chapter of the Association for Computational Linguistics}, PAGES = {346-353}, ADDRESS = {Toulouse} }