Back to papers
    vector-spacesword-embeddingscosine-similarityrepresentation-learningnlp

    Efficient Estimation of Word Representations in Vector Space

    Jeffrey DeanKai ChenGreg CorradoTomas Mikolov
    📅 2013🏛 ICLR 2013 Workshop Track; arXiv preprint arXiv:1301.3781 — https://arxiv.org/abs/1301.3781
    Problem

    Before this work, representing words for machine learning meant either one-hot vectors, which carry no notion of similarity, or neural language models that were far too expensive to train on billions of words. The authors wanted dense, meaningful vector representations of words that could be learned from very large corpora at a realistic computational cost.

    Method

    The paper introduced two simple log-linear architectures, Continuous Bag-of-Words (CBOW) and Skip-gram, collectively known as word2vec. Both remove the expensive hidden layer of earlier neural language models: CBOW predicts a word from the average of its surrounding context vectors, while Skip-gram does the reverse and predicts context words from the target word.

    Finding

    The models learned high-quality word vectors from 1.6 billion words in under a day, orders of magnitude faster than earlier neural approaches. Strikingly, the resulting vector space encoded semantic and syntactic relationships as directions: vector arithmetic such as king − man + woman produced a vector closest to queen, showing that regularities in language were captured as consistent geometric offsets.

    Limitations

    Each word gets exactly one vector, so polysemous words such as 'bank' collapse distinct meanings into a single point. The models ignore word order beyond a small window, cannot handle words unseen during training, and inherit social biases present in the training corpus. Context-dependent embeddings from later transformer models address several of these weaknesses.

    Practical application

    Vector-space representations are now standard in search engines, recommendation systems, document clustering, and the retrieval step of AI assistants that look up relevant documents before answering. This paper is foundational rather than tied to one of the three target projects, but it is directly relevant to all of them: any agent that must match an on-screen label, a spoken instruction, or a task description to a stored capability does so by comparing vectors in an embedding space.

    📇 Summary flashcard — 13 analytical fields for this paper

    خلاصه

    The word2vec paper showed that simple, shallow models can learn dense word vectors from billions of words cheaply, and that the resulting vector space encodes meaning geometrically. It turned the abstract idea of a vector space into a practical engineering tool for language.

    نمای سریع

    Learning meaningful word vectors cheaply, so that similarity becomes geometry.

    یافته‌های کلیدی

    The models learned high-quality word vectors from 1.6 billion words in under a day, orders of magnitude faster than earlier neural approaches. Strikingly, the resulting vector space encoded semantic and syntactic relationships as directions: vector arithmetic such as king − man + woman produced a vector closest to queen, showing that regularities in language were captured as consistent geometric offsets.

    هدف

    To learn high-quality continuous vector representations of words from very large datasets at a fraction of the training cost of previous neural language models.

    روش

    The paper introduced two simple log-linear architectures, Continuous Bag-of-Words (CBOW) and Skip-gram, collectively known as word2vec. Both remove the expensive hidden layer of earlier neural language models: CBOW predicts a word from the average of its surrounding context vectors, while Skip-gram does the reverse and predicts context words from the target word.

    نتایج

    CBOW and Skip-gram trained on 1.6 billion words in under a day and set new accuracy records on word similarity and analogy tasks; semantic and syntactic relations appeared as consistent vector offsets.

    نتیجه‌گیری

    Simplified log-linear architectures make it feasible to train word vectors on corpora of unprecedented size, and the resulting representations capture linguistic regularities well enough to support vector arithmetic on meaning.

    مفاهیم کلیدی

    vector-spaces، word-embeddings، cosine-similarity، representation-learning، nlp

    مطالعه‌ی بیشتر

    https://arxiv.org/abs/1301.3781

    تحلیل

    This paper made embedding spaces mainstream. It reframed 'meaning' as position and direction in a vector space, an idea that now underlies search, recommendation, retrieval-augmented generation and multimodal models, and it is cited tens of thousands of times.

    محدودیت‌ها

    Each word gets exactly one vector, so polysemous words such as 'bank' collapse distinct meanings into a single point. The models ignore word order beyond a small window, cannot handle words unseen during training, and inherit social biases present in the training corpus. Context-dependent embeddings from later transformer models address several of these weaknesses.

    کارهای آینده

    The authors suggested scaling to larger corpora and higher dimensions, extending the approach beyond single words to phrases and sentences, and exploring the learned representations for machine translation and knowledge-base extension.

    کاربرد عملی

    Vector-space representations are now standard in search engines, recommendation systems, document clustering, and the retrieval step of AI assistants that look up relevant documents before answering. This paper is foundational rather than tied to one of the three target projects, but it is directly relevant to all of them: any agent that must match an on-screen label, a spoken instruction, or a task description to a stored capability does so by comparing vectors in an embedding space.

    References (this paper draws on) (0)

    No references recorded.

    Cited by (0) ▶

    No paper cites this one yet.

    Prerequisite learning path for this paper