Simple K-star Categorial Dependency Grammars and their Inference - LINA - Equipe Traitement Automatique du Langage Naturel Access content directly
Conference Papers Year : 2016

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.
Fichier principal
Vignette du fichier
main-ICGI-2016.pdf (337.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01363393 , version 1 (09-09-2016)

Identifiers

  • HAL Id : hal-01363393 , version 1

Cite

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⟩
514 View
71 Download

Share

Gmail Facebook X LinkedIn More