Pith. sign in

Learning to Compute Word Embeddings On the Fly

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Words in natural language follow a Zipfian distribution whereby some words are frequent but most are rare. Learning representations for words in the "long tail" of this distribution requires enormous amounts of data. Representations of rare words trained directly on end tasks are usually poor, requiring us to pre-train embeddings on external data, or treat all rare words as out-of-vocabulary words with a unique representation. We provide a method for predicting embeddings of rare words on the fly from small amounts of auxiliary data with a network trained end-to-end for the downstream task. We show that this improves results against baselines where embeddings are trained on the end task for reading comprehension, recognizing textual entailment and language modeling.

fields

cs.CL 1

years

2019 1

verdicts

CONDITIONAL 1

representative citing papers

Latent Relation Language Models

cs.CL · 2019-08-21 · conditional · novelty 6.0

Latent Relation Language Models marginalize over hidden relation-to-span assignments to condition neural language models on knowledge graphs, improving perplexity and providing posterior entity-link scores.

citing papers explorer

Showing 1 of 1 citing paper.

  • Latent Relation Language Models cs.CL · 2019-08-21 · conditional · none · ref 7 · internal anchor

    Latent Relation Language Models marginalize over hidden relation-to-span assignments to condition neural language models on knowledge graphs, improving perplexity and providing posterior entity-link scores.