<!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>A Hybrid Bi-LSTM-CRF model for Knowledge Recognition from eHealth documents</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Renzo M. Rivera Zavala</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>
        <contrib contrib-type="author">
          <string-name>Isabel Segura-Bedmar</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Computer Science Department, University Carlos III of Madrid</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <fpage>65</fpage>
      <lpage>70</lpage>
      <abstract>
        <p>In this work, we describe a Deep Learning architecture for Named Entity Recognition (NER) in biomedical texts. The architecture has two bidirectional Long Short-Term Memory (LSTM) layers and a last layer based on Conditional Random Field (CRF). Our system obtained the rst place in the subtask A (identi cation) of TASS-2018-Task 3 eHealth Knowledge Discovery, with an F1 of 87.2%.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Currently, the number of biomedical
literature is growing at an exponential rate. The
substantial number of research works makes
it extremely di cult for researchers to keep
up with the new development in their
research areas. Therefore, the e ective
management of a large amount of information
and the accuracy of knowledge is a vital task.</p>
      <p>Named Entities Recognition (NER) is one
of the fundamental tasks of biomedical text
mining, with the aim of identifying pieces of
text that refer to speci c entities of interest.</p>
      <p>
        There are di erent scopes to address the
NER problem. Among them, we can nd
methods based on dictionaries, which are
limited by the size of the dictionary, spelling
errors, the use of synonyms and the constant
growth of vocabulary. Rule-based methods
and Machine Learning methods usually
require both syntactic and semantic features
as well as characteristics of the language of
the speci c domain. One of the most e
ective method is Conditional Random Fields
(CRF)
        <xref ref-type="bibr" rid="ref5">(La erty, McCallum, and Pereira,
2001)</xref>
        . Recently, Deep learning-based
methods have also demonstrated state-of-the-art
performance by automatically learning of
relevant patterns from corpora, which allows
the independence of a speci c language or
domain. However, until now, Deep Learning
methods have not been able to provide
better results than those obtained by classical
traditional machine learning methods
        <xref ref-type="bibr" rid="ref7">(Limsopatham and Collier, 2016)</xref>
        .
      </p>
      <p>
        In this paper, we propose a hybrid
model combining two bidirectional Long
Short Memory (Bi-LSTM) layers with a CRF
layer. To do this, we adapt the NeuroNER
model proposed in
        <xref ref-type="bibr" rid="ref4">(Dernoncourt, Lee, and
Szolovits, 2017)</xref>
        for the subtask A (identi
cation) of TASS-2018-Task 3 eHealth
Knowledge Discovery
        <xref ref-type="bibr" rid="ref9">(Mart nez-Camara et al.,
2018)</xref>
        . Speci cally, we have extended
NeuroNER by adding context information,
Partof-Speech (PoS) tags and information about
overlapping or nested entities. Moreover, in
this work, we use two pre-trained word
embedding models: i) a word2vec model
(Spanish Billion Word Embeddings
        <xref ref-type="bibr" rid="ref3">(Cardellino,
2016)</xref>
        ), which was trained on the 2014 dump
      </p>
      <p>
        Copyright © 2018 by the paper's authors. Copying permitted for private and academic purposes.
of Wikipedia and ii) a sense-disambiguation
embedding model
        <xref ref-type="bibr" rid="ref12">(Trask, Michalak, and Liu,
2015)</xref>
        .
      </p>
      <p>The rest of the paper is organized as
follows. In Section 2, we describe the
architecture of our system. Section 3 presents the
results. In Section 4, we provide the
conclusions.
2
2.1</p>
    </sec>
    <sec id="sec-2">
      <title>System Description</title>
      <sec id="sec-2-1">
        <title>Pre-processing</title>
        <p>
          All texts were preprocessed in four steps.
