Abstract
Dependency parsing is a syntactic analysis method to analyze the dependency relationships between words in a sentence. The interconnection between words through dependency relationships is typical graph data. Traditional Tibetan dependency parsing methods typically model dependency analysis as a transition-based or sequence-labeling task, ignoring the graph information between words. To address this issue, this paper proposes a graph neural network (GNN)-based Tibetan dependency parsing method. This method treats Tibetan words as nodes and the dependency relationships between words as edges, thereby constructing the graph data of Tibetan sentences. Specifically, we use BiLSTM to learn the word representations of Tibetan, utilize GNN to model the relationships between words and employ MLP to predict the types of relationships between words. We conduct experiments on a Tibetan dependency database, and the results show that the proposed method can achieve high-quality Tibetan dependency parsing results.- Anthology ID:
- 2023.alp-1.24
- Volume:
- Proceedings of the Ancient Language Processing Workshop
- Month:
- September
- Year:
- 2023
- Address:
- Varna, Bulgaria
- Editors:
- Adam Anderson, Shai Gordin, Bin Li, Yudong Liu, Marco C. Passarotti
- Venues:
- ALP | WS
- SIG:
- Publisher:
- INCOMA Ltd., Shoumen, Bulgaria
- Note:
- Pages:
- 213–221
- Language:
- URL:
- https://aclanthology.org/2023.alp-1.24
- DOI:
- Cite (ACL):
- Bo An. 2023. Tibetan Dependency Parsing with Graph Convolutional Neural Networks. In Proceedings of the Ancient Language Processing Workshop, pages 213–221, Varna, Bulgaria. INCOMA Ltd., Shoumen, Bulgaria.
- Cite (Informal):
- Tibetan Dependency Parsing with Graph Convolutional Neural Networks (An, ALP-WS 2023)
- PDF:
- https://preview.aclanthology.org/alta-23-ingestion/2023.alp-1.24.pdf