Uncertainty-aware label refinement for sequence labeling

19Citations
Citations of this article
100Readers
Mendeley users who have this article in their library.

Abstract

Conditional random fields (CRF) for label decoding has become ubiquitous in sequence labeling tasks. However, the local label dependencies and inefficient Viterbi decoding have always been a problem to be solved. In this work, we introduce a novel two-stage label decoding framework to model long-term label dependencies, while being much more computationally efficient. A base model first predicts draft labels, and then a novel two-stream self-attention model makes refinements on these draft predictions based on long-range label dependencies, which can achieve parallel decoding for a faster prediction. In addition, in order to mitigate the side effects of incorrect draft labels, Bayesian neural networks are used to indicate the labels with a high probability of being wrong, which can greatly assist in preventing error propagation. The experimental results on three sequence labeling benchmarks demonstrated that the proposed method not only outperformed the CRF-based methods but also greatly accelerated the inference process.

Cite

CITATION STYLE

APA

Gui, T., Ye, J., Zhang, Q., Li, Z., Fei, Z., Gong, Y., & Huang, X. (2020). Uncertainty-aware label refinement for sequence labeling. In EMNLP 2020 - 2020 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference (pp. 2316–2326). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2020.emnlp-main.181

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free