DeepAI AI Chat
Log In Sign Up

Constrained Decoding for Computationally Efficient Named Entity Recognition Taggers

by   Brian Lester, et al.

Current state-of-the-art models for named entity recognition (NER) are neural models with a conditional random field (CRF) as the final layer. Entities are represented as per-token labels with a special structure in order to decode them into spans. Current work eschews prior knowledge of how the span encoding scheme works and relies on the CRF learning which transitions are illegal and which are not to facilitate global coherence. We find that by constraining the output to suppress illegal transitions we can train a tagger with a cross-entropy loss twice as fast as a CRF with differences in F1 that are statistically insignificant, effectively eliminating the need for a CRF. We analyze the dynamics of tag co-occurrence to explain when these constraints are most effective and provide open source implementations of our tagger in both PyTorch and TensorFlow.


page 1

page 2

page 3

page 4


Computationally Efficient NER Taggers with Combined Embeddings and Constrained Decoding

Current State-of-the-Art models in Named Entity Recognition (NER) are ne...

Supervised Complementary Entity Recognition with Augmented Key-value Pairs of Knowledge

Extracting opinion targets is an important task in sentiment analysis on...

Investigating Bi-LSTM and CRF with POS Tag Embedding for Indonesian Named Entity Tagger

Researches on Indonesian named entity (NE) tagger have been conducted si...

Fast and Accurate Recognition of Chinese Clinical Named Entities with Residual Dilated Convolutions

Clinical Named Entity Recognition (CNER) aims to identify and classify c...

Low-Rank Hidden State Embeddings for Viterbi Sequence Labeling

In textual information extraction and other sequence labeling tasks it i...