Exploiting Structure in Representation of Named Entities using Active Learning (C18-1)
Copied to clipboard
| Challenge: | Named entities are atomic objects of reference and reasoning in many knowledge-centric applications. |
| Approach: | They propose an active-learning based framework that drastically reduces the labeled data required to learn entities' structures. |
| Outcome: | The proposed framework outperforms handwritten programs and supervised learning models in relation extraction and entity resolution tasks. |
Similar Papers
Learning Structured Representations of Entity Names using Active Learning and Weak Supervision (2020.emnlp-main)
Copied to clipboard
| Challenge: | Structured representations of entity names are useful for many entity-related tasks such as entity normalization and variant generation. |
| Approach: | They propose a framework that combines active learning and weak supervision to solve this problem. |
| Outcome: | The proposed framework enables learning of high-quality models from a dozen labeled examples. |
Practical, Efficient, and Customizable Active Learning for Named Entity Recognition in the Digital Humanities (N19-1)
Copied to clipboard
Alexander Erdmann, David Joseph Wrisley, Benjamin Allen, Christopher Brown, Sophie Cohen-Bodénès, Micha Elsner, Yukun Feng, Brian Joseph, Béatrice Joyeux-Prunel, Marie-Catherine de Marneffe
| Challenge: | Scholars in interdisciplinary fields like the Digital Humanities are increasingly interested in semantic annotation of specialized corpora. |
| Approach: | They propose an active learning solution for named entity recognition that maximizes a custom model’s improvement per additional unit of manual annotation. |
| Outcome: | The proposed model reduces required annotation by 20-60% and outperforms a competitive active learning baseline. |
Entity Linking via Explicit Mention-Mention Coreference Modeling (2022.naacl-main)
Copied to clipboard
| Challenge: | Using a learning approach for entity mentions is a key component of modern entity linking systems for both candidate generation and making linking predictions. |
| Approach: | They propose a training approach that builds minimum spanning arborescences over mentions and entities to explicitly model mention coreference relationships. |
| Outcome: | The proposed approach improves candidate generation recall and link accuracy on the biomedical dataset and on MedMentions, setting a new SOTA result in linking accuracy. |
Regular Expression Guided Entity Mention Mining from Noisy Web Data (D18-1)
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) is a subtask of the broader problem of Information Extraction (IE) from text. |
| Approach: | They propose a framework that uses Regular Expressions to identify entities from web data . they combine expressive power of REs with ability of deep learning to learn from large data a human expert is asked to label a small set of documents . |
| Outcome: | The proposed framework achieves impressive accuracy while requiring modest human effort. |
Improving Entity Linking by Modeling Latent Relations between Mentions (P18-1)
Copied to clipboard
| Challenge: | Entity linking systems often exploit relations between textual mentions to decide if the linking decisions are compatible. |
| Approach: | They treat relations as latent variables while optimizing the neural entity-linking model without supervision. |
| Outcome: | The proposed model outperforms its relation-agnostic version and significantly outperformed its relational version. |
Active Learning for Coreference Resolution using Discrete Annotation (2020.acl-main)
Copied to clipboard
| Challenge: | Exhaustively annotating coreference is expensive as it requires tracking coreference chains across long passages of text. |
| Approach: | They propose a pairwise annotation technique which asks annotators to identify mention antecedents if a presented mention pair is not coreferent. |
| Outcome: | The proposed method is much more efficient when combined with a mention clustering algorithm for selecting which examples to label . future work can use the proposed protocol to develop coreference models for new domains. |
Re-weighting Tokens: A Simple and Effective Active Learning Strategy for Named Entity Recognition (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing active learning approaches focus on information-rich sequences, reducing the need for expert annotation. |
| Approach: | They propose a re-weighting-based active learning strategy that assigns dynamic weights to individual tokens. |
| Outcome: | The proposed strategy improves on multiple corpora and validates its effectiveness. |
DOCENT: Learning Self-Supervised Entity Representations from Large Document Collections (2021.eacl-main)
Copied to clipboard
Yury Zemlyanskiy, Sudeep Gandhe, Ruining He, Bhargav Kanagal, Anirudh Ravula, Juraj Gottweis, Fei Sha, Ilya Eckstein
| Challenge: | Using pre-trained models, we learn to jointly predict words and entities from multiple text sources without any human supervision. |
| Approach: | They propose to learn rich self-supervised entity representations from large amounts of associated text. |
| Outcome: | The proposed models outperform baseline models on downstream tasks in the TV-Movies domain, and scale to very large corpora. |
Weakly Supervised Named Entity Tagging with Learnable Logical Rules (2021.acl-long)
Copied to clipboard
| Challenge: | Existing methods for building entity tagging systems use weak supervision . previous methods focus on disambiguating entity types based on contexts and expert-provided rules . |
| Approach: | They propose a method that bootstraps high-quality logical rules to train a neural tagger in a fully automated manner. |
| Outcome: | The proposed method outperforms weakly supervised methods on three datasets . it rivals state-of-the-art supervised method with lexicon of over 2,000 terms . |
Boosting Entity Linking Performance by Leveraging Unlabeled Documents (P19-1)
Copied to clipboard
| Challenge: | a new approach to entity linking relies on unlabeled documents and Wikipedia . a supervised approach uses only natural information, such as unlabed documents . |
| Approach: | They propose a method which exploits only naturally occurring information . they construct a high recall list of candidate entities for each mention in an unlabeled document . |
| Outcome: | The proposed model outperforms fully-supervised state-of-the-art systems on standard test sets. |