A Strong Baseline for Learning Cross-Lingual Word Embeddingsfrom Sentence Alignments

A Strong Baseline for Learning Cross-Lingual Word Embeddings
from Sentence Alignments

Omer Levy
University of Washington
Seattle, WA
omerlevy@gmail.com &Anders Søgaard
University of Copenhagen
Copenhagen, Denmark
soegaard@di.ku.dk &Yoav Goldberg
Bar-Ilan University
Ramat-Gan, Israel
yoav.goldberg@gmail.com
These authors contributed equally to this work.
Abstract

While cross-lingual word embeddings have been studied extensively in recent years, the qualitative differences between the different algorithms remain vague. We observe that whether or not an algorithm uses a particular feature set (sentence IDs) accounts for a significant performance gap among these algorithms. This feature set is also used by traditional alignment algorithms, such as IBM Model-1, which demonstrate similar performance to state-of-the-art embedding algorithms on a variety of benchmarks. Overall, we observe that different algorithmic approaches for utilizing the sentence ID feature space result in similar performance. This paper draws both empirical and theoretical parallels between the embedding and alignment literature, and suggests that adding additional sources of information, which go beyond the traditional signal of bilingual sentence-aligned corpora, may substantially improve cross-lingual word embeddings, and that future baselines should at least take such features into account.

A Strong Baseline for Learning Cross-Lingual Word Embeddings
from Sentence Alignments


Omer Levythanks: These authors contributed equally to this work. University of Washington Seattle, WA omerlevy@gmail.com                        Anders Søgaard University of Copenhagen Copenhagen, Denmark soegaard@di.ku.dk                        Yoav Goldberg Bar-Ilan University Ramat-Gan, Israel yoav.goldberg@gmail.com

1 Introduction

Cross-lingual word embedding algorithms try to represent the vocabularies of two or more languages in one common continuous vector space. These vectors can be used to improve monolingual word similarity [Faruqui and Dyer, 2014] or support cross-lingual transfer [Gouws and Søgaard, 2015]. In this work, we focus on the second (cross-lingual) aspect of these embeddings, and try to determine what makes some embedding approaches better than others on a set of translation-oriented benchmarks. While cross-lingual word embeddings have been used for a variety of cross-lingual transfer tasks, we prefer evaluating on translation-oriented benchmarks, rather than across specific NLP tasks, since the translation setting allows for a cleaner examination of cross-lingual similarity. Another important delineation of this work is that we focus on algorithms that rely on sentence-aligned data; in part, because these algorithms are particularly interesting for low-resource languages, but also to make our analysis and comparison with alignment algorithms more focused.

We observe that the top performing embedding algorithms share the same underlying feature space – sentence IDs – while their different algorithmic approaches seem to have a negligible impact on performance. We also notice that several statistical alignment algorithms, such as IBM Model-1 [Brown et al., 1993], operate under the same data assumptions. Specifically, we find that using the translation probabilities learnt by Model-1 as the cross-lingual similarity function (in place of the commonly-used cosine similarity between word embeddings) performs on-par with state-of-the-art cross-lingual embeddings on word alignment and bilingual dictionary induction tasks. In other words, as long as the similarity function is based on the sentence ID feature space and the embedding/alignment algorithm itself is not too naïve, the actual difference in performance between different approaches is marginal.

This leads us to revisit another statistical alignment algorithm from the literature that uses the same sentence-based signal – the Dice aligner [Och and Ney, 2003]. We first observe that the vanilla Dice aligner is significantly outperformed by the Model-1 aligner. We then recast Dice as the dot-product between two word vectors (based on the sentence ID feature space), which allows us to generalize it, resulting in an embedding model that is as effective as Model-1 and other sophisticated state-of-the-art embedding methods, but takes a fraction of the time to train.

Existing approaches for creating cross-lingual word embeddings are typically restricted to training bilingual embeddings, mapping exactly two languages onto a common space. We show that our generalization of the Dice coefficient can be augmented to jointly train multi-lingual embeddings for any number of languages. We do this by leveraging the fact that the space of sentence IDs is shared among all languages in the parallel corpus; the verses of the Bible, for example, are identical across all translations. Introducing this multi-lingual signal shows a significant performance boost, which eclipses the variance in performance among pre-existing embedding algorithms.

Contributions

We first establish the importance of the sentence ID feature space for cross-lingual word embedding algorithms through experiments across several translation-oriented benchmarks. We then compare cross-lingual word embedding algorithms to traditional word alignment algorithms that also rely on sentence ID signals. We show that a generalization of one of these, the Dice aligner, is a very strong baseline for cross-lingual word embedding algorithms, performing better than several state-of-the-art algorithms, especially when exploiting a multi-lingual signal. Our code and data are publicly available.111bitbucket.org/omerlevy/xling_embeddings

