Efficient Non-parametric Estimation of Multiple Embeddings per Word in Vector Space

By Arvind Neelakantan, Jeevan Shankar, Alexandre Passos, Andrew McCallum. 2014

474 citations recorded by the source corpus.

There is rising interest in vector-space word embeddings and their use in NLP, especially given recent methods for their fast estimation at very large scale. Nearly all this work, however, assumes a single vector per word type—ignoring polysemy and thus jeopardizing their usefulness for downstream tasks. We present an extension to the Skip-gram model that efficiently learns multiple embeddings per word type. It differs from recent related work by jointly performing word sense discrimination and embedding learning, by non-parametrically estimating the number of senses per word type, and by its efficiency and scalability. We present new state-of-the-art results in the word similarity in context task and demonstrate its scalability by training with one machine on a corpus of nearly 1 billion tokens in less than 6 hours.

Subfields: Artificial Intelligence, Natural Language Processing, Representation & Self-Supervised Learning

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Mohit Bansal
  2. Luke S. Zettlemoyer
  3. Graham Neubig
  4. Percy Liang
  5. Noah A. Smith
  6. Caiming Xiong
  7. Jianfeng Gao
  8. Hannaneh Hajishirzi

In Natural Language Processing

  1. Mohit Bansal
  2. Graham Neubig
  3. Luke S. Zettlemoyer
  4. Hannaneh Hajishirzi
  5. Caiming Xiong
  6. Noah A. Smith
  7. Percy Liang
  8. Samuel R. Bowman

In Representation & Self-Supervised Learning

  1. José Camacho-Collados
  2. Mohammad Taher Pilehvar
  3. Graham Neubig
  4. Yoav Goldberg
  5. Luke S. Zettlemoyer
  6. Yulia Tsvetkov
  7. Samuel R. Bowman
  8. Jimmy J. Lin

Citations in the corpus