Claire Gardent | Université Henri Poincaré Nancy 1 (original) (raw)

Papers by Claire Gardent

Coling 2008: Proceedings of the workshop on Cross-Framework and Cross-Domain Parser Evaluation - CrossParser '08, 2008

Meeting of the Association for Computational Linguistics, 2001

While the view eliminates invalid linguistic structures out of a set of possible structures by me... more While the view eliminates invalid 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 semantics, this axiomatic view permits avoiding drawbacks known to hold either of top-down or of bottom-up generators.

Both in computational linguistics and in formal semantics, descriptions have been used which are ... more Both in computational linguistics and in formal semantics, descriptions have been used which are stated in terms of dominance. In the domain of syntactic processing, MHM83] used dominance to support deterministic parsing. In the domain of grammar formalisms, VS92] has used ...

This software and its documentation are copyrighted by the German Research Center for Artificial ... more This software and its documentation are copyrighted by the German Research Center for Artificial Intelligence (DFKI), the Swedish Institute of Computer Science (SICS), and other parties. The following terms apply to all files associated with the software unless explicitly disclaimed ...

Maurice Gross' grammar lexicon contains rich and exhaustive informat... more Maurice Gross' grammar lexicon contains rich and exhaustive information about the morphosyntactic and semantic properties of French syntactic functors (verbs, adjectives, nouns). Yet its use within natural language processing systems is hampered both by its non standard encoding and ...

Maurice Gross' grammar lexicon contains an extremly ... more Maurice Gross' grammar lexicon contains an extremly rich and exhaustive information about the morphosyntactic and semantic proper-ties of French syntactic functors (verbs, adjectives, nouns). Yet its use within natural language processing systems is still ...

Although Tree Adjoining Grammars (TAG) are widely used for syntactic processing, there is to date... more Although Tree Adjoining Grammars (TAG) are widely used for syntactic processing, there is to date no large scale TAG available which also supports semantic construction. In this paper, we present a highly factorised way of implementing a syntax/semantic interface in TAG. We then show how the resulting resource can be used to perform semantic construction either during or after derivation.

Computing Research Repository, 1996

Pulman has shown that Higher--Order Unification (HOU) can be used to model the interpretation of ... more 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.

In this extended abstract back- and-forth structures are defined and applied to the semantics of ... more In this extended abstract back- and-forth structures are defined and applied to the semantics of natural language. Back- and-forth structures consist of an event structure and an interval structure communicating via a relational link; transitions in the one structure correspond to transitions in the other. Such structures enable us to view temporal constructions (such as tense, aspect, and temporal connectives) as methods of moving systematically between information sources. We illustrate this with a treatment of the English present perfect, and progressive aspect, that draws on ideas developed in Moens and Steedman (1988).

Computing Research Repository, 1995

Journal of Logic, Language and Information, 2001

In this paper, we claim that the disambiguation ofreferring expressions in discourse can be formu... more In this paper, we claim that the disambiguation ofreferring expressions in discourse can be formulated in terms automatedreasoners can address. Specifically, we show that consistency,informativity and minimality are criteria which (i) can be implementedusing automated reasoning tools and (ii) can be used to disambiguatenoun-noun compounds, metonymy and definite descriptions.

Coling 2008: Proceedings of the workshop on Cross-Framework and Cross-Domain Parser Evaluation - CrossParser '08, 2008

Meeting of the Association for Computational Linguistics, 2001

While the view eliminates invalid linguistic structures out of a set of possible structures by me... more While the view eliminates invalid 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 semantics, this axiomatic view permits avoiding drawbacks known to hold either of top-down or of bottom-up generators.

Both in computational linguistics and in formal semantics, descriptions have been used which are ... more Both in computational linguistics and in formal semantics, descriptions have been used which are stated in terms of dominance. In the domain of syntactic processing, MHM83] used dominance to support deterministic parsing. In the domain of grammar formalisms, VS92] has used ...

This software and its documentation are copyrighted by the German Research Center for Artificial ... more This software and its documentation are copyrighted by the German Research Center for Artificial Intelligence (DFKI), the Swedish Institute of Computer Science (SICS), and other parties. The following terms apply to all files associated with the software unless explicitly disclaimed ...

Maurice Gross' grammar lexicon contains rich and exhaustive informat... more Maurice Gross' grammar lexicon contains rich and exhaustive information about the morphosyntactic and semantic properties of French syntactic functors (verbs, adjectives, nouns). Yet its use within natural language processing systems is hampered both by its non standard encoding and ...

Maurice Gross' grammar lexicon contains an extremly ... more Maurice Gross' grammar lexicon contains an extremly rich and exhaustive information about the morphosyntactic and semantic proper-ties of French syntactic functors (verbs, adjectives, nouns). Yet its use within natural language processing systems is still ...

Although Tree Adjoining Grammars (TAG) are widely used for syntactic processing, there is to date... more Although Tree Adjoining Grammars (TAG) are widely used for syntactic processing, there is to date no large scale TAG available which also supports semantic construction. In this paper, we present a highly factorised way of implementing a syntax/semantic interface in TAG. We then show how the resulting resource can be used to perform semantic construction either during or after derivation.

Computing Research Repository, 1996

Pulman has shown that Higher--Order Unification (HOU) can be used to model the interpretation of ... more 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.

In this extended abstract back- and-forth structures are defined and applied to the semantics of ... more In this extended abstract back- and-forth structures are defined and applied to the semantics of natural language. Back- and-forth structures consist of an event structure and an interval structure communicating via a relational link; transitions in the one structure correspond to transitions in the other. Such structures enable us to view temporal constructions (such as tense, aspect, and temporal connectives) as methods of moving systematically between information sources. We illustrate this with a treatment of the English present perfect, and progressive aspect, that draws on ideas developed in Moens and Steedman (1988).

Computing Research Repository, 1995

Journal of Logic, Language and Information, 2001

In this paper, we claim that the disambiguation ofreferring expressions in discourse can be formu... more In this paper, we claim that the disambiguation ofreferring expressions in discourse can be formulated in terms automatedreasoners can address. Specifically, we show that consistency,informativity and minimality are criteria which (i) can be implementedusing automated reasoning tools and (ii) can be used to disambiguatenoun-noun compounds, metonymy and definite descriptions.