Unsupervised Learning of Sentence Embeddings using Compositional n-Gram Features
2017-03-07NAACL 2018Code Available0· sign in to hype
Matteo Pagliardini, Prakhar Gupta, Martin Jaggi
Code Available — Be the first to reproduce this paper.
ReproduceCode
- github.com/epfml/sent2vecOfficialIn papernone★ 0
- github.com/celento/sent2vecnone★ 0
- github.com/chalothon/Sentence2Vecnone★ 0
- github.com/dantetam/twitterServerAuthnone★ 0
- github.com/SimengSun/CIS530-projectpytorch★ 0
Abstract
The recent tremendous success of unsupervised word embeddings in a multitude of applications raises the obvious question if similar methods could be derived to improve embeddings (i.e. semantic representations) of word sequences as well. We present a simple but efficient unsupervised objective to train distributed representations of sentences. Our method outperforms the state-of-the-art unsupervised models on most benchmark tasks, highlighting the robustness of the produced general-purpose sentence embeddings.