On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types - Archive ouverte HAL
Communication Dans Un Congrès Année : 2011

On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types

Denis Béchet
Annie Foret

Résumé

We study learnability of Categorial Dependency Grammars (CDG), a family of categorial grammars expressing all kinds of projective, discontinuous and repeatable dependencies. For these grammars, it is known that they are not learnable from dependency structures. We propose two different ways of modelling the repeatable dependencies through iterated types and the two corresponding families of CDG which cannot distinguish between the dependencies repeatable at least $K$ times and those repeatable {\sf any} number of times. For both we show that they are incrementally learnable in the limit from dependency structures.
Fichier non déposé

Dates et versions

hal-00820207 , version 1 (03-05-2013)

Identifiants

Citer

Denis Béchet, Alexander Dikovsky, Annie Foret. On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types. 6th International Conference on Logical Aspects of Computational Linguistics, Jun 2011, Montpellier, France. pp.80-95, ⟨10.1007/978-3-642-22221-4⟩. ⟨hal-00820207⟩
153 Consultations
0 Téléchargements

Altmetric

Partager

More