Learning Word Representations from Relational Graphs

Bollegala, Danushka ORCID: 0000-0003-4476-7003, Maehara, Takanori, Yoshida, Yuichi and Kawarabayashi, Ken-ichi (2015) Learning Word Representations from Relational Graphs. In: AAAI 2015, 2015-1 - 2015-1, Texas, USA.

Text (Natural Language Processing) AAAI_2015.pdf - Author Accepted Manuscript Download (317kB)

Abstract

Attributes of words and relations between two words are central to numerous tasks in Artificial Intelligence such as knowledge representation, similarity measurement, and analogy detection. Often when two words share one or more attributes in common, they are connected by some semantic relations. On the other hand, if there are numerous semantic relations between two words, we can expect some of the attributes of one of the words to be inherited by the other. Motivated by this close connection between attributes and relations, given a relational graph in which words are inter- connected via numerous semantic relations, we propose a method to learn a latent representation for the individual words. The proposed method considers not only the co-occurrences of words as done by existing approaches for word representation learning, but also the semantic relations in which two words co-occur. To evaluate the accuracy of the word representations learnt using the proposed method, we use the learnt word representations to solve semantic word analogy problems. Our experimental results show that it is possible to learn better word representations by using semantic semantics between words.

Item Type:	Conference or Workshop Item (Paper)
Additional Information:	AAAI 2015
Uncontrolled Keywords:	cs.CL, cs.CL
Subjects:	?? QA75 ??
Depositing User:	Symplectic Admin
Date Deposited:	20 Nov 2015 10:23
Last Modified:	23 Nov 2023 15:34
Related URLs:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/2006350