mlsanityData to 7 Oct 2026

Read, Retrospect, Select: An MRC Framework to Short Text Entity Linking

arXiv 2101.02394 ↗First posted 7 Jan 2021cs.CLcited by 14

Not on the map. Why?

Abstract (arXiv)

Entity linking (EL) for the rapidly growing short text (e.g. search queries and news titles) is critical to industrial applications. Most existing approaches relying on adequate context for long text EL are not effective for the concise and sparse short text. In this paper, we propose a novel framework called Multi-turn Multiple-choice Machine reading comprehension (M3}) to solve the short text EL from a new perspective: a query is generated for each ambiguous mention exploiting its surrounding context, and an option selection module is employed to identify the golden entity from candidates using the query. In this way, M3 framework sufficiently interacts limited context with candidate entities during the encoding process, as well as implicitly considers the dissimilarities inside the candidate bunch in the selection stage. In addition, we design a two-stage verifier incorporated into M3 to address the commonly existed unlinkable problem in short text. To further consider the topical coherence and interdependence among referred entities, M3 leverages a multi-turn fashion to deal with mentions in a sequence manner by retrospecting historical cues. Evaluation shows that our M3 framework achieves the state-of-the-art performance on five Chinese and English datasets for the real-world short text EL.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 19 of its 30 references that are in the map. First posted on arXiv 7 Jan 2021.

Builds on

19 of 30 references.

References · 19

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  3. 2018Deep contextualized word representationscited by 2,285
  4. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
  5. 2018Know What You Don't Know: Unanswerable Questions for SQuADcited by 1,538
  6. 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 851
  7. 2019A Unified MRC Framework for Named Entity Recognitioncited by 199
  8. 2019Zero-Shot Entity Linking by Reading Entity Descriptionscited by 124
  9. 2019Learning Dense Representations for Entity Retrievalcited by 122
  10. 2015The Goldilocks Principle: Reading Children's Books with Explicit Memory Representationscited by 108
  11. 2019Coreference Resolution as Query-based Span Predictioncited by 91
  12. 2018End-to-End Neural Entity Linkingcited by 85
7 more
  1. 2019Joint Entity Linking with Deep Reinforcement Learningcited by 27
  2. 2017Named Entity Disambiguation for Noisy Textcited by 24
  3. 2020Improving Entity Linking by Modeling Latent Entity Type Informationcited by 18
  4. 2016S-MART: Novel Tree-based Structured Learning Algorithms Applied to Tweet Entity Linkingcited by 16
  5. 2019Distant Learning for Entity Linking with Automatic Noise Detectioncited by 11
  6. 2019Entity-aware ELMo: Learning Contextual Entity Representation for Entity Disambiguationcited by 10
  7. 2018Jointly Embedding Entities and Text with Distant Supervisioncited by 7

Built on by

Cited by year

Citing papers per year: 2021: 6; 2022: 2; 2023: 4; 2024: 2.

14 papers.

Sort: