This is the authors' abstract. We don't add key points for this paper.
Word embeddings resulting from neural language models have been shown to be successful for a large variety of NLP tasks. However, such architecture might be difficult to train and time-consuming. Instead, we propose to drastically simplify the word embeddings computation through a Hellinger PCA of the word co-occurence matrix. We compare those new word embeddings with the Collobert and Weston (2008) embeddings on several NLP tasks and show that we can reach similar or even better performance. 1
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Lebret et al. (2014) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: