Decoding sentiment from distributed representations of sentences

3Citations
Citations of this article
88Readers
Mendeley users who have this article in their library.

Abstract

Distributed representations of sentences have been developed recently to represent their meaning as real-valued vectors. However, it is not clear how much information such representations retain about the polarity of sentences. To study this question, we decode sentiment from unsupervised sentence representations learned with different architectures (sensitive to the order of words, the order of sentences, or none) in 9 typologically diverse languages. Sentiment results from the (recursive) composition of lexical items and grammatical strategies such as negation and concession. The results are manifold: we show that there is no 'one-size-fits-all' representation architecture outperforming the others across the board. Rather, the top-ranking architectures depend on the language and data at hand. Moreover, we find that in several cases the additive composition model based on skip-gram word vectors may surpass supervised state-of-art architectures such as bidirectional LSTMs. Finally, we provide a possible explanation of the observed variation based on the type of negative constructions in each language.

Cite

CITATION STYLE

APA

Ponti, E. M., Vulić, I., & Korhonen, A. (2017). Decoding sentiment from distributed representations of sentences. In *SEM 2017 - 6th Joint Conference on Lexical and Computational Semantics, Proceedings (pp. 22–32). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/s17-1003

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free