<!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>
      <journal-title-group>
        <journal-title>Seville, Spain, September</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Deep Learning approach for Negation Cues Detection in Spanish</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Hermenegildo Fabregat</string-name>
          <email>gildo.fabregat@lsi.uned.es</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Juan Martinez-Romo</string-name>
          <email>juaner@lsi.uned.es</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lourdes Araujo</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>IMIENS: Instituto Mixto de Investigaci ́on</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Universidad Nacional de Educaci ́on a Distancia</institution>
          ,
          <addr-line>UNED</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <volume>18</volume>
      <issue>2018</issue>
      <fpage>43</fpage>
      <lpage>48</lpage>
      <abstract>
        <p>This paper describes the negation cues detection model presented by the UNED group for task 2 (Task 2: Negation cues detection) of the NEGES workshop collocated in the SEPLN congress (Sevilla, 2018). This task deals with negation cues detection in Spanish reviews in domains such as cars, music and books. In order to deal with the extraction of both semantic and syntactic patterns and the extraction of contextual patterns, we have proposed a model based on the combination of some dense neural networks and one Bidirectional Long Short-Term Memory (Bi-LSTM). The evaluation is divided by domains and using an inter-domain average we have obtained acceptable results.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        To understand the meaning of a sentence
through the use of the natural language
processing techniques it is necessary to take
into account that a sentence can express a
negated fact. In some languages such as
English, detection and processing of negation
is a recurrent working area. It is a very
interesting field of study if we consider the
influence of the negation in tasks such as
sentiment analysis and relationship extraction
        <xref ref-type="bibr" rid="ref15 ref4 ref5">(Reitan et al., 2015; Chowdhury and
Lavelli, 2013)</xref>
        . NegEx
        <xref ref-type="bibr" rid="ref2">(Chapman et al., 2001)</xref>
        is
one of the most popular algorithms for
negation detection in English. The use of this
algorithm for other languages has been
addressed by some recent works, such as
        <xref ref-type="bibr" rid="ref3">Chapman et al. (2013)</xref>
        (French, German and
Swedish),
        <xref ref-type="bibr" rid="ref16">Skeppstedt (2011)</xref>
        (Swedish) and
        <xref ref-type="bibr" rid="ref7">Cotik et al. (2016)</xref>
        (Spanish) which also explore
other syntactic approaches based on rules
derived from PoS-tagging and dependency tree
patterns for negation detection in Spanish.
      </p>
      <p>
        The proposal of the task 2 of NEGES
workshop
        <xref ref-type="bibr" rid="ref11 ref12">(Jim´enez-Zafra et al., 2018a)</xref>
        focuses on the detection of negated cues in
Spanish. For this purpose the organizers
facilitate the corpus SFU ReviewSP-NEG
        <xref ref-type="bibr" rid="ref11 ref12">(Jim´enezZafra et al., 2018b)</xref>
        which consists of 400
reviews related to 8 different domains (cars,
hotels, washing machines, books, cell phones,
music, computers and movies), 221866 words
and 9455 sentences, out of which 3022
sentences contain at least one negation structure.
The organizers have presented the corpus
divided in three sets: training, development and
test. As can be seen in the figure 1, the
corpus was presented using the format CoNLLL
(
        <xref ref-type="bibr" rid="ref10">Hajiˇc et al., 2009</xref>
        ).
      </p>
      <p>hoteles 21 1 Y y cc coordinating - -
hoteles 21 2 no no rn negative no -
hoteles 21 3 hay haber vmip3s0 main - -
hoteles 21 4 en en sps00 preposition - -
hoteles 21 5 la el da0fs0 article - -
hoteles 21 6 habitacio´n habitacio´n ncfs000 common
- -
hoteles 21 7 ni ni rn negative ni -
hoteles 21 8 una uno di0fs0 indefinite - -
hoteles 21 9 triste triste aq0cs0 qualificative - -
hoteles 21 10 hoja hoja ncfs000 common - -</p>
      <p>Each line corresponds to a token, where
