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 . |
Similar Papers
Named Entity Recognition through Deep Representation Learning and Weak Supervision (2021.findings-acl)
Copied to clipboard
| Challenge: | Weakly supervised named entity recognition (NER) uses noisy labels to estimate the true labels of a dataset. |
| Approach: | They propose a model to learn optimal assignments of latent NER tags using observed tokens and weak labels provided by labeling functions. |
| Outcome: | The proposed model improves the quality of weak labels on four public datasets. |
Learning Named Entity Tagger using Domain-Specific Dictionary (D18-1)
Copied to clipboard
| Challenge: | Existing methods to build reliable named entity recognition systems require large amounts of manually-labeled training data. |
| Approach: | They propose a revised fuzzy CRF layer to handle tokens with multiple possible labels to address noisy distant supervision. |
| Outcome: | The proposed model can handle tokens with multiple possible labels under the traditional framework and improves on the existing model with a new Tie or Break scheme. |
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. |
BERTifying the Hidden Markov Model for Multi-Source Weakly Supervised Named Entity Recognition (2021.acl-long)
Copied to clipboard
| Challenge: | Existing NER models are supervised by a large number of training sequences, each pre-annotated with token-level labels. |
| Approach: | They propose a conditional hidden Markov model which can effectively infer true labels from multi-source noisy labels in an unsupervised way. |
| Outcome: | The proposed model outperforms state-of-the-art weakly supervised NER models on four benchmarks from various domains. |
Named Entity Recognition without Labelled Data: A Weak Supervision Approach (2020.acl-main)
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) performance often degrades when applied to target domains that differ from the texts observed during training. |
| Approach: | They propose a method to learn NER models in the absence of labelled data through weak supervision by using a broad spectrum of labelling functions to automatically annotate texts from the target domain. |
| Outcome: | The proposed approach improves on two English datasets and shows that it improves by 7 percentage points on entity-level F1 scores compared to an out-of-domain neural NER model. |
Coarse-to-Fine Pre-training for Named Entity Recognition (2020.emnlp-main)
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) is a task of discovering information entities and identifying their corresponding categories. |
| Approach: | They propose a NER-specific framework to inject coarse-to-fine named entity knowledge into pre-trained models by using a remote supervision strategy. |
| Outcome: | The proposed framework achieves significant improvements against several pre-trained base-lines, demonstrating its effectiveness in label-few and low-resource scenarios. |
Weakly Supervised Attention Networks for Entity Recognition (D19-1)
Copied to clipboard
| Challenge: | Existing approaches to entity recognition require large amounts of token-level data, which can be expensive and cumbersome to obtain. |
| Approach: | They propose a weakly supervised model that can be annotated at word level from a corpus containing binary presence/absence labels. |
| Outcome: | The proposed model performs reasonably well on the task of entity recognition despite not having access to token-level ground truth data. |
Named Entity Recognition with Small Strongly Labeled and Large Weakly Labeled Data (2021.acl-long)
Copied to clipboard
| Challenge: | Existing work focuses on learning deep NER models with weak supervision without any human annotation. |
| Approach: | They propose a framework that can suppress the noise of the weak labels and fine-tune over the strongly labeled data. |
| Outcome: | The proposed framework outperforms existing methods on Named Entity Recognition tasks with weak supervision and weakly labeled data. |
Ultra-Fine Entity Typing with Weak Supervision from a Masked Language Model (2021.acl-long)
Copied to clipboard
| Challenge: | Existing methods for fine-grained entity typing use weak labels that are automatically generated. |
| Approach: | They propose to obtain training data by using a BERT Masked Language Model (MLM) given a mention in a sentence, they construct an input for the MLM so it predicts context dependent hypernyms of the mention, which can be used as type labels. |
| Outcome: | The proposed model improves performance by using type labels generated from a BERT Masked Language Model given a mention in a sentence. |
Low-Resource Name Tagging Learned with Weakly Labeled Data (D19-1)
Copied to clipboard
| Challenge: | Existing methods for name tagging in low-resource languages or domains require extensive human efforts for training annotations. |
| Approach: | They propose a neural model for name tagging based on weakly labeled (WL) data. |
| Outcome: | The proposed model outperforms existing models in five low-resource languages and fine-grained food domains and shows that it is more efficient and efficient than existing models. |