2 Background: Cross-lingual Embeddings

Previous approaches to cross-lingual word embeddings can be divided into three categories, according to assumptions on the training data. The first category assumes word-level alignments, in the form of bilingual dictionaries [Mikolov et al., 2013a, Xiao and Guo, 2014] or automatically produced word alignments [Klementiev et al., 2012, Zou et al., 2013, Faruqui and Dyer, 2014]. Sizable bilingual dictionaries are not available for many language pairs, and the quality of automatic word alignment greatly affects the quality of the embeddings. It is also unclear whether the embedding process provides significant added value beyond the initial word alignments [Zou et al., 2013]. We therefore exclude these algorithms for this study, also in order to focus our analysis and make the comparison with traditional word alignment algorithms more straightforward.

The second category makes a much weaker assumption, document-level alignments, and uses comparable texts in different languages (not necessarily translations) such as Wikipedia articles or news reports of the same event. Algorithms in this category try to leverage massive amounts of data to make up for the lack of lower-level alignments [Søgaard et al., 2015, Vulić and Moens, 2016].

Algorithms in the third category take the middle ground; they use sentence-level alignments, common in legal translations and religious texts. Also known as “parallel corpora”, sentence-aligned data maps each sentence (as a whole) to its translation. We focus on this third category, because it does not require the strict assumption of word-aligned data (which is difficult to obtain), while still providing a cleaner and more accurate signal than document-level alignments (which have been shown, in monolingual data, to capture mainly syntagmatic relations [Sahlgren, 2006]). In §6, we provide evidence to the hypothesis that sentence-aligned data is indeed far more informative than document-aligned data.

Algorithms that rely on sentence-aligned data typically create intermediate sentence representations from each sentence’s constituent words. ?) proposed a deep neural model, BiCVM, which compared the two sentence representations at the final layer, while ?) proposed a shallower autoencoder-based model, representing both source and target language sentences as the same intermediate sentence vector. Recently, a simpler model, BilBOWA [Gouws et al., 2015], showed similar performance without using a hidden sentence-representation layer, giving it a dramatic speed advantage over its predecessors. BilBOWA is essentially an extension of skip-grams with negative sampling (SGNS) [Mikolov et al., 2013b], which simultaneously optimizes each word’s similarity to its inter-lingual context (words that appeared in the aligned target language sentence) and its intra-lingual context (as in the original monolingual model). ?) proposed a similar SGNS-based model over the same features.

We study which factors determine the success of cross-lingual word embedding algorithms that use sentence-aligned data, and evaluate them against baselines from the statistical machine translation literature that incorporate the same data assumptions. We go on to generalize one of these, the Dice aligner, showing that one variant is a much stronger baseline for cross-lingual word embedding algorithms than standard baselines.

Finally, we would like to point out the work of ?), who studied how different data assumptions affect embedding quality in both monolingual and cross-lingual tasks. Our work focuses on one specific data assumption (sentence-level alignments) and only on cross-lingual usage. This more restricted setting allows us to: (a) compare embeddings to alignment algorithms, (b) decouple the feature space from the algorithm, and make a more specific observation about the contribution of each component to the end result. In that sense, our findings complement those of ?).

3 Which Features Make Better Cross-lingual Embeddings?

We group state-of-the-art cross-lingual embedding algorithms according to their feature sets, and compare their performance on two cross-lingual benchmarks: word alignment and bilingual dictionary induction. In doing so, we hope to learn which features are more informative.

3.1 Features of Sentence-aligned Data

We observe that cross-lingual embeddings typically use parallel corpora in one of two ways:

Source + Target Language Words

Each word is represented using all the other words that appeared with it in the same sentence (source language words) and all the words that appeared in target language sentences that were aligned to sentences in which the word appeared (target language words). This representation also stores the number of times each pair of word and feature (context) word co-occurred.

These features are analogous to the ones used by ?) for document-aligned data, and can be built in a similar manner: create a pseudo-bilingual sentence from each aligned sentence, and for each word in question, consider all the other words in this sentence as its features. BilBOWA [Gouws et al., 2015] also uses a similar set of features, but restricts the source language words to those that appeared within a certain distance from the word in question, and defines a slightly different interaction with target language words.

Sentence IDs

