SubRegWeigh: Effective and Efficient Annotation Weighing with Subword Regularization

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Tsuji, Kohei, Hiraoka, Tatsuya, Cheng, Yuchang, Iwakura, Tomoya
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866915132061253632
author Tsuji, Kohei
Hiraoka, Tatsuya
Cheng, Yuchang
Iwakura, Tomoya
author_facet Tsuji, Kohei
Hiraoka, Tatsuya
Cheng, Yuchang
Iwakura, Tomoya
contents NLP datasets may still contain annotation errors, even when they are manually annotated. Researchers have attempted to develop methods to automatically reduce the adverse effect of errors in datasets. However, existing methods are time-consuming because they require many trained models to detect errors. This paper proposes a time-saving method that utilizes a tokenization technique called subword regularization to simulate multiple error detection models for detecting errors. Our proposed method, SubRegWeigh, can perform annotation weighting four to five times faster than the existing method. Additionally, SubRegWeigh improved performance in document classification and named entity recognition tasks. In experiments with pseudo-incorrect labels, SubRegWeigh clearly identifies pseudo-incorrect labels as annotation errors. Our code is available at https://github.com/4ldk/SubRegWeigh .
format Preprint
id arxiv_https___arxiv_org_abs_2409_06216
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle SubRegWeigh: Effective and Efficient Annotation Weighing with Subword Regularization
Tsuji, Kohei
Hiraoka, Tatsuya
Cheng, Yuchang
Iwakura, Tomoya
Computation and Language
NLP datasets may still contain annotation errors, even when they are manually annotated. Researchers have attempted to develop methods to automatically reduce the adverse effect of errors in datasets. However, existing methods are time-consuming because they require many trained models to detect errors. This paper proposes a time-saving method that utilizes a tokenization technique called subword regularization to simulate multiple error detection models for detecting errors. Our proposed method, SubRegWeigh, can perform annotation weighting four to five times faster than the existing method. Additionally, SubRegWeigh improved performance in document classification and named entity recognition tasks. In experiments with pseudo-incorrect labels, SubRegWeigh clearly identifies pseudo-incorrect labels as annotation errors. Our code is available at https://github.com/4ldk/SubRegWeigh .
title SubRegWeigh: Effective and Efficient Annotation Weighing with Subword Regularization
topic Computation and Language
url https://arxiv.org/abs/2409.06216