| Challenge: | Recent studies have shown that unsupervised bilingual lexicon induction is even on par with supervised methods. |
| Approach: | They propose a relaxed matching procedure to find a more precise matching between two languages by aligning source and target embedding space bidirectionally. |
| Outcome: | The proposed method significantly outperforms previous unsupervised methods on standard benchmarks. |
Similar Papers
DM-BLI: Dynamic Multiple Subspaces Alignment for Unsupervised Bilingual Lexicon Induction (2024.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to unsupervised bilingual lexicon induction (BLI) fail on distant or low-resource language pairs, achieving less than half the performance observed in rich-resourced languages. |
| Approach: | They propose a framework for unsupervised bilingual lexicon induction that uses multiple subspace alignments instead of a single mapping. |
| Outcome: | Experiments on 12 language pairs show that the proposed framework improves language alignment by utilizing multiple subspace alignments instead of a single mapping. |
When Your Cousin Has the Right Connections: Unsupervised Bilingual Lexicon Induction for Related Data-Imbalanced Languages (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods for unsupervised bilingual lexicon induction depend on good quality static or contextual embeddings for both languages. |
| Approach: | They propose a method for unsupervised bilingual lexicon induction between a related LRL and a high-resource language that only requires inference on a masked language model of the HRL. |
| Outcome: | The proposed method performs well on low-resource languages with 5M tokens against Hindi . it is compared with existing methods on (mid-resourced) Marathi and Nepali . |
Bilingual Lexicon Induction with Semi-supervision in Non-Isometric Embedding Spaces (P19-1)
Copied to clipboard
| Challenge: | Recent work on bilingual lexicon induction (BLI) relies on an assumption about the isometry of two embedding spaces. |
| Approach: | They propose a semi-supervised approach that relaxes the isometric assumption while leveraging limited aligned bilingual lexicons and a larger set of unaligned word embeddings. |
| Outcome: | The proposed method obtains state-of-the-art results on 15 of 18 language pairs on the MUSE dataset and does particularly well when the embedding spaces don’t appear isometric. |
How Lexical is Bilingual Lexicon Induction? (2024.findings-naacl)
Copied to clipboard
| Challenge: | lexical variation and low-resource settings make it difficult to learn in low-level settings. |
| Approach: | They propose to incorporate additional lexical information into the retrieve-and-rank approach to improve lexicon induction. |
| Outcome: | The proposed approach improves on XLING by an average of 2% across all language pairs. |
Combining Static Word Embeddings and Contextual Representations for Bilingual Lexicon Induction (2021.findings-acl)
Copied to clipboard
| Challenge: | Bilingual Lexicon Induction (BLI) aims to map words in one language to their translations in another. |
| Approach: | They propose a mechanism to combine static word embeddings and contextual representations to utilize the advantages of both paradigms. |
| Outcome: | The proposed method improves performance on supervised and unsupervised BLI benchmarks on all language pairs by average improving 3.2 points over baselines. |
Improving Bilingual Lexicon Induction with Cross-Encoder Reranking (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Current methods for bilingual lexicon induction rely on the induction of cross-lingual word embeddings (CLWEs) such as VecMap or mPLMs are not available for multilingual NLP. |
| Approach: | They propose a semi-supervised post-hoc reranking method which combines cross-lingual lexical knowledge from multilingual pretrained language models with original CLWEs. |
| Outcome: | The proposed method outperforms existing methods on two standard benchmarks spanning a wide spectrum of languages and is robust to different CLWEs. |
Bilingual Lexicon Induction through Unsupervised Machine Translation (P19-1)
Copied to clipboard
| Challenge: | Existing methods for bilingual lexicon induction use nearest neighbor or related retrieval methods to induce word translation pairs. |
| Approach: | They propose a method that aligns word embeddings in two languages and uses them to build a phrase-table and a language model to extract the bilingual lexicon. |
| Outcome: | The proposed method improves accuracy 6 points over nearest neighbor and 4 points over CSLS retrieval on the same cross-lingual embeddings. |
Bilingual Lexicon Induction via Unsupervised Bitext Construction and Word Alignment (2021.acl-long)
Copied to clipboard
| Challenge: | Existing methods for bilingual lexicon induction are linear and require simplifying assumptions. |
| Approach: | They propose methods that combine unsupervised bitext mining and unsupervised word alignment to produce higher quality lexicons. |
| Outcome: | The proposed method outperforms the state-of-the-art on the BUCC 2020 task by 14 F1 points . further analysis suggests they are comparable quality . |
Bilingual Lexicon Induction for Low-Resource Languages using Graph Matching via Optimal Transport (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing literature on bilingual lexicon induction fails in low-resource scenarios . a language dataset is considered low- resource based on its own embedding space . |
| Approach: | They propose a graph-matching method that improves bilingual lexicon induction performance across 40 language pairs using optimal transport. |
| Outcome: | The proposed method is especially strong with low amounts of supervision. |
Hubless Nearest Neighbor Search for Bilingual Lexicon Induction (P19-1)
Copied to clipboard
| Challenge: | Existing methods for bilingual Lexicon Induction use nonparallel corpora, but hubness often degrades accuracy. |
| Approach: | They propose a method to create a lexicon of translation equivalents from non-parallel corpora by aligning two word embedding spaces and retrieving the nearest neighbor (NN) this method reduces hubness, which is necessary for retrieval tasks. |
| Outcome: | The proposed method outperforms NN, Inverted SoFtmax and other state-of-the-art methods. |