an empty line is the end of a sentence
and each column represents an annotation
about a specific term (for instance, column
one contains the name of the domain file
and columns three and four contain word
and lemma). Column eight onwards shows
the annotations related to negation. If the
sentence has no negations, column eight
has a value “***” and there are no more
columns. Otherwise, the notation for each
negation is provided in three columns. The
first column contains the word that belongs
to the negation cue. The second and third
columns contain “-”.</p>
      <p>This work is organized as follows: Section
2 contains both the description of the
proposed model and the description of the
features and resources used. In section 3 we
report and discuss the results obtained during
the evaluation stage. And finally, in section 4
conclusions and future work are presented.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Proposed model</title>
      <p>
        Inspired by the model presented by
        <xref ref-type="bibr" rid="ref9">Fancellu,
Lopez, and Webber (2016</xref>
        ), the problem is
addressed as a sequence labeling task.
      </p>
      <p>
        The proposed model has been
implemented using Python’s Keras library
        <xref ref-type="bibr" rid="ref4">(Chollet and
others, 2015)</xref>
        with TensorFlow backend and
it is a supervised approach which uses the
following embedded features: words, lemmas,
PoS-tagging and case-tagging. Both words
and lemmas are encoded using a pre-trained
Spanish word embedding
        <xref ref-type="bibr" rid="ref1">(Cardellino, 2016)</xref>
        and both PoS-tagging and casing embedding
models have been implemented using two
Keras Embedding Layer1 initialized using a
random uniform distribution. In order to avoid
any cascade error we used both lemmas and
PoS-tagging provided in the corpus.
      </p>
      <p>X L</p>
      <p>XW</p>
      <p>XP</p>
      <p>XC
Embedding layers</p>
      <p>Concatenate
Bidirectional LSTM
...</p>
      <p>...</p>
      <p>Time Distributed wrapper</p>
      <p>Dense Neural network</p>
      <p>Dense Neural network</p>
      <p>T1</p>
      <p>T2</p>
      <p>T3
...</p>
      <p>Tz
Output Layer</p>
      <p>The casing embedding matrix is a
hotone encoding matrix of size 8 which was
1https://keras.io/layers/embeddings/
calculated for each input token making
use the following encoder dictionary: { 0:
Input token is numerical - 1: - 2: - 3: Initial
character is upper case - 4: Input token is
mainly numerical - 5: Contains at least one
digit - 6: Other case }.</p>
      <p>
        In order to ensure that the words
presented in the corpus, which are linked by
an underscore such as “ya que” are not
being left out of the embedding, we have
carried out a preprocessing step to divide
these expressions according to the number
of underscores that these expressions have.
To standardize the sentences to a common
length, after dividing expressions with more
than one term, a padding of up to 200
positions has been applied. To label the
targets, we follow the standard IOB labeling
scheme
        <xref ref-type="bibr" rid="ref14">(Ramshaw and Marcus, 1999)</xref>
        . The
first cue of a negation phrase is denoted by B
(Begin) and the remaining cues, if any with
I (Inside). O (Out) indicates that the word
does not correspond to any kind of entity
considered. For example:
      </p>
      <p>Del (O) buffet (O) del (O) desayuno (O)
no (B) puedo (O) opinar (O) ya que (B) no
(I) lo (O) incluia (O) nuestro (O) regimen
(O) . (O)
Figure 2 shows the proposed model
architecture. The first layer is a densely connected
hidden layer (Dense neural network), which
has as activation function the hyperbolic
tangent function (tanh). This layer takes as
input the concatenation of the different
embeddings. The output of the first layer is
connected to an LSTM (Long Short-Term
memory) enveloped in a bidirectional wrapper
(forward and backward processing network).
For each network, this second layer uses a
hidden state for processing data from the
current step taking into account information of
previous steps. In the next layer and
connected to the output layer, another dense hidden
layer has been used to reduce the complexity
of the bidirectional LSTM output. To avoid
possible over-fitting we have applied a
dropout factor of 0.25 to the output of this
dense layer. Finally, another dense hidden layer,
using the softmax activation function,
calculates the probabilities of all tags for each word
in a sentence. The most probable label is the
one selected as the final tag.</p>
      <p>
        The model has been trained with data from
all the categories and this process has been
limited to 25 epochs in order to avoid
possible over-fitting. We have evaluated during
the training phase for each epoch the
generated model using the script provided by the
organizers
        <xref ref-type="bibr" rid="ref13">(Morante and Blanco, 2012)</xref>
        and
