GRI: Graph-based Relative Isomorphism of Word Embedding Spaces

2Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Automated construction of bilingual dictionaries using monolingual embedding spaces is a core challenge in machine translation. The end performance of these dictionaries relies upon the geometric similarity of individual spaces, i.e., their degree of isomorphism. Existing attempts aimed at controlling the relative isomorphism of different spaces fail to incorporate the impact of semantically related words in the training objective. To address this, we propose GRI that combines the distributional training objectives with attentive graph convolutions to unanimously consider the impact of semantically similar words required to define/compute the relative isomorphism of multiple spaces. Experimental evaluation shows that GRI outperforms the existing research by improving the average P@1 by a relative score of up to 63.6%. We release the codes for GRI at https://github.com/asif6827/GRI.

Cite

CITATION STYLE

APA

Ali, M. A., Hu, Y., Qin, J., & Wang, D. (2023). GRI: Graph-based Relative Isomorphism of Word Embedding Spaces. In Findings of the Association for Computational Linguistics: EMNLP 2023 (pp. 11304–11313). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2023.findings-emnlp.756

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