Alain Lecomte
University of Grenoble
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Alain Lecomte.
meeting of the association for computational linguistics | 2001
Alain Lecomte; Christian Retoré
We provide a logical definition of Minimalist grammars, that are Stablers formalization of Chomskys minimalist program. Our logical definition leads to a neat relation to categorial grammar, (yielding a treatment of Montague semantics), a parsing-as-deduction in a resource sensitive logic, and a learning algorithm from structured data (based on a typing-algorithm and type-unification). Here we emphasize the connection to Montague semantics which can be viewed as a formal computation of the logical form.
logical aspects of computational linguistics | 1996
Patrick Blackburn; Marc Dymetman; Alain Lecomte; Aarne Ranta; Christian Retoré; Éric Villemonte de la Clergerie
The papers in this collection are all devoted to single theme: logic and its applications in computational linguistics. They share many themes, goals and techniques, and any editorial classification is bound to highlight some connections at the expense of other. Nonetheless, we have found it useful to divide these papers (somewhat arbitrarily) into the following four categories: logical semantics of natural language, grammar and logic, mathematics with linguistic motivations, and computational perspectives. In this introduction, we use this four-way classification as a guide to the papers, and, more generally, to the research agenda that underlies them. We hope that the reader will find it a useful starting point to the collection.
logical aspects of computational linguistics | 2005
Areski Nait Abdallah; Alain Lecomte
In this paper, we use the logic of partial information to re-examine some early analyses of vague quantifiers in French such as quelques,peu,beaucoup that are found in particular in the work of O. Ducrot [2]. Our approach is based on the paradigm offered by the logical formalization of the sorites paradox. We claim that this paradox offers a general scheme along which the argumentation structure of all vague quantifiers in French may be expressed. We offer a variational principle approximating Grices maxims in the case of vague quantification.
Archive | 1999
Alain Lecomte; François Lamarche; Guy Perrier
Invited papers.- Type Grammar Revisited.- Optimal Parameters.- Selected papers.- Strong Equivalence of Generalized Ajdukiewicz and Lambek Grammars.- Linguistic, Philosophical, and Pragmatic Aspects of Type-Directed Natural Language Parsing.- Derivational and Representational Views of Minimalist Transformational Grammar.- The MSO Logic-Automaton Connection in Linguistics.- The Logic of Tune A Proof-Theoretic Analysis of Intonation.- A Linear Logic Treatment of Phrase Structure Grammars For Unbounded Dependencies.- Underspecification in Type-Logical Grammars.- On Fibring Feature Logics with Concatenation Logics.- An Operational Model for Parsing De.nite Clause Grammars with In.nite Terms.- Mathematical Vernacular and Conceptual Well-Formedness in Mathematical Language.
Research on Language and Computation | 2004
Alain Lecomte
logical aspects of computational linguistics | 1998
Alain Lecomte
Mathématiques et sciences humaines. Mathematics and social sciences | 2010
Alain Lecomte; Myriam Quatrini
Linguistic Analysis | 2010
Maxime Amblard; Alain Lecomte; Christian Retoré
Prospect and advance in the syntax/semantic interface | 2004
Maxime Amblard; Alain Lecomte; Christian Retoré
Archive | 1997
Christian Retoré; Alain Lecomte
Collaboration
Dive into the Alain Lecomte's collaboration.
French Institute for Research in Computer Science and Automation
View shared research outputs