Thunder-DeID+：面向韩国法院判决书及更广泛敏感文档的边界感知去标识化模型

Authors:Gyuseong Lee, Gyeongje Cho, Jongmin Kim, Heejin Kim, Yeonkyoung So, Hyunggeun Jeon, Hyunji M. Park, Sangho Kim, Yoonhee Park, Youngbin Pyo, Jaejin Lee

View PDF HTML (experimental)

Abstract:This study examines the transferability of a de-identification model developed for Korean court judgments to a broader range of sensitive documents, focusing on boundary precision, label granularity, and recall. The agglutinative structure of Korean causes Byte Pair Encoding (BPE) tokenizers to frequently merge Personally Identifiable Information (PII) with adjacent particles, which complicates accurate span recovery. Furthermore, current PII taxonomies lack sufficient granularity for legal texts. To address these issues, this study introduces Thunder-DeID+, which integrates a refined three-tier PII taxonomy with a boundary-aware tokenizer. The tokenizer enhances a pretrained BPE vocabulary by incorporating N-gram and boundary-scoring components to better align token and PII span boundaries. The proposed approach is evaluated using a tokenizer-independent word-segment-level protocol. On full-length judgments, the tokenizer consistently improves W. Strict Typed F1-score from 0.76-0.77 to 0.87-0.88 across four model sizes (150M, 395M, 750M, and 1B), mainly by increasing precision rather than model scale. With fine-tuning on 1,000 broader sensitive documents, the judgment-trained model further achieves 0.93 W. Strict Typed F1-score, indicating effective transfer beyond court judgments.

Subjects:	Computation and Language (cs.CL)
Cite as:	arXiv:2610.22733 [cs.CL]
	(or arXiv:2610.22733v1 [cs.CL] for this version)
	https://doi.org/10.48550/arXiv.2610.22733 arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Yeonkyoung So [view email]
[v1] Thu, 15 Oct 2026 23:11:43 UTC (320 KB)