Constructing Word Embeddings from the Random Hyperbolic Graph
| dc.contributor.author | Nurmukhamedov, Sultan | |
| dc.date.accessioned | 2020-05-11T07:38:47Z | |
| dc.date.available | 2020-05-11T07:38:47Z | |
| dc.date.issued | 2020-04-30 | |
| dc.description.abstract | Recent studies have shown that the appropriate space for word embeddings is not the Euclidean space, but negatively curved, hyperbolic space. We randomly throw points in the hyperbolic disc and claim that these points are already word representations. However, it is yet to be uncovered which point corresponds to which word of the human language of interest. This correspondence can be approximately established using a pointwise mutual information between words and graph matching techniques. The embeddings were evaluated at WS353 task, and then separately on its similarity and relatedness parts. | en_US |
| dc.identifier.uri | http://nur.nu.edu.kz/handle/123456789/4630 | |
| dc.language.iso | en | en_US |
| dc.publisher | Nazarbayev University School of Sciences and Humanities | en_US |
| dc.rights | Attribution-NonCommercial-ShareAlike 3.0 United States | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/us/ | * |
| dc.subject | Research Subject Categories::MATHEMATICS | en_US |
| dc.title | Constructing Word Embeddings from the Random Hyperbolic Graph | en_US |
| dc.type | Capstone Project | en_US |
| workflow.import.source | science |