Mining Word Boundaries from Speech-Text Parallel Data for Cross-domain Chinese Word Segmentation

Xuebin Wang, Lei Zhang, Zhenghua Li, Shilin Zhou, Chen Gong +1 more
12/12/2024
cs.CL

No official code found. Best implementation: XuebinWang-ai/Mining_Word_Boundaries (1 star, last commit 2025-07-18).

Abstract

Inspired by early research on exploring naturally annotated data for Chinese Word Segmentation (CWS), and also by recent research on integration of speech and text processing, this work for the first time proposes to explicitly mine word boundaries from speech-text parallel data. We employ the Montreal Forced Aligner (MFA) toolkit to perform character-level alignment on speech-text data, giving pauses as candidate word boundaries. Based on detailed analysis of collected pauses, we propose an effective probability-based strategy for filtering unreliable word boundaries. To more effectively utilize word boundaries as extra training data, we also propose a robust complete-then-train (CTT) strategy. We conduct cross-domain CWS experiments on two target domains, i.e., ZX and AISHELL2. We have annotated about 1,000 sentences as the evaluation data of AISHELL2. Experiments demonstrate the effectiveness of our proposed approach.

View on arXivView PDF

Code Implementations(1)

COLING2025

10Shell, PythonJun 16, 20241 years ago

Cite this paper

@article{wang2024mining,
  title  = {Mining Word Boundaries from Speech-Text Parallel Data for Cross-domain Chinese Word Segmentation},
  author = {Xuebin Wang and Lei Zhang and Zhenghua Li and Shilin Zhou and Chen Gong and Yang Hou},
  year   = {2024},
  eprint = {2412.09045},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2412.09045v1}
}

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/2412.09045.svg)](https://codeofpaper.com/paper/2412.09045)

Discussion