Here, each word is represented by the set of sentences in which it appeared, indifferent to the number of times it appeared in each one. This feature set is also indifferent to the word ordering within each sentence. This approach is implicitly used by ?), who encode the bag-of-words representations of parallel sentences into the same vector. Thus, each word is not matched directly to another word, but rather used to create the sentence’s language-independent representation. ?) use similar features, document IDs, for leveraging comparable Wikipedia articles in different languages. In §6 we show that when using sentence IDs, even a small amount of sentence-aligned data is more powerful than a huge amount of comparable documents.

3.2 Experiment Setup

Algorithms

We use the four algorithms mentioned in §3.1: BilBOWA [Gouws et al., 2015], BWE-SkipGram [Vulić and Moens, 2016], Bilingual Autoencoders [Chandar et al., 2014], and Inverted Index [Søgaard et al., 2015]. While both BWE-SkipGram and Inverted Index were originally trained on document-aligned data, in this work, we apply them to sentence-aligned data.

Data

?) collected translations of the Bible (or parts of it) in over 100 languages, naturally aligned by book, chapter, and verse (31,102 verses in total).222homepages.inf.ed.ac.uk/s0787820/bible/ This corpus allows us to evaluate methods across many different languages, while controlling for the training set’s size. The corpus was decapitalized and tokenized using white spaces after splitting at punctuation.

Benchmarks

We measure the quality of each embedding using both manually annotated word alignment datasets and bilingual dictionaries. We use 16 manually annotated word alignment datasets – Hansards333www.isi.edu/natural-language/download/hansard/ and data from four other sources [Graca et al., 2008, Lambert et al., 2005, Mihalcea and Pedersen, 2003, Holmqvist and Ahrenberg, 2011, Cakmak et al., 2012] – as well as 16 bilingual dictionaries from Wiktionary.

In the word alignment benchmark, each word in a given source language sentence is aligned with the most similar target language word from the target language sentence – this is exactly the same greedy decoding algorithm that is implemented in IBM Model-1 [Brown et al., 1993]. If a source language word is out of vocabulary, it is not aligned with anything, whereas target language out-of-vocabulary words are given a default minimal similarity score, and never aligned to any candidate source language word in practice. We use the inverse of alignment error rate (1-AER) as described in ?) to measure performance, where higher scores mean better alignments.

High quality, freely available, manually annotated word alignment datasets are rare, especially for non-European languages. We therefore include experiments on bilingual dictionary induction. We obtain bilingual dictionaries from Wiktionary for five non-Indo-European languages, namely: Arabic, Finnish, Hebrew, Hungarian, and Turkish (all represented in the Edinburgh Bible Corpus). We emphasize that unlike most previous work, we experiment with finding translation equivalents of all words and do not filter the source and target language words by part of speech. We use precision-at-one (P@1), essentially selecting the closest target-language word to the given source-language word as the translation of choice. This often means that 100% precision is unattainable, since many words have multiple translations.

Hyperparameters

?) exposed a collection of hyperparameters that affect the performance of monolingual embeddings. We assume that the same is true for cross-lingual embeddings, and use their recommended settings across all algorithms (where applicable). Specifically, we used 500 dimensions for every algorithm, context distribution smoothing with (applicable to BilBOWA and BWE-SkipGram), the symmetric version of SVD (applicable to Inverted Index), and run iterative algorithms for 100 epochs to ensure convergence (applicable to all algorithms except Inverted Index). For BilBOWA’s monolingual context window, we used the default of 5. Similarity is always measured by the vectors’ cosine. Most importantly, we use a shared vocabulary, consisting of every word that appeared at least twice in the corpus (tagged with language ID). While hyperparameter tuning could admittedly affect results, we rarely have data for reliably tuning hyperparameters for truly low-resource languages.

Source+Target Words Sentence IDs
BilBOWA BWE Bilingual Inverted
SkipGram Autoencoders Index

Word Alignment (1-AER)

Graça en fr .3653 .3538 .4376 .3499
fr en .3264 .3676 .4488 .3995
en es .2723 .3156 .5000 .3443
es en .2953 .3740 .5076 .4545
en pt .3716 .3983 .4449 .3263
pt en .3949 .4272 .4474 .3902
Hansards en fr .3189 .3109 .4083 .3336
fr en .3206 .3314 .4218 .3749
Lambert en es .1576 .1897 .2960 .2268
es en .1617 .2073 .2905 .2696
Mihalcea en ro .1621 .1848 .2366 .1951
ro en .1598 .2042 .2545 .2133
Holmqvist en sv .2092 .2373 .2746 .2357
sv en .2121 .2853 .2994 .2881
Cakmak en tr .1302 .1547 .2256 .1731
tr en .1479 .1571 .2661 .2665

Dictionary Induction (P@1)

