Denis Béchet

Alexandre Ja. Dikovsky

Proceedings of the Joint Conference JEP-TALN-RECITAL 2012, 2012

On the Adequacy of Three POS Taggers and a Dependency Parser.

[BibT_eX]

[DOI]

Ramadan Alfared

Proceedings of the Computational Linguistics and Intelligent Text Processing, 2012

2011

On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types.

[BibT_eX]

[DOI]

Proceedings of the Logical Aspects of Computational Linguistics, 2011

"CDG Lab": An Integrated Environment for Categorial Dependency Grammar and Dependency Treebank Development.

[BibT_eX]

[DOI]

Ophélie Lacroix

Proceedings of the Computational Dependency Theory [papers from the International Conference on Dependency Linguistics, 2011

2010

Two Models of Learning Iterated Dependencies.

[BibT_eX]

[DOI]

Proceedings of the Formal Grammar, 2010

2008

Optional and Iterated Types for Pregroup Grammars.

[BibT_eX]

[DOI]

Emmanuelle Garel

Proceedings of the Language and Automata Theory and Applications, 2008

2007

Learnability of Pregroup Grammars.

[BibT_eX]

[DOI]

Isabelle Tellier

Stud Logica, 2007

Parsing Pregroup Grammars and Lambek Calculus Using Partial Composition.

[BibT_eX]

[DOI]

Stud Logica, 2007

Hard combinators.

[BibT_eX]

[DOI]

Sylvain Lippi

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

Universal Boolean Systems.

[BibT_eX]

[DOI]

Sylvain Lippi

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

System identification of photosensitiser uptake kinetics in photodynamic therapy.

[BibT_eX]

[DOI]

Biomed. Signal Process. Control., 2007

Fully Lexicalized Pregroup Grammars.

[BibT_eX]

[DOI]

Proceedings of the Logic, 2007

2006

<i>k</i>-Valued non-associative Lambek grammars are learnable from generalized functor-argument structures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

2005

k-Valued Non-associative Lambek Grammars (Without Product) Form a Strict Hierarchy of Languages.

[BibT_eX]

[DOI]

Proceedings of the Logical Aspects of Computational Linguistics, 2005

Dependency Structure Grammars.

[BibT_eX]

[DOI]

Proceedings of the Logical Aspects of Computational Linguistics, 2005

2003

k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Eighth International Conference on Parsing Technologies, 2003

k-Valued Non-Associative Lambek Categorial Grammars are not Learnable from Strings.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics, 2003

2001

Universal Interaction Systems with Only Two Agents.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

1998

Minimality of the correctness criterion for multiplicative proof nets.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1998

1997

A Complete Axiomatisation for the Inclusion of Series-Parallel Partial Orders.

[BibT_eX]

[DOI]

Philippe de Groote

Christian Retoré

Proceedings of the Rewriting Techniques and Applications, 8th International Conference, 1997

1996

Constructing Different Phonological Bracketings from a Proof Net.

[BibT_eX]

[DOI]

Philippe de Groote

Proceedings of the Logical Aspects of Computational Linguistics, 1996

Removing Value Encoding Using Alternative Values in Partial Evaluation of Strongly-Typed Languages.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 1996

1992

Partial Evaluation of Interaction Nets.

[BibT_eX]