<!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>Explain sentiments using Conditional Random Field and a Huge Lexical Network</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Joe¨l MAI¨ZI Pierre POMPIDOR Sandra BRINGAY LIRMM</string-name>
          <email>tapinzali@lirmm.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Univ. Montpellier Montpellier</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</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>Christian LAVERGNE</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>I3M, Univ. Montpellier Montpellier, France Caroline MOLLEVI Biostatistics Unit</institution>
          ,
          <addr-line>ICM Montpellier</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Mike Donald TAPI NZALI I3M, Univ. Montpellier Montpellier, France LIRMM, Univ. Montpellier Montpellier</institution>
          ,
          <country country="FR">France</country>
        </aff>
      </contrib-group>
      <fpage>89</fpage>
      <lpage>93</lpage>
      <abstract>
        <p>In this paper, we focus on a particular task which consists in explaining the source and the target of sentiments expressed in social networks. We propose a method for French, which overcomes a fine syntactic parsing and successfully integrate the Conditional Random Field (CRF) method and a smart exploration of a very large lexical network. Quantitative and qualitative experiments were performed on real dataset to validate this approach.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        In this article, we focus on a particular task of
sentiment analysis which consists in explaining the
target and the source of sentiments. For example,
in the sentence ”We like the green initiative”, the
sentiment is expressed by the verb ”like”, the
target is ”green initiative” and the source is ”We”. In
        <xref ref-type="bibr" rid="ref2">(Bringay et al., 2014)</xref>
        , we have proposed a method
based on syntactic roles for English texts.
Experiments have shown that our method is robust, even
on the texts that are difficult to process :
messages in health forums that contain misspelling
and slang. Indeed, the method is not based on fine
syntactic parsing. However, it is not possible to
transpose this method directly to French because,
to our knowledge, there is no resource available to
explain semantic roles.
      </p>
      <p>In this context, we propose a new approach
based on machine learning methods and a very
large lexical network, in French, issued from a
contributory game JeuxDeMots1. The challenge is
twofold: 1) Instead of using fine syntactic parsing,
we use a statistical modeling method called
Conditional Random Field (CRF), to extract candidates
for targets and sources in large volumes of texts
1http://www.jeuxdemots.org/
jdm-accueil.php
issued from poorly written social web messages
2) we also exploit the huge French lexical
network JeuxDeMots (more than 300, 000 nodes and
7, 000, 000 relations) to choose the best sources
and targets among the candidates identified with
CRF. This new method has been successfully
exploited to analyse the sentiments expressed in the
French tweets dealing with environment and
climate change.</p>
      <p>The paper is organized as follows. In section 2,
we briefly present the state of the art. In section 3,
we provide a description of our method. In section
4, we provide all the detail of the experiments
carried out and the prime results. Finally in section
5, we conclude this work by providing the main
perspectives associated with this work.
2</p>
    </sec>
    <sec id="sec-2">
      <title>State of the Art</title>
      <p>
        Since the early 2000s, sentiment analysis, also
called “opinion mining”, has experienced
growing interest. Many methods have been developed
to extract emotional states expressed or implied
in texts. To identify sentiments, many resources
exist (e.g. list of words, phrases, idioms), which
were built mostly for English and polarity (e.g.
Linguistic Inquiry and Word Count
        <xref ref-type="bibr" rid="ref15 ref7 ref8 ref9">(Tausczik and
Pennebaker, 2010)</xref>
        ) or emotions (e.g. NRC
lexicon
        <xref ref-type="bibr" rid="ref15 ref7 ref8 ref9">(Mohammad and Turney, 2010a)</xref>
        ). Some
methods extend these vocabularies to specific
domains
        <xref ref-type="bibr" rid="ref11">(Neviarouskaya et al., 2011)</xref>
        . Others are
not restricted to the use of lexicons as
        <xref ref-type="bibr" rid="ref13">(Strapparava and Mihalcea, 2008)</xref>
        who implement learning