First, sentences were split by using Spacy
(Space.io, 2018), an open source library for
advanced natural language processing with
support for 26 languages. Second, sentences
and their annotated entities were
transformed to the BRAT format1, a stando
format similar to BioNLP Shared Task
stando format. Then, sentences were tokenized.
Finally, each token in a sentence was
annotated using the BMEWO-V extended tag
encoding, to capture information about the
sequence of tokens in a given sentence. The
BIOES label scheme introduced in the work
of
          <xref ref-type="bibr" rid="ref2">(Borthwick et al., 1998)</xref>
          arises in order to
overcome the limitation of the BIO scheme
for the representation of discontinuous
entities. BIOES coding distinguishes the end of
an entity through the E (End) tag and adds
the S (Single) tag to denote entities
composed of a single token. The BIOES-V or
BMEWO-V encoding distinguishes the B tag
to indicate the start of an entity, the M tag
to indicate the continuity of an entity, the E
tag to indicate the end of an entity, the W
tag for indicate a single entity, and the O tag
to represent other tokens that do not belong
to any entity. The V tag allows to represent
overlapping entities. This encoding scheme
allows the representation of discontinuous
entities and overlapping or nested entities.
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Learning Transfer</title>
        <p>In our work, we propose as input of our
network two di erent embeddings: word
embeddings and sense-disambiguation embeddings.
Below we describe them in more detail.</p>
        <sec id="sec-2-2-1">
          <title>2.2.1 Words Embeddings</title>
          <p>
            Word embedding is an approach to
represent words as vectors of real numbers. There
are di erent methods to obtain these
vectors such as probabilistic models and neural
1http://brat.nlplab.org/stando .html
networks. In last years, neural networks for
training word embedding models have gained
a lot of popularity among NLP community
because they are able to capture syntactic
and semantic information among words. The
most popular methods are word2vec
            <xref ref-type="bibr" rid="ref10 ref6">(Le and
Mikolov, 2014)</xref>
            , the global aggregate model
of word-word co-occurrence statistics
            <xref ref-type="bibr" rid="ref10 ref6">(Pennington, Socher, and Manning, 2014)</xref>
            and
the morphological representation of fastText
            <xref ref-type="bibr" rid="ref1">(Bojanowski et al., 2017)</xref>
            .
          </p>
          <p>
            In this work, we used the Spanish
Billion Words
            <xref ref-type="bibr" rid="ref3">(Cardellino, 2016)</xref>
            , which is a
pretrained model of word embeddings trained
on di erent text corpora written in Spanish
(such Ancora Corpus
            <xref ref-type="bibr" rid="ref11">(Taule, Mart , and
Recasens, 2008)</xref>
            and Wikipedia). The details of
the pre-trained model are the following:
Corpus size: approximately 1.5 billions
words
Vocab size: 1000653
Array size: 300
          </p>
          <p>Algorithm: Skip-gram Bag of Words</p>
        </sec>
        <sec id="sec-2-2-2">
          <title>2.2.2 Sense-Disambiguation</title>
        </sec>
        <sec id="sec-2-2-3">
          <title>Embedding</title>
          <p>
            We also used the sense2vec
            <xref ref-type="bibr" rid="ref12">(Trask, Michalak,
and Liu, 2015)</xref>
            model, which provides
multiple embeddings for each word based on the
sense of the word. This is able to analyze the
context of a word and then assign its more
adequate vector. In this work, we used a
pretrained model generated with the sense2vec
tool with 22 million words represented in 128
features vectors trained on the 2015 Reddit.
          </p>
          <p>
            Reddit Vector is a pre-trained model of
sense-disambiguation representation vectors
presented by
            <xref ref-type="bibr" rid="ref12">(Trask, Michalak, and Liu,
2015)</xref>
            . This model was trained on a
collection of comments published on Reddit
(corresponding to the year 2015). The
pretrained Reddit vectors support the following
"senses", whether partial or full PoS tags or
entity tags. The details of the pre-trained
model are the following:
          </p>
          <p>Corpus size: approximately 2 billions
words
Vocab size: 1 million
Array size: 128
Algorithm: Sense2Vec</p>
        </sec>
        <sec id="sec-2-2-4">
          <title>2.3.1 Character Embedding</title>
        </sec>
        <sec id="sec-2-2-5">
          <title>Bi-LSTM layer</title>
          <p>
            Although the word embeddings are able to
