Character-Level Chinese Dependency Parsing via Modeling Latent Intra-Word Structure

Yang Hou, Zhenghua Li
6/6/2024
cs.CL

No official code found. Best implementation: ironsword666/CharDepParsing (1 star, last commit 2025-03-17).

Abstract

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.

View on arXivView PDF

Code Implementations(1)

10Shell, PythonJun 5, 20241 years ago

Cite this paper

@article{hou2024characterlevel,
  title  = {Character-Level Chinese Dependency Parsing via Modeling Latent Intra-Word Structure},
  author = {Yang Hou and Zhenghua Li},
  year   = {2024},
  eprint = {2406.03772},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2406.03772v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2406.03772.svg)](https://codeofpaper.com/paper/2406.03772)

Discussion