Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Alain Lecomte

dblp:73/5052 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Automata and formal languages · 60% Logic in computer science · 40%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages
categorial grammar		 0.012001
Extending Lambek Grammars: a Logical Account of Minimalist Grammars · ACL 2001
Logic in computer science › formal semantics
compositional semantics		 0.012001
Extending Lambek Grammars: a Logical Account of Minimalist Grammars · ACL 2001
Automata and formal languages › categorial grammar
lambek grammar		 0.012001
Extending Lambek Grammars: a Logical Account of Minimalist Grammars · ACL 2001
Automata and formal languages › grammar formalisms
minimalist grammar		 0.012001
Extending Lambek Grammars: a Logical Account of Minimalist Grammars · ACL 2001
Logic in computer science › formal semantics
montague semantics		 0.012001
Extending Lambek Grammars: a Logical Account of Minimalist Grammars · ACL 2001

Methods — techniques the papers use, named apart from their topics

type unification · 0.0parsing-as-deduction · 0.0
YearPublicationVenuePosition
2009 Ludics and Its Applications to Natural Language Semantics
Alain Lecomte, Myriam Quatrini
 WoLLIC1
2001 Extending Lambek Grammars: a Logical Account of Minimalist Grammars
abstract
We provide a logical definition of Minimalist grammars, that are Stabler's formalization of Chomsky's 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.
Alain Lecomte, Christian Retoré
 ACL1
1993 Towards efficient parsing with proof-nets
Alain Lecomte
 EACL1
1992 Proof-Nets And Dependencies
Alain Lecomte
 COLING1