% % GENERATED FROM https://www.coli.uni-saarland.de % by : anonymous % IP : coli2006.lst.uni-saarland.de % at : Mon, 05 Feb 2024 15:42:38 +0100 GMT % % Selection : Author: Claire_Gardent % @TechReport{Avgustinova_et_al:1999, AUTHOR = {Avgustinova, Tania and Gardent, Claire and Oliva, Karel}, TITLE = {Binding of Reciprocals with Particular Respect to Czech}, YEAR = {1999}, MONTH = {February}, NUMBER = {109}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus109.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus109.dvi}, ABSTRACT = {Drawing on data from Czech and English, we first argue against a uniform syntactic treatment of reciprocals and reflexives. We then define a binding theory for Czech which differs from HPSG binding theory in two main points. First, it is based on an ordering (the D-ordering) which is more general than HPSG's obliqueness ordering -- this permits a natural treatment of adjuncts. Second, it distinguishes between reflexives and reciprocals and submits them to different binding constraints. Finally, we provide a semantics for reciprocals with summated antecedents.}, ANNOTE = {COLIURL : Avgustinova:1999:BRP.pdf Avgustinova:1999:BRP.ps Avgustinova:1999:BRP.dvi} } @InProceedings{Blackburn_Gardent:1995, AUTHOR = {Blackburn, Patrick and Gardent, Claire}, TITLE = {A Specification Language for Lexical Functional Grammars}, YEAR = {1995}, BOOKTITLE = {7th Conference of the European Chapter of the Association for Computational Linguistics (EACL '91)}, PAGES = {39-44}, ADDRESS = {Dublin} } @TechReport{Blackburn_Gardent:1995_1, AUTHOR = {Blackburn, Patrick and Gardent, Claire}, TITLE = {A Specification Language for Lexical Functional Grammars}, YEAR = {1995}, MONTH = {February}, NUMBER = {51}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus51.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus51.dvi}, ABSTRACT = {This paper defines a language L for specifying LFG grammars. This enables constraints on LFG's composite ontology (c-structures synchronised with f-structures) to be stated directly; no appeal to the LFG construction algorithm is needed. We use L to specify schemata annotated rules and the LFG uniqueness, completeness and coherence principles. Broader issues raised by this work are noted and discussed.}, ANNOTE = {COLIURL : Blackburn:1995:SLLb.pdf Blackburn:1995:SLLb.ps Blackburn:1995:SLLb.dvi} } @InProceedings{Blackburn_Gardent:1998, AUTHOR = {Blackburn, Patrick and Gardent, Claire}, TITLE = {A Description Language for Discourse Semantics}, YEAR = {1998}, BOOKTITLE = {Logical Aspects of Computational Linguistics (LACL '98), December 14-16}, ADDRESS = {Grenoble, France} } @TechReport{Duchier_Gardent:1998, AUTHOR = {Duchier, Denys and Gardent, Claire}, TITLE = {A constraint-based treatment of descriptions}, YEAR = {1998}, MONTH = {November}, NUMBER = {105}, PAGES = {15}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/people/claire/constraints.ps}, ABSTRACT = {Both in computational linguistics and in formal semantics, descriptions have been used which are stated in terms of dominance . Yet the issue of how such descriptions are processed has been little explored. In this paper, we present a constraint-based treatment of descriptions and apply it to the description-based treatment of discourse advocated in Gardent and Webber 1998.}, ANNOTE = {COLIURL : Duchier:1998:CBT.pdf Duchier:1998:CBT.ps} } @InProceedings{Duchier_Gardent:1999, AUTHOR = {Duchier, Denys and Gardent, Claire}, TITLE = {A Constraint-Based Treatment of Descriptions}, YEAR = {1999}, BOOKTITLE = {3rd International Workshop on Computational Semantics (IWCS 3), January 13-15}, PAGES = {71-85}, EDITOR = {Bunt, Harry and Thijsse, Elias}, ADDRESS = {Tilburg, The Netherlands}, URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/iwcs99.ps.gz}, ABSTRACT = {Both in computational linguistics and in formal semantics, tree (or graph) descriptions stated in terms of dominance have become common. Yet the issue of how such descriptions are processed has been little explored. In this paper, we present a constraint-based treatment of descriptions: we develop a formulation in terms of sets, which is simple and declarative, and, at the same time, constitutes an efficient implementation. We further show how the treatement of tree descriptions can be extended to DAG descriptions and apply it to a description-based account of discourse.}, ANNOTE = {COLIURL : Duchier:1999:CBT.pdf Duchier:1999:CBT.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{Egg_et_al:1998, AUTHOR = {Egg, Markus and Gardent, Claire and Kohlhase, Michael}, TITLE = {Steuerung der Inferenz in der Diskursverarbeitung}, YEAR = {1998}, JOURNAL = {Kognitionswissenschaft}, VOLUME = {7}, PAGES = {106-110}, ABSTRACT = {Semantic interpretation is an essential component of natural language understanding which draws on extremely efficient language-based inference techniques. Such techniques are still lacking in computational systems for natural language processing. We have investigated specialized representation formalisms and suitable inference techniques that meet some of these desiderata. We have developed higher-order inference procedures to accurately represent linguistic ambiguities in terms of underspecification, and show how these procedures can be guided by information from other linguistic strata.} } @TechReport{Gardent:1994, AUTHOR = {Gardent, Claire}, TITLE = {Discourse Multiple Dependencies}, YEAR = {1994}, MONTH = {October}, NUMBER = {45}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus45.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus45.dvi}, ABSTRACT = {It is sometimes claimed (cf. [Mann/Thompson 1988, Scha/Polanyi 1988, Webber 1991, Gardent 1991, Pruest 1992]) that discourse has a tree structure which reflects the semantic structure of discourse. In this paper, I argue that this claim is problematic in cases of discourse multiple dependencies i.e. cases where one discourse segment is semantically related to two discourse segments. I develop a discourse framework which is based on [Scha/Polanyi 1988] but integrates ideas from Feature-based Tree Adjoining Grammars (FTAGs). I then show that this new framework adequately captures multiple dependencies whilst retaining the precise linguistic predictions made by the discourse grammar. In particular, I show how it permits a simple modelling of discourse semantics, discourse coherence and discourse based constraints on anaphora resolution.}, ANNOTE = {COLIURL : Gardent:1994:DMD.pdf Gardent:1994:DMD.ps Gardent:1994:DMD.dvi} } @TechReport{Gardent:1995, AUTHOR = {Gardent, Claire}, TITLE = {Generating with Discourse Grammar}, YEAR = {1995}, MONTH = {May}, NUMBER = {58}, PAGES = {21}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus58.ps}, ABSTRACT = {In this paper, we show how typed unification based formalisms extended with arbitrary relations can be used to generate discourse. We start by presenting the specific framework being used (discourse grammar), and we argue that it provides a natural setting for a computational analysis of intersentential phenomena such as ellipsis, anaphora and focus. We then show that it is possible for a discourse grammar to be neither monotonic nor declarative and further, that a discourse grammar is not guaranteed to terminate even when the set of solutions to be found is finite. Finally, we argue that despite these non properties, a generator can be developed which both preserves the intended meaning of the grammar and terminates.}, ANNOTE = {COLIURL : Gardent:1995:GDG.pdf Gardent:1995:GDG.ps} } @InProceedings{Gardent:1996, AUTHOR = {Gardent, Claire}, TITLE = {Ellipses, Pronouns and Parallelism}, YEAR = {1996}, BOOKTITLE = {1st International Conference on Logical Aspects of Computational Linguistics (LACL '96), April 23-25}, ADDRESS = {Nancy, France} } @Article{Gardent:1996_1, AUTHOR = {Gardent, Claire}, TITLE = {Anaphores parallèles et techniques de résolution}, YEAR = {1996}, JOURNAL = {Langages}, VOLUME = {123}, PAGES = {75-98} } @InCollection{Gardent:1997, AUTHOR = {Gardent, Claire}, TITLE = {Sloopy Identity}, YEAR = {1997}, BOOKTITLE = {Logical Aspects of Computational Linguistics}, VOLUME = {1328}, PAGES = {188-207}, EDITOR = {Retoré, C.}, SERIES = {LNAI}, ADDRESS = {Berlin}, PUBLISHER = {Springer}, ABSTRACT = {Although sloppy interpretation is usually accounted for by theories of ellipsis, it often arises in non-elliptical contexts. In this paper, a theory of sloppy interpretation is provided which captures this fact. The underlying idea is that sloppy interpretation results from a semantic constraint on parallel structures and the theory is shown to predict sloppy readings for deaccented and paycheck sentences as well as relational-, event-, and one-anaphora. It is further shown to capture the interaction of sloppy/strict ambiguity with quantification and binding.} } @TechReport{Gardent:1997_1, AUTHOR = {Gardent, Claire}, TITLE = {Parallelism, HOU and Deaccenting}, YEAR = {1997}, MONTH = {January}, NUMBER = {85}, PAGES = {29}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus85.ps}, ABSTRACT = {We generalise (Dalrymple, Shieber and Pereira 1991)'s treatment of ellipsis to deaccenting and show that the resulting account has three main advantages. First, it predicts the interpretive similarities between ellipsis and deaccenting. Second, it captures the interaction of deaccenting and anaphora. Third, it yields a uniform treatment of sloppy identity and of its interaction with both ellipsis and deaccenting.}, ANNOTE = {COLIURL : Gardent:1997:PHD.pdf Gardent:1997:PHD.ps} } @TechReport{Gardent:1997_2, AUTHOR = {Gardent, Claire}, TITLE = {Sloppy Identity}, YEAR = {1997}, MONTH = {March}, NUMBER = {88}, PAGES = {20}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus88.ps}, ABSTRACT = {Although sloppy interpretation is usually accounted for by theories of ellipsis, it often arises in non-elliptical contexts. In this paper, a theory of sloppy interpretation is provided which captures this fact. The underlying idea is that sloppy interpretation results from a semantic constraint on parallel structures and the theory is shown to predict sloppy readings for deaccented and paycheck sentences as well as relational-, event-, and one-anaphora. It is further shown to capture the interaction of sloppy/strict ambiguity with quantification and binding. Finally, it is compared with other approaches to sloppy identity, in particular (Dalrymple, Shieber and Pereira 1991, Hardt 1996) and (Fiengo and May 1994).}, ANNOTE = {COLIURL : Gardent:1997:SIB.pdf Gardent:1997:SIB.ps} } @TechReport{Gardent:1997_3, AUTHOR = {Gardent, Claire}, TITLE = {Discourse Tree Adjoining Grammar}, YEAR = {1997}, MONTH = {April}, NUMBER = {89}, PAGES = {23}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus89.ps}, ABSTRACT = {It is generally agreed that discourse has a recursive structure and that this structure affects the semantic interpretation of discourse. Despite this consensus however, relatively few proposals give a precise specification of how the syntax of discourse relates to its semantics. In this paper, we use a variant of Feature-Based Tree Adjoining Grammars to construct discourse structure. We then show that it provides a natural account of the relation between discourse syntax and discourse semantics, and in particular that it captures some interesting cases of semantic ambiguity in discourse.}, ANNOTE = {COLIURL : Gardent:1997:DTA.pdf Gardent:1997:DTA.ps} } @TechReport{Gardent:1999, AUTHOR = {Gardent, Claire}, TITLE = {Deaccenting and Higher-Order Unification}, YEAR = {1999}, MONTH = {October}, NUMBER = {112}, PAGES = {26}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus112.ps}, ABSTRACT = {The HOU based analysis of ellipsis presented in (Dalrymple, Shieber and Pereira 1991) was shown to correctly capture the complex interaction of VP-ellipsis, scope and anaphora and claimed to extend to further related phenomena. When applied to deaccenting, the analysis makes a strong prediction, namely that all anaphors occurring in the deaccented part of a deaccented utterance are parallel anaphors that is, anaphors that resolve to their parallel counterpart in the source. I argue that this prediction is supported by the data and show that it correctly captures the interaction of deaccenting with anaphora, (in)definiteness and focus.}, ANNOTE = {COLIURL : Gardent:1999:DHO.pdf Gardent:1999:DHO.ps} } @InProceedings{Gardent_Dorrepaal:1994, AUTHOR = {Gardent, Claire and Dorrepaal, Joke}, TITLE = {Reversible Discourse Processing}, YEAR = {1994}, BOOKTITLE = {International Workshop on Computational Semantics (IWCS-1), December 19-21}, ADDRESS = {Tilburg, The Netherlands} } @TechReport{Gardent_Dorrepaal:1995, AUTHOR = {Gardent, Claire and Dorrepaal, Joke}, TITLE = {Reversible Discourse Processing}, YEAR = {1995}, MONTH = {May}, NUMBER = {59}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus59.ps ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus59.dvi}, ABSTRACT = {In this paper we describe a reversible framework for discourse processing, a framework in which contextual constraints can be specified independently of the processing algorithm. We take as a starting point Scha and Polanyi's discourse grammar ([Scha/Polanyi 1988]) which is in essence a unification based grammar extended with arbitrary relations. Although such a framework can be shown to have many non properties (e.g. non monotonicity and non declarativity), we argue that it is inherently finitely reversible in the sense of [Dymetman 1991] - that is, there is a parsing/generation program for this grammar such that for any string/semantics, the program enumerates all associated semantics/strings and terminates. We show by means of examples that one and the same specification can be used both for analysis and for generation.}, ANNOTE = {COLIURL : Gardent:1995:RDP.pdf Gardent:1995:RDP.ps Gardent:1995:RDP.dvi} } @InProceedings{Gardent_Kohlhase:1996, AUTHOR = {Gardent, Claire and Kohlhase, Michael}, TITLE = {Higher-Order Coloured Unification and Natural Language Semantics}, YEAR = {1996}, BOOKTITLE = {34th Annual Meeting of the Association for Computational Linguistics, June 24-27}, EDITOR = {ACL}, ADDRESS = {Santa Cruz, California, USA} } @InProceedings{Gardent_Kohlhase:1996_1, AUTHOR = {Gardent, Claire and Kohlhase, Michael}, TITLE = {Focus and Higher-Order Unification}, YEAR = {1996}, BOOKTITLE = {16th International Conference on Computational Linguistics (COLING '96), August 5-9}, VOLUME = {1}, PAGES = {430-435}, EDITOR = {ACL}, ADDRESS = {Copenhagen, Denmark} } @TechReport{Gardent_Kohlhase:1996_2, AUTHOR = {Gardent, Claire and Kohlhase, Michael}, TITLE = {Focus and Higher-Order Unification}, YEAR = {1996}, MONTH = {April}, NUMBER = {75}, PAGES = {6}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus75.ps}, ABSTRACT = {Pulman has shown that Higher-Order Unification (HOU) can be used to model the interpretation of focus. In this paper, we extend the unification-based approach to cases which are often seen as a test-bed for focus theory: utterances with multiple focus operators and second occurrence expressions. We then show that the resulting analysis favourably compares with two prominent theories of focus (namely, Rooth's Alternative Semantics and Krifka's Structured Meanings theory) in that it correctly generates interpretations which these alternative theories cannot yield. Finally, we discuss the formal properties of the approach and argue that even though HOU need not terminate, for the class of unification-problems dealt with in this paper, HOU avoids this shortcoming and is in fact computationally tractable.}, ANNOTE = {COLIURL : Gardent:1996:FHOb.pdf Gardent:1996:FHOb.ps} } @TechReport{Gardent_Kohlhase:1996_3, AUTHOR = {Gardent, Claire and Kohlhase, Michael}, TITLE = {Higher-Order Coloured Unification and Natural Language Semantics}, YEAR = {1996}, MONTH = {April}, NUMBER = {76}, PAGES = {9}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus76.ps}, ABSTRACT = {In this paper, we show that Higher--Order Coloured Unification -- a form of unification developed for automated theorem proving -- provides a general theory for modeling the interface between the interpretation process and other sources of linguistic, non semantic information. In particular, it provides the general theory for the Primary Occurrence Restriction which (Dalrymple et al. 1991)'s analysis called for.}, ANNOTE = {COLIURL : Gardent:1996:HOCb.pdf Gardent:1996:HOCb.ps} } @InProceedings{Gardent_Kohlhase:1997, AUTHOR = {Gardent, Claire and Kohlhase, Michael}, TITLE = {Computing Parallelism in Discourse}, YEAR = {1997}, BOOKTITLE = {15th International Joint Conference on Artificial Intelligence (IJCAI '97), August 23-29}, VOLUME = {2}, PAGES = {1016-1021}, ADDRESS = {Nagoya, Japan}, PUBLISHER = {Morgan Kaufmann Publishers}, ABSTRACT = {Although much has been said about parallelism in discourse, a formal, computational theory of parallelism structure is still outstanding. In this paper, we present a theory which given two parallel utterances predicts which are the parallel elements. The theory consists of a sorted, higher-order abductive calculus and we show that it reconciles the insights of discourse theories of parallelism with those of Higher-Order Unification approaches to discourse semantics, thereby providing a natural framework in which to capture the effect of parallelism on discourse semantics.} } @TechReport{Gardent_et_al:1998, AUTHOR = {Gardent, Claire and Kohlhase, Michael and Konrad, Karsten}, TITLE = {Higher-Order Coloured Unification: a linguistic application}, YEAR = {1998}, MONTH = {November}, NUMBER = {101}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/people/claire/tsi.ps.gz}, ABSTRACT = {During the last decade, Higher-Order unification (HOU) has become a popular tool for constructing the semantic representation of natural language expressions. But there is a well-known problem with this approach: it over-generates that is, it produces solutions which although they are mathematically valid, are linguistically incorrect because they do not represent possible meanings of the expression being analysed. In this paper, we argue that Higher-Order Colored Unification (HOCU) can help prevent over-generation and we describe the linguistic, logical and computational aspects of an HOCU--based approach to semantic construction.}, ANNOTE = {COLIURL : Gardent:1998:HOC.pdf Gardent:1998:HOC.ps} } @Article{Gardent_et_al:1999, AUTHOR = {Gardent, Claire and Kohlhase, Michael and Konrad, Karsten}, TITLE = {Higher-Order Coloured Unification: a Linguistic Application}, YEAR = {1999}, JOURNAL = {Technique et Science Informatiques}, VOLUME = {18}, NUMBER = {2}, PAGES = {181-209} } @InProceedings{Gardent_et_al:1996, AUTHOR = {Gardent, Claire and Kohlhase, Michael and van Leusen, Noor}, TITLE = {Corrections and Higher-Order Unification}, YEAR = {1996}, BOOKTITLE = {3. Konferenz Verarbeitung natürlicher Sprache (KONVENS '96), 7.-9. Oktober}, PAGES = {268-279}, ADDRESS = {Bielefeld, Germany}, PUBLISHER = {de Gruyter}, ABSTRACT = {We propose an analysis of corrections which models some of the requirements corrections place on context. We then show that this analysis naturally extends to the interaction of corrections with pronominal anaphora on the one hand, and (in)definiteness on the other. The analysis builds on previous unification--based approaches to NL semantics and relies on Higher--Order Unification with Equivalences, a form of unification which takes into account not only syntactic beta-eta-identity but also denotational equivalence.} } @TechReport{Gardent_et_al:1996_1, AUTHOR = {Gardent, Claire and Kohlhase, Michael and van Leusen, Noor}, TITLE = {Corrections and Higher-Order Unification}, YEAR = {1996}, MONTH = {May}, NUMBER = {77}, PAGES = {12}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus77.ps}, ABSTRACT = {We propose an analysis of corrections which models some of the requirements corrections place on context. We then show that this analysis naturally extends to the interaction of corrections with pronominal anaphora on the one hand, and (in)definiteness on the other. The analysis builds on previous unification--based approaches to NL semantics and relies on Higher--Order Unification with Equivalences, a form of unification which takes into account not only syntactic beta-eta-identity but also denotational equivalence. Wir schlagen eine Analyse vor, die einige der Anforderungen von Korrekturen an den Kontext modelliert und sich natuerlich auf die Interaktion von Korrekturen mit Pronominalanaphern und Undefiniertheit erweitern laesst. Die Analyse basiert auf bekannten unifikationsbasierten Ansaetzen fuer die Semantik natuerlicher Sprache und benutzt eine Erweiterung der Unifikation hoeherer Stufe. Diese beruecksichtigt nicht nur strukturelle beta-eta-Gleichheit, sondern auch logische Aequivalenz.}, ANNOTE = {COLIURL : Gardent:1996:CHOb.pdf Gardent:1996:CHOb.ps} } @TechReport{Gardent_Konrad:1999, AUTHOR = {Gardent, Claire and Konrad, Karsten}, TITLE = {Definites or the proper treatment of rabbits}, YEAR = {1999}, MONTH = {June}, NUMBER = {111}, PAGES = {12}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus111.ps}, ABSTRACT = {We argue that model generation programs, i.e., deduction systems that automatically compute the interpretations satisfying a given formula, can provide a procedural interpretation for semantic theories of natural language. We illustrate this claim by describing how the higher-order model generator kimba interprets definite descriptions.}, ANNOTE = {COLIURL : Gardent:1999:DPT.pdf Gardent:1999:DPT.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} } @InProceedings{Gardent_Webber:1998, AUTHOR = {Gardent, Claire and Webber, Bonnie}, TITLE = {Describing Discourse Semantics}, YEAR = {1998}, BOOKTITLE = {4th International Workshop on Tree-Adjoining Grammars and Related Frameworks (TAG+), August 1-3}, ADDRESS = {Philadelphia, USA} } @TechReport{Gardent_Webber:2000, AUTHOR = {Gardent, Claire and Webber, Bonnie}, TITLE = {Automated Reasoning and Discourse Disambiguation}, YEAR = {2000}, MONTH = {January}, NUMBER = {113}, PAGES = {24}, ADDRESS = {Saarbrücken}, TYPE = {CLAUS-Report}, INSTITUTION = {Universität des Saarlandes}, URL = {ftp://ftp.coli.uni-sb.de/pub/coli/claus/claus113.ps}, ABSTRACT = {The performance of first-order automated reasoning systems has been steadily improving, stimulated in part by the availability of test suites of mathematical problems on which the systems can be tested, tuned and compared. But discourse understanding in Natural Language poses different inference problems than mathematics. In order to tailor automated reasoning systems to the needs of Natural Language understanding, similar test suites need to be developed. In this paper, we claim that several kinds of ambiguity in discourse can be resolved through automated reasoning checks for consistency, informativity and minimality. Future test suites should therefore include problems of these sorts. The overall goal then is to characterise the range of inference problems that discourse understanding gives rise to and that test suites should include.}, ANNOTE = {COLIURL : Gardent:2000:ARD.pdf Gardent:2000:ARD.ps} } @InCollection{Gardent_et_al:2004, AUTHOR = {Gardent, Claire and Manuélian, Hélène and Striegnitz, Kristina and Amoia, Marilisa}, TITLE = {Generating Definite Descriptions: Non incrementality, inference and data}, YEAR = {2004}, BOOKTITLE = {Multidisciplinary Approaches to Language Production}, PAGES = {53--85}, EDITOR = {Pechman, T. and Habel, Christopher}, ADDRESS = {Berlin}, PUBLISHER = {Mouton de Gruyter}, URL = {https://www.coli.uni-saarland.de/~kris/papers/spp-book.ps.gz} } @InProceedings{AmGa2007, AUTHOR = {Amoia, Marilisa and Gardent, Claire}, TITLE = {A first order semantic approach to adjectival inference}, YEAR = {2007}, BOOKTITLE = {Proceedings of ACL-Pascal Workshop on Textual Entailment and Paraphrasing. Prague, Czech Republic}, NOTE = {MP} } @InProceedings{AmGa2008, AUTHOR = {Amoia, Marilisa and Gardent, Claire}, TITLE = {A test suite for inference involving adjectives}, YEAR = {2008}, BOOKTITLE = {Proceedings of the 6th International Conference on Language Resources and Evaluation : LREC 2008, May 26 - June 1, 2008, Palais des congrès Mansour Eddahbi, Marrakech, Morocco}, PAGES = {631-637}, ADDRESS = {Paris}, ORGANIZATION = {ELRA}, NOTE = {MP} }