Wiktionary en fr .1096 .2176 .2475 .3125
fr en .1305 .2358 .2762 .3466
en es .0630 .1246 .2738 .3135
es en .0650 .1399 .3012 .3574
en pt .1384 .3869 .3281 .3866
pt en .1573 .4119 .3661 .4190
en ar .0385 .1364 .0995 .1364
ar en .0722 .2408 .1958 .2825
en fi .0213 .1280 .0887 .1367
fi en .0527 .1877 .1597 .2477
en he .0418 .1403 .0985 .1284
he en .0761 .1791 .1701 .2179
en hu .0533 .2299 .1679 .2182
hu en .0810 .2759 .2234 .3204
en tr .0567 .2207 .1770 .2245
tr en .0851 .2598 .2069 .2835
Average* .1640 .2505 .2856 .2867
Top 1 0 3.5 15 13.5
Table 1: The performance of four state-of-the-art cross-lingual embedding methods. * Averages across two different metrics.

3.3 Results

Table 1 shows that the two algorithms based on the sentence-ID feature space perform consistently better than those using source+target words. We suspect that the source+target feature set might be capturing more information than is actually needed for translation, such as syntagmatic or topical similarity between words (e.g. “dog” “kennel”). This might be distracting for cross-lingual tasks such as word alignment and bilingual dictionary induction. Sentence ID features, on the other hand, are simpler, and might therefore contain a cleaner translation-oriented signal.

It is important to state that, in absolute terms, these results are quite poor. The fact that the best inverse AER is around 50% calls into question the ability to actually utilize these embeddings in a real-life scenario. While one may suggest that this is a result of the small training dataset (Edinburgh Bible Corpus), previous work (e.g. [Chandar et al., 2014]) used an even smaller dataset (the first 10K sentences in Europarl [Koehn, 2005]). To ensure that our results are not an artifact of the Edinburgh Bible Corpus, we repeated our experiments on the full Europarl corpus (180K sentences) for a subset of languages (English, French, and Spanish), and observed similar trends. As this is a comparative study focused on analyzing the qualitative differences between algorithms, we place the issue of low absolute performance aside for the moment, and reopen it in §5.4.

Embeddings Alignment
Algorithms
Bilingual Inverted Dice IBM
Autoencoders Index Model-1

Word Alignment (1-AER)

Graça en fr .4376 .3499 .3355 .4263
fr en .4488 .3995 .3470 .4248
en es .5000 .3443 .3919 .4251
es en .5076 .4545 .3120 .4243
en pt .4449 .3263 .3569 .4729
pt en .4474 .3902 .3598 .4712
Hansards en fr .4083 .3336 .3614 .4360
fr en .4218 .3749 .3663 .4499
Lambert en es .2960 .2268 .2057 .2400
es en .2905 .2696 .1947 .2443
Mihalcea en ro .2366 .1951 .2030 .2335
ro en .2545 .2133 .1720 .2214
Holmqvist en sv .2746 .2357 .2435 .3405
sv en .2994 .2881 .2541 .3559
Cakmak en tr .2256 .1731 .2285 .3154
tr en .2661 .2665 .2458 .3494

Dictionary Induction (P@1)

Wiktionary en fr .2475 .3125 .1104 .1791
fr en .2762 .3466 .1330 .1816
en es .2738 .3135 .1072 .0903
es en .3012 .3574 .1417 .1131
en pt .3281 .3866 .1384 .3779
pt en .3661 .4190 .1719 .4358
en ar .0995 .1364 .0449 .1316
ar en .1958 .2825 .0610 .2873
en fi .0887 .1367 .0423 .1340
fi en .1597 .2477 .0463 .2394
en he .0985 .1284 .0358 .1224
he en .1701 .2179 .0328 .2000
en hu .1679 .2182 .0569 .2219
hu en .2234 .3204 .0737 .2985
en tr .1770 .2245 .0406 .1985
tr en .2069 .2835 .0820 .3073
Average 0.2856 0.2867 0.1843 0.2922
Top 1 8 12 0 12
Table 2: The performance of embedding and alignment methods based on the sentence ID feature set.

4 Comparing Cross-lingual Embeddings with Traditional Alignment Methods

Sentence IDs are not unique to modern embedding methods, and have been used by statistical machine translation from the very beginning. In particular, the Dice coefficient [Och and Ney, 2003], which is often used as a baseline for more sophisticated alignment methods, measures the cross-lingual similarity of words according to the number of aligned sentences in which they appeared. IBM Model-1 [Brown et al., 1993] also makes exactly the same data assumptions as other sentence-ID methods. It therefore makes sense to use Dice similarity and the translation probabilities derived from IBM Model-1 as baselines for cross-lingual embeddings that use sentence IDs.

