CONF Lebret_EACL_2014/IDIAP Word Embeddings through Hellinger PCA Lebret, Rémi Collobert, Ronan EXTERNAL https://publications.idiap.ch/attachments/papers/2014/Lebret_EACL_2014.pdf PUBLIC https://publications.idiap.ch/index.php/publications/showcite/Lebret_Idiap-RR-29-2013 Related documents 14th Conference of the European Chapter of the Association for Computational Linguistics 2014 Word embeddings resulting from neural language models have been shown to be a great asset for a large variety of NLP tasks. However, such architecture might be difficult and time-consuming to train. 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 some well-known embeddings on named entity recognition and movie review tasks and show that we can reach similar or even better performance. Although deep learning is not really necessary for generating good word embeddings, we show that it can provide an easy way to adapt embeddings to specific tasks. REPORT Lebret_Idiap-RR-29-2013/IDIAP Word Embeddings through Hellinger PCA Lebret, Rémi Collobert, Ronan EXTERNAL https://publications.idiap.ch/attachments/reports/2013/Lebret_Idiap-RR-29-2013.pdf PUBLIC Idiap-RR-29-2013 2013 Idiap August 2013 Word embeddings resulting from neural lan- guage 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.