<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Dictionary-Based Sentiment Analysis applied to specific domain using a Web Mining approach</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Laura Cruz Jose´ Ochoa</string-name>
          <email>jeochoa@ucsp.edu.pe</email>
          <email>lcruzq@unsa.edu.pe</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mathieu Roche TETIS Cirad</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Cnrs AgroParisTech</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Irstea</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>France mathieu.roche@cirad.fr</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Pascal Poncelet LIRMM, Cnrs Universite ́ Montpellier</institution>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Universidad Nacional de San Agust ́ın, Per u ́ Universidad Cato ́ lica San Pablo</institution>
          ,
          <addr-line>Per u ́</addr-line>
        </aff>
      </contrib-group>
      <fpage>80</fpage>
      <lpage>88</lpage>
      <abstract>
        <p>In recent years, the Web and social media are growing exponentially. We are provided with documents which have opinions expressed about several topics. This constitute a rich source for Natural Language Processing tasks, in particular, Sentiment Analysis. In this work, we aim at constructing a sentiment dictionary based on words obtained from web pages related to a specific domain. To do so, we correlate candidate opinion words, seed words and domain using AcroDefMI3 and TrueSkill methods. This dictionarybased approach is compared to the SentiWordNet lexical resource. Experimental results show suitability of our approach for multiple domains and infrequent opinion words.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        In recent years, the Web and social media
are growing exponentially, this constitute a rich
source for Sentiment Analysis tasks. Companies
are increasingly using the content in these media
to make better decisions
        <xref ref-type="bibr" rid="ref5">(Marrese-Taylor et al.,
2013)</xref>
        . Social networking sites are being used for
expressing thoughts and opinions about products
by users
        <xref ref-type="bibr" rid="ref1">(Amine et al., 2014)</xref>
        . In this context,
Sentiment Analysis involves the process of
identifying the polarity of opinionated texts. These
opinionated texts are highly unstructured in nature
and thus involves the application of Natural
Language Processing techniques
        <xref ref-type="bibr" rid="ref10">(Varghese and
Jayasree, 2013)</xref>
        . As a rule, documents have
opinionated texts about several topics. Words used to
express opinions about some topics can be
specific and highly correlated to a particular domain
        <xref ref-type="bibr" rid="ref2">(Duthil et al., 2011)</xref>
        . Likewise, while we may
find that The chair is black, such an adjective
would be unusual in a movies domain. To tackle
these issues both machine learning and
dictionarybased approaches have been proposed in the
literature. A machine learning method that applies
text-categorization techniques has been proposed
by
        <xref ref-type="bibr" rid="ref6">(Pang and Lee, 2004)</xref>
        . In such method, graphs,
minimum cut formulation, context and domain
have been considered to extract subjective portions
of documents.
      </p>
      <p>
        On the other hand, dictionary based approaches
are unsupervised in nature. In general, these
methods assume that positive (negative) adjectives
appear more frequently near a positive (negative)
seed word
        <xref ref-type="bibr" rid="ref3">(Harb et al., 2008)</xref>
        . An unsupervised
learning algorithm for classifying reviews (thumbs
up or thumbs down) has been adopted by
        <xref ref-type="bibr" rid="ref11 ref4 ref8 ref9">(Turney,
2002; Wang and Araki, 2007)</xref>
        . A review
classification is given by the average semantic orientation of
their phrases which contain either adjectives or
adverbs. A phrase semantic orientation is computed
using the mutual information between the given
phrase and the word excellent minus the mutual
information between the given phrase and the word
poor. Therefore, a phrase has a positive
semantic orientation when it has good associations and a
negative semantic orientation when it has bad
associations, as shown by equation 1.
      </p>
      <p>SO(phrase) =
log
hits(phrase NEAR excellent) · hits(poor)
hits(phrase NEAR poor) · hits(excellent)</p>
      <p>(1)
In this work, words used to express opinions
are learned. To do so, positive and negative
seed words (e.g. good, excellent, bad) are used
to extract adjectives near seed words. To
correlate candidate words, seed words and domain,
AcroDefMI3 and TrueSkill methods are
proposed. Experimental results show suitability of
our proposal. Several domains (e.g movies,
agricultural) were used to compare our approach to
SentiWordNet.</p>
      <p>The paper is organized as follows. The
Methodology is presented in Section 2. Experimental
setup is described in Section 3. In Section 4, we
present and discuss the obtained results.
Concluding remarks are presented in Section 5.
2</p>
      <p>Methodology
The proposed process is depicted in Figure 1. The
steps are summarized in the following steps:
1. A corpora for a specific domain,
containing positive and negative opinions is acquired
from the Web.
2. Each document is pre-processed to get text,</p>
      <p>remove HTML tags and scripts.
3. Opinion adjectives and nouns are extracted
using POS-Tagging and the Window Size
algorithm.
4. The correlation score of a given word with
a seed word and domain is computed
using AcroDefMI3 and TrueSkill. lexicons
are inferred based on these correlation scores
that identify semantic orientation for each
extracted word. High correlation score words
are selected.</p>
      <p>
        We perform experiments over two domains:
Agricultural domain (opinions extracted from Twitter)
and a Movie domain1 (data set introduced in
        <xref ref-type="bibr" rid="ref7">(Pang
et al., 2002)</xref>
        ). Further details are given in the next
sections.
2.1
      </p>
      <p>Corpus Acquisition
Some words can express neutral, positive or
negative opinion in specific domain such as:
Domain,
Seed Word
Pre-processing</p>
      <p>Text</p>
      <p>Word Extraction
Nouns,
Adjectives</p>
      <p>Word Selection</p>
      <p>Score</p>
      <p>POS-Tag
Window Size(N)</p>
      <p>MI3</p>
      <p>TrueSkill</p>
      <p>SentiWordNet
Dictionary+</p>
      <p>Dictionary</p>
      <p>
        These examples show that a given word, for
instance scientific, can be highly correlated to a
particular domain
        <xref ref-type="bibr" rid="ref3">(Harb et al., 2008)</xref>
        . The first
example is considered a neutral opinion. Conversely,
the second example is considered a positive
opinion. The third example is also a positive opinion
because of the word good. Thus, some words are
useful to learn opinion words related to a given
domain. We can define a seed word, such as good,
that can help us to find others opinion words.
      </p>
      <p>Lexicons are built using selected words from
web page corpus. Web pages are retrieved using
Bing search engine. Queries used to retrieve this
web pages combine seed words and domain
keywords. We have positive and negative seed words,
P = {good, nice, excellent, positive, fortunate,
correct, superior} , Q = {bad, nasty, poor, negative,
unfortunate, wrong, inferior}, respectively.</p>
      <p>A positive (negative) seed word ensure a
positive (negative) web page about a query domain,
due to all opposite seed words are excluded from
that query. For example, the following query can
be used for retrieving positive pages: query+ =
+opinion + review + gmo + good bad nasty
poor negative unfortunate wrong inferior
Neutral ! I attend scientific conferences. Thus, we have positive and negative web pages
denoted by corpus+, corpus respectively. Each
Positive ! The list shows the scientific discoveries. corpus is related to a seed word and a given
doPositive ! He made a good scientific discovery. main. In the next section we will extract words
1http://www.cs.cornell.edu/People/pabo/movie-review- near seed words for each web page corpus using
data/ POS-Tagging and the Window Size algorithm.
2.2</p>
      <p>
        Word extraction
Opinion words near a seed word can have the same
polarity
        <xref ref-type="bibr" rid="ref11 ref3 ref4 ref8">(Roche and Prince, 2007; Harb et al.,
2008)</xref>
        . The same approach has been used to
extract candidate opinion words. To identify opinion
words (nouns and adjectives) in web page corpus,
TreeTagger2 has been used. Previously, HTML
tags, scripts, blank spaces and stop words3 were
removed from web pages. In order to get near
words for each seed word a Window Size
algorithm has been used (Algorithm 1). The Window
Size Algorithm looks for opinion words in both
left and right sides of a seed word given a K
distance. This distance is the number of left (right)
opinion words of a seed word given a web page
corpus. This process is shown in Algorithm 1.
      </p>
      <p>Algorithm 1 The Window Size Algorithm