From Table 2 we learn that the existing embedding methods are not really better than IBM Model-1. In fact, their average performance is even slightly lower than Model-1’s. Although Bilingual Autoencoders, Inverted Index, and Model-1 reflect entirely different algorithmic approaches (respectively: neural networks, matrix factorization, and EM), the overall difference in performance seems to be rather marginal. This suggests that the main performance factor is not the algorithm, but the feature space: sentence IDs.

However, Dice also relies on sentence IDs, yet its performance is significantly worse. We suggest that Dice uses the sentence-ID feature set naïvely, resulting in degenerate performance with respect to the other methods. In the following section, we analyze this shortcoming and show that generalizations of Dice actually do yield similar performance Model-1 and other sentence-ID methods.

5 Generalized Dice

In this section, we show that the Dice coefficient [Och and Ney, 2003] can be seen as the dot-product between two word vectors represented over the sentence-ID feature set. After providing some background, we demonstrate the mathematical connection between Dice and word-feature matrices. We then introduce a new variant of Dice, SID-SGNS, which performs on-par with Model-1 and the other embedding algorithms. This variant is able to seamlessly leverage the multi-lingual nature of sentence IDs, giving it a small but significant edge over Model-1.

5.1 Word-Feature Matrices

In the word similarity literature, it is common to represent words as real-valued vectors and compute their “semantic” similarity with vector similarity metrics, such as the cosine of two vectors. These word vectors are traditionally derived from sparse word-feature matrices, either by using the matrix’s rows as-is (also known as “explicit” representation) or by inducing a lower-dimensional representation via matrix factorization [Turney and Pantel, 2010]. Many modern methods, such as those in word2vec [Mikolov et al., 2013b], also create vectors by factorizing word-feature matrices, only without representing these matrices explicitly.

Formally, we are given a vocabulary of words and a feature space (“vocabulary of features”) . These features can be, for instance, the set of sentences comprising the corpus. We then define a matrix of rows and columns. Each entry in represents some statistic pertaining to that combination of word and feature. For example, could be the number of times the word appeared in the document .

The matrix is typically processed into a “smarter” matrix that reflects the strength of association between each given word and feature . We present three common association metrics: row normalization (Equation (1)), Inverse Document Frequency (IDF, Equation (2)), and Pointwise Mutual Information (PMI, Equation (3)). The following equations show how to compute their respective matrices:

(1)

(2)

(3)

where is the co-occurrence count function, is the co-occurrence indicator function, and is a wildcard.444A function with a wildcard should be interpreted as the sum of all possible instantiations, e.g. .

To obtain word vectors of lower dimensionality ( may be huge), the processed matrix is then decomposed, typically with SVD. An alternative way to create low-dimensional word vectors without explicitly constructing is to use the negative sampling algorithm (SGNS) [Mikolov et al., 2013b].555For consistency with prior art, we refer to this algorithm as SGNS (skip-grams with negative sampling), even when it is applied without the skip-gram feature model. This algorithm factorizes using a weighted non-linear objective [Levy and Goldberg, 2014].

5.2 Reinterpreting the Dice Coefficient

In statistical machine translation, the Dice coefficient is commonly used as a baseline for word alignment [Och and Ney, 2003]. Given sentence-aligned data, it provides a numerical measure of how likely two words – a source-language word and a target-language word – are each other’s translation:

(4)

where is the number of aligned sentences in the data where both arguments occurred.

We claim that this metric is mathematically equivalent to the dot-product of two -normalized sentence-ID word-vectors, multiplied by 2. In other words, if we use the combination of sentence-ID features and -normalization to create our word vectors, then for any and :

(5)

To demonstrate this claim, let us look at the dot-product of and :

(6)

where is the index of an aligned sentence. Since and , and both are independent of , we can rewrite the equation as follows:

(7)

Since is an indicator function of whether the word appeared in sentence , it stands to reason that the product is an indicator of whether both and appeared in . Ergo, the numerator of Equation (7) is exactly the number of aligned sentences in which both and occurred: . Therefore:

(8)

This theoretical result implies that the cross-lingual similarity function derived from embeddings based on sentence IDs is essentially a generalization of the Dice coefficient.

5.3 SGNS with Sentence IDs

Prior Art This Work
Bilingual Inverted IBM Bilingual Multilingual
Autoencoders Index Model-1 SID-SGNS SID-SGNS

Word Alignment (1-AER)

Graça en fr .4376 .3499 .4263 .4167 .4433
fr en .4488 .3995 .4248 .4300 .4632
en es .5000 .3443 .4251 .4200 .4893
es en .5076 .4545 .4243 .3610 .5015
en pt .4449 .3263 .4729 .3983 .4047
pt en .4474 .3902 .4712 .4272 .4151
Hansards en fr .4083 .3336 .4360 .3810 .4091
fr en .4218 .3749 .4499 .3806 .4302
Lambert en es .2960 .2268 .2400 .2471 .2989
es en .2905 .2696 .2443 .2415 .3049
Mihalcea en ro .2366 .1951 .2335 .1986 .2514
ro en .2545 .2133 .2214 .1914 .2753
Holmqvist en sv .2746 .2357 .3405 .2373 .2737
sv en .2994 .2881 .3559 .2853 .3195
Cakmak en tr .2256 .1731 .3154 .1547 .2404
tr en .2661 .2665 .3494 .1571 .2945

Dictionary Induction (P@1)

Wiktionary en fr .2475 .3125 .1791 .3182 .3304
fr en .2762 .3466 .1816 .3379 .3893
en es .2738 .3135 .0903 .3268 .3509
es en .3012 .3574 .1131 .3483 .3868
en pt .3281 .3866 .3779 .3869 .4058
pt en .3661 .4190 .4358 .4119 .4376
en ar .0995 .1364 .1316 .1364 .1605
ar en .1958 .2825 .2873 .2408 .3082
en fi .0887 .1367 .1340 .1280 .1591
fi en .1597 .2477 .2394 .1877 .2584
en he .0985 .1284 .1224 .1403 .1448
he en .1701 .2179 .2000 .1791 .2403
en hu .1679 .2182 .2219 .2299 .2482
hu en .2234 .3204 .2985 .2759 .3372
en tr .1770 .2245 .1985 .2207 .2437
tr en .2069 .2835 .3073 .2598 .3080
Average 0.2856 0.2867 0.2922 0.2830 0.3289
Top 1 2 0 8 0 22
Table 3: The performance of SID-SGNS compared to state-of-the-art cross-lingual embedding methods and traditional alignment methods.

The Dice coefficient appears to be a particularly naïve variant of matrix-based methods that use sentence IDs. For example, Inverted Index [Søgaard et al., 2015]), which uses SVD over IDF followed by normalization (instead of normalization), shows significantly better performance. We propose using a third variant, sentence-ID SGNS (SID-SGNS), which simply applies SGNS [Mikolov et al., 2013b] to the word/sentence-ID matrix (see §5.1).

Table 3 compares its performance (Bilingual SID-SGNS) to the other methods, and shows that indeed, this algorithm behaves similarly to other sentence-ID-based methods. We observe similar results for other variants as well, such as SVD over positive PMI (not shown).

5.4 Embedding Multiple Languages

Up until now, we used bilingual data to train cross-lingual embeddings, even though our parallel corpus (the Bible) is in fact multi-lingual. Can we make better use of this fact?

An elegant property of the sentence-ID feature set is that it is a truly inter-lingual representation. This means that multiple languages can be represented together in the same matrix before factorizing it. This raises a question: does dimensionality reduction over a multi-lingual matrix produce better cross-lingual vectors than doing so over a bilingual matrix?

We test our hypothesis by comparing the performance of embeddings trained with SID-SGNS over all 57 languages of the Bible corpus to that of the bilingual embeddings we used earlier. This consistently improves performance across all the development benchmarks, providing a 4.69% average increase in performance (Table 3). With this advantage, SID-SGNS performs significantly better than the other methods combined.666We observed a similar increase in performance when applying the multi-lingual signal to Søgaard et al.’s [Søgaard et al., 2015] IDF-based method and to SVD over positive PMI. This result is similar in vein to recent findings in the parsing literature [Ammar et al., 2016, Guo et al., 2016], where multi-lingual transfer was shown to improve upon bilingual transfer.

In absolute terms, Multilingual SID-SGNS’s performance is still very low. However, this experiment demonstrates that one way of making significant improvement in cross-lingual embeddings is by considering additional sources of information, such as the multi-lingual signal demonstrated here. We hypothesize that, regardless of the algorithmic approach, relying solely on sentence IDs from bilingual parallel corpora will probably not be able to improve much beyond IBM Model-1.

6 Data Paradigms

In §2, we assumed that using sentence-aligned data is a better approach than utilizing document-aligned data. Is this the case?

To compare the data paradigms, we run the same algorithm, SID-SGNS, also on document IDs from Wikipedia.777We use the word-document matrix mined by ?), which contains only a subset of our target languages: English, French, and Spanish. We use the bilingual (not multilingual) version for both data types to control for external effects. During evaluation, we use a common vocabulary for both sentence-aligned and document-aligned embeddings.

Table 4 shows that using sentence IDs from the Bible usually outperforms Wikipedia. This remarkable result, where a small amount of parallel sentences is enough to outperform one of the largest collections of multi-lingual texts in existence, indicates that document-aligned data is an inferior paradigm for translation-related tasks such as word alignment and dictionary induction.

The Bible Wikipedia
Graça en fr .3169 .2602
fr en .3089 .2440
en es .3225 .2429
es en .3207 .2504
Hansards en fr .3661 .2365
fr en .3345 .1723
Lambert en es .2161 .1215
es en .2123 .1027
Wiktionary en fr .3232 .3889
fr en .3418 .4135
en es .3307 .3262
es en .3509 .3310
Average .3121 .2575
Top 1 10 2
Table 4: The performance of SID-SGNS with sentence-aligned data from the Bible (31,102 verses) vs document-aligned data from Wikipedia (195,000 documents).

7 Conclusions

In this paper, we draw both empirical and theoretical parallels between modern cross-lingual word embeddings based on sentence alignments and traditional word alignment algorithms. We show the importance of sentence ID features and present a new, strong baseline for cross-lingual word embeddings, inspired by the Dice aligner. Our results suggest that apart from faster algorithms and more compact representations, recent cross-lingual word embedding algorithms are still unable to outperform the traditional methods by a significant margin. However, introducing our new multi-lingual signal considerably improves performance. Therefore, we hypothesize that the information in bilingual sentence-aligned data has been thoroughly mined by existing methods, and suggest that future work explore additional sources of information in order to make substantial progress.

Acknowledgments

The work was supported in part by The European Research Council (grant number 313695) and The Israeli Science Foundation (grant number 1555/15). We would like to thank Sarath Chandar for helping us run Bilingual Autoencoders on large datasets.

References

  • [Ammar et al., 2016] Waleed Ammar, George Mulcaire, Miguel Ballesteros, Chris Dyer, and Noah Smith. 2016. Many languages, one parser. Transactions of the Association for Computational Linguistics, 4:431–444.
  • [Brown et al., 1993] Peter F Brown, Vincent J Della Pietra, Stephen A Della Pietra, and Robert L Mercer. 1993. The mathematics of statistical machine translation: Parameter estimation. Computational Linguistics, 19(2):263–311.
  • [Cakmak et al., 2012] Talha Cakmak, Süleyman Acar, and Gülsen Eyrigit. 2012. Word alignment for english-turkish language pair. In LREC.
  • [Chandar et al., 2014] Sarath A P Chandar, Stanislas Lauly, Hugo Larochelle, Mitesh Khapra, Balaraman Ravindran, Vikas C Raykar, and Amrita Saha. 2014. An autoencoder approach to learning bilingual word representations. In Z. Ghahramani, M. Welling, C. Cortes, N. D. Lawrence, and K. Q. Weinberger, editors, Advances in Neural Information Processing Systems 27, pages 1853–1861. Curran Associates, Inc.
  • [Christodouloupoulos and Steedman, 2015] Christos Christodouloupoulos and Mark Steedman. 2015. A massively parallel corpus: The bible in 100 languages. Language Resources and Evaluation, 49(2):375–395.
  • [Faruqui and Dyer, 2014] Manaal Faruqui and Chris Dyer. 2014. Improving vector space word representations using multilingual correlation. In Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, pages 462–471, Gothenburg, Sweden, April. Association for Computational Linguistics.
  • [Gouws and Søgaard, 2015] Stephan Gouws and Anders Søgaard. 2015. Simple task-specific bilingual word embeddings. In Proceedings of the 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pages 1386–1390, Denver, Colorado, May–June. Association for Computational Linguistics.
  • [Gouws et al., 2015] Stephan Gouws, Yoshua Bengio, and Greg Corrado. 2015. Bilbowa: Fast bilingual distributed representations without word alignments. In Proceedings of the 32nd International Conference on Machine Learning, ICML 2015, Lille, France, 6-11 July 2015, pages 748–756.
  • [Graca et al., 2008] Joao Graca, Joana Pardal, Luísa Coheur, and Diamantino Caseiro. 2008. Building a golden collection of parallel multi-language word alignments. In LREC.
  • [Guo et al., 2016] Jiang Guo, Wanxiang Che, David Yarowsky, Haifeng Wang, and Ting Liu. 2016. A representation learning framework for multi-source transfer parsing. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI’16, pages 2734–2740. AAAI Press.
  • [Hermann and Blunsom, 2014] Karl Moritz Hermann and Phil Blunsom. 2014. Multilingual Distributed Representations without Word Alignment. In Proceedings of ICLR, April.
  • [Holmqvist and Ahrenberg, 2011] Maria Holmqvist and Lars Ahrenberg. 2011. A gold standard for english–swedish word alignment. In NODALIDA.
  • [Klementiev et al., 2012] Alexandre Klementiev, Ivan Titov, and Binod Bhattarai. 2012. Inducing crosslingual distributed representations of words. In Proceedings of COLING 2012, pages 1459–1474, Mumbai, India, December. The COLING 2012 Organizing Committee.
  • [Koehn, 2005] Philipp Koehn. 2005. Europarl: A parallel corpus for statistical machine translation. In MT Summit, volume 5, pages 79–86.
  • [Koehn, 2010] Philipp Koehn. 2010. Statistical Machine Translation. Cambridge University Press, New York, NY, USA, 1st edition.
  • [Lambert et al., 2005] Patrik Lambert, Adria de Gispert, Rafael Banchs, and Jose Marino. 2005. Guidelines for word aligment evaluation and manual alignment. Language Resources and Evaluation, 39(4):267–285.
  • [Levy and Goldberg, 2014] Omer Levy and Yoav Goldberg. 2014. Neural word embeddings as implicit matrix factorization. In Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, December 8-13 2014, Montreal, Quebec, Canada, pages 2177–2185.
  • [Levy et al., 2015] Omer Levy, Yoav Goldberg, and Ido Dagan. 2015. Improving distributional similarity with lessons learned from word embeddings. Transactions of the Association for Computational Linguistics, 3:211–225.
  • [Luong et al., 2015] Minh-Thang Luong, Hieu Pham, and Christopher Manning. 2015. Bilingual word representations with monolingual quality in mind. In Proceedings of the 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pages 151––159, Denver, Colorado, May–June. Association for Computational Linguistics.
  • [Mihalcea and Pedersen, 2003] Rada Mihalcea and Ted Pedersen. 2003. An evaluation exercise for word alignment. In HLT-NAACL 2003 Workshop: Building and Using Parallel Texts: Data Driven Machine Translation and Beyond.
  • [Mikolov et al., 2013a] Tomas Mikolov, Quoc V Le, and Ilya Sutskever. 2013a. Exploiting similarities among languages for machine translation. arXiv preprint arXiv:1309.4168.
  • [Mikolov et al., 2013b] Tomas Mikolov, Ilya Sutskever, Kai Chen, Gregory S. Corrado, and Jeffrey Dean. 2013b. Distributed representations of words and phrases and their compositionality. In Advances in Neural Information Processing Systems, pages 3111–3119.
  • [Och and Ney, 2003] Franz Josef Och and Hermann Ney. 2003. A systematic comparison of various statistical alignment models. Computational Linguistics, 29(1):19–51.
  • [Sahlgren, 2006] Magnus Sahlgren. 2006. The Word-Space Model. Ph.D. thesis, Stockholm University.
  • [Søgaard et al., 2015] Anders Søgaard, Željko Agić, Héctor Martínez Alonso, Barbara Plank, Bernd Bohnet, and Anders Johannsen. 2015. Inverted indexing for cross-lingual nlp. In Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), pages 1713–1722, Beijing, China, July. Association for Computational Linguistics.
  • [Turney and Pantel, 2010] Peter D. Turney and Patrick Pantel. 2010. From frequency to meaning: Vector space models of semantics. Journal of Artificial Intelligence Research, 37(1):141–188.
  • [Upadhyay et al., 2016] Shyam Upadhyay, Manaal Faruqui, Chris Dyer, and Dan Roth. 2016. Cross-lingual models of word embeddings: An empirical comparison. In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 1661–1670, Berlin, Germany, August. Association for Computational Linguistics.
  • [Vulić and Moens, 2016] Ivan Vulić and Marie-Francine Moens. 2016. Bilingual distributed word representations from document-aligned comparable data. Journal of Artificial Intelligence Research, 55:953–994.
  • [Xiao and Guo, 2014] Min Xiao and Yuhong Guo. 2014. Distributed word representation learning for cross-lingual dependency parsing. In Proceedings of the Eighteenth Conference on Computational Natural Language Learning, pages 119–129, Ann Arbor, Michigan, June. Association for Computational Linguistics.
  • [Zou et al., 2013] Will Y. Zou, Richard Socher, Daniel Cer, and Christopher D. Manning. 2013. Bilingual word embeddings for phrase-based machine translation. In Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing, pages 1393–1398, Seattle, Washington, USA, October. Association for Computational Linguistics.
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
""
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
   
Add comment
Cancel
Loading ...
36553
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description