Abstract
Categorial Dependency Grammars (CDG) are computational grammars for natural language processing, 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 able to define discontinuous (non-projective) dependencies. Algorithms have been proposed to infer grammars in this class from treebanks, with respect to Mel’čuk principles. We consider this approach with experiments on Breton. We focus in particular on ”repeatable dependencies” (iterated) and their patterns. A dependency d is iterated in a dependency structure if some word in this structure governs several other words through dependency d. We illustrate this approach with data in the universal dependencies format and dependency patterns written in Grew (a graph rewriting tool dedicated to applications in natural Language Processing).- Anthology ID:
- 2022.cltw-1.6
- Volume:
- Proceedings of the 4th Celtic Language Technology Workshop within LREC2022
- Month:
- June
- Year:
- 2022
- Address:
- Marseille, France
- Editors:
- Theodorus Fransen, William Lamb, Delyth Prys
- Venue:
- CLTW
- SIG:
- Publisher:
- European Language Resources Association
- Note:
- Pages:
- 40–46
- Language:
- URL:
- https://aclanthology.org/2022.cltw-1.6
- DOI:
- Cite (ACL):
- Annie Foret, Denis Béchet, and Valérie Bellynck. 2022. Iterated Dependencies in a Breton treebank and implications for a Categorial Dependency Grammar. In Proceedings of the 4th Celtic Language Technology Workshop within LREC2022, pages 40–46, Marseille, France. European Language Resources Association.
- Cite (Informal):
- Iterated Dependencies in a Breton treebank and implications for a Categorial Dependency Grammar (Foret et al., CLTW 2022)
- PDF:
- https://preview.aclanthology.org/proper-vol2-ingestion/2022.cltw-1.6.pdf