Learning Reasoning Patterns for Relational Triple Extraction with Mutual Generation of Text and Graph
Relational triple extraction is a critical task for constructing knowledge graphs. Existing methods focused on learning text patterns from explicit relational mentions. However, they usually suffered from ignoring relational reasoning patterns, thus failed to extract the implicitly implied triples. Fortunately, the graph structure of a sentence’s relational triples can help find multi-hop reasoning paths. Moreover, the type inference logic through the paths can be captured with the sentence’s supplementary relational expressions that represent the real-world conceptual meanings of the paths’ composite relations. In this paper, we propose a unified framework to learn the relational reasoning patterns for this task. To identify multi-hop reasoning paths, we construct a relational graph from the sentence (text-to-graph generation) and apply multi-layer graph convolutions to it. To capture the relation type inference logic of the paths, we propose to understand the unlabeled conceptual expressions by reconstructing the sentence from the relational graph (graph-to-text generation) in a self-supervised manner. Experimental results on several benchmark datasets demonstrate the effectiveness of our method.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph GenerationKnowledge GraphsRelational ReasoningSentenceText GenerationSimilar Papers 제목 키워드 기반
Jointly Extracting Explicit and Implicit Relational Triples with Reasoning Pattern Enhanced Binary Pointer Network
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+3Mutually Guided Few-shot Learning for Relational Triple Extraction
Knowledge graphs (KGs), containing many entity-relation-entity triples, provide rich information for downstream applications. Although extracting triples from unstructured texts has been widely explored, most of them req…
Cross-Domain Few-ShotDecoderFew-Shot LearningKnowledge Graphs+2Shrinking Embeddings for Hyper-Relational Knowledge Graphs
Link prediction on knowledge graphs (KGs) has been extensively studied on binary relational KGs, wherein each fact is represented by a triple. A significant amount of important knowledge, however, is represented by hyper…
Knowledge GraphsLink PredictionA Relational Triple Extraction Method Based on Feature Reasoning for Technological Patents
The relation triples extraction method based on table filling can address the issues of relation overlap and bias propagation. However, most of them only establish separate table features for each relationship, which ign…
RelationOpen Relation Extraction and Grounding
Previous open Relation Extraction (open RE) approaches mainly rely on linguistic patterns and constraints to extract important relational triples from large-scale corpora. However, they lack of abilities to cover diverse…
RelationRelation ExtractionSentenceslot-filling+1