Denis Béchet

37 papers A* 1A 1B 3C 4Journal 8Unranked 19
YearRankTypeTitle / Venue / Authors
2024 J jnl
Incremental learning of iterated dependencies.
Mach. Learn.
Denis Béchet, Annie Foret
2017 J jnl
Biography of Alexandre Dikovsky.
J. Log. Lang. Inf.
Denis Béchet, Michael I. Dekhtyar
2016 — conf
Categorial Dependency Grammars with Iterated Sequences.
LACL
Denis Béchet, Annie Foret
2016 — conf
Simple K-star Categorial Dependency Grammars and their Inference.
ICGI
Denis Béchet, Annie Foret
2015 — conf
CDGFr, un corpus en dépendances non-projectives pour le français.
TALN
Denis Béchet, Ophélie Lacroix
2014 B conf
A Three-Step Transition-Based System for Non-Projective Dependency Parsing.
COLING
Ophélie Lacroix, Denis Béchet
2014 J jnl
Label Pre-annotation for Building Non-projective Dependency Treebanks for French.
Int. J. Comput. Linguistics Appl.
Ophélie Lacroix, Denis Béchet, Florian Boudin
2014 — conf
NP-Completeness of Grammars Based Upon Products of Free Pregroups.
Categories and Types in Logic, Language, and Physics
Denis Béchet
2014 B conf
Validation Issues induced by an Automatic Pre-Annotation Mechanism in the Building of Non-projective Dependency Treebanks.
LREC
Ophélie Lacroix, Denis Béchet
2012 — conf
Calcul des cadres de sous catégorisation des noms déverbaux français (le cas du génitif) (On Computing Subcategorization Frames of French Deverbal Nouns (Case of Genitive)) [in French].
JEP-TALN-RECITAL
Ramadan Alfared, Denis Béchet, Alexandre Ja. Dikovsky
2012 J jnl
Categorial grammars with iterated types form a strict hierarchy of k-valued languages.
Theor. Comput. Sci.
Denis Béchet, Alexandre Ja. Dikovsky, Annie Foret
2012 — ed.
Logical Aspects of Computational Linguistics - 7th International Conference, LACL 2012, Nantes, France, July 2-4, 2012. Proceedings
LACL
Denis Béchet, Alexander Ja. Dikovsky
2012 — conf
On the Adequacy of Three POS Taggers and a Dependency Parser.
CICLing (1)
Ramadan Alfared, Denis Béchet
2011 — conf
"CDG Lab": An Integrated Environment for Categorial Dependency Grammar and Dependency Treebank Development.
DepLing
Denis Béchet, Alexander Ja. Dikovsky, Ophélie Lacroix
2011 C conf
Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages.
CIAA
Denis Béchet, Alexander Ja. Dikovsky, Annie Foret
2011 — conf
On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types.
LACL
Denis Béchet, Alexander Ja. Dikovsky, Annie Foret
2010 B conf
Two Models of Learning Iterated Dependencies.
FG
Denis Béchet, Alexander Ja. Dikovsky, Annie Foret
2008 C conf
Optional and Iterated Types for Pregroup Grammars.
LATA
Denis Béchet, Alexander Ja. Dikovsky, Annie Foret, Emmanuelle Garel
2007 C conf
Fully Lexicalized Pregroup Grammars.
WoLLIC
Denis Béchet, Annie Foret
2007 — conf
Hard combinators.
TERMGRAPH@ETAPS
Denis Béchet, Sylvain Lippi
2007 J jnl
Learnability of Pregroup Grammars.
Stud Logica
Denis Béchet, Annie Foret, Isabelle Tellier
2007 J jnl
Parsing Pregroup Grammars and Lambek Calculus Using Partial Composition.
Stud Logica
Denis Béchet
2007 J jnl
System identification of photosensitiser uptake kinetics in photodynamic therapy.
Biomed. Signal Process. Control.
Thierry Bastogne, Loraine Tirand, Denis Béchet, Muriel Barberi-Heyob, Alain Richard
2007 — conf
Universal Boolean Systems.
TERMGRAPH@ETAPS
Denis Béchet, Sylvain Lippi
2005 — conf
Dependency Structure Grammars.
LACL
Denis Béchet, Alexander Ja. Dikovsky, Annie Foret
2005 — conf
k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of Languages.
LACL
Denis Béchet, Annie Foret
2004 — conf
Learnability of Pregroup Grammars.
ICGI
Denis Béchet, Annie Foret, Isabelle Tellier
2003 — conf
Incremental Parsing Of Lambek Calculus Using Proof-Net Interfaces.
IWPT
Denis Béchet
2003 — conf
Remarques et perspectives sur les langages de prégroupe d'ordre 1/2.
TALN (Posters)
Denis Béchet, Annie Foret
2003 A* conf
k-Valued Non-Associative Lambek Categorial Grammars are not Learnable from Strings.
ACL
Denis Béchet, Annie Foret
2003 C conf
k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures.
WoLLIC
Denis Béchet, Annie Foret
2001 — conf
Universal Interaction Systems with Only Two Agents.
RTA
Denis Béchet
1998 J jnl
Minimality of the correctness criterion for multiplicative proof nets.
Math. Struct. Comput. Sci.
Denis Béchet
1997 — conf
A Complete Axiomatisation for the Inclusion of Series-Parallel Partial Orders.
RTA
Denis Béchet, Philippe de Groote, Christian Retoré
1996 — conf
Constructing Different Phonological Bracketings from a Proof Net.
LACL
Denis Béchet, Philippe de Groote
1996 A conf
Removing Value Encoding Using Alternative Values in Partial Evaluation of Strongly-Typed Languages.
ESOP
Denis Béchet
1992 — conf
Partial Evaluation of Interaction Nets.
WSA
Denis Béchet