홈 › Papers

Subsequence Based Deep Active Learning for Named Entity Recognition

Active Learning (AL) has been successfully applied to Deep Learning in order to drastically reduce the amount of data required to achieve high performance. Previous works have shown that lightweight architectures for Named Entity Recognition (NER) can achieve optimal performance with only 25{\%} of the original training data. However, these methods do not exploit the sequential nature of language and the heterogeneity of uncertainty within each instance, requiring the labelling of whole sentences. Additionally, this standard method requires that the annotator has access to the full sentence when labelling. In this work, we overcome these limitations by allowing the AL algorithm to query subsequences within sentences, and propagate their labels to other sentences. We achieve highly efficient results on OntoNotes 5.0, only requiring 13{\%} of the original training data, and CoNLL 2003, requiring only 27{\%}. This is an improvement of 39{\%} and 37{\%} compared to querying full sentences.

Code (0)

등록된 구현이 없습니다.

Tasks

Similar Papers 제목 키워드 기반