Character-Level Chinese Dependency Parsing via Modeling Latent Intra-Word Structure
Not on the map. Why?
Abstract (arXiv)
Revealing the syntactic structure of sentences in Chinese poses significant challenges for word-level parsers due to the absence of clear word boundaries. To facilitate a transition from word-level to character-level Chinese dependency parsing, this paper proposes modeling latent internal structures within words. In this way, each word-level dependency tree is interpreted as a forest of character-level trees. A constrained Eisner algorithm is implemented to ensure the compatibility of character-level trees, guaranteeing a single root for intra-word structures and establishing inter-word dependencies between these roots. Experiments on Chinese treebanks demonstrate the superiority of our method over both the pipeline framework and previous joint models. A detailed analysis reveals that a coarse-to-fine parsing strategy empowers the model to predict more linguistically plausible intra-word structures.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 6 of its 36 references that are in the map. First posted on arXiv 6 Jun 2024.
Builds on
6 of 36 references.
References · 6
- 2016Deep Biaffine Attention for Neural Dependency Parsingcited by 334
- 2020Efficient Second-Order TreeCRF for Neural Dependency Parsingcited by 48
- 2016Unsupervised Neural Hidden Markov Modelscited by 19
- 2021Semantic Role Labeling as Dependency Parsing: Exploring Latent Tree Structures Inside Argumentscited by 14
- 2019A Graph-based Model for Joint Chinese Word Segmentation and Dependency Parsingcited by 6
- 2021An In-depth Study on Internal Structure of Chinese Wordscited by 1
Built on by
Not cited yet.