词向量空间中的高效估计方法

Efficient Estimation of Word Representations in Vector Space

杰夫·迪恩 Jeff Dean · Google · 2013-01-16 · arXiv:1301.3781 ↗ · 被引 34590

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

摘要 · Abstract

我们提出了两种新颖的模型架构,用于从非常大的数据集中计算词的连续向量表示。这些表示的质量通过词相似性任务进行衡量,并将结果与之前基于不同类型神经网络的最佳技术进行比较。我们观察到在计算成本大大降低的情况下,准确性有了显著提高,即从 16 亿词的数据集中学习高质量词向量只需不到一天的时间。此外,我们表明这些向量在用于测量句法和语义词相似性的测试集上提供了最先进的性能。

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.

核心贡献 · Key contributions

局限 · Limitations

论文章节 · Sections(共 20)

阅读逐段中英对照全文 →