29.06.2014 Views

Sentiment Analysis based on Appraisal Theory and Functional Local ...

Sentiment Analysis based on Appraisal Theory and Functional Local ...

Sentiment Analysis based on Appraisal Theory and Functional Local ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

31<br />

for studying subjectivity. The MPQA corpus is publicly available <strong>and</strong> it advantages<br />

<strong>and</strong> flaws are discussed in Secti<strong>on</strong> 5.1. They have not described an integrated system<br />

for sentiment extracti<strong>on</strong>, <strong>and</strong> many of the experiments that they have performed have<br />

involved automatically boiling down the ground truth annotati<strong>on</strong>s into something<br />

more tractable for a computer to match. They’ve generally avoided trying to extract<br />

spans of text, preferring to take the existing ground truth annotati<strong>on</strong>s <strong>and</strong> classify<br />

them.<br />

2.6 Opini<strong>on</strong> lexic<strong>on</strong> c<strong>on</strong>structi<strong>on</strong><br />

Lexic<strong>on</strong>-<str<strong>on</strong>g>based</str<strong>on</strong>g> approaches to sentiment analysis often require large h<strong>and</strong>-built<br />

lexic<strong>on</strong>s to identify opini<strong>on</strong> words. These lexic<strong>on</strong>s can be time-c<strong>on</strong>suming to c<strong>on</strong>struct,<br />

so there has been a lot of research into techniques for automatically building<br />

lexic<strong>on</strong>s of positive <strong>and</strong> negative words.<br />

Hatzivassiloglou <strong>and</strong> McKeown [66] developed a graph-<str<strong>on</strong>g>based</str<strong>on</strong>g> technique for<br />

learning lexic<strong>on</strong>s by reading a corpus. In their technique, they find pairs of adjectives<br />

c<strong>on</strong>joined by c<strong>on</strong>juncti<strong>on</strong>s (e.g. “fair <strong>and</strong> legitimate” or “fair but brutal”), as well as<br />

morphologically related adjectives (e.g. “thoughtful” <strong>and</strong> “thoughtless”), <strong>and</strong> create<br />

a graph where the vertices represent words, <strong>and</strong> the edges represent pairs (marked<br />

as same-orientati<strong>on</strong> or opposite-orientati<strong>on</strong> links).<br />

They apply a graph clustering<br />

algorithm to cluster the adjectives found into two clusters of positive <strong>and</strong> negative<br />

terms. This technique achieved 82% accuracy at classifying the words found.<br />

Another algorithm for c<strong>on</strong>structing lexic<strong>on</strong>s is that of Turney <strong>and</strong> Littman<br />

[171]. They determine whether words are positive or negative <strong>and</strong> how str<strong>on</strong>g the<br />

evaluati<strong>on</strong> is by computing the words’ pointwise mutual informati<strong>on</strong> (PMI) for their<br />

co-occurrence with small set of positive seed words <strong>and</strong> a small set of negative seed<br />

words. Unlike their earlier work [170], which I menti<strong>on</strong>ed in Secti<strong>on</strong> 2.3, the seed

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!