Skip to Main content Skip to Navigation
Conference papers

Simple K-star Categorial Dependency Grammars and their Inference

Abstract : We propose a novel subclass in the family of Categorial Dependency Grammars (CDG), based on a syntactic criterion on categorial types associated to words in the lexicon and study its learnability. This proposal relies on a linguistic principle and relates to a former non-constructive condition on iterated dependencies. We show that the projective CDG in this subclass are incrementally learnable in the limit from dependency structures. In contrast to previous proposals, our criterion is both syntactic and does not impose a (rigidity) bound on the number of categorial types associated to a word.
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download
Contributor : Annie Foret <>
Submitted on : Friday, September 9, 2016 - 3:40:33 PM
Last modification on : Friday, July 10, 2020 - 4:21:34 PM
Document(s) archivé(s) le : Saturday, December 10, 2016 - 1:25:26 PM


Files produced by the author(s)


  • HAL Id : hal-01363393, version 1


Denis Béchet, Annie Foret. Simple K-star Categorial Dependency Grammars and their Inference. The 13th International Conference on Grammatical Inference (ICGI), Oct 2016, Delft, Netherlands. ⟨hal-01363393⟩



Record views


Files downloads