arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.12640cs.CL
收藏

An Analysis of Euclidean vs. Graph-Based Framing for Bilingual Lexicon Induction from Word Embedding Spaces

Center for Imaging Science(影像科学中心);Human Language Technology Center of Excellence(人类语言技术卓越中心);Johns Hopkins University(约翰斯·霍普金斯大学)

Kelly Marchisio, Youngser Park, Ali Saad-Eldin, Anton Alyakin, Kevin Duh, Carey Priebe, Philipp Koehn

英文摘要:

Much recent work in bilingual lexicon induction (BLI) views word embeddings as vectors in Euclidean space. As such, BLI is typically solved by finding a linear transformation that maps embeddings to a common space. Alternatively, word embeddings may be understood as nodes in a weighted graph. This framing allows us to examine a node's graph neighborhood without assuming a linear transform, and exploits new techniques from the graph matching optimization literature. These contrasting approaches have not been compared in BLI so far. In this work, we study the behavior of Euclidean versus graph-based approaches to BLI under differing data conditions and show that they complement each other when combined. We release our code at https://github.com/kellymarchisio/euc-v-graph-bli.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