On learning discontinuous dependencies from positive data - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

On learning discontinuous dependencies from positive data

Résumé

This paper is concerned with learning in the model of Gold the Categorial Dependency Grammars (CDG), which express discontin- uous (non-projective) dependencies. We show that rigid and k-valued CDG (without optional and iterative types) are learnable from strings. In fact, we prove that the languages of dependency nets coding rigid CDGs have finite elasticity, and we show a learning algorithm. As a standard corollary, this result leads to the learnability of rigid or k- valued CDGs (without optional and iterative types) from strings.
Fichier principal
Vignette du fichier
bechet_al_fg04.pdf (186.58 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00487058 , version 1 (27-05-2010)

Identifiants

  • HAL Id : hal-00487058 , version 1

Citer

Denis Béchet, Alexandre Dikovsky, Annie Foret, Erwan Moreau. On learning discontinuous dependencies from positive data. 9th conference on Formal Grammar (FG 2004), Aug 2004, Nancy, France. pp.1--16. ⟨hal-00487058⟩
407 Consultations
93 Téléchargements

Partager

Gmail Facebook X LinkedIn More