Embeddings of Label Components for Sequence Labeling: A Case Study of Fine-grained Named Entity Recognition (2020.acl-srw)
Copied to clipboard
| Challenge: | In general, the labels used in sequence labeling consist of different types of elements. |
| Approach: | They propose to integrate label component information as embeddings into sequence labeling models. |
| Outcome: | The proposed method improves on English and Japanese fine-grained named entity recognition on low-frequency labels. |
Similar Papers
More Embeddings, Better Sequence Labelers? (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing work suggests contextual embeddings improve sequence labeling accuracy . but, there is no definite conclusion on whether concatenating different kinds of embeddables is effective . |
| Approach: | They propose a family of contextual embeddings that improves sequence labeling accuracy . they conduct extensive experiments on 3 tasks over 18 datasets and 8 languages . |
| Outcome: | The proposed family of contextual embeddings improves the accuracy of sequence labelers over non-contextual embedders. |
Attributed and Predictive Entity Embedding for Fine-Grained Entity Typing in Knowledge Bases (C18-1)
Copied to clipboard
| Challenge: | Existing methods for identifying semantic type of entities are incomplete even in large knowledge bases. |
| Approach: | They propose an attributed and predictive entity embedding method which can fully utilize various kinds of information comprehensively. |
| Outcome: | Experiments on two real DBpedia datasets show that the proposed method outperforms 8 state-of-the-art methods with 4.0% improvement in Mi-F1 and 5.2% improvement in Ma-F1. |
An Analysis of Simple Data Augmentation for Named Entity Recognition (2020.coling-main)
Copied to clipboard
| Challenge: | Recent studies have focused on using data augmentation techniques on sentence-level and sentence-pair natural language processing tasks such as text classification. |
| Approach: | They propose to use data augmentation techniques for named entity recognition to increase model performance. |
| Outcome: | The proposed techniques boost performance for both recurrent and transformer-based models, especially for small training sets. |
Viable Dependency Parsing as Sequence Labeling (N19-1)
Copied to clipboard
| Challenge: | Existing work on dependency parsing by sequence labeling suggested that it was impractical. |
| Approach: | They propose to use dependency trees as sequence labels to obtain fast and accurate parsers using a conventional BILSTM-based model. |
| Outcome: | The proposed models are conceptually simple, not needing traditional parsing algorithms or auxiliary structures, and provide a good speed-accuracy tradeoff, with results competitive with more complex approaches. |
Bringing Emerging Architectures to Sequence Labeling in NLP (2026.eacl-long)
Copied to clipboard
| Challenge: | Pretrained Transformer encoders are the dominant approach to sequence labeling . however, few have been applied to sequence labels on flat or simplified tasks . |
| Approach: | They propose to use pretrained Transformer encoders to model relations across words . they find that the architectures adapt well across tagging tasks that vary in complexity . |
| Outcome: | The proposed architectures perform well across tagging tasks across languages and datasets. |
Joint Embedding of Words and Labels for Text Classification (P18-1)
Copied to clipboard
Guoyin Wang, Chunyuan Li, Wenlin Wang, Yizhe Zhang, Dinghan Shen, Xinyuan Zhang, Ricardo Henao, Lawrence Carin
| Challenge: | Existing approaches to text classification use word embeddings to capture semantic regularities between words. |
| Approach: | They propose to view text classification as a label-word joint embedding problem . they use a framework that measures compatibility between text sequences and labels . |
| Outcome: | The proposed framework outperforms the state-of-the-art methods on large text datasets. |
Entity or Relation Embeddings? An Analysis of Encoding Strategies for Relation Extraction (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to relation extraction use concatenating embeddings of head and tail entities . however, such representations capture the types of the entities involved, leading to false positives and confusion between relations involving entities of the same type. |
| Approach: | They propose a model which combines [MASK] embeddings with entity embedds to learn relation embeddations. |
| Outcome: | The proposed model outperforms the state-of-the-art on several benchmarks . it uses a self-supervised pre-training strategy which further improves the results. |
E-BERT: Efficient-Yet-Effective Entity Embeddings for BERT (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to enhance BERT with factual knowledge about entities require no additional pretraining and no changes to the encoder itself. |
| Approach: | They propose a way to inject factual knowledge into the pretrained BERT model by aligning Wikipedia2Vec entity vectors with BERT's native wordpiece vector space and feeding the aligned entity vector into BERT as if they were wordpieces. |
| Outcome: | The proposed version outperforms baseline models on unsupervised question answering, supervised relation classification and entity linking tasks. |
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. |
Contextual String Embeddings for Sequence Labeling (C18-1)
Copied to clipboard
| Challenge: | Recent advances in language modeling have made it viable to model language as distributions over characters. |
| Approach: | They propose to leverage internal states of a trained character language model to produce a new type of word embeddings. |
| Outcome: | The proposed embeddings outperform the state-of-the-art on four classic sequence labeling tasks. |