Require: seed words, corpus, K
Ensure: opinion words
1: words TreeTagger to each corpus
2: words filter adjectives and nouns
3: for index= 0 until total of words do
4: if words{index} in seed word then
5: for k = 1 until K do
6: left word words[index - k]
7: right word words[index + k]
8: opinion words</p>
      <p>left word and right word
In Figure 2 adjectives (JJ) and nouns (NNS) are
retrieved using TreeTagger. The good word is a
positive seed word and its nearest adjective is safe
given k = 1 distance. Likewise, scientific and
studies words are retrieved with distance k = 2.</p>
      <p>
        In addition, safe is a positive opinion word
candidate because it occurred near a positive seed word
(good). In this sense, we can have a set of
opinion words (positive and negative), that can be
candidates to include into the resulting lexicon. To
get the correlation score of each extracted word
given a seed word, two measures are employed:
AcroDefMI3 and TrueSkill which are described
in the next section.
as gmo, can be used to express a domain
opinion. Hence, we need to measure the correlation
of a given extracted word with domain and seed
word to build a lexicon. In order to get
candidate opinion words we propose to use the
statistical measure AcroDefMI3 (equation 2)
        <xref ref-type="bibr" rid="ref11 ref4 ref8">(Roche
and Prince, 2007)</xref>
        . Moreover, we also propose a
novel probabilistic measure based on the TrueSkill
Algorithm
        <xref ref-type="bibr" rid="ref4">(Herbrich et al., 2007)</xref>
        (Algorithm 3).
      </p>
      <p>The AcroDefMI3 measure takes each word
extracted using the Window Size algorithm and
computes the following equation 2, which is based on
web mining.</p>
      <p>The total web page results, based on queries
that combine candidate words, seed words and
domain keywords, are used in the AcroDefMI3
measure to get the correlation score for each
extracted word.</p>
      <p>AcroDefMI3 =
0 (nb(sw word AND domain)+ 1</p>
      <p>nb(word sw AND domain))3 C
log BB@ nb(sw AND domain) CA
· nb(word AND domain)</p>
      <p>(2)
where sw is a seed word, nb(x) function is the
number of total result pages, x is the query used
to retrieve pages in the search engine, and word
is the word extracted using the Window Size
algorithm. This process is detailed in Algorithm 2.</p>
      <p>Algorithm 2 Word selection algorithm using
AcroDefMI3
Require: corpus, seed words = P, keywords of</p>
      <p>domain
Ensure: correlation score values for each word
1: for each corpus do
2: words+ = window size(corpus+, P )
3: for word in words+ do
4: given each seed word and keywords of</p>
      <p>domain compute correlation score:
5: score max(AcroDefMI3)
2.3
As seen in our previous example (Figure 2), the
scientific word was retrieved using window size
distance = 2. However, specific words, such
Scientific studies have frequently found that GMO’s are safe to eat and even good.</p>
      <p>JJ NNS VHP RB VVN IN NNS VBP JJ TO VV CC RB JJ
window size = 1
window size = 2
words. The process is detailed in Figure 3, where</p>
      <p>S = {s1,1, s1,2, , s1,n} and S = {s2,1, s2,2, , s2,n},
s are learning values for each word in positive and
negative web page respectively. p is the learning
performance for each word, t is the sum of total
performance for each word in corpus.</p>
      <p>As T rueSkill learns s according its match
outcome, we set a high punctuation for corpus+, and
less punctuation for corpus . Therefore, we have
d = t1 t2. Due to difference (d) is important, we
set t1 = 1 to a positive corpus and t2 = 2 to a
negative corpus, where 1 denotes first. This process is
detailed in Algorithm 3.</p>
      <p>The following example shows how TrueSkill
measures two collected web pages:
corpus+= By the way a New York Times
excellent job · · · bioengineered food · · · .
corpus = Roundup Ready cotton · · ·
solution · · · at any economic advantage.</p>
      <p>· · ·
wrong</p>
    </sec>
    <sec id="sec-2">
      <title>Algorithm 3 Word selection algorithm using</title>
    </sec>
    <sec id="sec-3">
      <title>TrueSkill</title>
      <p>Require: corpus, seed words(P, Q)
