Name
Abstract | ||
|---|---|---|
Polarity classification of words is important for applications such as Opinion Mining and Sentiment Analysis. A number of sentiment word/sense dictionaries have been manually or (semi)automatically constructed. The dictionaries have substantial inaccuracies. Besides obvious instances, where the same word appears with different polarities in different dictionaries, the dictionaries exhibit complex cases, which cannot be detected by mere manual inspection. We introduce the concept of polarity consistency of words/senses in sentiment dictionaries in this paper. We show that the consistency problem is NP-complete. We reduce the polarity consistency problem to the satisfiability problem and utilize a fast SAT solver to detect inconsistencies in a sentiment dictionary. We perform experiments on four sentiment dictionaries and WordNet. |
Year | Venue | Keywords |
|---|---|---|
2012 | ACL | satisfiability problem,dictionaries exhibit,polarity classification,consistency problem,polarity consistency checking,different dictionary,polarity consistency,polarity consistency problem,different polarity,sentiment word,sentiment dictionary,wordnet,opinion mining,polarity,np complete,sat solver |
DocType | Volume | Citations |
Conference | P12-1 | 7 |
PageRank | References | Authors |
0.42 | 26 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eduard Constantin Dragut | 1 | 201 | 21.55 |
| Hong Wang | 2 | 31 | 4.92 |
| Clement T. Yu | 3 | 3171 | 1419.96 |
| A. Prasad Sistla | 4 | 5140 | 827.34 |
| Weiyi Meng | 5 | 2722 | 514.77 |