Dynamic Entity Memory Network for Dialogue Relational Triplet Extraction
Relational triplet extraction (RTE) is a crucial task in information extraction and has aroused extensive attention. Although advanced studies on RTE have achieved great progress, they are still insufficient for supporting practical applications, such as dialogue system and information retrieval. In this paper, we focus on relational triplet extraction in dialogue scenarios and introduce a new task named dialogue relational triplet extraction (DRTE). Instead of being treated as static texts like sentences or documents, dialogues should be regarded as dynamic ones generated with the progress of conversations. Thus, it imposes three important challenges, including extracting triplets in real-time with incomplete dialogue context, discovering cross-utterance relational triplets, and perceiving the transition of dialogue topics. To tackle these challenges, we propose a Dynamic Entity Memory Network (DEMN). Specifically, the key of our approach is an attentional context encoder and an entity memory network. The attentional context encoder learns dialogue semantics utterance by utterance and dynamically captures salient contexts for each utterance. The entity memory network is devised to store the entities extracted from previous utterances and for cross-utterance triplets extraction. Meanwhile, it also tracks topic transitions in real-time and forgets the semantics of trivial entities. To verify the effectiveness of our model, we manually build three datasets based on KdConv benchmark. Extensive experimental results demonstrate that our model achieves state-of-the-art performances.
Code (0)
등록된 구현이 없습니다.
Tasks
Information RetrievalRetrievalRTETripletMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Extracting Relational Facts by an End-to-End Neural Model with Copy Mechanism
The relational facts in sentences are often complicated. Different relational triplets may have overlaps in a sentence. We divided the sentences into three types according to triplet overlap degree, including Normal, Ent…
DecoderFeature EngineeringRelation ExtractionSentence+1Hierarchical Relational Learning for Few-Shot Knowledge Graph Completion
Knowledge graphs (KGs) are known for their large scale and knowledge inference ability, but are also notorious for the incompleteness associated with them. Due to the long-tail distribution of the relations in KGs, few-s…
Knowledge Graph CompletionKnowledge GraphsRelational ReasoningTripletImproving Hyper-Relational Knowledge Graph Completion
Different from traditional knowledge graphs (KGs) where facts are represented as entity-relation-entity triplets, hyper-relational KGs (HKGs) allow triplets to be associated with additional relation-entity pairs (a.k.a q…
Computational EfficiencyGraph Neural NetworkKnowledge Graph CompletionKnowledge Graphs+2Representation Learning on Hyper-Relational and Numeric Knowledge Graphs with Transformers
A hyper-relational knowledge graph has been recently studied where a triplet is associated with a set of qualifiers; a qualifier is composed of a relation and an entity, providing auxiliary information for a triplet. Whi…
Graph EmbeddingKnowledge Graph EmbeddingKnowledge GraphsRepresentation Learning+1MrMep: Joint Extraction of Multiple Relations and Multiple Entity Pairs Based on Triplet Attention
This paper focuses on how to extract multiple relational facts from unstructured text. Neural encoder-decoder models have provided a viable new approach for jointly extracting relations and entity pairs. However, these m…
DecoderRelationTriplet