Categorial Dependency Grammars extended with barriers (CDGb) yield an Abstract Family of Languages (AFL) - Archive ouverte HAL
Communication Dans Un Congrès Année : 2024

Categorial Dependency Grammars extended with barriers (CDGb) yield an Abstract Family of Languages (AFL)

Résumé

We consider the family of Categorial Dependency Grammars (CDG), as computational grammars for language processing. CDG are a class of categorial grammars defining dependency structures. They can be viewed as a formal system, where types are attached to words, combining the classical categorial grammars’ elimination rules with valency pairing rules that are able to define non-projective (discontinuous) dependencies. Whereas the problem of closure under iteration is open for the original version of CDG, we define “CDG extended with barriers”, an extended version of the original CDG, that solves this formal issue. We provide a rule system and we show that the extended version defines an Abstract Family of Languages (AFL), while preserving advantages of the original CDG, in terms of expressivity, parsing and efficiency.
Fichier principal
Vignette du fichier
GT_CDG-version-HAL.pdf (392.69 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04570932 , version 1 (07-05-2024)

Identifiants

Citer

Denis Béchet, Annie Foret. Categorial Dependency Grammars extended with barriers (CDGb) yield an Abstract Family of Languages (AFL). 5th International Conference on Natural Language Processing and Computational Linguistics (NLPCL 2024), David C. Wyld; Dhinaharan Nagamalai, Sep 2024, Copenhagen, Denmark. pp.53-66, ⟨10.5121/csit.2024.141706⟩. ⟨hal-04570932⟩
43 Consultations
17 Téléchargements

Altmetric

Partager

More