<!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>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>LABDA at TASS-2018 Task 3: Convolutional Neural Networks for Relation Classi cation in Spanish eHealth documents</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>V ctor Suarez-Paniagua</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Isabel Segura-Bedmar</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Paloma Mart nez</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Computer Science Department Carlos III University of Madrid Leganes 28911</institution>
          ,
          <addr-line>Madrid</addr-line>
          ,
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <fpage>71</fpage>
      <lpage>76</lpage>
      <abstract>
        <p>This work presents the participation of the LABDA team at the subtask of classi cation of relationships between two identi ed entities in electronic health (eHealth) documents written in Spanish. We used a Convolutional Neural Network (CNN) with the word embedding and the position embedding of each word to classify the type of the relation between two entities in the sentence. Previously, this machine learning method has already showed good performance for capturing the relevant features in electronic health documents which describe relationships. Our architecture obtained an F1 of 44.44 % in the scenario 3 of the shared task, named as Setting semantic relationships. Only ve teams submitted results for this subtask. Our system achieved the second highest F1, being very similiar to the top score (micro F1=44.8 %) and higher than the remainig teams. One of the main advantage of our approach is that it does not require any external knowledge resource as features.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Nowadays, there is a high increase in the
publication of scienti c articles every year,
which demonstrates that we are living in an
emerging knowledge era. This explosion of
information makes it nearly impossible for
doctors and biomedical researchers to keep
up to date with the literature in their elds.</p>
      <p>The development of automatic systems to
extract and analyse information from electronic
health (eHealth) documents can signi cantly
reduce the workload of doctors.</p>
      <p>
        The TASS workshop proposes shared
tasks on sentiment analysis in Spanish each
year. Concretely, the goal of TASS-2018 Task
3
        <xref ref-type="bibr" rid="ref6">(Mart nez-Camara et al., 2018)</xref>
        is to create
a competition where Natural Language
Processing (NLP) experts can train their
sys
      </p>
      <p>Copyright © 2018 by the paper's authors. Copying permitted for private and academic purposes.
tems for extracting the relevant information
in Spanish eHealth documents and evaluate
them in a objective and fair way.</p>
      <p>
        Recently, Deep Learning has had a big
impact on NLP tasks becoming the
state-of-theart technique. Convolutional Neural Network
(CNN) is a Deep Learning architecture which
has shown good performance in Computer
Vision task such as image classi cation
        <xref ref-type="bibr" rid="ref4">(Krizhevsky, Sutskever, y Hinton, 2012)</xref>
        and face
recognition
        <xref ref-type="bibr" rid="ref5">(Lawrence et al., 1997)</xref>
        .
      </p>
      <p>
        The system described in
        <xref ref-type="bibr" rid="ref2">(Kim, 2014)</xref>
        was
the rst work to use a CNN for a NLP task.
      </p>
      <p>
        It created a vector representation for each
sentence by extracting the relevant
information with di erent lters in order to
classify them into prede ned categories
obtaining good results. In addition, CNN was used
with good performance for relation classi
cation between nominals in the work of
        <xref ref-type="bibr" rid="ref9">(Zeng
et al., 2014)</xref>
        . Furthermore, this
architecture has been also used in the biomedical
domain for the extraction of drug-drug
interactions in
        <xref ref-type="bibr" rid="ref7 ref8">(Suarez-Paniagua, Segura-Bedmar,
y Mart nez, 2017a)</xref>
        . This system did not
require any external biomedical knowledge
in order to provide very close results to
those obtained using lots of hand-crafted
features. We also employed the same
approach of
        <xref ref-type="bibr" rid="ref7 ref8">(Suarez-Paniagua, Segura-Bedmar,
y Mart nez, 2017b)</xref>
        , which was used for
extracting relationships between keyphrases in
the Semeval-2017 Task 10: ScienceIE
        <xref ref-type="bibr" rid="ref1">(Augenstein et al., 2017)</xref>
        , which proposed very
similar subtasks than those de ned in
TASS2018 Task 3.
      </p>
      <p>In this work, we describe the participation
of the LABDA at the subtask C in the classi
cation of relationships between two identi ed
entities in Spanish documents about health.</p>
      <p>In this subtask, the test dataset includes the
text, the boundaries and the types of their
entities to generate the prediction.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Dataset</title>
      <p>The task provides an annotated corpus from
MedlinePlus documents which is divided into
the training set for the learning step,
development set for the validation and test set for the
evaluation of the systems.</p>
      <p>
        The relationship between entities de ned
as concepts are: is-a, part-of, property-of and
same-as. There are also relationships de ned
as roles: subject and target. The training set
contains 559 sentences with 3,276 entities,
1,012 relations and 1,385 roles, the
development set contains another 285 sentences. The
dataset contains 3,276 entities and 1,012
relations and 1,385 roles in the train set, the
development set contains 285 sentences. A
detailed description of the method used to
collect and process documents can be found
in
        <xref ref-type="bibr" rid="ref6">(Mart nez-Camara et al., 2018)</xref>
        .
      </p>
      <p>Unlike the other two previous subtasks,
the documents include annotated entities
with boundaries and types. In this way, it
is possible to measure and compare the di
erent approaches only focusing on the goal of
the subtask C.
2.1</p>
      <sec id="sec-2-1">
        <title>Pre-processing phase</title>
        <p>As some of the relationships types are
asymmetrical, for each pair of entities marked
in the sentence, we generate two instances.</p>
        <p>Thus, a sentence with n entities will have
(n 1) n instances. Each instance is
labelled with one of the six classes is-a,
partof, property-of, same-as, subject and target.</p>
        <p>In addition, a None class is also considered
for the non-relationship between the entities.</p>
        <p>Due to the fact that there are some
overlapped entities, we consider each sentence as
a graph where the vertices are the entities
and the edges are the non-overlapped entities
with itself in order to obtain recursively all
the possible paths without overlapping, thus
we have di erent instances for each
overlapped entities. Table 2 shows the resulting
number of instances for each class on the train,
validation and test sets.</p>
        <p>Label
is-a
part-of
property-of
same-as
subject
target
None</p>
        <p>
          After that, we tokenize and clean the
sentences following a similar approach as
that described in
          <xref ref-type="bibr" rid="ref2">(Kim, 2014)</xref>
          , converting
the numbers to a common name, words to
lower-case, replacing special Spanish accents
to Unicode, e.g n~ to n, and separating
special characters with white spaces by regular
Relationship between entities
(ataque de asma ! produce)
(ataque de asma produce)
(ataque de asma ! s ntomas)
(ataque de asma s ntomas)
(ataque de asma ! empeoran)
(ataque de asma empeoran)
(produce ! s ntomas)
(produce s ntomas)
(produce ! empeoran)
(produce empeoran)
(s ntomas ! empeoran)
(s ntomas empeoran)
(asma ! produce)
(asma produce)
(asma ! s ntomas)
(asma s ntomas)
(asma ! empeoran)
(asma empeoran)
(produce ! s ntomas)
(produce s ntomas)
(produce ! empeoran)
(produce empeoran)
(s ntomas ! empeoran)
(s ntomas empeoran)
        </p>
        <p>Instances after entity blinding
'un entity1 se entity2 cuando los entity0 entity0 .'
'un entity2 se entity1 cuando los entity0 entity0 .'
'un entity1 se entity0 cuando los entity2 entity0 .'
'un entity2 se entity0 cuando los entity1 entity0 .'
'un entity1 se entity0 cuando los entity0 entity2 .'
'un entity2 se entity0 cuando los entity0 entity1 .'
'un entity0 se entity1 cuando los entity2 entity0 .'
'un entity0 se entity2 cuando los entity1 entity0 .'
'un entity0 se entity1 cuando los entity0 entity2 .'
'un entity0 se entity2 cuando los entity0 entity1 .'
'un entity0 se entity0 cuando los entity1 entity2 .'
'un entity0 se entity0 cuando los entity2 entity1 .'
'un ataque de entity1 se entity2 cuando los entity0 entity0 .'
'un ataque de entity2 se entity1 cuando los entity0 entity0 .'
'un ataque de entity1 se entity0 cuando los entity2 entity0 .'
'un ataque de entity2 se entity0 cuando los entity1 entity0 .'
'un ataque de entity1 se entity0 cuando los entity0 entity2 .'
'un ataque de entity2 se entity0 cuando los entity0 entity1 .'
'un ataque de entity0 se entity1 cuando los entity2 entity0 .'
'un ataque de entity0 se entity2 cuando los entity1 entity0 .'
'un ataque de entity0 se entity1 cuando los entity0 entity2 .'
'un ataque de entity0 se entity2 cuando los entity0 entity1 .'
'un ataque de entity0 se entity0 cuando los entity1 entity2 .'
'un ataque de entity0 se entity0 cuando los entity2 entity1 .'
Label
None
target
None
None
None
None
None
None
subject
None
None
target
None
None
None
None
None
None
None
None
subject
None
None
target
Tabla 1: Instances with two di erent entities relationship after the pre-processing phase with
entity blinding of the sentence 'Un ataque de asma se produce cuando los s ntomas empeoran.'.
expressions.</p>
        <p>Furthermore, the two target entities of
each instance are replaced by the labels
"entity1 ", "entity2 ", and by "entity0 "for the
remaining entities. This method is known as
entity blinding, and supports the
generalization of the model. For instance, the sentence
in Figure 1: 'Un ataque de asma se
produce cuando los s ntomas empeoran.' with the
entities ataque de asma, asma, produce, s
ntomas and empeoran should be transformed to
the relation instances showed in Table 1.</p>
        <p>Figura 1: Relationships and entities in the
sentence 'Un ataque de asma se produce
cuando los s ntomas empeoran.'.</p>
        <p>We observed that there are some
instances that involve relationships between an
entity and its overlapped entity, for this reason,
we remove them from the dataset because we
can not deal with these relations in the
entity blinding process. Moreover, there are
relationships with more than one label, in this
case, we take just one label because our
system is not able to cope with a multi-class
problem.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>CNN model</title>
      <p>In this section, we present the CNN
architecture which is used for the task of relation
extraction in electronic health documents.
Figure 2 shows the entire process of the CNN
starting from a sentence with marked entities
to return the prediction.
3.1</p>
      <sec id="sec-3-1">
        <title>Word table layer</title>
        <p>After the pre-processing phase, we created an
input matrix suitable for the CNN
architecture. The input matrix should represent all
training instances for the CNN model;
therefore, they should have the same length. We
determined the maximum length of the
sentence in all the instances (denoted by n), and
then extended those sentences with lengths
shorter than n by padding with an auxiliary
token "0 ".</p>
        <p>Moreover, each word has to be represented
by a vector. To do this, we randomly
initialized a vector for each di erent word which
allows us to replace each word by its word
embedding vector: We 2 RjV j me where V
is the vocabulary size and me is the word
embedding dimension. Finally, we obtained a
vector x = [x1; x2; :::; xn] for each instance
where each word of the sentence is
represented by its corresponding word vector from the
word embedding matrix. We denote p1 and
p2 as the positions in the sentence of the two</p>
        <p>Un &lt;e1&gt;ataque de asma&lt;\e1&gt; se &lt;e2&gt;produce&lt;\e2&gt; cuando los &lt;e0&gt;síntomas&lt;\e0&gt; &lt;e0&gt;empeoran&lt;\e0&gt;.
n
|V|</p>
        <p>Un
entity1</p>
        <p>se
entity2
cuando</p>
        <p>los
entity0
entity0.</p>
        <p>0
…</p>
        <p>Figura 2: CNN model for the Setting semantic relationships subtask of TASS-2018-Task 3.
entities to be classi ed.</p>
        <p>
          The following step involves calculating the
