Chinese Relation Extraction with Multi-Grained Information and External Linguistic Knowledge (P19-1)
Copied to clipboard
| Challenge: | Existing methods for Chinese relation extraction suffer from segmentation errors and ambiguity of polysemy. |
| Approach: | They propose a multi-grained lattice framework for Chinese relation extraction . they incorporate word-level information into character sequence inputs to avoid segmentation errors . |
| Outcome: | The proposed model outperforms existing models on three real-world datasets in distinct domains. |
Similar Papers
Modeling Multi-Granularity Hierarchical Features for Relation Extraction (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing work on relation extraction focuses on constructing explicit structured features using knowledge graph and dependency tree. |
| Approach: | They propose a method to extract multi-granularity features based solely on the original input sentences. |
| Outcome: | The proposed method outperforms state-of-the-art models that even use external knowledge on three public benchmarks: SemEval 2010 Task 8, Tacred, and Tacred Revisited. |
Lattice-BERT: Leveraging Multi-Granularity Representations in Chinese Pre-trained Language Models (2021.naacl-main)
Copied to clipboard
| Challenge: | Pre-trained language models process text as a sequence of characters, ignoring more coarse granularity, e.g., words. |
| Approach: | They propose a new pre-training paradigm for Chinese that incorporates word representations along with characters and can model a sentence in a multi-granular manner. |
| Outcome: | The proposed model can bring an average increase of 1.5% under the 12-layer setting, which achieves new state-of-the-art among base-size models on the CLUE benchmarks. |
Relation Extraction with Word Graphs from N-grams (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies for relation extraction (RE) leverage the dependency tree of the input sentence to improve performance. |
| Approach: | They propose to use a graph convolutional network to build a context graph without dependency parsers. |
| Outcome: | The proposed approach improves neural RE methods without dependency parsers on English benchmark datasets. |
Hierarchical Relation Extraction with Coarse-to-Fine Grained Attention (D18-1)
Copied to clipboard
| Challenge: | Existing methods for relation extraction use knowledge graphs to automatically label training data . but, it suffers from the wrong labeling problem because not all sentences containing two entities can express their relations in KGs . |
| Approach: | They propose a distant supervision approach to automatically label training instances . they integrate hierarchical information of relations into distantly supervised relation extraction . |
| Outcome: | The proposed model outperforms baseline models on a large-scale dataset. |
NCRE: A Benchmark for Document-level Nominal Compound Relation Extraction (2025.coling-main)
Copied to clipboard
| Challenge: | Existing work focuses on detecting specific relations between entities, often constrained to specific fields and lacking general applicability. |
| Approach: | They propose a novel task that concentrates on abstract relation extraction between noun phrases . they annotate a Chinese dataset and develop a model incorporating a rotary position-enhanced word pair detection schema. |
| Outcome: | The proposed task is more efficient than previous methods. |
Improving Chinese Named Entity Recognition with Multi-grained Words and Part-of-Speech Tags via Joint Modeling (2024.lrec-main)
Copied to clipboard
| Challenge: | Named entity recognition (CNER) is a fundamental task in natural language processing (NLP). |
| Approach: | They propose a tree parsing approach for jointly modeling Chinese named entity recognition (CNER) with multi-grained word segmentation (MWS) and POS tagging tasks. |
| Outcome: | The proposed approach achieves better or comparable performance with current methods. |
Chinese NER Using Lattice LSTM (P18-1)
Copied to clipboard
| Challenge: | Chinese named entity recognition (NER) is a fundamental task in information extraction. |
| Approach: | They propose a lattice-structured LSTM model for Chinese named entity recognition (NER) model leverages word and word sequence information to encode a sequence of input characters and all potential words that match a lexicon. |
| Outcome: | The proposed model outperforms word-based and character-based models on Chinese NER datasets. |
Distantly Supervised Relation Extraction using Multi-Layer Revision Network and Confidence-based Multi-Instance Learning (2021.emnlp-main)
Copied to clipboard
| Challenge: | Distantly supervised relation extraction is used in knowledge bases but its low quality and noisy sentences are present in sentence bags. |
| Approach: | They propose a multi-layer revision network which emphasizes inner-sentence correlations before extracting relevant information within sentences. |
| Outcome: | The proposed method improves on two New York Times datasets. |
Neural Relation Extraction for Knowledge Base Enrichment (P19-1)
Copied to clipboard
| Challenge: | Existing studies focus on the extraction itself and rely on Named Entity Disambiguation (NED) to map triples into knowledge base (KB) enrichment. |
| Approach: | They propose an end-to-end relation extraction model for knowledge base enrichment based on a neural encoder-decoder model . they propose to extract entities and their relationships from sentences in the form of triples and map the elements of the extracted triples to an existing KB in an end to end manner. |
| Outcome: | The proposed model outperforms state-of-the-art baselines by 15.51% and 8.38% on two real-world datasets. |
HacRED: A Large-Scale Relation Extraction Dataset Toward Hard Cases in Practical Applications (2021.findings-acl)
Copied to clipboard
Qiao Cheng, Juntao Liu, Xiaoye Qu, Jin Zhao, Jiaqing Liang, Zhefeng Wang, Baoxing Huai, Nicholas Jing Yuan, Yanghua Xiao
| Challenge: | Relation extraction (RE) is an essential topic in natural language processing and has attracted extensive attention. |
| Approach: | They propose a case-oriented construction framework to build a hard case relation extraction dataset with 65,225 relational facts annotated from 9,231 documents. |
| Outcome: | The proposed model achieves a high 96% F1 score on data quality and is far lower than humans. |