Our new X account is live! Follow @wizwand_team for updates
WorkDL logo mark

AIN: Fast and Accurate Sequence Labeling with Approximate Inference Network

About

The linear-chain Conditional Random Field (CRF) model is one of the most widely-used neural sequence labeling approaches. Exact probabilistic inference algorithms such as the forward-backward and Viterbi algorithms are typically applied in training and prediction stages of the CRF model. However, these algorithms require sequential computation that makes parallelization impossible. In this paper, we propose to employ a parallelizable approximate variational inference algorithm for the CRF model. Based on this algorithm, we design an approximate inference network that can be connected with the encoder of the neural CRF model to form an end-to-end network, which is amenable to parallelization for faster training and prediction. The empirical results show that our proposed approaches achieve a 12.7-fold improvement in decoding speed with long sentences and a competitive accuracy compared with the traditional CRF approach.

Xinyu Wang, Yong Jiang, Nguyen Bach, Tao Wang, Zhongqiang Huang, Fei Huang, Kewei Tu• 2020

Related benchmarks

TaskDatasetResultRank
Named Entity RecognitionCoNLL 2003 (test)
F1 Score92.2
539
ChunkingCoNLL 2000 (test)
F1 Score92.87
88
Slot FillingATIS (test)
F1 Score95.59
55
Joint Word Segmentation and POS TaggingJapanese (test)
F1 Score89.3
36
Joint Word Segmentation and POS TaggingChinese (test)
F1 Score82
36
POS TaggingUD Treebank Dutch 2.15
Accuracy94.7
24
POS TaggingUD Treebank English 2.15
Accuracy91.7
24
Named Entity RecognitionCoNLL NER (test)
F1 Score84.22
19
Part-of-Speech TaggingUniversal Dependencies (UD) (test)
Accuracy94.97
12
Showing 9 of 9 rows

Other info

Code

Follow for update