Ensure: correlation score values for each word
1: k = 10 number of match for each corpus.
2: for each corpus do
3: words+ = window size(corpus+, P )</p>
    </sec>
    <sec id="sec-4">
      <title>4: for k random corpus do</title>
      <p>5: words = window size(corpus , Q)</p>
    </sec>
    <sec id="sec-5">
      <title>6: given each word compute correlation</title>
      <p>score:
7:</p>
      <p>score</p>
      <p>T rueSkill(words+, words , t = [1, 2])</p>
    </sec>
    <sec id="sec-6">
      <title>Team</title>
      <p>word+
word</p>
    </sec>
    <sec id="sec-7">
      <title>Words bioengineered economic</title>
      <p>Si
22, 738
0, 001</p>
      <p>Si+1</p>
      <p>Where: Si denotes current correlation score
for each word, and Si+1, the updated value
after matching pages (positive against negative
page), bioengineered is a word near excellent,
a seed word 2 P , and economic is near wrong,
seed word 2 Q when the Window Size algorithm
has distance k = 1. Thus, when the same
corpus+ has a match with other corpus :
corpus = Various studies · · · poor
agricultural income · · · .</p>
    </sec>
    <sec id="sec-8">
      <title>Team</title>
      <p>word+
word</p>
    </sec>
    <sec id="sec-9">
      <title>Words bioengineered agricultural</title>
      <p>Si
22, 738
0, 108</p>
      <p>Si+1</p>
      <p>It is worth noting that agricultural becomes a
more negative word than economic because its
value decreases more after the match using the
same positive word: bioengineered. On one hand,
if a word is often found in a corpus its value
tends to decrease. On the other hand, if it is in
a corpus+ its value will increase. If the word is
found in both corpus it tends to be constant. In the
next section, experiments results are showed.
3</p>
      <p>Experiments
In order to validate our approach experiments over
two data sets were conducted. The polarity of each
opinion from domains (Agricultural tweets and
Movie reviews) is predicted using the inferred
lexicons, AcroDefMI3 and TrueSkill measures.
Precision, recall and f-score were measured in order
to compare to the SentiWordNet approach. Data
sets used are described in the next section.
3.1</p>
      <sec id="sec-9-1">
        <title>Datasets</title>
        <p>
          The domains keywords used in queries were:
Agriculture domain = {gmo, agricultural
biotechnology, biotechnology for agriculture}, and
Movie domain = {cinema, film, movie}. In order
to test the agricultural domain, tweets using these
keywords were collected and manually classified.
There were 50 positive and 61 negative tweets.
The Movie domain 4 is based on
          <xref ref-type="bibr" rid="ref6">(Pang and Lee,
2004)</xref>
          . The number of positive and negative is
respectively 1000 and 1000.
        </p>
        <p>A simple classification procedure was used. In
order to do so, the number of positive and negative
words in each tweet or review is computed using
the inferred lexicons. If the difference is greater
than zero then it is classified as positive, otherwise
is negative. The following kind of lexicons were
used to sentiment classification:
• M I3: seed words + W S with AcroDefMI3.
• T S: seed words + W S with T rueSkill.
• SW N : SentiWordNet.
where W S denotes words extracted with window
size. Finally, the number of web pages retrieved
during the corpus acquisition for each seed word
was k = 20.</p>
        <p>In the next, we show word distributions for each
type of lexicon.
3.2</p>
      </sec>
      <sec id="sec-9-2">
        <title>Seed words</title>
        <p>superior</p>
        <p>good
positive
fortunate
excellent
correct
nice
poor
negative
wrong</p>
        <p>bad
unfortunate
nasty
inferior
Using web pages number k = 20, a high number
of low frequency adjectives are retrieved as shown
in Figure 5a. To get a word near a seed word with
window size= 1, the maximum distance allowed
is 10 words per window size.
SentiWordNet5 is a lexical resource for opinion
mining. It assigns to each synset of WordNet three
sentiment scores, positive, negative and neutral.
We compute differences between positive and
negative scores. If the result is greater than zero then
the polarity of the word is positive, otherwise
negative. SentiWordNet assigns a different score for
each word according its context. As context is
not considered, higher positive and negative word
scores are obtained. Finally, SentiWordNet
comprises 21479 adjectives and 117798 nouns.
top 10 new words ordered by their correlation
score value. In order to validate the algorithms we
calculate recall, precision and f-score. Figures 7,
6 show the recall, precision and fscore using each
word type(noun, adjectives), and the results using
MI3, SentiWordNet and TrueSkill.</p>
        <p>Discussion of the results