approaches.
      </p>
      <p>
        Two categories of approaches are used to link
sentiments and potential target and source. 1)
Methods that essentially implement syntactical
aspects, represented by combinations of rules
        <xref ref-type="bibr" rid="ref10">(Mudinas et al., 2012)</xref>
        as the polarity inverters (do not,
just, very...), conjunctions (but, or), etc. The
effectiveness of these methods is strongly linked to
language style that impacts on the syntactic rules
to take into account and are not adapted to
social web texts. 2) Methods that are based on
different distance computations between words
denoting sentiments and potential targets and source
(as the proximity
        <xref ref-type="bibr" rid="ref5">(Hu and Liu, 2004)</xref>
        or the
position in the syntactic tree
        <xref ref-type="bibr" rid="ref16">(Wu et al., 2009)</xref>
        ).
There are also many hybrid methods
        <xref ref-type="bibr" rid="ref4">(Ding and
Liu, 2007)</xref>
        . In
        <xref ref-type="bibr" rid="ref2">(Bringay et al., 2014)</xref>
        , we
proposed an efficient approach for English texts that
requires a resource FrameNet2 and the SEMAFOR
parser 3 for explaining the semantic roles. To
our best knowledge, such a resource does not
exist in French. Consequently, we have proposed a
method combining learning approach to find
targets and sources candidates and a smart
exploration of a large French lexical network to select
the best one.
      </p>
      <p>
        To choose the best candidate, we use the Games
with a purpose JeuxDeMots, created in 2007
        <xref ref-type="bibr" rid="ref10 ref6">(Lafourcade and Joubert, 2012)</xref>
        , to build a huge
lexical network for french. For example, the game
asks the player ideas associated with term climatic
change. The player freely associate terms such as
bear. Other players have already faced the same
term. The player wins credits if the proposed term
has already been proposed by another player. The
more the proposal is specific, the more points he
obtains. The lexical network generated with this
game is a directed graph, with terms (nodes) and
typed and weighted relations (edges) between the
terms. There are more than 50 types of
relationships. To weight the edges, JeuxDeMots is based
on crowdsourcing. Each relation is weighted by
a strength of association, denoted Cjdm
representing the number of players who have associated two
terms by the same relation. A first challenge is to
explore the network to link terms in the sentences
(sentiment and target/source) and explain these
relations. The second challenge will be to exploit
this very large network that includes more than
300000 terms and more than 7000000 relations.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Methods</title>
      <sec id="sec-3-1">
        <title>The method is organised into 3 steps :</title>
        <p>Step 1: Corpus. The corpus we used and
annotations have been made in the Ucomp project4.
These tweets deal with climate change. Table 1
and 2 present detailed statistics on the corpus.</p>
        <sec id="sec-3-1-1">
          <title>Step 2: candidates generation with CRF. The</title>
          <p>CRF model was developed with domain
indepen2https://FrameNet.icsi.berkeley.edu/</p>
        </sec>
        <sec id="sec-3-1-2">
          <title>Class</title>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>Source target</title>
        <sec id="sec-3-2-1">
          <title>Total 7867 55 Test</title>
          <p>
            • The original token from the text (word form);
• Surface features: capitalization of the
token (all in upper/lower case, combination
of both), and punctuation mark in the token
(PUNCT, NO PUNCT);
• Lexical features: n-grams, number of
consecutive repeats. Token frequency was
computed based on the entire training corpus.
• Brown clustering: we used Percy Liang’s
implementation of Brown clustering
            <xref ref-type="bibr" rid="ref3">(Brown et
al., 1992)</xref>
            , which is an HMM-based
algorithm. In our work, we partition words into
a base set of 100 clusters, and induces a
hierarchy among those 100 clusters.
• Emotion lexicon: We built
semiautomatically a new lexicon of French
sentiments
            <xref ref-type="bibr" rid="ref1">(Amine et al., 2014)</xref>
            by
