Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Denis Béchet

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Annie Foret

> Home > Persons > Denis Béchet

Publications

2016
[c28]
- view
  - electronic edition @ mlr.press (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/icgi/BechetF16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icgi/BechetF16
Denis Béchet, Annie Foret:
Simple K-star Categorial Dependency Grammars and their Inference. ICGI 2016: 3-14
[c27]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/lacl/BechetF16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lacl/BechetF16
Denis Béchet, Annie Foret:
Categorial Dependency Grammars with Iterated Sequences. LACL 2016: 34-51
2012
[j6]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/BechetDF12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BechetDF12
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)
2011
[c19]
- view
  authority control:
- export record
  dblp key:
  - conf/lacl/BechetDF11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lacl/BechetDF11
Denis Béchet, Alexander Ja. Dikovsky, Annie Foret:
On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types. LACL 2011: 80-95
[c18]
- view
  authority control:
- export record
  dblp key:
  - conf/wia/BechetDF11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wia/BechetDF11
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]
- view
  authority control:
- export record
  dblp key:
  - conf/fg/BechetDF10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fg/BechetDF10
Denis Béchet, Alexander Ja. Dikovsky, Annie Foret:
Two Models of Learning Iterated Dependencies. FG 2010: 17-32
2008
[c16]
- view
  authority control:
- export record
  dblp key:
  - conf/lata/BechetDFG08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lata/BechetDFG08
Denis Béchet, Alexander Ja. Dikovsky, Annie Foret, Emmanuelle Garel:
Optional and Iterated Types for Pregroup Grammars. LATA 2008: 88-100
2007
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/sLogica/BechetFT07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/sLogica/BechetFT07
Denis Béchet, Annie Foret, Isabelle Tellier:
Learnability of Pregroup Grammars. Stud Logica 87(2-3): 225-252 (2007)
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/wollic/BechetF07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wollic/BechetF07
Denis Béchet, Annie Foret:
Fully Lexicalized Pregroup Grammars. WoLLIC 2007: 12-25
2006
[j2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/BechetF06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BechetF06
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]
- view
  authority control:
- export record
  dblp key:
  - conf/lacl/BechetF05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lacl/BechetF05
Denis Béchet, Annie Foret:
k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of Languages. LACL 2005: 1-17
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/lacl/BechetDF05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lacl/BechetDF05
Denis Béchet, Alexander Ja. Dikovsky, Annie Foret:
Dependency Structure Grammars. LACL 2005: 18-34
2004
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/icgi/BechetFT04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icgi/BechetFT04
Denis Béchet, Annie Foret, Isabelle Tellier:
Learnability of Pregroup Grammars. ICGI 2004: 65-76
2003
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/acl/BechetF03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/acl/BechetF03
Denis Béchet, Annie Foret:
k-Valued Non-Associative Lambek Categorial Grammars are not Learnable from Strings. ACL 2003: 351-358
[c7]
- view
  - electronic edition @ aclanthology.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/taln/BechetF03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/taln/BechetF03
Denis Béchet, Annie Foret:
Remarques et perspectives sur les langages de prégroupe d'ordre 1/2. TALN (Posters) 2003: 309-314
[c6]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/entcs/BechetF03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entcs/BechetF03
Denis Béchet, Annie Foret:
k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures. WoLLIC 2003: 60-72

a service of

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.