Distributed prediction of relations for entities: The easy, the difficult, and the impossible

3Citations
Citations of this article
76Readers
Mendeley users who have this article in their library.

Abstract

Word embeddings are supposed to provide easy access to semantic relations such as "male of" (man-woman). While this claim has been investigated for concepts, little is known about the distributional behavior of relations of (Named) Entities. We describe two word embedding-based models that predict values for relational attributes of entities, and analyse them. The task is challenging, with major performance differences between relations. Contrary to many NLP tasks, high difficulty for a relation does not result from low frequency, but from (a) one-to-many mappings; and (b) lack of context patterns expressing the relation that are easy to pick up by word embeddings.

Cite

CITATION STYLE

APA

Gupta, A., Boleda, G., & Padó, S. (2017). Distributed prediction of relations for entities: The easy, the difficult, and the impossible. In *SEM 2017 - 6th Joint Conference on Lexical and Computational Semantics, Proceedings (pp. 104–109). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/s17-1012

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free