When the inferred lexicon for the Movie domain
is considered, TrueSkill performs better (Recall,
Precision and F-Score) than SentiWordNet and
AcroDefMI3 for positive reviews using
adjectives and nouns. When negative reviews are
con</p>
        <p>Domain
Agricultural
chocolaty
glyphosate
phosphonic
carfentrazone
sporogene</p>
        <p>kalu
protato
adeed
phthalates
genotoxicity</p>
        <p>Movie
configurable</p>
        <p>updated
readymade</p>
        <p>nature
directorial
spendidly
cartoonish</p>
        <p>mic
showreel
coverup
AcroDefMI3 and TrueSkill methods, which are
not in SentiW ordN et</p>
        <sec id="sec-9-2-1">
          <title>Word</title>
        </sec>
        <sec id="sec-9-2-2">
          <title>Adjective Noun</title>
        </sec>
        <sec id="sec-9-2-3">
          <title>Adjective</title>
          <p>Noun</p>
          <p>Positive</p>
          <p>Negative
Agricultural</p>
          <p>Movie
SentiWordNet performs better than AcroDefM I3
and TrueSkill. This is due to the agricultural
domain was collected from Twitter. Tweets are short
texts that usually have more seed words and
common words as shown in Table 1. The agricultural
domain has frequent seed words.
5</p>
          <p>Conclusion
Most of the dictionary-based algorithms for
sentiment analysis consider word frequency in
documents. However, this research has shown that
collected corpus words with low frequencies can
be useful to set polarities. Thus, We propose a
dictionary-based algorithm for sentiment analysis
that uses AcroDefM I3 and TrueSkill methods so
as to compute correlation word scores that allow
us to differentiate between positive and negative
polarities. This is particularly useful for low
frequency words obtained from corpus. In addition,
by using the Window Size Algorithm, it is
possible to obtain new adjectives entries in both
agricultural and movie domains when compared to
SentiWordNet.</p>
          <p>Acknowledgments
