Skip to Main content Skip to Navigation
Conference papers

On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00820207
Contributor : Denis Béchet <>
Submitted on : Friday, May 3, 2013 - 2:02:40 PM
Last modification on : Friday, July 10, 2020 - 4:01:11 PM

Identifiers

Citation

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⟩

Share

Metrics

Record views

316