Title:
|
Distributed prediction of relations for entities: the Easy, the Difficult, and the impossible
|
Author:
|
Boleda, Gemma; Gupta, Abhijeet; Padó, Sebastian
|
Abstract:
|
Comunicació presentada a la 6th Joint Conference on Lexical and Computational Semantics (*SEM 2017), celebrat els dies 3 i 4 d'agost de 2017 a Vancouver, Canada. |
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. |
Abstract:
|
This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 715154) and the DFG (SFB 732, Project D10). |
Subject(s):
|
-Computational linguistics -Natural language processing -Computational semantics -Distributional semantics -Reference -Entities |
Rights:
|
© ACL, Creative Commons Attribution 4.0 License
|
Document type:
|
Conference Object Article - Published version |
Published by:
|
ACL (Association for Computational Linguistics)
|
Share:
|
|