Skip to Main content Skip to Navigation
Conference papers

On learning discontinuous dependencies from positive data

Abstract : 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.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download
Contributor : Erwan Moreau <>
Submitted on : Thursday, May 27, 2010 - 5:50:28 PM
Last modification on : Friday, July 10, 2020 - 4:01:17 PM
Document(s) archivé(s) le : Thursday, September 16, 2010 - 3:29:38 PM


Files produced by the author(s)


  • HAL Id : hal-00487058, version 1


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⟩



Record views


Files downloads