Denis Béchet

Orcid: 0000-0001-7955-1339

Affiliations:
  • University of Nantes, France


According to our database1, Denis Béchet authored at least 35 papers between 1992 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Incremental learning of iterated dependencies.
Mach. Learn., May, 2024

2017
Biography of Alexandre Dikovsky.
J. Log. Lang. Inf., 2017

2016
Categorial Dependency Grammars with Iterated Sequences.
Proceedings of the Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996-2016), 2016

Simple K-star Categorial Dependency Grammars and their Inference.
Proceedings of the 13th International Conference on Grammatical Inference, 2016

2015
CDGFr, un corpus en dépendances non-projectives pour le français.
Proceedings of the Actes de la 22e conference sur le Traitement Automatique des Langues Naturelles. Articles courts, 2015

2014
Label Pre-annotation for Building Non-projective Dependency Treebanks for French.
Int. J. Comput. Linguistics Appl., 2014

Validation Issues induced by an Automatic Pre-Annotation Mechanism in the Building of Non-projective Dependency Treebanks.
Proceedings of the Ninth International Conference on Language Resources and Evaluation, 2014

A Three-Step Transition-Based System for Non-Projective Dependency Parsing.
Proceedings of the COLING 2014, 2014

NP-Completeness of Grammars Based Upon Products of Free Pregroups.
Proceedings of the Categories and Types in Logic, Language, and Physics, 2014

2012
Categorial grammars with iterated types form a strict hierarchy of k-valued languages.
Theor. Comput. Sci., 2012

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].
Proceedings of the Joint Conference JEP-TALN-RECITAL 2012, 2012

On the Adequacy of Three POS Taggers and a Dependency Parser.
Proceedings of the Computational Linguistics and Intelligent Text Processing, 2012

2011
On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types.
Proceedings of the Logical Aspects of Computational Linguistics, 2011

"CDG Lab": An Integrated Environment for Categorial Dependency Grammar and Dependency Treebank Development.
Proceedings of the Computational Dependency Theory [papers from the International Conference on Dependency Linguistics, 2011

2010
Two Models of Learning Iterated Dependencies.
Proceedings of the Formal Grammar, 2010

2008
Optional and Iterated Types for Pregroup Grammars.
Proceedings of the Language and Automata Theory and Applications, 2008

2007
Learnability of Pregroup Grammars.
Stud Logica, 2007

Parsing Pregroup Grammars and Lambek Calculus Using Partial Composition.
Stud Logica, 2007

Hard combinators.
Proceedings of the Fourth International Workshop on Computing with Terms and Graphs, 2007

Universal Boolean Systems.
Proceedings of the Fourth International Workshop on Computing with Terms and Graphs, 2007

System identification of photosensitiser uptake kinetics in photodynamic therapy.
Biomed. Signal Process. Control., 2007

Fully Lexicalized Pregroup Grammars.
Proceedings of the Logic, 2007

2006
<i>k</i>-Valued non-associative Lambek grammars are learnable from generalized functor-argument structures.
Theor. Comput. Sci., 2006

2005
k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of Languages.
Proceedings of the Logical Aspects of Computational Linguistics, 2005

Dependency Structure Grammars.
Proceedings of the Logical Aspects of Computational Linguistics, 2005

2003
k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures.
Proceedings of the 10th Workshop on Logic, Language, Information and Computation, 2003

Remarques et perspectives sur les langages de prégroupe d'ordre 1/2.
Proceedings of the Actes de la 10ème conférence sur le Traitement Automatique des Langues Naturelles. Posters, 2003

Incremental Parsing Of Lambek Calculus Using Proof-Net Interfaces.
Proceedings of the Eighth International Conference on Parsing Technologies, 2003

k-Valued Non-Associative Lambek Categorial Grammars are not Learnable from Strings.
Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics, 2003

2001
Universal Interaction Systems with Only Two Agents.
Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

1998
Minimality of the correctness criterion for multiplicative proof nets.
Math. Struct. Comput. Sci., 1998

1997
A Complete Axiomatisation for the Inclusion of Series-Parallel Partial Orders.
Proceedings of the Rewriting Techniques and Applications, 8th International Conference, 1997

1996
Constructing Different Phonological Bracketings from a Proof Net.
Proceedings of the Logical Aspects of Computational Linguistics, 1996

Removing Value Encoding Using Alternative Values in Partial Evaluation of Strongly-Typed Languages.
Proceedings of the Programming Languages and Systems, 1996

1992
Partial Evaluation of Interaction Nets.
Proceedings of the Actes WSA'92 Workshop on Static Analysis (Bordeaux, 1992


  Loading...