Los puntos clave no están disponibles para este artículo en este momento.
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.
Building similarity graph...
Analyzing shared references across papers
Loading...
Mikolov et al. (Wed,) studied this question.
www.synapsesocial.com/papers/69de9d78499d77a496b0c1a0 — DOI: https://doi.org/10.48550/arxiv.1301.3781
Tomáš Mikolov
Kai Chen
Greg S. Corrado
Google (United States)
Beijing University of Posts and Telecommunications
Brno University of Technology
Building similarity graph...
Analyzing shared references across papers
Loading...