This work has been supported and financed by
FONDECYT.</p>
        </sec>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>Abdelmalek</given-names>
            <surname>Amine</surname>
          </string-name>
          , Reda Mohamed Hamou, and
          <string-name>
            <given-names>Michel</given-names>
            <surname>Simonet</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Detecting opinions in tweets</article-title>
          .
          <source>volume abs/1402</source>
          .5123.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>Benjamin</given-names>
            <surname>Duthil</surname>
          </string-name>
          , Franc¸ois Trousset, Mathieu Roche, Ge´rard Dray, Michel Plantie´,
          <source>Jacky Montmain, and Pascal Poncelet</source>
          ,
          <year>2011</year>
          .
          <source>Towards an Automatic Characterization of Criteria</source>
          , pages
          <fpage>457</fpage>
          -
          <lpage>465</lpage>
          . Springer Berlin Heidelberg, Berlin, Heidelberg.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <given-names>Ali</given-names>
            <surname>Harb</surname>
          </string-name>
          , Michel Plantie, Gerard Dray, Mathieu Roche, Francois Trousset, and
          <string-name>
            <given-names>Pascal</given-names>
            <surname>Poncelet</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>Web opinion mining: How to extract opinions from blogs</article-title>
          ?
          <source>In Proceedings of the 5th International Conference on Soft Computing As Transdisciplinary Science and Technology, CSTST 08</source>
          , pages
          <fpage>211</fpage>
          -
          <lpage>217</lpage>
          , New York, NY, USA. ACM.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <given-names>Ralf</given-names>
            <surname>Herbrich</surname>
          </string-name>
          , Tom Minka, and
          <string-name>
            <given-names>Thore</given-names>
            <surname>Graepel</surname>
          </string-name>
          .
          <year>2007</year>
          .
          <article-title>Trueskill(tm): A bayesian skill rating system</article-title>
          .
          <source>In Advances in Neural Information Processing Systems</source>
          <volume>20</volume>
          , pages
          <fpage>569</fpage>
          -
          <lpage>576</lpage>
          . MIT Press, January.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>Edison</given-names>
            <surname>Marrese-Taylor</surname>
          </string-name>
          , Juan D. Velsquez, Felipe Bravo-Marquez, and
          <string-name>
            <given-names>Yutaka</given-names>
            <surname>Matsuo</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Identifying customer preferences about tourism products using an aspect-based opinion mining approach</article-title>
          .
          <source>Procedia Computer Science</source>
          ,
          <volume>22</volume>
          (
          <issue>0</issue>
          ):
          <fpage>182</fpage>
          -
          <lpage>191</lpage>
          . 17th International Conference in
          <source>Knowledge Based and Intelligent Information and Engineering</source>
          Systems - {
          <fpage>KES2013</fpage>
          }.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <given-names>Bo</given-names>
            <surname>Pang</surname>
          </string-name>
          and
          <string-name>
            <given-names>Lillian</given-names>
            <surname>Lee</surname>
          </string-name>
          .
          <year>2004</year>
          .
          <article-title>A sentimental education: Sentiment analysis using subjectivity summarization based on minimum cuts</article-title>
          .
          <source>In Proceedings of the ACL.</source>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <given-names>Bo</given-names>
            <surname>Pang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Lillian</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and Shivakumar</given-names>
            <surname>Vaithyanathan</surname>
          </string-name>
          .
          <year>2002</year>
          .
          <article-title>Thumbs up?: Sentiment classification using machine learning techniques</article-title>
          .
          <source>In Proceedings of the ACL-02 Conference on Empirical Methods in Natural Language Processing -</source>
          Volume
          <volume>10</volume>
          , EMNLP '
          <volume>02</volume>
          , pages
          <fpage>79</fpage>
          -
          <lpage>86</lpage>
          , Stroudsburg, PA, USA. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>Mathieu</given-names>
            <surname>Roche and Violaine Prince</surname>
          </string-name>
          ,
          <year>2007</year>
          .
          <article-title>Modeling and Using Context: 6th International</article-title>
          and Interdisciplinary Conference,
          <string-name>
            <surname>CONTEXT</surname>
          </string-name>
          <year>2007</year>
          , Roskilde, Denmark,
          <source>August 20-24</source>
          ,
          <year>2007</year>
          . Proceedings, chapter AcroDef:
          <article-title>A Quality Measure for Discriminating Expansions of Ambiguous Acronyms</article-title>
          , pages
          <fpage>411</fpage>
          -
          <lpage>424</lpage>
          . Springer Berlin Heidelberg, Berlin, Heidelberg.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <surname>Peter D. Turney</surname>
          </string-name>
          .
          <year>2002</year>
          .
          <article-title>Thumbs up or thumbs down?: Semantic orientation applied to unsupervised classification of reviews</article-title>
          .
          <source>In Proceedings of the 40th Annual Meeting on Association for Computational Linguistics, ACL '02</source>
          , pages
          <fpage>417</fpage>
          -
          <lpage>424</lpage>
          , Stroudsburg, PA, USA. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <given-names>R.</given-names>
            <surname>Varghese</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Jayasree</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Aspect based sentiment analysis using support vector machine classifier</article-title>
          .
          <source>In Advances in Computing, Communications and Informatics (ICACCI)</source>
          , 2013 International Conference on, pages
          <fpage>1581</fpage>
          -
          <lpage>1586</lpage>
          , Aug.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <given-names>Guangwei</given-names>
            <surname>Wang</surname>
          </string-name>
          and
          <string-name>
            <given-names>Kenji</given-names>
            <surname>Araki</surname>
          </string-name>
          .
          <year>2007</year>
          .
          <article-title>Modifying so-pmi for japanese weblog opinion mining by using a balancing factor and detecting neutral expressions</article-title>
          .
          <source>In Human Language Technologies</source>
          <year>2007</year>
          :
          <article-title>The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers</article-title>
          , NAACL-Short '
          <volume>07</volume>
          , pages
          <fpage>189</fpage>
          -
          <lpage>192</lpage>
          , Stroudsburg, PA, USA. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>