词汇与短语的分布式表示及其组合性

Distributed Representations of Words and Phrases and their Compositionality

托马斯·米科洛夫 Tomas Mikolov · Google · 2013-10-16 · arXiv:1310.4546 ↗ · 被引 35367

打开互动全文版(逐段中英对照 + 图/公式 + 论文问答)→

摘要 · Abstract

最近引入的连续 Skip-gram 模型是一种高效的学习高质量分布式向量表示的方法,这些向量能够捕捉大量精确的句法和语义词汇关系。在本文中,我们提出了几种改进,既提高了向量的质量,也加快了训练速度。通过对高频词进行子采样,我们获得了显著的加速,并学习了更规则的词表示。我们还描述了一种简单的替代层次 softmax 的方法,称为负采样。词表示的一个固有局限是它们对词序不敏感,并且无法表示习语短语。例如,“Canada”和“Air”的含义不能轻易组合得到“Air Canada”。受此例启发,我们提出了一种在文本中查找短语的简单方法,并表明学习数百万短语的良好向量表示是可行的。

The recently introduced continuous Skip-gram model is an efficient method for learning high-quality distributed vector representations that capture a large number of precise syntactic and semantic word relationships. In this paper we present several extensions that improve both the quality of the vectors and the training speed. By subsampling of the frequent words we obtain significant speedup and also learn more regular word representations. We also describe a simple alternative to the hierarchical softmax called negative sampling. An inherent limitation of word representations is their indifference to word order and their inability to represent idiomatic phrases. For example, the meanings of "Canada" and "Air" cannot be easily combined to obtain "Air Canada". Motivated by this example, we present a simple method for finding phrases in text, and show that learning good vector representations for millions of phrases is possible.

核心贡献 · Key contributions

局限 · Limitations

论文章节 · Sections(共 12)

阅读逐段中英对照全文 →