capture syntactic and semantic information,
other linguistic information such as
morphological information, orthographic
transcription or PoS tags are not exploited.
According to
            <xref ref-type="bibr" rid="ref8">(Ling et al., 2015)</xref>
            , the use of character
embeddings improves learning for speci c
domains and is useful for morphologically rich
languages. For this reason, we decided to
consider the character embedding
representation in our system. We used a vector of 25
dimensions to represent each character. The
character alphabet includes all 121 unique
characters in the TASS-2018-Task 3 eHealth
Knowledge Discovery training, development
and test datasets and the token PADDING.
In this way, tokens in sentences are
represented by their corresponding character
embeddings, which are the input for the rst
Bi-LSTM network.
          </p>
        </sec>
        <sec id="sec-2-2-6">
          <title>2.3.2 Word and Sense embedding</title>
        </sec>
        <sec id="sec-2-2-7">
          <title>Bi-LSTM layer</title>
          <p>The output of the rst layer is
concatenated with the word embeddings and with
the sense-disambiguation embeddings of the
tokens in a given input sentence. This
concatenation of features is the input for the
second Bi-LSTM layer. The goal of this layer
is to obtain a sequence of probabilities
corresponding to each label of the BMEWO-V
encoding format. In this way, for each
input token, this layer returns six probabilities
(one for each tag in BMEWO-V). The nal
tag should be that with highest probability.</p>
          <p>The parameters of the sets and the hyper
parameters of the models are the following:
Words Embedding Dimension: 300
Characters Embedding Dimension: 25
Hidden Layers Dimension: 100 (for each
LSTM: for the forward and backward
layers)
Learning method: SGD, learning ratio:
0.005
Dropout: 0.5</p>
          <p>Epochs: 100</p>
        </sec>
        <sec id="sec-2-2-8">
          <title>Conditional Random Fields (CRF) layer</title>
          <p>To improve the accuracy of predictions, we
also used a CRF model trained, which takes
as input the output of the previous layer and
obtains the most probable sequence of
predicted labels.
2.4</p>
        </sec>
      </sec>
      <sec id="sec-2-3">
        <title>Post-processing</title>
        <p>Once tokens have been annotated with their
corresponding labels in the BMEWO-V
encoding format, the entity mentions must be
transformed to the BRAT format. V tags,
which identify nested or overlapping entities,
are generated as new annotations within the
scope of other mentions.
3
3.1</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Evaluation</title>
      <sec id="sec-3-1">
        <title>Datasets</title>
        <p>The evaluation of the proposed model
