REVIEW 3 cited by
TENER: Adapting Transformer Encoder for Named Entity Recognition
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
The Bidirectional long short-term memory networks (BiLSTM) have been widely used as an encoder in models solving the named entity recognition (NER) task. Recently, the Transformer is broadly adopted in various Natural Language Processing (NLP) tasks owing to its parallelism and advantageous performance. Nevertheless, the performance of the Transformer in NER is not as good as it is in other NLP tasks. In this paper, we propose TENER, a NER architecture adopting adapted Transformer Encoder to model the character-level features and word-level features. By incorporating the direction and relative distance aware attention and the un-scaled attention, we prove the Transformer-like encoder is just as effective for NER as other NLP tasks.
Forward citations
Cited by 3 Pith papers
-
Measuring the practice of shared-decision making (OPTION12): An Investigation into Open-sourced Smaller LLMs (OS-sLLMs) for Better Privacy and Sustainability
Open-source smaller LLMs show moderate correlation with human OPTION12 SDM coding, with Gemma3:12b performing best, but remain insufficient for fully automated clinical assessment.
-
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.
-
A Word is Worth 4-bit: Efficient Log Parsing with Binary Coded Decimal Recognition
A 312k-parameter character-level log parser using 4-bit BCD encoding matches LLM-based parser accuracy at up to 20x higher throughput.
Discussion (0). Continue with ORCID to comment.