relative position of each word to the two
candidate entities as i p1 and i p2, where i
is the word position in the sentence (padded
word included), in the same way as
          <xref ref-type="bibr" rid="ref9">(Zeng et
al., 2014)</xref>
          . In order to avoid negative values,
we transformed the range ( n + 1; n 1) to
the range (1; 2n 1). Then, we mapped these
distances into a real value vector using two
position embeddings Wd1 2 R(2n 1) md and
Wd2 2 R(2n 1) md . Finally, we created an
input matrix X 2 Rn (me+2md) which is
represented by the concatenation of the word
embeddings and the two position embeddings
for each word in the instance.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2 Convolutional layer</title>
        <p>Once we obtained the input matrix, we
applied a lter matrix f = [f1; f2; :::; fw] 2
Rw (me+2md) to a context window of size w
in the convolutional layer to create higher
level features. For each lter, we obtained
a score sequence s = [s1; s2; :::; sn w+1] 2
R(n w+1) 1 for the whole sentence as
w
si = g(X fj xiT+j 1 + b)</p>
        <p>j=1
where b is a bias term and g is a non-linear
function (such as tangent or sigmoid). Note
that in Figure 2, we represent the total
number of lters, denoted by m, with the same
size w in a matrix S 2 R(n w+1) m. However,
the same process can be applied to lters with
di erent sizes by creating additional matrices
that would be concatenated in the following
layer.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3 Pooling layer</title>
        <p>In this layer, the goal is to extract the most
relevant features of each lter using an
aggregating function. We used the max function,
which produces a single value in each lter
as zf = maxfsg = maxfs1; s2; :::; sn w+1g.
Thus, we created a vector z = [z1; z2; :::; zm],
whose dimension is the total number of lters
m representing the relation instance. If
there are lters with di erent sizes, their output
values should be concatenated in this layer.</p>
      </sec>
      <sec id="sec-3-4">
        <title>3.4 Softmax layer</title>
        <p>Prior to performing the classi cation, we
performed a dropout to prevent over tting. We
obtained a reduced vector zd, randomly
setting the elements of z to zero with a
probability p following a Bernoulli distribution. After
that, we fed this vector into a fully
connected softmax layer with weights Ws 2 Rm k
to compute the output prediction values for
the classi cation as o = zdWs + d where d
is a bias term; we have k = 6 classes in the
Label
is-a
part-of
property-of
same-as
subject
target
Scenario 3
dataset and the "Noneclass. At test time, the
vector z of a new instance is directly classi ed
by the softmax layer without a dropout.
For the training phase, we need to learn the
CNN parameter set = (We, Wd1, Wd2,
Ws, d, Fm, b), where Fm are all of the m
lters f. For this purpose, we used the
conditional probability of a relation r obtained by
the softmax operation as
p(rjx; ) =</p>
        <p>exp(or)
Pk
l=1 exp(ol)
to minimize the cross entropy function for all
instances (xi,yi) in the training set T as
follows</p>
        <p>J ( ) =</p>
        <p>
          T
X log p(yijxi; )
i=1
In addition, we minimize the objective
function by using stochastic gradient descent
over shu ed mini-batches and the Adam
update rule
          <xref ref-type="bibr" rid="ref2 ref3">(Kingma y Ba, 2014)</xref>
          to learn the
parameters.
4
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Results and Discussion</title>
      <p>The CNN model was training with the
training set and we obtained the best values of
each parameters ne-tuning them on the
validation set (see Table 4).</p>
      <p>The results were measured with precision
(P), recall (R) and F1, de ned as:</p>
      <p>P =</p>
      <p>C
C + S</p>
      <p>R =</p>
      <p>C
C + M</p>
      <p>F 1 = 2</p>
      <p>P R
P + R
where Correct (C) are the relations that
matched to the test set and the prediction,
Missing (M) are the relations that are in the test
set but not in the prediction, and Spurious
(S) are the relations that are in the
prediction but not in the test set.</p>
      <p>Parameter
Maximal length in the dataset, n
Word embeddings dimension, Me
Position embeddings dimension, Md
Filter window sizes, w
Filters for each window size, m
Dropout rate, p
Non-linear function, g
Mini-batch size
Learning rate
Value
38
300
10
3, 4, 5
200
0.5
ReLU
50
0.001
Tabla 4: The CNN model parameters and
their values used for the results.</p>
      <p>Table 3 shows the results of the CNN
conguration with position embeddings. We
observe that the number of Missing is very high.
This may be due to the fact that the dataset
is very unbalanced and these instances are
classi ed as None by the system. In fact, we
see that the classes that are more
representative have better Recall. To solve this
problem we propose to use sampling techniques
to increase the number of instances of the less
representative classes.</p>
      <p>Only ve teams submitted results for this
subtask. Our system achieved the second
highest F1, being very similiar to the top
score (micro F1=44.8 %), but very much higher
than the other teams, which are bellow than
11 % of F1. One of the main advantage of our
approach is that it does not require any
external knowledge resource.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions and Future work</title>
      <p>In this paper, we propose a CNN model for
the subtask C (Setting semantic
relationships) of the TASS-2018 Task 3. The o cial
results for this model show that the CNN is
a very promising system because neither
expert domain knowledge nor external features
are needed. The con guration of the
architecture is very simple with a basic preprocessing
adapted for Spanish documents.</p>
      <p>The results show that the system
produces very many false negatives. We think that
this may be due to the unbalanced nature of
the dataset. To solve this problem, we
propose to use oversampling techniques to
increase the number of instances of the less
representative classes. Our system also seems to
have di culties in order to distinguish the
directionality of the relationships. For these
reasons, we will use more complex settings of
the architecture for tackling the
directionality problem.</p>
      <p>Moreover, we plan to use external features
as part of the embeddings such as the entity
labels given by the second subtask, the
Partof-Speech (PoS) tags and the dependency
types of each word for the Spanish documents
in order to increase the information of each
sentence. We want to explore in detail each
feature contribution and the ne-tune all the
parameters. Furthermore, we will use some
rules to distinguish the relations and the roles
with the entity labels and train two di erent
classi er, thus, they would be more accurate.
In addition, we will use another neural
network architectures like the Recurrent Neural
Network and possible combinations with the
CNN.</p>
    </sec>
    <sec id="sec-6">
      <title>Funding</title>
      <p>This work was supported by the Research