translating and expanding the English NRC lexicon
            <xref ref-type="bibr" rid="ref15 ref7 ref8 ref9">(Mohammad and Turney, 2010b)</xref>
            . This
lexicon is free to download 5. For each
tokens, the corresponding feature takes the
value “Yes” if the token appear in the lexicon
and “No” otherwise. As a source and a
target are usually surrounded by a sentiment
token, we also consider the apparition of the
sentiment in the neighborhood of the token
(e.g. two tokens before or after the current
token).
          </p>
          <p>
            We experimented with standard tokenization
(provided by TreeTagger) and custom tokenization
            <xref ref-type="bibr" rid="ref14">(Tapi-Nzali et al., 2015)</xref>
            of French TreeTagger by
fndrupal/home
3http://demo.ark.cs.cmu.edu/parse
4http://www.ucomp.eu/
5http://www.lirmm.fr/˜abdaoui/FEEL.
html
adding some segmentation rules (e.g. apostrophe :
l’image is segmented into l’ and image).
          </p>
          <p>Step 3: Lexical network construction of each
sentence. The purpose of this step is to extract a
part of the lexical network JeuxDeMots
representing the relationship between the meaning of the
word and the candidates identified in Step 2. The
intuition of the algorithm is the following one. We
cross the lexical network from node to node. We
stop when we no longer encounter new words or if
we reach a maximum depth. Two other constraints
are used to limit the expansion of the graph.</p>
          <p>Constraint 1. To consider only the parts of the
network related to our topic (environment and
sentiment), we expand a node to another if the new
one belong to these two predefined lexical fields
chosen via Larousse thesaurus6. If there is no node
in the lexical field, we expand to all neighboring
nodes.</p>
          <p>Constraint 2. We use the association strength
Cjdm weighting the edges and consider only the
relations frequently instantiated by players. A
threshold is set by default.</p>
          <p>Step 4: Identification of shortest paths. The
objective of this step is to identify in the graph
generated in step 3, the paths that must correspond
to a compromise between the shortest paths, with
a little depth, most reliable according to strength
of association Cjdm. We have therefore redefined
weights wrt to foster some relationships like
synonymy or significant semantic roles such as
patient and agent. To identify the paths, we have
adapted the shortest path algorithm and used the
weights computed according to formulas 1 and 2.
The weight wi foster relationships that interest us
with wrt while taking into account the strength of
association Cjdm. In equation 1, we verify a
balance between wrt and Cjdm terms. In equation
2, the term (n 1)2 enables to penalize depth.
We only consider paths which contain at least
one agent or patient relationship. The path with
the best score is proposed to the user to explain
the link between the sentiment and the target or
source.</p>
          <p>w1 =
1
1</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Experiments</title>
      <p>1
