Work

Word Embeddings through Hellinger PCA

Year: 2014
Type: conference-paper
Abstract: 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
Language: English
Open Access status: hybrid
OpenAlex ID: W1499253590
FWCI: 16.31
Cites: 35
Cited by: 267
Related to: 10