<!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>GPLSIUA Team at the DIAAN 2018 task</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>l Mor</string-name>
          <email>moredag@dlsi.ua.es</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>M.T. Rom</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Nursing, University of Alicante</institution>
          ,
          <country country="ES">Spain</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Software and Computing systems, University of Alicante</institution>
          ,
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <fpage>15</fpage>
      <lpage>24</lpage>
      <abstract>
        <p>This paper describes our participation in DIANN 2018 Task: DIsability ANNotation in English and Spanish documents. Our proposal detects disabilities as well as recognizes negated disabilities. To that end, our entity typing system is applied without tuning and it does not require any external knowledge. It consists of a Random Forest machine learning classi er whose feature set includes local entity information and pro les, generated unsupervisedly. Two experiments are presented in order to investigate performance of two types of pro les. Both proposals are able to reach promising and reasonable results, obtaining a partial-matching precision greater than 87% for disabilities and negated disabilities regardless of the language. Thus demonstrating the portability and adequateness of our approach regardless of type of pro le.</p>
      </abstract>
      <kwd-group>
        <kwd>Disability</kwd>
        <kwd>Negation</kwd>
        <kwd>Named entity learning</kwd>
        <kwd>Random Forest</kwd>
        <kwd>Language independent</kwd>
        <kwd>Pro les</kwd>
        <kwd>Machine</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Disability is de ned as \any condition of the body or mind (impairment) that
makes it more di cult for the person with the condition to do certain activities
(activity limitation) and interact with the world around them (participation
restrictions)" [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. The 2011 World Report on Disability [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] evince that more
than one billion people of the world's population have some form of disability.
Thus making the information gathering about disabilities of vital importance.
      </p>
      <p>
        There are some e orts to annotate medical concepts for languages such as
English [
        <xref ref-type="bibr" rid="ref18 ref8">8, 18</xref>
        ] or Spanish [
        <xref ref-type="bibr" rid="ref11 ref16">11, 16</xref>
        ], but the focus is on sign or disease. In other
words, they do not delve into these two concepts in order to distinguish
disabilities. This is why the goal of DIANN task is the DIsability ANNotation on
scienti c abstracts from the biomedical domain in English and Spanish [
        <xref ref-type="bibr" rid="ref1 ref5">1, 5</xref>
        ].
      </p>
      <p>The request was not only to annotate disabilities (dis) but also to annotate
the negation (neg) modi ers a ecting at least one disability as well as its scope
(scp), as illustrated by Example 1.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Example 1. I n November 2000 s e v e r a l i n f o r m a t i v e m e e t i n g s</title>
      <p>were h e l d f o r 41 r e s i d e n t s o f our c e n t e r ' s N u r s i n g Home
who were s e l e c t e d a s t h e y p r e s e n t e d &lt;scp&gt;&lt;neg&gt;no&lt;/neg&gt;
p o t e n t i a l l y f a t a l d i s e a s e o r &lt;d i s &gt;c o g n i t i v e
impairment &lt;/d i s &gt;&lt;/scp &gt;.</p>
      <p>
        For the rst edition of the DIANN task we were particularly interested in
evaluating CARMEN [12{14], our general purpose Named Entity Typing (NET)
system. Such NET system decides whether a possible chunk in a text corresponds
or not to a disability. It does not use any external resource (e.g. UMLS
Metathesaurus [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]) that contains any physical or intellectual conditions that when
impaired give rise to a disability. The idea was to establish how well can we perform
in this task without speci c domain or language resources and without feature or
parameter tuning. Despite the fact that our interest lies on classifying entities,
a simple approach to detect negation and scope of negated disabilities is also
proposed.
      </p>
      <p>The rest of the paper is structured as follows. Next, our approach is de ned
in Section 2. The experiments are presented in Section 3. Results are discussed
in Section 4. Last, conclusions and future work are outlined in Section 5.
2</p>
      <sec id="sec-2-1">
        <title>Methods</title>
        <p>Our approach, as can be seen in Figure 1, consists in ve main steps: (i)
preprocessing: this stage takes as input an annotated corpus to perform a linguistic
analysis (see Section 2.1); (ii) disability annotation: this process implies the
extraction of possible candidates in order to decide which ones should be typed as
disabilities (see Section 2.2); (iii) negation annotation: this task nds all
negation triggers in a given text (see Section 2.3); (iv) scope annotation: this phase
determines which negation triggers, previously detected, a ect a disability (i.e.
must be kept) and its span (see Section 2.4); and last, (v) post-processing: this
stage converts the resulting corpus to the competition format (see Section 2.5).
In the following sections this work- ow is explained in detail.</p>
        <p>Input
Corpus
1. Pre-processing</p>
        <p>Linguistically</p>
        <p>Analyzed
Corpus</p>
        <p>Candidate
extraction
Output
corpus</p>
        <p>5. Post
processing
4. Scope
annotation
2. Disability annotation</p>
        <p>Candidate</p>
        <p>Typing
3.Negation
annotation</p>
        <sec id="sec-2-1-1">
          <title>Pre-processing</title>
          <p>
            The system takes as input an annotated document following DIANN format. The
DIANN format is plain text that can include XML tags to determine the anchor
of the three elements that must be annotated (disabilities, negation and scope),
as can be seen in Example 1. Such format is converted to a well-formed XML that
can be processed by Gate [
            <xref ref-type="bibr" rid="ref4">4</xref>
            ]. To that end, special XML characters are escaped
and a root tag is created. Besides, its raw text is tokenized, sentence-splitted,
lemmatized, PoS-tagged and shallow parsed using Freeling [
            <xref ref-type="bibr" rid="ref17">17</xref>
            ]. Last, both
outputs (i.e. each linguistically annotated text and its corresponding well-formed
XML document) are merged into one document in GATE stando format.
2.2
          </p>
        </sec>
        <sec id="sec-2-1-2">
          <title>Disability Annotation</title>
          <p>Disability annotation consists of two modules:</p>
          <p>The rst one, candidate extraction in Figure 1, identi es possible candidates
from text. This module extracts noun phrases detected in shallow parsing to be
considered as the set of candidates for being a disability.</p>
          <p>
            The second component, candidate typing in Figure 1, establishes which of
the previous noun phrases should be nally typed as disabilities (i.e. binary
classi cation). For this purpose we applied CARMEN, our general purpose NET
system [12{14]. CARMEN is a machine learning based system which employs
Random Forest (RF) algorithm [
            <xref ref-type="bibr" rid="ref3">3</xref>
            ] with the default parameters from Weka 3.8 [
            <xref ref-type="bibr" rid="ref7">7</xref>
            ],
but the number of iterations has been set to 45, as in [
            <xref ref-type="bibr" rid="ref14">14</xref>
            ]. Thus, CARMEN
consists of two phases: (i) an o ine processing step whose main goal is to train
a ML model to perform NET, and (ii) an online processing step whose aim is to
decide which previously extracted candidates are a disability.
          </p>
          <p>For each candidate, CARMEN generates a feature vector that includes
context and local information of the entity.Table 1 contains all the features generated
for the sentence in Example 1, which are further explained next.</p>
          <p>
            Context of the entity is built through pro les [
            <xref ref-type="bibr" rid="ref10">10</xref>
            ], speci cally CARMEN
denes one pro le for each entity type (being a disability or not) in an unsupervised
manner.
          </p>
          <p>
            In brief, pro les are generated as follows: For each identi ed candidate, rst
we extract lemmas of nouns, verbs, adjectives and adverbs, in a window of size W
( W2 = 5 words after and before the candidate) and their frequency as the number
of occurrences. Second, for each entity type, the training corpus is divided in
positive instances (e.g. disability) and negative instances (e.g. no disability). Third,
each lemma found only accompanying positive instances computes a relevance
index based on the term frequency, disjoint corpora frequency [
            <xref ref-type="bibr" rid="ref10">10</xref>
            ] - TFDCF;
whereas relevance common index [
            <xref ref-type="bibr" rid="ref10">10</xref>
            ] - RC - is used for the ones present in all
training instances (positive and negative). This step produces a pro le for each
entity type (e.g. disability) of P elements. Each item in a pro le is a pair
representing a lemma and its relevance index (TFDCF or RC). The length of the
pro le (P) is the number of lemmas applying TFDCF and RC indexes. P has
been set to maximum 1000 lemmas for both indexes. Once the pro les are built,
4
the feature vector of CARMEN can be enhanced with either all pro le items
(i.e. all pairs lemma and its relevance) or only with items that compute TFDCF
relevance index.
          </p>
          <p>
            As previously stated, the feature vector of CARMEN also contains local
information of the entity, such features are inspired by state-of-the-art NET
modules. These comprise words of the entity, length of the entity, su xes and
pre xes [
            <xref ref-type="bibr" rid="ref14">14</xref>
            ]. Besides, character n-grams are included as a new feature.
          </p>
          <p>Feature Description Example</p>
          <p>Relevance of lemmas of nouns, verbs, relevance(disease)=
txpro le adjectives and adverbs that appear in RC(disease)=1.43,
te a window anchored in the candidate. relevance(potentially)=
on Relevance is obtain according to TFDCF(potentially)=5.1,</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>C TFDCF and RC indexes ...</title>
    </sec>
    <sec id="sec-4">
      <title>NE Words of the entity cognitive impairment</title>
      <p>itaonNElen ESuntitxyesleanngdthprweitxheosutwsitthopa-wleonrgdtsh of 2c, co, cog, cogn,
froma xes 1a,nd2,l3asatnwdo4rdcsharacters from the rst ment, ent, nt, t</p>
    </sec>
    <sec id="sec-5">
      <title>In All lowercase character bigrams, lacharacter n-gram trigrams, fourgrams and vegrams co from the words of the NE</title>
      <p>L
co, og, gn, ni, it, ti,
iv, ve, e , i, im, mp, pa,
ai, ir, rm, me, en, nt,
t , cog, ...</p>
      <p>Last, it should be noted that adapting CARMEN to this new scenario was
straightforward, since there was no need to change the NET architecture or
its parameters. It only required: (i) a linguistic analyzer that is able to deal
with the two languages tackled in DIANN task (i.e. English and Spanish) in
order to perform sentence detection, tokenization, lemmatization, PoS-tagging
and shallow parsing; and (ii) the DIANN training corpus, which was previously
annotated with the target entity.
2.3</p>
      <sec id="sec-5-1">
        <title>Negation annotation</title>
        <p>
          Negation is tackled using a dictionary-based approach, thus having two phases:
{ An o ine step whose main goal is to build a lexicon of negation triggers. For
each language, a lexicon is created directly from DIANN training corpus.
{ A real-time processing step whose purpose is to annotate all negation triggers
of a text. Each lexicon is used to instance a Hash Gazetteer, included within
ANNIE plugin from GATE [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. It performs case insensitive exact matching
for each entry in a lexicon within a document.
        </p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>GPLSIUA Team at the DIAAN 2018 task 5</title>
      <p>2.4</p>
      <sec id="sec-6-1">
        <title>Scope annotation</title>
        <p>This stage is carried out as a set of heuristics at sentence-level. In order to
determine which negation triggers a ect disabilities, the applied rule is: for each
sentence, all negation triggers that do not co-occur with at least one disability
are removed. To be able to de ne the scope of negated disabilities, scope is
established as the anchor of negation trigger and disabilities. For instance, in
Example 1, the scope starts at the negation position (\no") and ends with the
disability (\cognitive impairment").
2.5</p>
      </sec>
      <sec id="sec-6-2">
        <title>Post-processing</title>
        <p>
          At this point, the results are stored in XML GATE stando format. As a result,
they need to be converted to DIANN format again. To that end, all documents
are transformed to an inline XML format without a root tag using GATE
Embedded [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ].
3
        </p>
        <sec id="sec-6-2-1">
          <title>Experiments</title>
          <p>As mentioned before, our interest is focused on evaluating CARMEN, our
entity typing system. Its feature set includes pro les of each entity type among
other features. Pro les are composed of pairs lemma-relevance, but relevance is
computed according to two di erent indexes (TFDCF and RC), as explained in
Section 2.2. Therefore, two experiments were submitted aiming at studying the
di erences of using both relevance indexes or only one, namely:
R1 uses the full pro le (both TFDCF and RC relevance indexes) in the feature
vector of CARMEN.</p>
          <p>R2 uses a reduced pro le that only takes into account TFDCF relevance index
in the feature vector of CARMEN.
4</p>
        </sec>
        <sec id="sec-6-2-2">
          <title>Results and Discussion</title>
          <p>Initially, the organization provided an annotated training set and an unannotated
test for both languages. Next subsections present results for entity typing alone
during training phase (Section 4.1) and o cial test results (Section 4.2) for our
complete approach. Finally, the o cial results are analyzed (Section 4.3).
4.1</p>
        </sec>
      </sec>
      <sec id="sec-6-3">
        <title>Entity Typing Training Results</title>
        <p>Since no development set was provided, CARMEN was evaluated using 2 fold
strati ed cross-validation over the annotated training set. The purpose is to
assess the entity typing task alone, assuming our candidate extraction module
is \perfect" and all possible disabilities are included in the set of candidates.
Hence, Table 2 summarizes results for being a disability reported by Weka.
6</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>Isabel Moreno, M.T. Roma-Ferri, and Paloma Moreda Table 2. Entity typing training cross-validation results</title>
      <p>
        For each language and each run, values of Area Under the ROC Curve (AUC),
Precision, Recall and F-score are reported. AUC is commonly used in biomedical
informatics research to measure the performance of a classi er, thus allowing the
comparison of several models under the same test [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
      </p>
      <p>The two rst rows show the results of the two experiments for English.
Similarly, the last two rows show the results of both experiments for Spanish</p>
      <p>
        According to AUC, in the case of Spanish, it's better to use the full pro le
(R1 - 98.7) whereas there is no such di erence for English (i.e. AUC is the
same for the two experiments). Several scales for interpreting these AUC values
exists, but there is a consensus that values greater than .96 indicate an excellent
discriminatory ability [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Therefore, all runs have an excellent AUC regardless
of the language. The best Precision, Recall and F-score is obtained for English
using the full pro le (R1). On the contrary, Spanish achieves the higher results
thanks to the reduced pro le (R2). In view of these results, combining local
information and context (pro les) is appropriate for this task.
4.2
      </p>
      <sec id="sec-7-1">
        <title>DIANN Test Results</title>
        <p>The o cial results reported by DIANN task organizers over the test set can be
found in Table 3. For each language and each run, values of Precision, Recall and
F-score are reported for di erent types of disabilities. Two types of matching are
used for the evaluation: partial and exact. First, performance for all disabilities,
regardless being negated or not, are shown (type DIS). The rst four rows show
the results of the two experiments (R1 and R2) for English and Spanish,
respectively. Similarly, the next four rows refer to negated disabilities (type NEGDIS).
Finally, the last four rows concern non-negated disabilities as well as negated
disabilities (type DIS + NEGDIS).</p>
        <p>From Table 3, we can see that partial matching always bene ts our results
regardless the type of disability (DIS, NEGDIS or DIS+NEGDIS). Besides,
English always gets the highest results. Concerning all disabilities (DIS), the best
Precision, Recall and F-score is achieved for partial matching. As in the training
phase, it should be noted that our Spanish system is more accurate using the
reduced pro le (see precision in Table 3), whereas English requires the complete
pro le. However, di erences between training (see recall and F1 in Table 2) and
test results suggest a problem in determining the boundaries of disabilities.</p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>GPLSIUA Team at the DIAAN 2018 task 7 Table 3. O cial results of the runs over the test set</title>
      <p>Regarding negated disabilities (NEGDIS), there is an striking di erence
between English and Spanish performance and English is the highest by far. For
both, the use of the complete pro le (R1) seems more appropriate.</p>
      <p>Last, concerning non-negated and negated disabilities (DIS+NEGDIS), our
rst experiment (R1) achieves the best results for English. Although Spanish
obtains the best Precision with the complete pro le, the highest Recall and
F-score is accomplished for the second experiment (R2).</p>
      <p>In general terms, our proposal performed reasonably well, particularly given
that CARMEN system was applied without ne tuning parameters or features.
Besides, no additional external knowledge has been used to nd disabilities in
this narrow domain.
4.3</p>
      <sec id="sec-8-1">
        <title>Results Analysis</title>
        <p>As previously stated, GPLSI team obtains high precision values, specially
identifying disabilities regardless being negated or not, but recall values are a bit
lower. These results are reasonably good, especially considering that (i)
CARMEN system was applied o -the-shelf; and (ii) precise system are desired in a
medical environment. In order to nd reasons for the low recall, once the
annotated test set was released, a 5% of the test set was examined carefully to nd
possible improvements to be implemented as future work.</p>
        <p>Analyzing the results, regardless of the language, we found that most errors
are related to the boundary of disabilities and negated disabilities. This is
because the extraction module often includes extra tokens or misses some of them.
Another problem found are disabilities represented by acronyms. Although the
acronym de nition usually appears in text, CARMEN is not able to classify it as
8</p>
        <p>Isabel Moreno, M.T. Roma-Ferri, and Paloma Moreda
a disability. Another source of errors is concerned with detecting certain tokens
as a disability in a document but not detecting them in another, so e ects on
recall are evident. This might be explained by two reasons. On the one hand,
more local information and context may be needed in order to build a more
robust representation of a disability. Examples of features to characterize local
information of an entity mention could be its lemma, as well as its POS and
shallow parsing tags. Additionally, such features could be also incorporated for
our pro le (i.e. lemmas in a window) jointly with word-embedding or brown
clusters to enhance context. On the other hand, no additional knowledge has
been use to determine disabilities, but it could avoid losing disabilities and has a
direct e ect on recall. Hence, as future work, we plan to implement new features
to capture both.</p>
        <p>The last source of errors concerns the negation and scope detection modules.
On the one hand, our heuristics applied at sentence-level are too optimistic.
Although a negation trigger appears in a sentence, it does not necessary a ects
all tokens in a sentence. This could be improved considering heuristics at a lower
granularity, e.g. clause-level. On the other hand, the negation lexicon does not
contain all possible triggers, thus some disabilities are not considered negated in
testing. This could be improved gathering negation triggers from other corpora.
Both issues are particularly problematic for Spanish due to its high exibility
and variance in comparison with English.</p>
        <p>Finally, there were a few annotation issues which, in our opinion, could a ect
participant systems:
{ Wrong tokenization in disability annotation: For example, \&lt;dis&gt;severe
mental illness&lt;/dis&gt;es" instead of \&lt;dis&gt;severe mental illnesses&lt;/dis&gt;";
{ Inconsistent disability annotation: Texts are the same for both languages,
but the same disabilities are not present for both versions. For example,
\nonagenarians with recent onset of &lt;dis&gt;functional impairment&lt;/dis&gt;
also bene t from rehabilitation in a medium-stay geriatric unit;[...]" but \los
pacientes nonagenarios con incapacidad reciente tambien se bene cian del
tratamiento en una UME, [...]".
5</p>
        <sec id="sec-8-1-1">
          <title>Conclusions</title>
          <p>In this paper our proposal to detect both disabilities and negated disabilities is
presented. On the one hand, negation and its scope is tacked with a set of simple
heuristics and dictionaries. On the other hand, disabilities are extracted using our
entity typing system, CARMEN, for this new task. It employs Random Forest,
a supervised machine learning algorithm. Its feature set is based on pro les
(context of the surrounding words) and information gathered from the NE itself.
In this manner, the actual performance of CARMEN is studied when applied
to a new genre and a new entity. Two experiments are presented in order to
investigate performance of two types of pro les.</p>
          <p>Our training phase results for the entity typing task alone (AUC &gt; .96 and F1
almost 84%) show all runs have an excellent discriminatory ability regardless of
GPLSIUA Team at the DIAAN 2018 task
9
the language and pro le type. Regarding o cial testing results, our recall values
are a bit lower but partial-matching precision is greater than 87% for disabilities
and negated disabilities for all languages and pro le types. These results show
our approach performs reasonably well when dealing with disabilities, specially
considering the lack of external resources or parameter tuning.</p>
          <p>Although the results are encouraging, there is still room for improvement.
To that end, an analysis of the obtained output has been carried out to explain
our results. Concerning the recall of the testing phase, it was found that (i)
boundary detection needs to be more accurate and (ii) representation of entities
may be enhanced with either more features or external knowledge. Thus, our
participation in the DIANN task has given us an excellent opportunity to study
which aspects should be considered to achieve a more versatile CARMEN.</p>
        </sec>
        <sec id="sec-8-1-2">
          <title>Acknowledgments</title>
          <p>This research is partially funded by the Spanish Government under the projects
RESCATA (reference number TIN2015-65100-R) and REDES (reference number
TIN2015-65136-C02-2-R).</p>
        </sec>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>Araujo</given-names>
            <surname>Serna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Mart</surname>
          </string-name>
          nez Romo, J.,
          <string-name>
            <given-names>Fabregat</given-names>
            <surname>Marcos</surname>
          </string-name>
          , H.:
          <article-title>Diann: Disability annotation on documents from the biomedical domain (</article-title>
          <year>2018</year>
          ), http://nlp.uned.es/diann, (last accessed May 27,
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Bethesda</surname>
          </string-name>
          (MD)
          <article-title>: National Library of Medicine (US): Metathesaurus</article-title>
          . In:
          <string-name>
            <surname>UMLS R Reference Manual</surname>
          </string-name>
          [Internet],
          <source>chap. 2</source>
          (
          <issue>2009</issue>
          ), https://www.ncbi.nlm.nih.gov/books/NBK9684/pdf/Bookshelf NBK9684.pdf
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Breiman</surname>
            ,
            <given-names>L.: Random</given-names>
          </string-name>
          <string-name>
            <surname>Forests</surname>
          </string-name>
          .
          <source>Machine Learning 45(1)</source>
          ,
          <volume>5</volume>
          {
          <fpage>32</fpage>
          (
          <year>2001</year>
          ). https://doi.org/10.1023/A:1010933404324
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Cunningham</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maynard</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bontcheva</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tablan</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ursu</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dimitrov</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dowman</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aswani</surname>
          </string-name>
          , N.:
          <article-title>Developing language processing components with GATE Version 8 (a user guide)</article-title>
          .
          <source>Department of Computer Science</source>
          (
          <year>2016</year>
          ), https://gate.ac.uk/sale/tao/tao.pdf
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Fabregat</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mart</surname>
            nez-Romo,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Araujo</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Overview of the diann task: Disability annotation task at ibereval 2018</article-title>
          .
          <source>In: Proceedings of the Workshop on Evaluation of Human Language Technologies for Iberian Languages (IberEval</source>
          <year>2018</year>
          ) (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Fan</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Upadhye</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Worster</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Understanding receiver operating characteristic (ROC) curves</article-title>
          .
          <source>Canadian Journal of Emergency Medicine</source>
          <volume>8</volume>
          (
          <issue>01</issue>
          ),
          <volume>19</volume>
          {
          <fpage>20</fpage>
          (
          <year>2006</year>
          ). https://doi.org/10.1017/S1481803500013336
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Hall</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Frank</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Holmes</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pfahringer</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Reutemann</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Witten</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>The WEKA data mining software: An update</article-title>
          .
          <source>SIGKDD Explorations Newsletter</source>
          <volume>11</volume>
          (
          <issue>1</issue>
          ),
          <volume>10</volume>
          {
          <fpage>18</fpage>
          (
          <year>2009</year>
          ). https://doi.org/10.1145/1656274.1656278
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Herrero-Zazo</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Segura-Bedmar</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          , Mart nez, P.,
          <string-name>
            <surname>Declerck</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>The DDI corpus: An annotated corpus with pharmacological substances and drug-drug interactions</article-title>
          .
          <source>Journal of biomedical informatics 46(5)</source>
          ,
          <volume>914</volume>
          {920 (oct
          <year>2013</year>
          ). https://doi.org/10.1016/j.jbi.
          <year>2013</year>
          .
          <volume>07</volume>
          .011
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Lasko</surname>
            ,
            <given-names>T.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bhagwat</surname>
            ,
            <given-names>J.G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zou</surname>
            ,
            <given-names>K.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ohno-Machado</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>The use of receiver operating characteristic curves in biomedical informatics</article-title>
          .
          <source>Journal of Biomedical Informatics</source>
          <volume>38</volume>
          (
          <issue>5</issue>
          ),
          <volume>404</volume>
          {
          <fpage>415</fpage>
          (
          <year>2005</year>
          ). https://doi.org/10.1016/j.jbi.
          <year>2005</year>
          .
          <volume>02</volume>
          .008
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Lopes</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vieira</surname>
          </string-name>
          , R.:
          <article-title>Building and Applying Pro les Through Term Extraction</article-title>
          .
          <source>In: Proceedings of the 10th Brazilian Symposium in Information and Human Language Technology</source>
          . pp.
          <volume>91</volume>
          {
          <issue>100</issue>
          (
          <year>2015</year>
          ), http://aclweb.org/anthology/W15-5613
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Moreno</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Boldrini</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moreda</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , Roma-Ferri, M.T.:
          <article-title>DrugSemantics: A corpus for Named Entity Recognition in Spanish Summaries of Product Characteristics</article-title>
          .
          <source>Journal of Biomedical Informatics</source>
          <volume>72</volume>
          ,
          <issue>8</issue>
          {
          <fpage>22</fpage>
          (
          <year>2017</year>
          ). https://doi.org/10.1016/j.jbi.
          <year>2017</year>
          .
          <volume>06</volume>
          .013
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Moreno</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          , Roma-Ferri,
          <string-name>
            <given-names>M.T.</given-names>
            ,
            <surname>Moreda</surname>
          </string-name>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          :
          <article-title>Combining pro les and local information for named entity classi cation: Adjustment of a domain and language independent approach</article-title>
          .
          <source>In: Proceedings of the Language</source>
          and Technology Conference:
          <article-title>Human Language Technologies as a Challenge for Computer Science</article-title>
          and Linguistics,
          <string-name>
            <surname>LTC</surname>
          </string-name>
          <year>2017</year>
          , Poznan, Poland,
          <source>November 17-19</source>
          ,
          <year>2017</year>
          . pp.
          <volume>73</volume>
          {
          <issue>77</issue>
          (
          <year>2017</year>
          ), http://ltc.amu.edu.pl/book/papers/IRIE1-2.pdf
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Moreno</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          , Roma-Ferri,
          <string-name>
            <given-names>M.T.</given-names>
            ,
            <surname>Moreda</surname>
          </string-name>
          ,
          <string-name>
            <surname>P.:</surname>
          </string-name>
          <article-title>A domain and language independent named entity classi cation approach based on pro les and local information</article-title>
          .
          <source>In: Proceedings of the International Conference Recent Advances in Natural Language Processing, RANLP</source>
          <year>2017</year>
          , Varna, Bulgaria, September 2 -
          <issue>8</issue>
          ,
          <year>2017</year>
          . pp.
          <volume>510</volume>
          {
          <issue>518</issue>
          (
          <year>2017</year>
          ). https://doi.org/10.26615/
          <fpage>978</fpage>
          -954-452-049-6 067
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Moreno</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          , Roma-Ferri,
          <string-name>
            <given-names>M.T.</given-names>
            ,
            <surname>Moreda</surname>
          </string-name>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          : Carmen:
          <article-title>Sistema de entity typing basado en per les [ carmen: Entity typing system based on pro les]</article-title>
          .
          <source>In: Congreso informatica para tod@s, IPT</source>
          <year>2018</year>
          , Madrid, Spain, April
          <volume>19</volume>
          -
          <fpage>20</fpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>National</surname>
          </string-name>
          <article-title>Center on Birth Defects and Developmental Disabilities, Centers for Disease Control and Prevention: Disability overview</article-title>
          (
          <year>August 2017</year>
          ), https://www.cdc.gov/ncbddd/disabilityandhealth/disability.html,
          <source>(last accessed May 27</source>
          ,
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Oronoz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gojenola</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Perez</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>de Ilarraza</surname>
            ,
            <given-names>A.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Casillas</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>On the creation of a clinical gold standard corpus in Spanish: Mining adverse drug reactions</article-title>
          .
          <source>Journal of Biomedical Informatics</source>
          <volume>56</volume>
          ,
          <issue>318</issue>
          {
          <fpage>332</fpage>
          (
          <year>2015</year>
          ). https://doi.org/10.1016/j.jbi.
          <year>2015</year>
          .
          <volume>06</volume>
          .016
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Padro</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stanilovsky</surname>
          </string-name>
          , E.:
          <article-title>FreeLing 3.0: Towards Wider Multilinguality</article-title>
          .
          <source>In: Proceedings of the Language Resources and Evaluation</source>
          Conference (may
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Roberts</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gaizauskas</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hepple</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Demetriou</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guo</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roberts</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Setzer</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Building a semantically annotated corpus of clinical texts</article-title>
          .
          <source>Journal of biomedical informatics 42(5)</source>
          ,
          <volume>950</volume>
          {66 (oct
          <year>2009</year>
          ). https://doi.org/10.1016/j.jbi.
          <year>2008</year>
          .
          <volume>12</volume>
          .013
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19. World Health Organization:
          <source>World report on disability</source>
          (
          <year>2011</year>
          ), http://www.who.int/disabilities/world report/2011/report/en/,
          <source>(last accessed May 27</source>
          ,
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>