pith. sign in

arxiv: 1805.05388 · v1 · pith:TU4D2WSXnew · submitted 2018-05-14 · 💻 cs.CL · cs.AI

A La Carte Embedding: Cheap but Effective Induction of Semantic Feature Vectors

classification 💻 cs.CL cs.AI
keywords carteembeddingsfeatureembeddinglearninglinearmethodrare
0
0 comments X
read the original abstract

Motivations like domain adaptation, transfer learning, and feature learning have fueled interest in inducing embeddings for rare or unseen words, n-grams, synsets, and other textual features. This paper introduces a la carte embedding, a simple and general alternative to the usual word2vec-based approaches for building such representations that is based upon recent theoretical results for GloVe-like embeddings. Our method relies mainly on a linear transformation that is efficiently learnable using pretrained word vectors and linear regression. This transform is applicable on the fly in the future when a new text feature or rare word is encountered, even if only a single usage example is available. We introduce a new dataset showing how the a la carte method requires fewer examples of words in context to learn high-quality embeddings and we obtain state-of-the-art results on a nonce task and some unsupervised document classification tasks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.