1. 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]



2. 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. Sébastien Ferré. The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees. In S.O. Kuznetsov and S. Schmidt, editors, Int. Conf. Formal Concept Analysis, LNAI 4390, pages 98-113, 2007. Springer. Keyword(s): concept analysis, logic, string, suffix tree. [Abstract] [bibtex-entry]



2. Sébastien Ferré and Olivier Ridoux. Logical Information Systems: from Taxonomies to Logics. In DEXA Work. Dynamic Taxonomies and Faceted Search (FIND), pages 212-216, 2007. IEEE Computer Society. [PDF] Keyword(s): logical information system, taxonomy, logic. [Abstract] [bibtex-entry]



3. 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]



4. Denis Bechet and Annie Foret. k-valued Non-Associative Lambek Categorial Grammars are not Learnable from Strings. In ACL, editor, Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics (ACL 2003), July 2003. [bibtex-entry]



5. Annie Foret and Yannick Le Nir. Lambek rigid grammars are not learnable from strings. In COLING'2002, 19th International Conference on Computational Linguistics, Taipei, Taiwan, 2002. [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