paper-with-me

홈 › Papers

A Novel Cascade Binary Tagging Framework for Relational Triple Extraction

2019-09-07 · ACL 2020 6 · Zhepei Wei, Jianlin Su, Yue Wang, Yuan Tian, Yi Chang

Extracting relational triples from unstructured text is crucial for large-scale knowledge graph construction. However, few existing works excel in solving the overlapping triple problem where multiple relational triples in the same sentence share the same entities. In this work, we introduce a fresh perspective to revisit the relational triple extraction task and propose a novel cascade binary tagging framework (CasRel) derived from a principled problem formulation. Instead of treating relations as discrete labels as in previous works, our new framework models relations as functions that map subjects to objects in a sentence, which naturally handles the overlapping problem. Experiments show that the CasRel framework already outperforms state-of-the-art methods even when its encoder module uses a randomly initialized BERT encoder, showing the power of the new tagging framework. It enjoys further performance boost when employing a pre-trained BERT encoder, outperforming the strongest baseline by 17.5 and 30.2 absolute gain in F1-score on two public datasets NYT and WebNLG, respectively. In-depth analysis on different scenarios of overlapping triples shows that the method delivers consistent performance gain across all these scenarios. The source code and data are released online.

📄 PDF Abstract BibTeX arXiv:1909.03227

Code (5)

weizhepei/CasRel 공식 구현 tf
LitianD/Joint_RE pytorch
Sherlock-coder/CasRel pytorch
longlongman/CasRel-pytorch-reimplement pytorch
prasad4fun/casrel-torch pytorch

Tasks

Relation ExtractionSentence

Methods 이 논문이 사용한 방법론

Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Residual Connection 설명 없음
Attention Dropout Attention Dropout is a type of dropout used in attention-based architectures, where elements are randomly dropped out of the…
Linear Warmup With Linear Decay Linear Warmup With Linear Decay is a learning rate schedule in which we increase the learning rate linearly for $n$ updates and then linearly decay afterwards.
Weight Decay 설명 없음
Refunds@Expedia|||How do I get a full refund from Expedia? “How do I get a full refund from Expedia? How do I get a full refund from Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Quick Help &…
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Adam 설명 없음

Similar Papers 제목 키워드 기반

A Conditional Cascade Model for Relational Triple Extraction

2021-08-20 · Feiliang Ren, Longhui Zhang, Shujuan Yin, Xiaofeng Zhao 외

Tagging based methods are one of the mainstream methods in relational triple extraction. However, most of them suffer from the class imbalance issue greatly. Here we propose a novel tagging based model that addresses thi…

model

BitCoin: Bidirectional Tagging and Supervised Contrastive Learning based Joint Relational Triple Extraction Framework

2023-09-21 · Luyao He, Zhongbao Zhang, Sen Su, Yuxin Chen

Relation triple extraction (RTE) is an essential task in information extraction and knowledge graph construction. Despite recent advancements, existing methods still exhibit certain limitations. They just employ generali…

Contrastive Learninggraph constructionObjectRelation+3

RTF: Region-based Table Filling Method for Relational Triple Extraction

2024-04-29 · Ning An, Lei Hei, Yong Jiang, Weiping Meng 외

Relational triple extraction is crucial work for the automatic construction of knowledge graphs. Existing methods only construct shallow representations from a token or token pair-level. However, previous works ignore lo…

Boundary DetectionKnowledge GraphsRelation

Jointly Extracting Explicit and Implicit Relational Triples with Reasoning Pattern Enhanced Binary Pointer Network

2021-06-01 · NAACL 2021 4 · Yubo Chen, Yunqi Zhang, Changran Hu, Yongfeng Huang

Relational triple extraction is a crucial task for knowledge graph construction. Existing methods mainly focused on explicit relational triples that are directly expressed, but usually suffer from ignoring implicit tripl…

graph constructionImplicit RelationsKnowledge GraphsRelation+3

FastRE: Towards Fast Relation Extraction with Convolutional Encoder and Improved Cascade Binary Tagging Framework

2022-05-05 · Guozheng Li, Xu Chen, Peng Wang, Jiafeng Xie 외

Recent work for extracting relations from texts has achieved excellent performance. However, most existing methods pay less attention to the efficiency, making it still challenging to quickly extract relations from massi…

Language ModellingRelationRelation ExtractionRelation Mapping