Abstract

This paper presents an application of PageRank, a random-walk model originally devised for ranking Web search results, to ranking WordNet synsets in terms of how strongly they possess a given semantic property. The semantic properties we use for exemplifying the approach are positivity and negativity, two properties of central importance in sentiment analysis. The idea derives from the observation that WordNet may be seen as a graph in which synsets are connected through the binary relation “a term belonging to synset sk occurs in the gloss of synset si”, and on the hypothesis that this relation may be viewed as a transmitter of such semantic properties. The data for this relation can be obtained from eXtended WordNet, a publicly available sensedisambiguated version of WordNet. We argue that this relation is structurally akin to the relation between hyperlinked Web pages, and thus lends itself to PageRank analysis. We report experimental results supporting our intuitions. 1

Keywords

WordNetComputer sciencePageRankRelation (database)Information retrievalRanking (information retrieval)GraphNatural language processingArtificial intelligenceTheoretical computer scienceData mining

Affiliated Institutions

Related Publications

TriRank

Most existing collaborative filtering techniques have focused on modeling the binary relation of users to items by extracting from user ratings. Aside from users' ratings, their...

2015 452 citations

Publication Info

Year
2007
Type
article
Pages
424-431
Citations
148
Access
Closed

External Links

Citation Metrics

148
OpenAlex

Cite This

Andrea Esuli, Fabrizio Sebastiani (2007). PageRanking WordNet Synsets: An Application to Opinion Mining. , 424-431.