Hierarchically-Refined Label Attention Network for Sequence Labeling

Leyang Cui, Yue Zhang
8/23/2019
cs.CL

Official code: Nealcly/BiLSTM-LAN (291 stars, Apache-2.0, PyTorch, last commit 2021-04-09).

Abstract

CRF has been used as a powerful model for statistical sequence labeling. For neural sequence labeling, however, BiLSTM-CRF does not always lead to better results compared with BiLSTM-softmax local classification. This can be because the simple Markov label transition model of CRF does not give much information gain over strong neural encoding. For better representing label sequences, we investigate a hierarchically-refined label attention network, which explicitly leverages label embeddings and captures potential long-term label dependency by giving each word incrementally refined label distributions with hierarchical attention. Results on POS tagging, NER and CCG supertagging show that the proposed model not only improves the overall tagging accuracy with similar number of parameters, but also significantly speeds up the training and testing compared to BiLSTM-CRF.

View on arXivView PDF

Code Implementations(1)

Nealcly/BiLSTM-LANOfficial100%
PyTorchApache-2.0

Hierarchically-Refined Label Attention Network for Sequence Labeling

29149Shell, PythonAug 15, 20195 years agoApache-2.0
ccgemnlp2019label-attention-networknamed-entity-recognitionpart-of-speech-tagger+2 more

Similar Papers

Cite this paper

@article{cui2019hierarchicallyrefined,
  title  = {Hierarchically-Refined Label Attention Network for Sequence Labeling},
  author = {Leyang Cui and Yue Zhang},
  year   = {2019},
  eprint = {1908.08676},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1908.08676}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1908.08676.svg)](https://codeofpaper.com/paper/1908.08676)

Discussion