Challenge: Named entity recognition (NER) is a fundamental problem in information retrieval . nested NER has a cubic-time complexity, but can be realized in quadratic time using a semi-Markov model .
Approach: They propose a span-based named-entity recognition algorithm with a quadratic-time complexity . they add a constraint on the search space to reduce the complexity of the algorithm .
Outcome: The proposed algorithm covers a large part of three standard English benchmarks and delivers comparable results.

Similar Papers

Nested Named Entity Recognition with Span-level Graphs (2022.acl-long)

Copied to clipboard

Challenge: Named entity recognition is one of the major subtasks of information extraction for extracting categorized named entities from unstructured text.
Approach: They propose to use retrieval-based span-level graphs to connect spans and entities in the training data based on n-gram features to integrate information of similar neighbor entities into the span representation.
Outcome: The proposed method achieves general improvements on all three benchmarks and special superiority on low frequency entities.
Locate and Label: A Two-stage Identifier for Nested Named Entity Recognition (2021.acl-long)

Copied to clipboard

Challenge: Named entity recognition (NER) is a well-studied task in natural language processing.
Approach: They propose a method that generates span proposals and labels them with categories . they use boundary information of entities and partially matched spans to locate them .
Outcome: The proposed method outperforms state-of-the-art models on nested NER datasets.
A Unified Generative Framework for Various NER Subtasks (2021.acl-long)

Copied to clipboard

Challenge: Named Entity Recognition (NER) is the task of identifying spans that represent entities in sentences.
Approach: They propose to formulate NER subtasks as entity span sequence generation task . framework can be used to solve all three kinds of NER tasks without tagging schema .
Outcome: The proposed framework achieves state-of-the-art (SoTA) or near SoTA performance on eight English NER datasets.
Extract-Select: A Span Selection Framework for Nested Named Entity Recognition with Generative Adversarial Training (2022.findings-acl)

Copied to clipboard

Challenge: Existing studies treat named entity recognition as a sequential labeling problem.
Approach: They propose a span selection framework for nested named entity recognition . they propose nesting entities with different input categories would be separately extracted .
Outcome: The proposed framework outperforms competing models on four benchmark datasets.
SpanNER: Named Entity Re-/Recognition as Span Prediction (2021.acl-long)

Copied to clipboard

Challenge: Recent years have seen the paradigm shift of Named Entity Recognition (NER) systems from sequence labeling to span prediction.
Approach: They experimentally implement 154 named entity recognition models on 11 datasets and show that span prediction can serve as a system combiner to re-recognize named entities from different systems’ outputs.
Outcome: The proposed model can be used to re-recognize named entities from different systems’ outputs.
Simple Yet Powerful: An Overlooked Architecture for Nested Named Entity Recognition (2022.coling-1)

Copied to clipboard

Challenge: Named Entity Recognition (NER) is an important task in Natural Language Processing that aims to identify text spans belonging to predefined categories.
Approach: They propose to revisit the Multiple LSTM-CRF (MLC) model, a simple, overlooked, yet powerful approach based on training independent sequence labeling models for each entity type.
Outcome: The proposed model achieves state-of-the-art results in the Chilean Waiting List corpus by including pre-trained language models.
T 2 -NER: A Two-Stage Span-Based Framework for Unified Named Entity Recognition with Templates (2023.tacl-1)

Copied to clipboard

Challenge: Named Entity Recognition (NER) has evolved from flat to overlapped and discontinuous . NER is a text recognition task that recognizes mentions that represent entities in text .
Approach: They propose a two-stage span-based framework to solve a unified NER task using two stages . they extract entity spans, classify over all entity span pairs and combine them to train two stages.
Outcome: The proposed framework beats all the current competitive baselines on eight benchmark datasets, obtaining the best performance of unified NER.
Named Entity Recognition as Dependency Parsing (2020.acl-main)

Copied to clipboard

Challenge: Named Entity Recognition (NER) is a fundamental task in Natural Language Processing, concerned with identifying spans of text expressing references to entities.
Approach: They propose a method to handle both types of NEs in one system by using a biaffine dependency parsing model which scores pairs of start and end tokens in a sentence.
Outcome: The proposed model performs well on 8 corpora and achieves accuracy gains of up to 2.2 percentage points.
A Unified MRC Framework for Named Entity Recognition (2020.acl-main)

Copied to clipboard

Challenge: Named entity recognition is divided into nested NER and flat NER depending on whether entities are nesting.
Approach: They propose to formulate named entity recognition task as machine reading comprehension task instead of sequence labeling problem .
Outcome: The proposed framework achieves vast amount of performance boost over current models on nested and flat NER datasets.
Span-based Named Entity Recognition by Generating and Compressing Information (2023.eacl-main)

Copied to clipboard

Challenge: Existing work on Named Entity Recognition (NER) only used generative or information compression models to improve performance.
Approach: They propose to combine two types of IB models into one system to enhance Named Entity Recognition (NER) they incorporate unsupervised generative components span reconstruction and synonym generation into a span-based NER system.
Outcome: The proposed model focuses on learning span representation, which is applicable not only to span-based NER but also to other span-related tasks such as event coreference resolution and question answering.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations