这是用户在 2024-5-26 1:41 为 https://app.immersivetranslate.com/pdf-pro/cdb9a8ce-cefc-4106-9fe9-6c71014e71a3 保存的双语快照页面,由 沉浸式翻译 提供双语支持。了解如何保存?

Efficient Estimation of Word Representations in Vector Space

Tomas Mikolov 托马斯-米科洛夫Google Inc., Mountain View, CA
tmikolov@google.comGreg Corrado 格雷格-科拉多Google Inc., Mountain View, CA

Kai Chen 陈凯Google Inc., Mountain View, CA
kaichen@google.comJeffrey Dean 杰弗里-迪安Google Inc., Mountain View, CA

Abstract 摘要

We propose two novel model architectures for computing continuous vector representations of words from very large data sets. The quality of these representations is measured in a word similarity task, and the results are compared to the previously best performing techniques based on different types of neural networks. We observe large improvements in accuracy at much lower computational cost, i.e. it takes less than a day to learn high quality word vectors from a 1.6 billion words data set. Furthermore, we show that these vectors provide state-of-the-art performance on our test set for measuring syntactic and semantic word similarities.
我们提出了两种新颖的模型架构,用于计算超大数据集中单词的连续向量表示。我们在词语相似性任务中测量了这些表征的质量,并将结果与之前基于不同类型神经网络的最佳技术进行了比较。我们观察到,在计算成本大大降低的情况下,准确率有了很大提高,也就是说,从 16 亿字的数据集中学习高质量的单词向量只需不到一天的时间。此外,我们还表明,这些向量在我们的测试集上提供了最先进的性能,可用于测量句法和语义词的相似性。

1 Introduction 1 引言

Many current NLP systems and techniques treat words as atomic units - there is no notion of similarity between words, as these are represented as indices in a vocabulary. This choice has several good reasons - simplicity, robustness and the observation that simple models trained on huge amounts of data outperform complex systems trained on less data. An example is the popular -gram model used for statistical language modeling - today, it is possible to train -grams on virtually all available data (trillions of words [3]).
当前的许多 NLP 系统和技术都将单词视为原子单位,没有单词之间相似性的概念,因为这些单词在词汇表中表示为索引。这种选择有几个很好的理由--简单、稳健,以及观察到在海量数据上训练出来的简单模型优于在较少数据上训练出来的复杂系统。统计语言建模中常用的 -gram 模型就是一个很好的例子--如今,在几乎所有可用数据(数万亿单词[3])上训练 -grams是可能的。
However, the simple techniques are at their limits in many tasks. For example, the amount of relevant in-domain data for automatic speech recognition is limited - the performance is usually dominated by the size of high quality transcribed speech data (often just millions of words). In machine translation, the existing corpora for many languages contain only a few billions of words or less. Thus, there are situations where simple scaling up of the basic techniques will not result in any significant progress, and we have to focus on more advanced techniques.
With progress of machine learning techniques in recent years, it has become possible to train more complex models on much larger data set, and they typically outperform the simple models. Probably the most successful concept is to use distributed representations of words [10]. For example, neural network based language models significantly outperform -gram models [1, 27, 17].
近年来,随着机器学习技术的进步,在更大的数据集上训练更复杂的模型已成为可能,而且这些模型通常优于简单的模型。最成功的概念可能是使用单词的分布式表示[10]。例如,基于神经网络的语言模型明显优于 -gram 模型[1, 27, 17]。

1.1 Goals of the Paper
1.1 本文的目标

The main goal of this paper is to introduce techniques that can be used for learning high-quality word vectors from huge data sets with billions of words, and with millions of words in the vocabulary. As far as we know, none of the previously proposed architectures has been successfully trained on more

than a few hundred of millions of words, with a modest dimensionality of the word vectors between .
数亿词以上,词向量维度适中,介于 之间。
We use recently proposed techniques for measuring the quality of the resulting vector representations, with the expectation that not only will similar words tend to be close to each other, but that words can have multiple degrees of similarity [20]. This has been observed earlier in the context of inflectional languages - for example, nouns can have multiple word endings, and if we search for similar words in a subspace of the original vector space, it is possible to find words that have similar endings [13, [14].
我们使用最近提出的技术来衡量所得到的向量表示的质量,希望不仅相似的词往往彼此接近,而且词可以有多种相似度[20]。早先在词性语言的语境中就观察到了这一点--例如,名词可以有多种词尾,如果我们在原始向量空间的子空间中搜索相似词,就有可能找到词尾相似的词[13, [14]。
Somewhat surprisingly, it was found that similarity of word representations goes beyond simple syntactic regularities. Using a word offset technique where simple algebraic operations are performed on the word vectors, it was shown for example that vector("King") - vector("Man") + vector("Woman") results in a vector that is closest to the vector representation of the word Queen [20].
令人惊讶的是,我们发现词语表征的相似性超出了简单的句法规律。例如,利用词偏移技术对词向量进行简单的代数运算,结果表明向量("King")-向量("Man")+向量("Woman")得到的向量最接近 Queen 这个词的向量表示[20]。
In this paper, we try to maximize accuracy of these vector operations by developing new model architectures that preserve the linear regularities among words. We design a new comprehensive test set for measuring both syntactic and semantic regularities and show that many such regularities can be learned with high accuracy. Moreover, we discuss how training time and accuracy depends on the dimensionality of the word vectors and on the amount of the training data.
在本文中,我们试图通过开发新的模型架构来最大限度地提高这些向量运算的准确性,从而保留词语之间的线性规律性。我们设计了一个新的综合测试集,用于测量句法和语义规则性 ,并证明可以高精度地学习到许多此类规则性。此外,我们还讨论了训练时间和准确性如何取决于词向量的维度和训练数据的数量。

1.2 Previous Work 1.2 以前的工作

Representation of words as continuous vectors has a long history [10, 26, 8]. A very popular model architecture for estimating neural network language model (NNLM) was proposed in [1], where a feedforward neural network with a linear projection layer and a non-linear hidden layer was used to learn jointly the word vector representation and a statistical language model. This work has been followed by many others.
将单词表示为连续向量的方法由来已久[10, 26, 8]。[1]中提出了一种非常流行的用于估算神经网络语言模型(NNLM)的模型结构,即使用带有线性投影层和非线性隐藏层的前馈神经网络来联合学习词向量表示和统计语言模型。这项工作之后又有许多人效仿。
Another interesting architecture of NNLM was presented in [13, 14], where the word vectors are first learned using neural network with a single hidden layer. The word vectors are then used to train the NNLM. Thus, the word vectors are learned even without constructing the full NNLM. In this work, we directly extend this architecture, and focus just on the first step where the word vectors are learned using a simple model.
文献[13, 14]提出了另一种有趣的 NNLM 结构,即首先使用单隐层神经网络学习单词向量。然后使用这些词向量来训练 NNLM。因此,即使不构建完整的 NNLM,也能学习到词向量。在这项工作中,我们直接扩展了这一架构,只关注第一步,即使用简单模型学习词向量。
It was later shown that the word vectors can be used to significantly improve and simplify many NLP applications [4, 5, 29]. Estimation of the word vectors itself was performed using different model architectures and trained on various corpora [4, 29, 23, 19, 9], and some of the resulting word vectors were made available for future research and comparison . However, as far as we know, these architectures were significantly more computationally expensive for training than the one proposed in [13], with the exception of certain version of log-bilinear model where diagonal weight matrices are used [23].
后来的研究表明,词向量可用于显著改善和简化许多 NLP 应用 [4, 5, 29]。词向量的估算本身使用了不同的模型架构,并在不同的语料库上进行了训练[4, 29, 23, 19, 9],得到的一些词向量可供未来的研究和比较 。然而,据我们所知,除了使用对角权重矩阵的对数-线性模型的某些版本外[23],这些架构的训练计算成本明显高于[13]中提出的架构。

2 Model Architectures 2 模型架构

Many different types of models were proposed for estimating continuous representations of words, including the well-known Latent Semantic Analysis (LSA) and Latent Dirichlet Allocation (LDA). In this paper, we focus on distributed representations of words learned by neural networks, as it was previously shown that they perform significantly better than LSA for preserving linear regularities among words [20, 31]; LDA moreover becomes computationally very expensive on large data sets.
人们提出了许多不同类型的模型来估计词语的连续表征,其中包括著名的潜在语义分析(LSA)和潜在德里希特分配(LDA)。在本文中,我们将重点关注通过神经网络学习到的词的分布式表示,因为之前的研究表明,神经网络在保持词之间的线性规律性方面的表现要明显优于 LSA [20, 31];此外,LDA 在大型数据集上的计算成本也非常高昂。
Similar to [18], to compare different model architectures we define first the computational complexity of a model as the number of parameters that need to be accessed to fully train the model. Next, we will try to maximize the accuracy, while minimizing the computational complexity.
For all the following models, the training complexity is proportional to
where is number of the training epochs, is the number of the words in the training set and is defined further for each model architecture. Common choice is and up to one billion. All models are trained using stochastic gradient descent and backpropagation [26].
其中, 是训练历元数, 是训练集中的单词数, 是针对每个模型架构的进一步定义。常见的选择是 ,最高可达 10 亿。所有模型均采用随机梯度下降法和反向传播法进行训练[26]。

2.1 Feedforward Neural Net Language Model (NNLM)
2.1 前馈神经网络语言模型(NNLM)

The probabilistic feedforward neural network language model has been proposed in [1]. It consists of input, projection, hidden and output layers. At the input layer, previous words are encoded using 1 -of- coding, where is size of the vocabulary. The input layer is then projected to a projection layer that has dimensionality , using a shared projection matrix. As only inputs are active at any given time, composition of the projection layer is a relatively cheap operation.
概率前馈神经网络语言模型是在 [1] 中提出的。它由输入层、投影层、隐藏层和输出层组成。在输入层, 前一个词使用 1 的 编码,其中 是词汇量的大小。然后,使用共享投影矩阵将输入层投影到投影层 ,投影层的维度为 。由于在任何给定时间内只有 输入处于活动状态,因此组成投影层的操作成本相对较低。
The NNLM architecture becomes complex for computation between the projection and the hidden layer, as values in the projection layer are dense. For a common choice of , the size of the projection layer might be 500 to 2000 , while the hidden layer size is typically 500 to 1000 units. Moreover, the hidden layer is used to compute probability distribution over all the words in the vocabulary, resulting in an output layer with dimensionality . Thus, the computational complexity per each training example is
NNLM 架构在投影层和隐藏层之间的计算变得复杂,因为投影层中的值是密集的。对于 的常见选择,投影层的大小 可能是 500 到 2000,而隐藏层的大小 通常是 500 到 1000 个单位。此外,隐层用于计算词汇表中所有单词的概率分布,因此输出层的维度为 。因此,每个训练实例的计算复杂度为
where the dominating term is . However, several practical solutions were proposed for avoiding it; either using hierarchical versions of the softmax [25, 23, 18], or avoiding normalized models completely by using models that are not normalized during training [4, 9]. With binary tree representations of the vocabulary, the number of output units that need to be evaluated can go down to around . Thus, most of the complexity is caused by the term .
其中主导项为 。然而,为了避免这种情况,人们提出了几种实用的解决方案:或者使用分层版本的 softmax [25, 23, 18],或者通过使用在训练过程中未归一化的模型来完全避免归一化模型 [4, 9]。使用二叉树表示词汇时,需要评估的输出单元数量可以减少到 左右。因此,大部分复杂性都是由术语 引起的。
In our models, we use hierarchical softmax where the vocabulary is represented as a Huffman binary tree. This follows previous observations that the frequency of words works well for obtaining classes in neural net language models [16]. Huffman trees assign short binary codes to frequent words, and this further reduces the number of output units that need to be evaluated: while balanced binary tree would require outputs to be evaluated, the Huffman tree based hierarchical softmax requires only about Unigram_perplexity . For example when the vocabulary size is one million words, this results in about two times speedup in evaluation. While this is not crucial speedup for neural network LMs as the computational bottleneck is in the term, we will later propose architectures that do not have hidden layers and thus depend heavily on the efficiency of the softmax normalization.
在我们的模型中,我们使用分层软最大值(hierarchical softmax),将词汇表表示为哈夫曼二叉树(Huffman binary tree)。根据之前的观察,在神经网络语言模型中,词频可以很好地用于获取类别[16]。哈夫曼树为频繁出现的单词分配了简短的二进制代码,这进一步减少了需要评估的输出单元数量:平衡二叉树需要评估 个输出,而基于哈夫曼树的分层软最大值只需要约 Unigram_perplexity 。例如,当词汇量为一百万词时,评估速度将提高两倍。由于计算瓶颈在于 项,因此这对神经网络 LM 的速度提升并不重要,但我们稍后将提出没有隐藏层的架构,因此这在很大程度上取决于 softmax 归一化的效率。

2.2 Recurrent Neural Net Language Model (RNNLM)
2.2 循环神经网络语言模型(RNNLM)

Recurrent neural network based language model has been proposed to overcome certain limitations of the feedforward NNLM, such as the need to specify the context length (the order of the model ), and because theoretically RNNs can efficiently represent more complex patterns than the shallow neural networks [15, 2]. The RNN model does not have a projection layer; only input, hidden and output layer. What is special for this type of model is the recurrent matrix that connects hidden layer to itself, using time-delayed connections. This allows the recurrent model to form some kind of short term memory, as information from the past can be represented by the hidden layer state that gets updated based on the current input and the state of the hidden layer in the previous time step.
提出基于递归神经网络的语言模型是为了克服前馈 NNLM 的某些局限性,例如需要指定上下文长度(模型的阶数 ),而且从理论上讲,RNN 比浅层神经网络能有效地表示更复杂的模式[15, 2]。RNN 模型没有投影层,只有输入层、隐藏层和输出层。这种模型的特殊之处在于使用延时连接将隐藏层与自身连接起来的递归矩阵。这使得递归模型能够形成某种短期记忆,因为过去的信息可以通过隐层状态来表示,而隐层状态则根据当前输入和上一时间步的隐层状态进行更新。
The complexity per training example of the RNN model is
RNN 模型每个训练实例的复杂度为
where the word representations have the same dimensionality as the hidden layer . Again, the term can be efficiently reduced to by using hierarchical softmax. Most of the complexity then comes from .
其中,词表示 与隐藏层 的维度相同。同样,通过使用分层软最大值(hierarchical softmax),可以将 有效地缩减为 。这样,大部分复杂性就来自于

2.3 Parallel Training of Neural Networks
2.3 并行训练神经网络

To train models on huge data sets, we have implemented several models on top of a large-scale distributed framework called DistBelief [6], including the feedforward NNLM and the new models proposed in this paper. The framework allows us to run multiple replicas of the same model in parallel, and each replica synchronizes its gradient updates through a centralized server that keeps all the parameters. For this parallel training, we use mini-batch asynchronous gradient descent with an adaptive learning rate procedure called Adagrad [7]. Under this framework, it is common to use one hundred or more model replicas, each using many CPU cores at different machines in a data center.
为了在海量数据集上训练模型,我们在一个名为 DistBelief [6] 的大规模分布式框架上实现了几个模型,包括前馈 NNLM 和本文提出的新模型。该框架允许我们并行运行同一模型的多个副本,每个副本通过一个保存所有参数的集中式服务器同步梯度更新。在这种并行训练中,我们使用迷你批次异步梯度下降法,并采用名为 Adagrad 的自适应学习率程序 [7]。在此框架下,通常会使用 100 个或更多模型副本,每个副本使用数据中心不同机器上的多个 CPU 内核。

3 New Log-linear Models
3 新对数线性模型

In this section, we propose two new model architectures for learning distributed representations of words that try to minimize computational complexity. The main observation from the previous section was that most of the complexity is caused by the non-linear hidden layer in the model. While this is what makes neural networks so attractive, we decided to explore simpler models that might not be able to represent the data as precisely as neural networks, but can possibly be trained on much more data efficiently.
The new architectures directly follow those proposed in our earlier work [13, 14], where it was found that neural network language model can be successfully trained in two steps: first, continuous word vectors are learned using simple model, and then the N-gram NNLM is trained on top of these distributed representations of words. While there has been later substantial amount of work that focuses on learning word vectors, we consider the approach proposed in [13] to be the simplest one. Note that related models have been proposed also much earlier [26, 8].
新架构直接沿用了我们早期工作[13, 14]中提出的架构,我们发现神经网络语言模型可以通过两个步骤训练成功:首先,使用简单模型学习连续词向量,然后在这些分布式词表征的基础上训练 N-gram NNLM。虽然后来有大量的工作都集中在学习单词向量上,但我们认为 [13] 中提出的方法是最简单的方法。需要注意的是,相关模型的提出也要早得多 [26, 8]。

3.1 Continuous Bag-of-Words Model
3.1 连续词袋模型

The first proposed architecture is similar to the feedforward NNLM, where the non-linear hidden layer is removed and the projection layer is shared for all words (not just the projection matrix); thus, all words get projected into the same position (their vectors are averaged). We call this architecture a bag-of-words model as the order of words in the history does not influence the projection. Furthermore, we also use words from the future; we have obtained the best performance on the task introduced in the next section by building a log-linear classifier with four future and four history words at the input, where the training criterion is to correctly classify the current (middle) word. Training complexity is then
第一个提议的架构类似于前馈 NNLM,其中的非线性隐藏层被移除,所有单词共享投影层(而不仅仅是投影矩阵);因此,所有单词都会被投影到相同的位置(它们的向量被平均化)。我们称这种结构为词袋模型,因为词在历史记录中的顺序不会影响投影。此外,我们还使用了来自未来的单词;在下一节介绍的任务中,我们通过建立一个对数线性分类器,输入四个未来单词和四个历史单词,训练标准是正确分类当前(中间)单词,从而获得了最佳性能。训练复杂度为
We denote this model further as CBOW, as unlike standard bag-of-words model, it uses continuous distributed representation of the context. The model architecture is shown at Figure 1. Note that the weight matrix between the input and the projection layer is shared for all word positions in the same way as in the NNLM.
我们将该模型进一步命名为 CBOW,因为与标准的词袋模型不同,它使用连续的分布式上下文表示法。模型架构如图 1 所示。请注意,输入层和投影层之间的权重矩阵与 NNLM 中的方式相同,都是共享所有词位的权重矩阵。

3.2 Continuous Skip-gram Model
3.2 连续跳读模式

The second architecture is similar to CBOW, but instead of predicting the current word based on the context, it tries to maximize classification of a word based on another word in the same sentence. More precisely, we use each current word as an input to a log-linear classifier with continuous projection layer, and predict words within a certain range before and after the current word. We found that increasing the range improves quality of the resulting word vectors, but it also increases the computational complexity. Since the more distant words are usually less related to the current word than those close to it, we give less weight to the distant words by sampling less from those words in our training examples.
第二种结构与 CBOW 类似,但它不是根据上下文预测当前单词,而是试图根据同一句子中的另一个单词最大化单词分类。更确切地说,我们将每个当前单词作为带有连续投影层的对数线性分类器的输入,并预测当前单词前后一定范围内的单词。我们发现,扩大范围可以提高得到的词向量的质量,但同时也会增加计算复杂度。由于距离较远的词与当前词的相关性通常低于距离较近的词,因此我们在训练示例中减少了对距离较远的词的采样,从而降低了这些词的权重。
The training complexity of this architecture is proportional to
where is the maximum distance of the words. Thus, if we choose , for each training word we will select randomly a number in range , and then use words from history and
其中 是单词的最大距离。因此,如果我们选择 ,那么对于每个训练词,我们将在 的范围内随机选择一个数字 ,然后使用历史中的 词,并将其作为训练词。
Figure 1: New model architectures. The CBOW architecture predicts the current word based on the context, and the Skip-gram predicts surrounding words given the current word.
图 1:新的模型架构。CBOW 架构根据上下文预测当前单词,Skip-gram 则根据当前单词预测周边单词。
words from the future of the current word as correct labels. This will require us to do word classifications, with the current word as input, and each of the words as output. In the following experiments, we use .
当前单词的未来单词作为正确标签。这就要求我们以当前单词为输入,以 的每个单词为输出,进行 单词分类。在下面的实验中,我们使用 。

4 Results 4 项成果

To compare the quality of different versions of word vectors, previous papers typically use a table showing example words and their most similar words, and understand them intuitively. Although it is easy to show that word France is similar to Italy and perhaps some other countries, it is much more challenging when subjecting those vectors in a more complex similarity task, as follows. We follow previous observation that there can be many different types of similarities between words, for example, word big is similar to bigger in the same sense that small is similar to smaller. Example of another type of relationship can be word pairs big - biggest and small - smallest [20]. We further denote two pairs of words with the same relationship as a question, as we can ask: "What is the word that is similar to small in the same sense as biggest is similar to big?"
为了比较不同版本单词向量的质量,以往的论文通常使用一个表格来显示示例单词及其最相似的单词,并直观地理解它们。虽然很容易看出单词 "法国"(France)与 "意大利"(Italy)以及其他一些国家的单词相似,但要将这些向量用于更复杂的相似性任务,难度就大得多了。根据我们之前的观察,词与词之间可能存在许多不同类型的相似性,例如,词 big 与 bigger 的相似性与词 small 与 smaller 的相似性相同。另一种关系的例子是词对 big - biggest 和 small - smallest [20]。我们还可以将具有相同关系的两对词表示为一个问题,如我们可以问:"在 biggest 与 big 相似的意义上,与 small 相似的词是什么?
Somewhat surprisingly, these questions can be answered by performing simple algebraic operations with the vector representation of words. To find a word that is similar to small in the same sense as biggest is similar to big, we can simply compute vector vector("biggest") - vector("big") + vector ("small"). Then, we search in the vector space for the word closest to measured by cosine distance, and use it as the answer to the question (we discard the input question words during this search). When the word vectors are well trained, it is possible to find the correct answer (word smallest) using this method.
令人惊讶的是,这些问题都可以通过对单词的向量表示进行简单的代数运算来解答。要找到一个与 "小 "相似的词,就像 "大 "与 "小 "相似一样,我们只需计算向量 向量("最大")- 向量("大")+ 向量("小")。然后,我们在向量空间中搜索最接近 的单词,并将其作为问题的答案(在搜索过程中,我们会丢弃输入的问题单词)。当单词向量训练有素时,就有可能用这种方法找到正确答案(单词最小)。
Finally, we found that when we train high dimensional word vectors on a large amount of data, the resulting vectors can be used to answer very subtle semantic relationships between words, such as a city and the country it belongs to, e.g. France is to Paris as Germany is to Berlin. Word vectors with such semantic relationships could be used to improve many existing NLP applications, such as machine translation, information retrieval and question answering systems, and may enable other future applications yet to be invented.
最后,我们发现,当我们在大量数据上训练高维词向量时,得到的向量可以用来回答词与词之间非常微妙的语义关系,例如一个城市和它所属的国家,如法国之于巴黎,德国之于柏林。具有这种语义关系的词向量可用于改进许多现有的 NLP 应用,如机器翻译、信息检索和问题解答系统,并可用于其他尚未发明的未来应用。
Table 1: Examples of five types of semantic and nine types of syntactic questions in the SemanticSyntactic Word Relationship test set.
表 1:语义句法词语关系测试集中的五类语义问题和九类句法问题示例。
Type of relationship 关系类型 Word Pair 1 词对 1 Word Pair 2 词对 2
Common capital city 共同首都 Athens Greece Oslo Norway
All capital cities 所有首都 Astana Kazakhstan Harare Zimbabwe
Currency Angola kwanza Iran rial
City-in-state 州内城市 Chicago Illinois Stockton California
Man-Woman brother sister grandson granddaughter 外孙女
Adjective to adverb 形容词对副词 apparent apparently rapid rapidly
Opposite possibly impossibly ethical unethical
Comparative 比较 great greater tough tougher
Superlative 高级 easy easiest lucky luckiest
Present Participle 现在分词 think thinking read reading
Nationality adjective 国籍形容词 Switzerland 瑞士 Swiss Cambodia Cambodian
Past tense 过去式 walking walked swimming swam
Plural nouns 复数名词 mouse mice dollar dollars
Plural verbs 复数动词 work works speak speaks

4.1 Task Description 4.1 任务描述

To measure quality of the word vectors, we define a comprehensive test set that contains five types of semantic questions, and nine types of syntactic questions. Two examples from each category are shown in Table 1. Overall, there are 8869 semantic and 10675 syntactic questions. The questions in each category were created in two steps: first, a list of similar word pairs was created manually. Then, a large list of questions is formed by connecting two word pairs. For example, we made a list of 68 large American cities and the states they belong to, and formed about questions by picking two word pairs at random. We have included in our test set only single token words, thus multi-word entities are not present (such as New York).
为了衡量词向量的质量,我们定义了一个综合测试集,其中包含五类语义问题和九类句法问题。表 1 显示了每类问题的两个示例。总共有 8869 个语义问题和 10675 个句法问题。每个类别的问题都是分两步创建的:首先,人工创建相似词对列表。然后,通过连接两个词对形成一个大的问题列表。例如,我们制作了一个包含 68 个美国大城市及其所属州的列表,并通过随机挑选两个词对形成了约 个问题。我们的测试集只包含单标记词,因此不包含多词实体(如纽约)。
We evaluate the overall accuracy for all question types, and for each question type separately (semantic, syntactic). Question is assumed to be correctly answered only if the closest word to the vector computed using the above method is exactly the same as the correct word in the question; synonyms are thus counted as mistakes. This also means that reaching accuracy is likely to be impossible, as the current models do not have any input information about word morphology. However, we believe that usefulness of the word vectors for certain applications should be positively correlated with this accuracy metric. Further progress can be achieved by incorporating information about structure of words, especially for the syntactic questions.
我们对所有问题类型以及每种问题类型(语义、句法)分别进行总体准确率评估。只有当使用上述方法计算出的向量中最接近的单词与问题中的正确单词完全相同时,问题才会被认为是正确回答;因此,同义词也被算作错误。这也意味着,要达到 的准确率很可能是不可能的,因为目前的模型没有任何关于词形的输入信息。不过,我们相信,词向量在某些应用中的实用性应该与这一准确度指标呈正相关。通过加入词的结构信息,尤其是句法问题的结构信息,我们可以取得更大的进步。

4.2 Maximization of Accuracy
4.2 精度最大化

We have used a Google News corpus for training the word vectors. This corpus contains about 6B tokens. We have restricted the vocabulary size to 1 million most frequent words. Clearly, we are facing time constrained optimization problem, as it can be expected that both using more data and higher dimensional word vectors will improve the accuracy. To estimate the best choice of model architecture for obtaining as good as possible results quickly, we have first evaluated models trained on subsets of the training data, with vocabulary restricted to the most frequent words. The results using the CBOW architecture with different choice of word vector dimensionality and increasing amount of the training data are shown in Table 2.
我们使用谷歌新闻语料库来训练词向量。该语料库包含约 6B 个词库。我们将词汇量限制在 100 万个最常出现的词。显然,我们面临的是时间有限的优化问题,因为可以预期,使用更多数据和更高维度的词向量都会提高准确率。为了估算模型架构的最佳选择,以便尽快获得尽可能好的结果,我们首先评估了在训练数据子集上训练的模型,并将词汇量限制在最常见的 单词上。表 2 列出了使用 CBOW 架构、不同的词向量维度选择和不断增加的训练数据量所得到的结果。
It can be seen that after some point, adding more dimensions or adding more training data provides diminishing improvements. So, we have to increase both vector dimensionality and the amount of the training data together. While this observation might seem trivial, it must be noted that it is currently popular to train word vectors on relatively large amounts of data, but with insufficient size
Table 2: Accuracy on subset of the Semantic-Syntactic Word Relationship test set, using word vectors from the CBOW architecture with limited vocabulary. Only questions containing words from the most frequent words are used.
表 2:在语义-句法单词关系测试集子集上的准确率,使用来自 CBOW 架构的单词向量,词汇量有限。只使用包含最常见 词的问题。
Dimensionality / Training words
50 13.4 15.7 18.6 19.1 22.5 23.2
100 19.4 23.1 27.8 28.7 33.4 32.2
300 23.2 29.2 35.3 38.6 43.7 45.9
600 24.0 30.1 36.5 40.8 46.6 50.4
Table 3: Comparison of architectures using models trained on the same data, with 640-dimensional word vectors. The accuracies are reported on our Semantic-Syntactic Word Relationship test set, and on the syntactic relationship test set of [20]
表 3:使用在相同数据(640 维词向量)上训练的模型的架构比较。准确率是在我们的语义-句法词关系测试集和 [20] 的句法关系测试集上报告的。
} {模型架构}
Semantic-Syntactic Word Relationship test set
MSR Word Relatedness MSR 词语相关性
Semantic Accuracy [%] 语义准确率 [%]。 Syntactic Accuracy [%] 句法准确率 [%] Test [20] 测试 [20]
RNNLM 9 36 35
NNLM 23 53 47
CBOW 24 64 61
Skip-gram 55 59 56
(such as 50 - 100). Given Equation 4, increasing amount of training data twice results in about the same increase of computational complexity as increasing vector size twice.
(例如 50 - 100)。考虑到等式 4,将训练数据量增加两倍与将向量大小增加两倍的计算复杂度增幅大致相同。
For the experiments reported in Tables 2 and 4 , we used three training epochs with stochastic gradient descent and backpropagation. We chose starting learning rate 0.025 and decreased it linearly, so that it approaches zero at the end of the last training epoch.
在表 2 和表 4 中的实验中,我们使用了随机梯度下降和反向传播的三个训练历元。我们选择了 0.025 的起始学习率,并将其线性递减,使其在最后一个训练历元结束时接近于零。

4.3 Comparison of Model Architectures
4.3 模型结构比较

First we compare different model architectures for deriving the word vectors using the same training data and using the same dimensionality of 640 of the word vectors. In the further experiments, we use full set of questions in the new Semantic-Syntactic Word Relationship test set, i.e. unrestricted to the 30k vocabulary. We also include results on a test set introduced in [20] that focuses on syntactic similarity between word
The training data consists of several LDC corpora and is described in detail in [18] (320M words, vocabulary). We used these data to provide a comparison to a previously trained recurrent neural network language model that took about 8 weeks to train on a single CPU. We trained a feedforward NNLM with the same number of 640 hidden units using the DistBelief parallel training [6], using a history of 8 previous words (thus, the NNLM has more parameters than the RNNLM, as the projection layer has size ).
训练数据由多个 LDC 语料库组成,详细描述见 [18](3.2 亿字, 词汇量)。我们使用这些数据与之前训练的递归神经网络语言模型进行了比较,后者在单 CPU 上的训练时间约为 8 周。我们使用 DistBelief 并行训练[6]训练了一个前馈 NNLM,它具有相同数量的 640 个隐藏单元,并使用了 8 个先前单词的历史记录(因此,NNLM 比 RNNLM 具有更多参数,因为投影层的大小为 )。
In Table 3, it can be seen that the word vectors from the RNN (as used in [20]) perform well mostly on the syntactic questions. The NNLM vectors perform significantly better than the RNN - this is not surprising, as the word vectors in the RNNLM are directly connected to a non-linear hidden layer. The CBOW architecture works better than the NNLM on the syntactic tasks, and about the same on the semantic one. Finally, the Skip-gram architecture works slightly worse on the syntactic task than the CBOW model (but still better than the NNLM), and much better on the semantic part of the test than all the other models.
从表 3 中可以看出,来自 RNN 的词向量(如 [20] 中所用)在大部分句法问题上表现良好。NNLM 向量的表现明显优于 RNN--这并不奇怪,因为 RNNLM 中的单词向量是直接连接到非线性隐藏层的。CBOW 架构在句法任务上的表现优于 NNLM,在语义任务上的表现大致相同。最后,Skip-gram 架构在句法任务上的表现略逊于 CBOW 模型(但仍优于 NNLM),而在测试的语义部分则远远优于所有其他模型。
Next, we evaluated our models trained using one CPU only and compared the results against publicly available word vectors. The comparison is given in Table 4 The CBOW model was trained on subset
接下来,我们对仅使用一个 CPU 训练的模型进行了评估,并将结果与公开的词向量进行了比较。比较结果见表 4。
Table 4: Comparison of publicly available word vectors on the Semantic-Syntactic Word Relationship test set, and word vectors from our models. Full vocabularies are used.
表 4:语义-句法单词关系测试集上的公开单词向量与我们的模型中的单词向量的比较。使用的是完整词汇表。
Accuracy [%] 精确度 [%]
Semantic Syntactic Total
Collobert-Weston NNLM 科尔罗伯特-韦斯顿 NNLM 50 9.3 12.3 11.0
Turian NNLM 图里安 NNLM 50 1.4 2.6 2.1
Turian NNLM 图里安 NNLM 200 1.4 2.2 1.8
Mnih NNLM NNLM Monk 50 1.8 9.1 5.8
Mnih NNLM NNLM Monk 100 3.3 13.2 8.8
Mikolov RNNLM 80 4.9 18.4 12.7
Mikolov RNNLM 640 8.6 36.5 24.6
Huang NNLM 黄 NNLM 50 13.3 11.6 12.3
Our NNLM 我们的无法律约束力文书 20 12.9 26.4 20.3
Our NNLM 我们的无法律约束力文书 50 27.9 55.8 43.2
Our NNLM 我们的无法律约束力文书 100 6B 34.2 50.8
CBOW 300 15.5 53.1 36.1
Skip-gram 300 55.9
Table 5: Comparison of models trained for three epochs on the same data and models trained for one epoch. Accuracy is reported on the full Semantic-Syntactic data set.
表 5:在相同数据上经过三个历时训练的模型与经过一个历时训练的模型的比较。准确率是在完整的语义-句法数据集上报告的。
Accuracy [%] 精确度 [%]
Training time 培训时间
Semantic Syntactic Total
3 epoch CBOW 3 个纪元 CBOW 300 15.5 53.1 36.1 1
3 epoch Skip-gram 3 个纪元跳转图 300 50.0 55.9 53.3 3
1 epoch CBOW 1 个纪元 CBOW 300 13.8