Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Confere 2015
DOI: 10.3115/v1/p15-1055
|View full text |Cite
|
Sign up to set email alerts
|

Learning to Explain Entity Relationships in Knowledge Graphs

Abstract: We study the problem of explaining relationships between pairs of knowledge graph entities with human-readable descriptions. Our method extracts and enriches sentences that refer to an entity pair from a corpus and ranks the sentences according to how well they describe the relationship between the entities. We model this task as a learning to rank problem for sentences and employ a rich set of features. When evaluated on a large set of manually annotated sentences, we find that our method significantly improv… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
43
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
6
1
1

Relationship

1
7

Authors

Journals

citations
Cited by 48 publications
(43 citation statements)
references
References 21 publications
(22 reference statements)
0
43
0
Order By: Relevance
“…Besides extracting relations per se, there have been efforts within computational linguistics involving interpersonal relationships. Voskarides et al (2015) extract human-readable descriptions of relations in a knowledge graph by ranking sentences that justify the relations. Iyyer et al (2016) propose an unsupervised algorithm to extract relationship trajectories of fictional characters, i.e., how interpersonal relationships evolve over time in fictional stories.…”
Section: Related Workmentioning
confidence: 99%
“…Besides extracting relations per se, there have been efforts within computational linguistics involving interpersonal relationships. Voskarides et al (2015) extract human-readable descriptions of relations in a knowledge graph by ranking sentences that justify the relations. Iyyer et al (2016) propose an unsupervised algorithm to extract relationship trajectories of fictional characters, i.e., how interpersonal relationships evolve over time in fictional stories.…”
Section: Related Workmentioning
confidence: 99%
“…The part-of-speech tags are generalized into four categories: nouns, verbs, adjectives and other (L1) [28]. If we take Figure 3, for example, the distribution of POS tags for the sentence segment before the query entity ("Nicole/noun Kidman/noun and/other") is the following: nouns: 2/3, verbs: 0/3, adjectives: 0/3, other: 1/3.…”
Section: Lexical (Pos) Featuresmentioning
confidence: 99%
“…This subset of features captures the location of named entities in the justification relative to the query and the filler for the following types: person (N1), geo-political entity (N2) and organization (N3) [28]. Similarly to feature C4, this set of features is based on the segmentation of the sentence according to the position of the query entity and the slot filler.…”
Section: Named Entity Featuresmentioning
confidence: 99%
See 1 more Smart Citation
“…This is different from the task of explaining relationships between entities in a knowledge base [9], since we include also yet unknown facts from documents. It is also different from explaining the relationship between entities and ad-hoc queries [2], since we look at relations between entities in documents.…”
Section: Introductionmentioning
confidence: 99%