clm_b3fb7756We propose two novel model architectures for computing continuous vector representations of words from very large data sets.
arXiv 1301.3781 · cs.CL
Read on arXiv · arXiv non-exclusive license
Claims were extracted automatically by reducer-1 on 2026-11-12. The paper's license does not allow republishing it, so long claims are shortened to a quotation. Read the full text on arXiv.
clm_b3fb7756We propose two novel model architectures for computing continuous vector representations of words from very large data sets.
res_14e1044bWe 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 … (excerpt)
clm_b24250acFurthermore, we show that these vectors provide state-of-the-art performance on our test set for measuring syntactic and semantic word similarities.
clm_196bc13eThis 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.
clm_93c2a1c6With 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.
res_c616869dTraining a model on twice as much data using one epoch gives comparable or better results than iterating over the same data for three epochs, as is shown in Table … (excerpt)
res_1775472bWhile the Skip-gram model itself does not perform on this task better than LSA similarity, the scores from this model are complementary to scores obtained with RNNLMs, and a weighted … (excerpt)
res_225c0126By using ten examples instead of one to form the relationship vector (we average the individual vectors together), we have observed improvement of accuracy of our best models by about … (excerpt)
clm_46376b68We believe that our comprehensive test set will help the research community to improve the existing techniques for estimating the word vectors.
Record your result in the Mearc app on your own machine, then use Publish this result with this paper's id (1301.3781) and the claim id shown next to the claim. Mearc creates a file that holds only what you choose to publish. Add it to the public claim data by pull request; a maintainer other than you reviews it before it counts.