default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDenis Béchet
Person information
- affiliation: University of Nantes, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Denis Béchet
, Annie Foret:
Incremental learning of iterated dependencies. Mach. Learn. 113(5): 2841-2875 (2024)
2010 – 2019
- 2017
- [j8]Denis Béchet, Michael I. Dekhtyar:
Biography of Alexandre Dikovsky. J. Log. Lang. Inf. 26(4): 333-340 (2017) - 2016
- [c28]Denis Béchet, Annie Foret:
Simple K-star Categorial Dependency Grammars and their Inference. ICGI 2016: 3-14 - [c27]Denis Béchet, Annie Foret:
Categorial Dependency Grammars with Iterated Sequences. LACL 2016: 34-51 - 2015
- [c26]Denis Béchet, Ophélie Lacroix:
CDGFr, un corpus en dépendances non-projectives pour le français. TALN 2015: 206-212 - 2014
- [j7]Ophélie Lacroix, Denis Béchet, Florian Boudin:
Label Pre-annotation for Building Non-projective Dependency Treebanks for French. Int. J. Comput. Linguistics Appl. 5(1): 89-103 (2014) - [c25]Denis Béchet:
NP-Completeness of Grammars Based Upon Products of Free Pregroups. Categories and Types in Logic, Language, and Physics 2014: 51-62 - [c24]Ophélie Lacroix, Denis Béchet:
A Three-Step Transition-Based System for Non-Projective Dependency Parsing. COLING 2014: 224-232 - [c23]Ophélie Lacroix, Denis Béchet:
Validation Issues induced by an Automatic Pre-Annotation Mechanism in the Building of Non-projective Dependency Treebanks. LREC 2014: 4082-4086 - 2012
- [j6]Denis Béchet, Alexandre Ja. Dikovsky, Annie Foret:
Categorial grammars with iterated types form a strict hierarchy of k-valued languages. Theor. Comput. Sci. 450: 22-30 (2012) - [c22]Ramadan Alfared, Denis Béchet:
On the Adequacy of Three POS Taggers and a Dependency Parser. CICLing (1) 2012: 104-116 - [c21]Ramadan Alfared, Denis Béchet, Alexandre Ja. Dikovsky:
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 2012: 71-84 - [e1]Denis Béchet, Alexander Ja. Dikovsky:
Logical Aspects of Computational Linguistics - 7th International Conference, LACL 2012, Nantes, France, July 2-4, 2012. Proceedings. Lecture Notes in Computer Science 7351, Springer 2012, ISBN 978-3-642-31261-8 [contents] - 2011
- [c20]Denis Béchet, Alexander Ja. Dikovsky, Ophélie Lacroix:
"CDG Lab": An Integrated Environment for Categorial Dependency Grammar and Dependency Treebank Development. DepLing 2011: 153-169 - [c19]Denis Béchet, Alexander Ja. Dikovsky, Annie Foret:
On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types. LACL 2011: 80-95 - [c18]Denis Béchet, Alexander Ja. Dikovsky, Annie Foret:
Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages. CIAA 2011: 42-52 - 2010
- [c17]Denis Béchet, Alexander Ja. Dikovsky, Annie Foret:
Two Models of Learning Iterated Dependencies. FG 2010: 17-32
2000 – 2009
- 2008
- [c16]Denis Béchet, Alexander Ja. Dikovsky, Annie Foret, Emmanuelle Garel:
Optional and Iterated Types for Pregroup Grammars. LATA 2008: 88-100 - 2007
- [j5]Thierry Bastogne, Loraine Tirand, Denis Béchet, Muriel Barberi-Heyob, Alain Richard:
System identification of photosensitiser uptake kinetics in photodynamic therapy. Biomed. Signal Process. Control. 2(3): 217-225 (2007) - [j4]Denis Béchet:
Parsing Pregroup Grammars and Lambek Calculus Using Partial Composition. Stud Logica 87(2-3): 199-224 (2007) - [j3]Denis Béchet, Annie Foret, Isabelle Tellier:
Learnability of Pregroup Grammars. Stud Logica 87(2-3): 225-252 (2007) - [c15]Denis Béchet, Annie Foret:
Fully Lexicalized Pregroup Grammars. WoLLIC 2007: 12-25 - [c14]Denis Béchet, Sylvain Lippi:
Universal Boolean Systems. TERMGRAPH@ETAPS 2007: 19-30 - [c13]Denis Béchet, Sylvain Lippi:
Hard combinators. TERMGRAPH@ETAPS 2007: 31-48 - 2006
- [j2]Denis Béchet, Annie Foret:
k-Valued non-associative Lambek grammars are learnable from generalized functor-argument structures. Theor. Comput. Sci. 355(2): 139-152 (2006) - 2005
- [c12]Denis Béchet, Annie Foret:
k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of Languages. LACL 2005: 1-17 - [c11]Denis Béchet, Alexander Ja. Dikovsky, Annie Foret:
Dependency Structure Grammars. LACL 2005: 18-34 - 2004
- [c10]Denis Béchet, Annie Foret, Isabelle Tellier:
Learnability of Pregroup Grammars. ICGI 2004: 65-76 - 2003
- [c9]Denis Béchet, Annie Foret:
k-Valued Non-Associative Lambek Categorial Grammars are not Learnable from Strings. ACL 2003: 351-358 - [c8]Denis Béchet:
Incremental Parsing Of Lambek Calculus Using Proof-Net Interfaces. IWPT 2003: 31-42 - [c7]Denis Béchet, Annie Foret:
Remarques et perspectives sur les langages de prégroupe d'ordre 1/2. TALN (Posters) 2003: 309-314 - [c6]Denis Béchet, Annie Foret:
k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures. WoLLIC 2003: 60-72 - 2001
- [c5]Denis Béchet:
Universal Interaction Systems with Only Two Agents. RTA 2001: 3-14
1990 – 1999
- 1998
- [j1]Denis Béchet:
Minimality of the correctness criterion for multiplicative proof nets. Math. Struct. Comput. Sci. 8(6): 543-558 (1998) - 1997
- [c4]Denis Béchet, Philippe de Groote, Christian Retoré:
A Complete Axiomatisation for the Inclusion of Series-Parallel Partial Orders. RTA 1997: 230-240 - 1996
- [c3]Denis Béchet:
Removing Value Encoding Using Alternative Values in Partial Evaluation of Strongly-Typed Languages. ESOP 1996: 77-91 - [c2]Denis Béchet, Philippe de Groote:
Constructing Different Phonological Bracketings from a Proof Net. LACL 1996: 118-133 - 1992
- [c1]Denis Béchet:
Partial Evaluation of Interaction Nets. WSA 1992: 331-338
Coauthor Index
aka: Alexander Ja. Dikovsky
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-19 00:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