was carried out using the annotated
corpus proposed in the
TASS-2018Task 3 eHealth Knowledge Discovery
(https://github.com/tass18-task3/data).</p>
        <p>The training set is made up of 5
documents with 3276 entities annotations. The
development set consists of 1 text document
with 1958 entities annotations. The test set
consists of 1 text document (see Table 2).
There are two types of of entities: concepts
and actions. For this reason, tokens can be
annotated with di erent labels (see Table 1)
following the BMEWO-V encoding format.</p>
        <sec id="sec-3-1-1">
          <title>Entity Tags</title>
          <p>Concept B/M/E/W/V-Concept
Action B/M/E/W/V-Action
Others O</p>
          <p>In our experiments, we used precision,
recall and F1 score to evaluate the
performance of our system. The TASS-2018-Task
3 considers two di erent criteria: the
partial matching (a tagged entity name
is correct only if there is some overlap
between it and a gold entity name) and
exact matching (a tagged entity name
is correct only if its boundary exactly
match with a gold entity name). A
detailed description of evaluation is in the
web (http://www.sepln.org/workshops/
tass/2018/task-3/evaluation.html).
Moreover, we used evaluation script
(https://github.com/TASS18-Task3/
data/blob/master/score_training.py)
provided by the shared task organizers to
evaluate our system.
3.2</p>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>Results</title>
        <p>As it was described above, our system is
based on network with two Bi-LSTM layers
and a last layer for CRF. In the rst
BiLSTM layer, we consider the character
embeddings. In the second layer, we
concatenate the output of the rst layer with word
embeddings and sense-disambiguate
embeddings. Finally, the last layer uses a CRF to
obtain the most suitable labels for each
token.</p>
        <p>Table 3 compares the results obtained
using the NeuroNER system with our extended
version using pre-trained embeddings models
and the BMEWO-V encoding format. Our
extended version of NeuroNER achieves a
signi cant improvement of the results (more
than 7.2% in F1).</p>
        <sec id="sec-3-2-1">
          <title>System P</title>
          <p>NeuroNER 0.824
ext. Neu- 0.862
roNER</p>
          <p>In the substask A (identi cation of key
phrases), our system obtained the top micro
F1 (0.872) (see Table4). It signi cantly
outperform the rest of participating systems. We
will wait to review the proposed systems in
greater depth in order to establish
comparisons and possible improvements to our
implementation.</p>
        </sec>
        <sec id="sec-3-2-2">
          <title>System</title>
        </sec>
        <sec id="sec-3-2-3">
          <title>Extended</title>
        </sec>
        <sec id="sec-3-2-4">
          <title>NeuroNER</title>
          <p>plubeda
upf-upc
VSP
Marcelo
P R F
0.862 0.882 0.872
0.77
0.86
0.31
0.11
0.81
0.75
0.32
0.32
0.79
0.80
0.32
0.17
4</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusions</title>
      <p>Named Entity Recognition (NER) is a crucial
tool in text mining tasks. In this work, we
propose a hybrid Bi-LSTM and CRF model
adding sense-disambiguation embedding and
an extended tag encoding format to detect
discontinuous entities, as well as
overlapping or nested entities. Our system is able
to achieve satisfactory performance without
requiring speci cally domain knowledge or
hand-crafted features. It is also important to
highlight the language independence, which
is key to multi-language tasks. Our results
demonstrated that the extended BMEWO-V
encoding improves the result of the
predictions. Moreover, the pre-trained models help
to reduce training time and increase the
accuracy of labeling, achieving the highest F1
for the subtask A.</p>
      <p>We plan to try with other embeddings
models such as the FastText model, which
contains morphological information.
Moreover, we will extend the encoding format
to capture distinct types of overlapping or
nested entities.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgement</title>
      <p>This work was supported by the Research
Program of the Ministry of Economy and
Competitiveness - Government of Spain
(project DeepEMR: Clinical information
extraction using deep learning and big data
techniques-TIN2017-87548-C2-1-R)</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>Bojanowski</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , E. Grave,
          <string-name>
            <given-names>A.</given-names>
            <surname>Joulin</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Mikolov</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Enriching word vectors with subword information</article-title>
          .
          <source>Transactions of the Association for Computational Linguistics</source>
          ,
          <volume>5</volume>
          :
          <fpage>135</fpage>
          {
          <fpage>146</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>Borthwick</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Sterling</surname>
          </string-name>
          , E. Agichtein, and
          <string-name>
            <given-names>R.</given-names>
            <surname>Grishman</surname>
          </string-name>
          .
          <year>1998</year>
          .
          <article-title>Exploiting Diverse Knowledge Sources via Maximum Entropy in Named Entity Recognition</article-title>
          .
          <source>Technical report.</source>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <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="ref4">
        <mixed-citation>
          <string-name>
            <surname>Dernoncourt</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>J. Y.</given-names>
            <surname>Lee</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Szolovits</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Neuroner: an easy-to-use program for named-entity recognition based on neural networks</article-title>
          .
          <source>In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing: System Demonstrations</source>
          , pages
          <volume>97</volume>
          {
          <fpage>102</fpage>
          .
          <article-title>Association for Computational Linguistics</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>La erty</surname>
            , J.,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>McCallum</surname>
            , and
            <given-names>F. C.</given-names>
          </string-name>
          <string-name>
            <surname>Pereira</surname>
          </string-name>
          .
          <year>2001</year>
          .
          <article-title>Conditional random elds: Probabilistic models for segmenting and labeling sequence data</article-title>
          .
          <source>In Proceedings of the Eighteenth International Conference on Machine Learning (ICML '01)</source>
          , pages
          <fpage>282</fpage>
          {
          <fpage>289</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>Le</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          and
          <string-name>
            <given-names>T.</given-names>
            <surname>Mikolov</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Distributed representations of sentences and documents</article-title>
          .
          <source>In International Conference on Machine Learning</source>
          , pages
          <volume>1188</volume>
          {
          <fpage>1196</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Limsopatham</surname>
            ,
            <given-names>N. and N.</given-names>
          </string-name>
          <string-name>
            <surname>Collier</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Learning orthographic features in bidirectional lstm for biomedical named entity recognition</article-title>
          .
          <source>In Proceedings of the Fifth Workshop on Building and Evaluating Resources for Biomedical Text Mining (BioTxtM2016)</source>
          , pages
          <fpage>10</fpage>
          {
          <fpage>19</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <surname>Ling</surname>
            , W., T. Lu s, L. Marujo,
            <given-names>R. F.</given-names>
          </string-name>
          <string-name>
            <surname>Astudillo</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Amir</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Dyer</surname>
            ,
            <given-names>A. W.</given-names>
          </string-name>
          <string-name>
            <surname>Black</surname>
            ,
            <given-names>and I.</given-names>
          </string-name>
          <string-name>
            <surname>Trancoso</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Finding function in form: Compositional character models for open vocabulary word representation</article-title>
          .
          <source>In Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing</source>
          , page
          <volume>1520</volume>
          {
          <fpage>1530</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <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>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Mun</surname>
          </string-name>
          <article-title>~oz, A. PiadMor s, and</article-title>
          <string-name>
            <given-names>J.</given-names>
            <surname>Villena-Roman</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Overview of TASS 2018: Opinions, health and emotions</article-title>
          . In E. Mart nezCamara,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Almeida Cruz</surname>
          </string-name>
          , M. C.
          <article-title>D az-</article-title>
          <string-name>
            <surname>Galiano</surname>
            ,
            <given-names>S. Estevez</given-names>
          </string-name>
          <string-name>
            <surname>Velarde</surname>
            ,
            <given-names>M. A.</given-names>
          </string-name>
          <string-name>
            <surname>Garc</surname>
            a-Cumbreras,
            <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</surname>
            ,
            <given-names>A. Montejo</given-names>
          </string-name>
          <string-name>
            <surname>Raez</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Montoyo</surname>
            <given-names>Guijarro</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Mun</surname>
          </string-name>
          <article-title>~oz Guillena, A. Piad Mor s, and</article-title>
          J. Villena-Roman, editors,
          <source>Proceedings of TASS 2018: Workshop on Semantic Analysis at SEPLN (TASS</source>
          <year>2018</year>
          ), volume
          <volume>2172</volume>
          <source>of CEUR Workshop Proceedings</source>
          , Sevilla, Spain, September. CEUR-WS.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <surname>Pennington</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Socher</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Manning</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Glove: Global vectors for word representation</article-title>
          .
          <source>In Proceedings of the 2014 conference on empirical methods in natural language processing (EMNLP)</source>
          , pages
          <fpage>1532</fpage>
          {
          <fpage>1543</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <surname>Taule</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Mart</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Recasens</surname>
          </string-name>
          .
          <year>2008</year>
          .
          <article-title>Ancora: Multilevel annotated corpora for catalan and spanish</article-title>
          .
          <source>In LREC 2008</source>
          , pages
          <fpage>96</fpage>
          {
          <fpage>101</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <surname>Trask</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Michalak</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Liu</surname>
          </string-name>
          .
          <year>2015</year>
          . sense2vec
          <article-title>- a fast and accurate method for word sense disambiguation in neural word embeddings</article-title>
          .
          <source>CoRR, abs/1511</source>
          .06388.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>