Program of the Ministry of Economy and
Competitiveness - Government of Spain,
(DeepEMR project TIN2017-87548-C2-1-R).</p>
    </sec>
    <sec id="sec-7">
      <title>Bibliograf a</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>Augenstein</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>M. Das</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Riedel</surname>
          </string-name>
          , L. Vikraman, y A.
          <string-name>
            <surname>McCallum</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Semeval 2017 task 10: Scienceie - extracting keyphrases and relations from scienti c publications</article-title>
          .
          <source>En Proceedings of the 11th International Workshop on Semantic Evaluation (SemEval-2017)</source>
          , paginas
          <volume>546</volume>
          {
          <fpage>555</fpage>
          , Vancouver, Canada, August. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <year>2014</year>
          .
          <article-title>Convolutional neural networks for sentence classi cation</article-title>
          .
          <source>En Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)</source>
          , paginas
          <volume>1746</volume>
          {
          <fpage>1751</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>Kingma</surname>
            ,
            <given-names>D. P. y J.</given-names>
          </string-name>
          <string-name>
            <surname>Ba</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Adam: A method for stochastic optimization</article-title>
          .
          <source>CoRR, abs/1412</source>
          .6980.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>Krizhevsky</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , I. Sutskever, y
          <string-name>
            <given-names>G. E.</given-names>
            <surname>Hinton</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>Imagenet classi cation with deep convolutional neural networks</article-title>
          .
          <source>En Advances in Neural Information Processing Systems</source>
          <volume>25</volume>
          , paginas
          <volume>1097</volume>
          {
          <fpage>1105</fpage>
          . Curran Associates, Inc.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>Lawrence</surname>
            , S.,
            <given-names>C. L.</given-names>
          </string-name>
          <string-name>
            <surname>Giles</surname>
            ,
            <given-names>A. C.</given-names>
          </string-name>
          <string-name>
            <surname>Tsoi</surname>
            , y
            <given-names>A. D.</given-names>
          </string-name>
          <string-name>
            <surname>Back</surname>
          </string-name>
          .
          <year>1997</year>
          .
          <article-title>Face recognition: a convolutional neural-network approach</article-title>
          .
          <source>IEEE Transactions on Neural Networks</source>
          ,
          <volume>8</volume>
          (
          <issue>1</issue>
          ):
          <volume>98</volume>
          {
          <fpage>113</fpage>
          ,
          <string-name>
            <surname>Jan</surname>
          </string-name>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>Mart</surname>
            nez-Camara, E.,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Almeida-Cruz</surname>
            ,
            <given-names>M. C.</given-names>
          </string-name>
          <article-title>D az-</article-title>
          <string-name>
            <surname>Galiano</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Estevez-Velarde</surname>
            ,
            <given-names>M. A.</given-names>
          </string-name>
          <string-name>
            <surname>Garc</surname>
            a-Cumbreras, M. Garc aVega,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Gutierrez</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Montejo-Raez</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Montoyo</surname>
          </string-name>
          , R. Mun~oz, A. PiadMor s, y J.
          <string-name>
            <surname>Villena-Roman</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Overview of TASS 2018: Opinions, health and emotions</article-title>
          . En E. Mart nezCamara
          <string-name>
            <given-names>Y.</given-names>
            <surname>Almeida Cruz M. C. D azGaliano S. Estevez Velarde M. A. Garc</surname>
          </string-name>
          a
          <string-name>
            <surname>-Cumbreras</surname>
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Garc</surname>
            a-Vega
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Gutierrez Vazquez A. Montejo Raez A. Montoyo Guijarro R. Mun</surname>
          </string-name>
          <article-title>~oz Guillena A. Piad Mor s</article-title>
          , y J.
          <article-title>Villena-Roman, editores</article-title>
          ,
          <source>Proceedings of TASS 2018: Workshop on Semantic Analysis at SEPLN (TASS</source>
          <year>2018</year>
          ), volumen 2172 de CEUR Workshop Proceedings, Sevilla, Spain, September. CEUR-WS.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Suarez-Paniagua</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          Segura-Bedmar, y P.
          <article-title>Mart nez</article-title>
          . 2017a.
          <article-title>Exploring convolutional neural networks for drug-drug interaction extraction</article-title>
          .
          <source>Database</source>
          ,
          <year>2017</year>
          :
          <fpage>bax019</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <surname>Suarez-Paniagua</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          Segura-Bedmar, y P.
          <article-title>Mart nez</article-title>
          .
          <source>2017b. LABDA at semeval2017 task</source>
          <volume>10</volume>
          :
          <article-title>Relation classi cation between keyphrases via convolutional neural network</article-title>
          .
          <source>En Proceedings of the 11th International Workshop on Semantic Evaluation, SemEval@ACL</source>
          <year>2017</year>
          , Vancouver, Canada,
          <source>August 3-4</source>
          ,
          <year>2017</year>
          , paginas
          <volume>969</volume>
          {
          <fpage>972</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <surname>Zeng</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Lai</surname>
          </string-name>
          , G. Zhou,
          <string-name>
            <given-names>y J</given-names>
            .
            <surname>Zhao</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Relation classi cation via convolutional deep neural network</article-title>
          .
          <source>En Proceedings of the 25th International Conference on Computational Linguistics (COLING</source>
          <year>2014</year>
          ), Technical Papers, paginas
          <volume>2335</volume>
          {
          <fpage>2344</fpage>
          , Dublin, Ireland,
          <year>August</year>
          . Dublin City University and Association for Computational Linguistics.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>