基于短语及依存的标注规则和短语识别算法研究
Summary
Most Chinese dependency parsing runs on word-segmented text and relies on end-to-end supervised models. The authors identify two weaknesses in this approach. First, annotation schemes such as LTP and Baidu's use dozens of POS and relation labels, which makes annotation slow and error-prone for non-linguists. Second, sequence-labelling models assign one tag per span and so cannot represent nested constituents.
To address this, the authors take the phrase rather than the word as the basic unit and define a simplified scheme with seven nestable phrase types, plus dependency links between phrases. Using this scheme they built the Chinese Phrase Window Dataset (CPWD).
They also propose the Syntax Window Model (SWM), which borrows its design from Faster R-CNN object detection. SWM enumerates every candidate span, predicts whether each span is a phrase, adjusts its start and end boundaries with small offsets, and then classifies the phrase type. This lets it recover overlapping phrases and their dependencies jointly.
On CPWD, SWM beats a conventional end-to-end baseline by over 1 F1 point. The same method also won first place in the CCL2018 Chinese metaphor sentiment analysis task. The work offers an easier-to-annotate, nesting-aware alternative to fine-grained Chinese parsing schemes.
Key points
- Seven phrase categories, each with its own bracket notation: noun, verb, numeral-classifier, prepositional, conjunction, modal-particle, and clause. Pivotal, serial-verb, and subject/object clauses are all marked as clauses.
- CPWD corpus:
- 45,000 mostly modern Chinese sentences drawn from dialogue, news, law, policy texts, and fiction.
- Sentences are capped at 50 characters.
- The data is split into 35,000 training, 5,000 validation, and 5,000 test sentences.
- SWM architecture:
- A feature encoder (LSTM or BERT; experiments mention a 2-layer BiLSTM) feeds a window-localisation network.
- This network scores all N(N+1)/2 spans and regresses start/end offsets of at most one character.
- Training combines a cross-entropy loss for phrase detection with an RMSE loss for the offsets.
- Results: SWM improves F1 by more than 1 point over a traditional end-to-end model on CPWD. In CCL2018 metaphor sentiment analysis, the method added more than 1 F1 point and ranked first.
Cite
@article{2024,
title = {{基于短语及依存的标注规则和短语识别算法研究}},
author = {刘广 and 涂刚 and 李政 and 刘译键},
journal = {中文信息学报 (Journal of Chinese Information Processing)},
year = {2024},
url = {http://jcip.cipsc.org.cn/article/id/zwxxxb_3676}
}References
- [ 基于字的分布表征的汉 11] 李国 臣, 党 帅 兵, 王 瑞 波, 等 . 语基本块识别 [ 中 文 信 息 学 报, J]. 2014, 28( 06):18 - 25. find
- [ 12] 徐菁 . 面 向 中 文 知 识 图 谱 的 开 放 式 文 本 信 息 抽 取 关 键技术研究[ 国防科技大学硕士学位论文, D]. 2018. find
- [ 基于强化学习协同训练的 13] 程钟 慧,陈 珂,陈 刚,等 . 命名实体识别方 法 [ 软 件 工 程,2020,23( J]. 01):7 - 11. find
- [ 题元 理 论 与 汉 语 配 价 问 题 [ 14] 徐烈炯 . J]. 当 代 语 言 学, ( ) : 1998 3 1 - 21. find
- [ 生成 语 法 中 词 汇 语 义 与 句 法 的 界 面 研 究 [ 15] 刘宇红 . J]. 外语学刊, 2011( 05):56 - 60. find
- [ 基于大规模 语 义 知 识 库 的“ 词 汇—句 法 语 义” 16] 孙道功 . 接口研究[ 语言文字应用, J]. 2016( 02):125 - 134. find
- [ 施 事、 受 事 句 法 实 现 的 义 类 17] 亢世 勇, 许 小 星, 马 永 腾 . 制约[ 语文研究, J]. 2011( 04):36 - 40. find
This page in Markdown → https://md.research.elamur.ai/free/papers/liu-2024-annotation-rules-phrase/