Cjdm
+ wrt) ⇤ (n
(2)
Our experiments were carried out using 10-fold
cross-validation. To do this, the training corpus
was divided into 10 folds. To build our model,
we need a training, development and test corpus.
Cross-validation has been distributed as follows:
The model is built on 8 folds, the optimization of
the construction is performed on the ninth part
(development) and the model evaluation performed
on the last fold (test).</p>
      <p>
        To perform our experiments, we use
Wapiti7
        <xref ref-type="bibr" rid="ref7">(Lavergne et al., 2010)</xref>
        . It is a very
fast toolkit for segmenting and labelling
sequences with discriminative models. For the
iterative estimation of the model parameters,
we used the algorithm RPROP
        <xref ref-type="bibr" rid="ref12">(Riedmiller and
Braun, 1992)</xref>
        .
      </p>
      <p>Table 3 presents the results obtained by different
CRF models on training set by cross validation.
The features of four bests configurations are :
• Configuration 1 : Part Of Speech tagging +
lemmatization + lowercase
• Configuration 2 : Part Of Speech tagging +
lemmatization + lowercase + brown
clustering
• Configuration 3 : All (Part Of Speech
tagging + lemmatization + lowercase + brown
clustering + emotion lexicon
• Configuration 4 : Part Of Speech tagging +
lemmatization + lowercase + emotion lexicon</p>
      <sec id="sec-4-1">
        <title>Tweets</title>
      </sec>
      <sec id="sec-4-2">
        <title>Tokens</title>
      </sec>
      <sec id="sec-4-3">
        <title>Source</title>
      </sec>
      <sec id="sec-4-4">
        <title>Target</title>
        <p>The results of the evaluation are reported in
terms of precision (the number of source and
target correctly extracted over the total number of
source and target extracted), recall (the number
of source and target correctly extracted over the
total number of source and target marked the
corpus used) and F-measure (the harmonic average
of precision and recall). We show two types of
results. the first is the results achieved by Exact
match and the second by Partial match. We
consider that there is an Exact match when the
tokens obtained with our model match exactly those
of the standard test annotation and we consider
a Partial match when the obtained token are
included. For example, governor partially matches
The governor. Overall, with Exact match,
configuration 1 is the best performing configuration.
Results show that, we performed a good results with
Partial match. Compared to other configurations,
configuration 4 gives the best results on precision
( Precision 0.78), and configuration 1 and 2 give
the same results and the best results on recall and
F-measure (recall 0.52 and F-measure 0.62).
Contrary, with the sentiment lexicon as feature, we
increase precision, decrease recall and f-measure.
Brown Clustering is good feature if we want to
have a good precision.</p>
        <p>If CRF is relevant for extracting target and
source candidates, how can we link them to the
sentiments also expressed in the sentences? In
figure 1, a sentence is annotated after the exploration
of the lexical network. Sentiment tokens are
represented by red points. Target and Source obtained
with CRF are colored (in blue and yellow).
Arrows correspond to the paths identified in the
network. The more the arrow is thick the more the
path is valuated.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Conclusions and Future Work</title>
      <p>A combination of CRF and huge lexical network
exploration seems promising for explaining
sentiments in social networks. By experimenting with
the CRF model, we found that the results varied
depending on the features. The best results are
obtained with the features: lemmatization, cluster ID
and Part Of Speech tagging.</p>
      <p>The first advantage of this method is that we can
detect multiple tokens (e.g. parc eolien terrestre,
La France). Another advantage of this method
is that it is efficient even if the sentence contains
misspelling. For example, the system identify
mode`le de de´velopement durable (sustainable
development model) even if the word de´velopement
is misspelled. Finally, the main advantage of this
contribution is not to restrict sentiment, source and
target identification to the case in which sentiment
word is present. Indeed, in most cases people
express sentiments implicitly without using these
sentiment words. An emotion cannot be limited to
something a person feels about a fact and not the
sentiment that a person expresses about this fact.
Thus, it could be common to explicitly express
sentiments about things, but it is more common
to feel emotions without expressing them
explicitly. Our method take into account this fact and try
to identify source and target beyond the explicit
cases.</p>
      <p>The principal limitation of our method is the
length of the sentences in the considered corpora
(size of the tweets). In many sentences, there is
no source or no target. Results are significantly
reduced. Moreover, a quantitative study has to be
performed on step 3 and 4 to evaluate the quality
of the computed relations between sentiment and
targets/sources.</p>
      <p>Prospects associated with this work are
numerous. First, in this work we focus only on the
targets/sources expressed in sentences and we now
have to focus on inter-sentence relationships at
paragraph level. In future work, we are going
to use the best model we obtained on health
forum messages with longer sentences. We will also
compare our method to identify relations between
sentiments and source/target with the methods of
the state of the art. We will also adapt CRF to
extract directly relations. Finally, we will present to
users the part of the network used to identify
relations in order to help their interpretation</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>Abdaoui</given-names>
            <surname>Amine</surname>
          </string-name>
          , Aze´ Je´r oˆme,
          <source>Sandra Bringay, and Pascal Poncelet</source>
          .
          <year>2014</year>
          .
          <article-title>Feel : French extended emotional lexicon</article-title>
          .
          <source>volume ISLRN: 041-639-484-224-2. ELRA Catalogue of Language Resources.</source>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>Sandra</given-names>
            <surname>Bringay</surname>
          </string-name>
          , Eric Kergosien, Pierre Pompidor, and
          <string-name>
            <given-names>Pascal</given-names>
            <surname>Poncelet</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Identifying the targets of the emotions expressed in health forums</article-title>
          .
          <source>In CICLing (2)</source>
          , pages
          <fpage>85</fpage>
          -
          <lpage>97</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>Peter F Brown</surname>
          </string-name>
          ,
          <string-name>
            <surname>Peter V Desouza</surname>
          </string-name>
          , Robert L Mercer,
          <string-name>
            <surname>Vincent J Della Pietra</surname>
          </string-name>
          , and Jenifer C Lai.
          <year>1992</year>
          .
          <article-title>Class-based n-gram models of natural language</article-title>
          .
          <source>Computational linguistics</source>
          ,
          <volume>18</volume>
          (
          <issue>4</issue>
          ):
          <fpage>467</fpage>
          -
          <lpage>479</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <given-names>Xiaowen</given-names>
            <surname>Ding</surname>
          </string-name>
          and
          <string-name>
            <given-names>Bing</given-names>
            <surname>Liu</surname>
          </string-name>
          .
          <year>2007</year>
          .
          <article-title>The utility of linguistic rules in opinion mining</article-title>
          .
          <source>In Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '07</source>
          , pages
          <fpage>811</fpage>
          -
          <lpage>812</lpage>
          , New York, NY, USA. ACM.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>Minqing</given-names>
            <surname>Hu</surname>
          </string-name>
          and
          <string-name>
            <given-names>Bing</given-names>
            <surname>Liu</surname>
          </string-name>
          .
          <year>2004</year>
          .
          <article-title>Mining opinion features in customer reviews</article-title>
          .
          <source>In Proceedings of the 19th National Conference on Artifical Intelligence</source>
          ,
          <source>AAAI'04</source>
          , pages
          <fpage>755</fpage>
          -
          <lpage>760</lpage>
          . AAAI Press.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <given-names>Mathieu</given-names>
            <surname>Lafourcade</surname>
          </string-name>
          and
          <string-name>
            <given-names>Alain</given-names>
            <surname>Joubert</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>Increasing Long Tail in Weighted Lexical Networks. In Cognitive Aspects of the Lexicon (CogAlex-III), COLING</article-title>
          , page
          <volume>16</volume>
          , France, December.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <given-names>Thomas</given-names>
            <surname>Lavergne</surname>
          </string-name>
          , Olivier Cappe´, and Fran¸cois Yvon.
          <year>2010</year>
          .
          <article-title>Practical very large scale crfs</article-title>
          .
          <source>In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics</source>
          , pages
          <fpage>504</fpage>
          -
          <lpage>513</lpage>
          , Uppsala, Sweden.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <surname>Saif M. Mohammad</surname>
          </string-name>
          and
          <string-name>
            <surname>Peter D. Turney</surname>
          </string-name>
          . 2010a.
          <article-title>Emotions Evoked by Common Words and Phrases : Using Mechanical Turk to Create an Emotion Lexicon</article-title>
          . In Workshop on Computational Approaches to Analysis and Generation of Emotion in Text, pages
          <fpage>26</fpage>
          -
          <lpage>34</lpage>
          , Stroudsburg, PA, USA. ACL.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <surname>Saif M. Mohammad</surname>
          </string-name>
          and
          <string-name>
            <surname>Peter D. Turney</surname>
          </string-name>
          . 2010b.
          <article-title>Emotions evoked by common words and phrases: Using mechanical turk to create an emotion lexicon</article-title>
          .
          <source>In Proceedings of the NAACL HLT 2010 Workshop on Computational Approaches to Analysis and Generation of Emotion in Text, CAAGET '10</source>
          , pages
          <fpage>26</fpage>
          -
          <lpage>34</lpage>
          , Stroudsburg, PA, USA. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <given-names>Andrius</given-names>
            <surname>Mudinas</surname>
          </string-name>
          , Dell Zhang, and
          <string-name>
            <given-names>Mark</given-names>
            <surname>Levene</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>Combining lexicon and learning based approaches for concept-level sentiment analysis</article-title>
          .
          <source>In Proceedings of the First International Workshop on Issues of Sentiment Discovery and Opinion Mining</source>
          ,
          <source>WISDOM '12</source>
          , pages
          <issue>5</issue>
          :
          <fpage>1</fpage>
          -
          <issue>5</issue>
          :
          <fpage>8</fpage>
          , New York, NY, USA. ACM.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <given-names>Alena</given-names>
            <surname>Neviarouskaya</surname>
          </string-name>
          , Helmut Prendinger, and
          <string-name>
            <given-names>Mitsuru</given-names>
            <surname>Ishizuka</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>Affect analysis model: Novel rulebased approach to affect sensing from text</article-title>
          . volume
          <volume>17</volume>
          , pages
          <fpage>95</fpage>
          -
          <lpage>135</lpage>
          , New York, NY, USA, January. Cambridge University Press.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <given-names>Martin</given-names>
            <surname>Riedmiller</surname>
          </string-name>
          and
          <string-name>
            <given-names>Heinrich</given-names>
            <surname>Braun</surname>
          </string-name>
          .
          <year>1992</year>
          .
          <article-title>Rprop-a fast adaptive learning algorithm</article-title>
          .
          <source>In Proc. of ISCIS VII)</source>
          , Universitat. Citeseer.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <given-names>Carlo</given-names>
            <surname>Strapparava</surname>
          </string-name>
          and
          <string-name>
            <given-names>Rada</given-names>
            <surname>Mihalcea</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>Learning to identify emotions in text</article-title>
          .
          <source>In Proceedings of the 2008 ACM Symposium on Applied Computing, SAC '08</source>
          , pages
          <fpage>1556</fpage>
          -
          <lpage>1560</lpage>
          , New York, NY, USA. ACM.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <given-names>Mike</given-names>
            <surname>Donald</surname>
          </string-name>
          Tapi-Nzali,
          <article-title>Aure´lie Ne´ve´ol, and</article-title>
          <string-name>
            <given-names>Xavier</given-names>
            <surname>Tannier</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Analyse d'expressions temporelles dans les dossiers e´lectroniques patients</article-title>
          . In Actes de la Confe´
          <article-title>rence Traitement Automatique des Langues Naturelles (TALN</article-title>
          <year>2015</year>
          ), Caen, France, June.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <given-names>Yla R.</given-names>
            <surname>Tausczik</surname>
          </string-name>
          and
          <string-name>
            <given-names>James W.</given-names>
            <surname>Pennebaker</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>The psychological meaning of words: Liwc and computerized text analysis methods</article-title>
          . volume
          <volume>29</volume>
          , pages
          <fpage>24</fpage>
          -
          <lpage>54</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <given-names>Yuanbin</given-names>
            <surname>Wu</surname>
          </string-name>
          , Qi Zhang, Xuanjing Huang, and
          <string-name>
            <given-names>Lide</given-names>
            <surname>Wu</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <article-title>Phrase dependency parsing for opinion mining</article-title>
          .
          <source>In Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 3 -</source>
          Volume
          <volume>3</volume>
          , pages
          <fpage>1533</fpage>
          -
          <lpage>1541</lpage>
          , Stroudsburg, PA, USA. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>