REVIEW 2 cited by
Neural Architectures for Nested NER through Linearization
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We propose two neural network architectures for nested named entity recognition (NER), a setting in which named entities may overlap and also be labeled with more than one label. We encode the nested labels using a linearized scheme. In our first proposed approach, the nested labels are modeled as multilabels corresponding to the Cartesian product of the nested labels in a standard LSTM-CRF architecture. In the second one, the nested NER is viewed as a sequence-to-sequence problem, in which the input sequence consists of the tokens and output sequence of the labels, using hard attention on the word whose label is being predicted. The proposed methods outperform the nested NER state of the art on four corpora: ACE-2004, ACE-2005, GENIA and Czech CNEC. We also enrich our architectures with the recently published contextual embeddings: ELMo, BERT and Flair, reaching further improvements for the four nested entity corpora. In addition, we report flat NER state-of-the-art results for CoNLL-2002 Dutch and Spanish and for CoNLL-2003 English.
Forward citations
Cited by 2 Pith papers
-
FSE: Continual Learning for Named Entity Recognition by Fast-Slow Experts
FSE's shared token-link fast expert plus task-specific span-classification slow expert achieves state-of-the-art continual NER on OntoNotes and FewNERD synthetic splits, at 89.23 and 63.69 final macro-F1.
-
Small Language Model Makes an Effective Long Text Extractor
A smaller span-based NER model with a compressed plus-shaped attention mechanism extracts long entities from very long texts with less memory than prior span-based methods.
Discussion (0). Continue with ORCID to comment.