the development set and we have observed
that, for most of the domains, 20th epoch are
enough to reach the best results (Figure 3).
#
"
"
!
Pre-trained resources parameters and
model’s hyper-parameters are the following:
– Pre-trained English Word Embedding
dimension: 300
– Embeddings dimension (Casing /
PoStagging): 8 / 50
– Hidden Dense units (output dimension /
activation function): 200 / tanh
– LSTM output dimension: 300
– Dropout (for each dense unit): 0.25
– Batch size / Model optimizer: 32 /
Ada
      </p>
      <p>
        Grad
        <xref ref-type="bibr" rid="ref8">(Duchi, Hazan, and Singer, 2011)</xref>
        Once the model has been set and it has a
stable and similar performance for all categories,
the model has been re-trained with the data
of the development set.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Evaluation</title>
      <p>In this section we describe the obtained
results, taking into account the following
evaluation criteria proposed by the organizers:
– Punctuation tokens are ignored.
– True positives are counted when the
system produces negation elements exactly
as they are in gold.</p>
      <p>Recall
72.06 % (80.85 %)
71.19 % (47.54 %)
66.67 % (68.89 %)
66.27 % (63.19 %)
73.68 % (59.63 %)
57.47 % (88.46 %)</p>
      <p>– (63.46 %)
69.33 % (63.64 %)</p>
      <p>F-measure
81.67 % (84.44 %)
82.35 % (62.36 %)
77.31 % (80.52 %)
72.29 % (74.59 %)
82.35 % (73.03 %)
70.92 % (86.79 %)</p>
      <p>– (72.53 %)
76.87 % (75.68 %)
– Partial matches are not counted as FP,
only as FN.
– False negatives are counted either by the
system not identifying negation elements
present in gold, or by identifying them
partially.
– False positives are counted when the
system produces a negation element not
present in gold.</p>
      <p>In order to carry out a study of the
performance of the presented system, it has been
compared with a baseline based on a lookup
of a filtered list of terms extracted from the
training set. To take into account the scope of
the negation, the sentences have been divided
according to the following delimiters: “.” - “,”
- “;”. The list of terms has been tunned in
order to improve the results obtained through
this baseline. Table 1 shows the results
obtained using the baseline (evaluating it with the
development set) and table 2 shows the
results obtained using the proposed approach.
As can be seen, table 2 presents two scores
for each evaluation metric (precision, recall
and f-measure). These scores correspond to
the evaluation of the system using the
development set during the training phase and to
the evaluation of the system carried out by
the organizers using the unannotated test set.
Due to an error submitting the system
output, there are no test results for the computer
category. On the one hand, the results
obtained in a preliminary analysis (development
set) show that the proposed system
significantly improves the results obtained by the
baseline. On the other hand, as shown in
table 2, the difference between recall and
precision is very remarkable. Taking into account
that we have not generated a specific model
for each domain, due to the needs of the
system presented, the differences between
precision and recall observed during the
evaluation of the test set may indicate, among other
things, that the system has some over-fitting
and is adjusting to very recurrent patterns or
that there are expressions that have not been
processed correctly (for example, there may
be expressions that are not correctly included
in the word embedding used). On the other
hand, the fall of the recall value in the music
domain is notable, comparing the results of
the test and training.</p>
      <p>Because the gold standard has not been
published, we have not been able to perform
an exhaustive analysis of the recognition
mistakes made evaluating with the test set.
However, some of the detected errors during the
training phase related to the obtained recall,
correspond to situations in which the model
has not been able to recognize some
multiword expressions related to a negation such
as “a no ser que” and “no hay mas que”.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Concluding Remarks</title>
      <p>The detection of negation cues is an
important task in the natural language processing
area. In this field we present a deep learning
model for detection of negation cues inspired
in named entity recognition architectures
and negation scope detection models. This
model achieves high performance without
any sophisticated features extraction process
and although the model has some weaknesses
in terms of coverage, the results are
acceptable and comparable with those obtained
by the UPC-TALP team (average results,
91.47 % precision, 82.17 % recall and 86.44 %
F-measure).</p>
      <p>
        As a future work, based on the low recall
