SOTAVerified

Learning to Compute Word Embeddings On the Fly

2017-06-01ICLR 2018Unverified0· sign in to hype

Dzmitry Bahdanau, Tom Bosc, Stanisław Jastrzębski, Edward Grefenstette, Pascal Vincent, Yoshua Bengio

Unverified — Be the first to reproduce this paper.

Reproduce

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.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
SQuAD1.1OTF dict+spelling (single)EM64.08Unverified
SQuAD1.1OTF spelling (single)EM62.9Unverified
SQuAD1.1OTF spelling+lemma (single)EM62.6Unverified
SQuAD1.1 devOTF dict+spelling (single)EM63.06Unverified

Reproductions