1. Denis Béchet and Annie Foret. Incremental learning of iterated dependencies. Journal of Machine Learning, 2022. [doi:10.1007/s10994-021-05947-2] Keyword(s): Grammatical inference - Categorial grammar - Dependency grammar - Incremental learning - Iterated types - Treebanks. [Abstract] [bibtex-entry]



2. Annie Foret and Denis Béchet. On Categorial Grammatical Inference and Logical Information Systems. In Logic and Algorithms in Computational Linguistics 2018, Series: Advances in Intelligent Systems and Computing, Studies in Computational Intelligence. 2019. [WWW] [Abstract] [bibtex-entry]



3. D. Béchet, R. Bonato, A. Dikovsky, A. Foret, Y. Le Nir, E. Moreau, C. Retoré, and I. Tellier. Modèles algorithmiques de l'acquisition de la syntaxe : concepts et méthodes, résultats et problèmes. Recherches linguistiques de Vincennes, 2007. Note: Vol. 37, Presses Universitaires de Vincennes. [PDF] Keyword(s): Acquisition syntaxique, inférence grammaticale, grammaires catégorielles, modèle de Gold, ressources syntaxiques (syntax learning, grammatical inference, categorial grammars, Gold's model, syntactical resources). [Abstract] [bibtex-entry]



4. Denis Bechet and Annie Foret. k-Valued Non-Associative Lambek Grammars are learnable from Generalized Functor-Argument Structures. Journal of Theoretical Computer Science, 2006. Note: Vol. 355, 2 (extended version). [PDF] Keyword(s): Grammatical inference, Categorial grammars, Non-associative Lambek calculus, Learning from positive examples, Model of Gold. [Abstract] [bibtex-entry]

1. Denis Béchet, Alexander Dikovsky, and Annie Foret. On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types. In Logical Aspects of Computational Linguistics - 6th International Conference, LACL 2011, Montpellier, France, volume 6736 of Lecture Notes in Computer Science, pages 80-95, 2011. Springer. Keyword(s): Grammatical inference, Categorial grammar, Dependency grammar, Incremental learning, Iterated types.. [Abstract] [bibtex-entry]



2. Denis Bechet and Annie Foret. On Rigid NL Lambek Grammars Inference from Generalized Functor-Argument Data. In FGMOL'05, the tenth conference on Formal Grammar and the ninnth on the Mathematics of Language, Edinburgh, Scotland, 2005. Keyword(s): grammatical inference, categorial grammars, non- associative Lambek calculus, learning from positive examples, model of Gold. [Abstract] [bibtex-entry]

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.

This document was translated from BibT_EX by bibtex2html