obtained we will explore others regularization
methods such as the use of some
regularization function
        <xref ref-type="bibr" rid="ref4 ref6">(Cogswell et al., 2015)</xref>
        and we
will explore some model modifications such as
the addition of a semantic vector
representation for the whole sentence and the use of a
CRF-based layer instead of the current dense
based output layer. Finally, the study of the
patterns generated by the current model can
lead to the creation of a rule-based auxiliary
model for the re-labeling of negation
beginning cues (label B). If we take into account
that the model has been trained using
nonhandcrafted features, the results obtained
indicate that the system is capable of achieving
more competitive levels of precision and
recall.
      </p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments</title>
      <p>
        This work has been partially supported by
the projects EXTRECM
(TIN2013-46616C2-2-R), PROSA-MED
        <xref ref-type="bibr" rid="ref1">(TIN2016-77820-C32-R)</xref>
        , and EXTRAE (IMIENS 2017).
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>Cardellino</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <year>2016</year>
          .
          <article-title>Spanish billion words corpus and embeddings</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>Chapman</surname>
            ,
            <given-names>W. W.</given-names>
          </string-name>
          , W. Bridewell,
          <string-name>
            <given-names>P.</given-names>
            <surname>Hanbury</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. F.</given-names>
            <surname>Cooper</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B. G.</given-names>
            <surname>Buchanan</surname>
          </string-name>
          .
          <year>2001</year>
          .
          <article-title>A Simple Algorithm for Identifying Negated Findings and Diseases in Discharge Summaries</article-title>
          .
          <source>Journal of Biomedical Informatics</source>
          ,
          <volume>34</volume>
          (
          <issue>5</issue>
          ):
          <fpage>301</fpage>
          -
          <lpage>310</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>Chapman</surname>
            ,
            <given-names>W. W.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hilert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Velupillai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kvist</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Skeppstedt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. E.</given-names>
            <surname>Chapman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Conway</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Tharp</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. L.</given-names>
            <surname>Mowery</surname>
          </string-name>
          , and
          <string-name>
            <given-names>L.</given-names>
            <surname>Deleger</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Extending the NegEx lexicon for multiple languages</article-title>
          .
          <source>Studies in health technology and informatics</source>
          ,
          <volume>192</volume>
          :
          <fpage>677</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>Chollet</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          et al.
          <year>2015</year>
          . Keras. https:// github.com/fchollet/keras.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>Chowdhury</surname>
            ,
            <given-names>M. F. M.</given-names>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Lavelli</surname>
          </string-name>
          .
          <year>2013</year>
          .
          <article-title>Exploiting the scope of negations and heterogeneous features for relation extraction: A case study for drug-drug interaction extraction</article-title>
          .
          <source>In Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , pages
          <fpage>765</fpage>
          -
          <lpage>771</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>Cogswell</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Ahmed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. B.</given-names>
            <surname>Girshick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zitnick</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Batra</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Reducing Overfitting in Deep Networks by Decorrelating Representations</article-title>
          . CoRR, abs/1511.06068.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Cotik</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Stricker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Vivaldi</surname>
          </string-name>
          , and H. Rodr´ıguez Hontoria.
          <year>2016</year>
          .
          <article-title>Syntactic methods for negation detection in radiology reports in Spanish</article-title>
          .
          <source>In Proceedings of the 15th Workshop on Biomedical Natural Language Processing</source>
          ,
          <string-name>
            <surname>BioNLP</surname>
          </string-name>
          <year>2016</year>
          : Berlin, Germany,
          <year>August 12</year>
          ,
          <year>2016</year>
          , pages
          <fpage>156</fpage>
          -
          <lpage>165</lpage>
          . Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <surname>Duchi</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Hazan</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Singer</surname>
          </string-name>
          .
          <year>2011</year>
          .
          <article-title>Adaptive subgradient methods for online learning and stochastic optimization</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          ,
          <volume>12</volume>
          (Jul):
          <fpage>2121</fpage>
          -
          <lpage>2159</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <surname>Fancellu</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Lopez</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Webber</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Neural networks for negation scope detection</article-title>
          .
          <source>In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume</source>
          <volume>1</volume>
          :
          <string-name>
            <surname>Long</surname>
            <given-names>Papers)</given-names>
          </string-name>
          , volume
          <volume>1</volume>
          , pages
          <fpage>495</fpage>
          -
          <lpage>504</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <surname>Hajiˇc</surname>
            , J.,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Ciaramita</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Johansson</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Kawahara</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>A</article-title>
          . Mart´ı, L. Ma`rquez,
          <string-name>
            <given-names>A.</given-names>
            <surname>Meyers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Nivre</surname>
          </string-name>
          , S. Pad´o,
          <string-name>
            <surname>J.</surname>
          </string-name>
          <article-title>Sˇtˇepa´nek</article-title>
          , et al.
          <year>2009</year>
          .
          <article-title>The CoNLL-2009 shared task: Syntactic and semantic dependencies in multiple languages</article-title>
          .
          <source>In Proceedings of the Thirteenth Conference on Computational Natural Language Learning: Shared Task</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>18</lpage>
          . Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <article-title>Jim´enez-</article-title>
          <string-name>
            <surname>Zafra</surname>
            ,
            <given-names>S. M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>N. P.</given-names>
            <surname>Cruz-D´</surname>
          </string-name>
          ıaz, R. Morante, and M.
          <source>T. Mart´ın-Valdivia. 2018a. Resumen de la Tarea 2 del Taller NEGES</source>
          <year>2018</year>
          : Detecci´on de Claves de Negaci´on.
          <source>In Proceedings of NEGES 2018: Workshop on Negation in Spanish</source>
          , volume
          <volume>2174</volume>
          , pages
          <fpage>35</fpage>
          -
          <lpage>41</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <article-title>Jim´enez-</article-title>
          <string-name>
            <surname>Zafra</surname>
            ,
            <given-names>S. M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Taul</surname>
          </string-name>
          ´e, M. T. Mart´
          <article-title>ın-</article-title>
          <string-name>
            <surname>Valdivia</surname>
            ,
            <given-names>L. A.</given-names>
          </string-name>
          <string-name>
            <surname>Uren</surname>
          </string-name>
          <article-title>˜a-L´opez, and M. A. Mart´ı. 2018b. SFU Review SPNEG: a Spanish corpus annotated with negation for sentiment analysis. A typology of negation patterns</article-title>
          .
          <source>Language Resources and Evaluation</source>
          ,
          <volume>52</volume>
          (
          <issue>2</issue>
          ):
          <fpage>533</fpage>
          -
          <lpage>569</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <surname>Morante</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          and
          <string-name>
            <given-names>E.</given-names>
            <surname>Blanco</surname>
          </string-name>
          .
          <year>2012</year>
          . *
          <article-title>SEM 2012 shared task: Resolving the scope and focus of negation</article-title>
          .
          <source>In Proceedings of the First Joint Conference on Lexical and Computational Semantics-Volume 1: Proceedings of the main conference and the shared task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation</source>
          , pages
          <fpage>265</fpage>
          -
          <lpage>274</lpage>
          . Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <surname>Ramshaw</surname>
            ,
            <given-names>L. A.</given-names>
          </string-name>
          and
          <string-name>
            <given-names>M. P.</given-names>
            <surname>Marcus</surname>
          </string-name>
          .
          <year>1999</year>
          .
          <article-title>Text chunking using transformation-based learning</article-title>
          .
          <source>In Natural language processing using very large corpora</source>
          . Springer, pages
          <fpage>157</fpage>
          -
          <lpage>176</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <surname>Reitan</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Faret</surname>
          </string-name>
          , B. Gamba¨ck, and
          <string-name>
            <given-names>L.</given-names>
            <surname>Bungum</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Negation scope detection for twitter sentiment analysis</article-title>
          .
          <source>In Proceedings of the 6th Workshop on Computational Approaches to Subjectivity, Sentiment and Social Media Analysis</source>
          , pages
          <fpage>99</fpage>
          -
          <lpage>108</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <surname>Skeppstedt</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <year>2011</year>
          .
          <article-title>Negation detection in Swedish clinical text: An adaption of NegEx to Swedish</article-title>
          .
          <source>In Journal of Biomedical Semantics</source>
          , volume
          <volume>2</volume>
          , page S3. BioMed Central.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>