SubRegWeigh: Effective and Efficient Annotation Weighing with Subword Regularization
About
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 .
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Named Entity Recognition | CoNLL 2003 (test) | F1 Score94.22 | 539 | |
| Text Classification | SST-2 | Accuracy94.84 | 121 | |
| Named Entity Recognition | Wnut 2017 | F1 Score60.29 | 79 | |
| Named Entity Recognition | CoNLL English 2003 (val) | Micro-F197.3 | 19 | |
| Paraphrase Detection | MRPC | Accuracy90.16 | 14 | |
| Named Entity Recognition | CoNLL-CW (test) | F1 Score96.12 | 11 | |
| Named Entity Recognition | CoNLL 2020 | F1 Score95.31 | 10 |