<!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>Construction of UMLS Metathesaurus with Knowledge-Infused Deep Learning</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Hong Yung Yip</string-name>
          <email>hyip@email.sc.edu1</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vinh Nguyen</string-name>
          <email>vinh.nguyen@nih.gov2</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Olivier Bodenreider</string-name>
          <email>obodenreider@mail.nih.gov2</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Semantic Similarity</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Artificial Intelligence Institute, University of South Carolina</institution>
          ,
          <addr-line>Columbia, SC</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>National Library of Medicine, National Institute of Health</institution>
          ,
          <addr-line>Bethesda, MD</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The Unified Medical Language System (UMLS) is a Metathesaurus of biomedical vocabularies developed to integrate a variety of ways the same concepts are expressed by different terminologies and to provide cross-walk among them. However, the current process of constructing and inserting new resources to the existing Metathesaurus relies heavily on lexical knowledge, semantic pre-processing, and manual audits by human editors. This project explores the use of supervised Deep Learning approach to identify synonymy and non-synonymy among English UMLS concepts at the atom level. We use a Siamese network with Long ShortTerm Memory and Convolutional Neural Network models to learn the similarities and dissimilarities between pairs of atoms from the active subset of 2019AA UMLS. To disambiguate concepts with lexically identical atoms, we contextualize the pairs with various enrichment strategies that reflect the information available to the UMLS editors including the source synonymy, hierarchical context, and source semantic group. Learning from base lexical features of the atoms yields an overall F1-score of 75.97%. Infusing source synonymy to the base yields a higher precision and overall F-1 score of 86.54% and 87.63% respectively. Whereas, infusing hierarchical context trades precision for higher recall of 90.38%. Infusing source synonymy, hierarchical context, and semantic group provides an overall increase in accuracy to 95.20%. However, infusing source synonymy of hierarchical context does not yield any noticeable improvement. A knowledge-infused learning approach provides a good performance indicating promising potential for emulating the current building process. Future works include evaluation with rule-based normalization approach of constructing the Metathesaurus and investigation of the applicability, maintenance, and scalability of these models.</p>
      </abstract>
      <kwd-group>
        <kwd>Unified Medical Language System</kwd>
        <kwd>Deep Learning</kwd>
        <kwd>Contextualized Knowledge Graph</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        The Unified Medical Language System (UMLS) is a rich repository of biomedical
vocabularies developed by the US National Library of Medicine. It is an effort to
overcome challenges to effective retrieval of machine-readable information. One
of which is the variety of ways the same concepts are expressed by different
terminologies [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. For example, the concept of "Addison’s Disease" is expressed as
"Primary hypoadrenalism" in the Medical Dictionary for Regulatory Activities
(MedDRA) and as "Primary adrenocortical insufficiency" in the 10th revision of
the International Statistical Classification of Diseases and Related Health
Problems (ICD-10). The lack of integration between these synonymous terms often
leads to poor interoperability between information systems (i.e. how does one
map a concept from one terminology to another) and confusion among health
professionals. Hence, the UMLS aims to integrate and provide cross-walk among
various terminologies as well as facilitate the creation of more effective and
interoperable biomedical information systems and services, including electronic
health records 3. Till date, it is increasingly being used in areas such as patient
care coordination, clinical coding, information retrieval, and data mining. There
are three components to the UMLS Knowledge Sources: the Metathesaurus, the
Semantic Network, and the SPECIALIST Lexicon and Lexical Tools.
      </p>
      <p>
        The Metathesaurus is a vocabulary database organized by concept or
meaning. It is built from the electronic versions of various thesauri, code sets,
classifications, and lists of controlled terms used in biomedical, clinical, and health
services, known as "terminologies" or interchangeably as "source vocabularies".
It connects alternative names (i.e. name variants) that are considered to be
synonymous under the same concept and identifies useful relationships between
various concepts [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Concepts are assigned at least one Semantic Type from the
Semantic Network to provide semantic categorization. The Lexical Tools provide
lexical information for language processing such as identifying string variants
and providing normalization as normalized string indexes to the Metathesaurus.
As of May 6, 2019, the 2019AA release of the UMLS Metathesaurus contains
approximately 3.85 million biomedical and health-related concepts and 14.6
million concept names from 210 source vocabularies including the National Center
for Biotechnology Information (NCBI) taxonomy, Systematized Nomenclature of
Medicine - Clinical Terms (SNOMED CT), Gene Ontology, the Medical Subject
Headings (MeSH), and OMIM4.
1.1
      </p>
      <sec id="sec-1-1">
        <title>Construction of the UMLS Metathesaurus</title>
        <p>The current approach of building the Metathesaurus relies on the use of
lexical knowledge, semantic pre-processing, and UMLS human editors. The core
3 https://www.nlm.nih.gov/research/umls/index.html
4 https://www.nlm.nih.gov/research/umls/knowledge_sources/metathesaurus/
release/notes.html
idea is that synonymous terms originating from different source vocabularies are
clustered into a concept with a preferred term and a Concept Unique Identifier
(CUI). The basic building block of the Metathesaurus, also known as an "atom",
is a concept string from each of the source vocabularies. Simply put, each
occurrence of a string in each source vocabulary is assigned a unique atom identifier
(AUI). When a lexically identical string appears in multiple source vocabularies
for example "Headache" appearing in both MeSH and ICD-10, they are assigned
different AUIs. These AUIs are then linked to a single string identifier (SUI) to
represent occurrences of the same string. Each SUI is linked to all of its
English lexical variants (detected using the Lexical Variant Generator tool) by a
common term identifier (LUI). These LUIs may subsequently be linked to more
than one CUI due to strings that are lexical variants of each other have different
meanings. Table 1 illustrates how synonymous terms are clustered into a CUI.</p>
        <p>
          In addition, some source vocabularies provide source synonyms, hierarchical
and non-hierarchical relationships as well as metadata information for semantic
pre-processing. The UMLS human editors are involved to associate concepts
and perform manual reviews [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. These processes of constructing and inserting
new resources to the existing Metathesaurus from identifying lexical variants
to manual audits by domain experts can be both arduous and time-consuming
given the current size of Metathesaurus comprises of over 3.85 million concepts.
Given the recent successes of supervised Deep Learning (DL) approaches in their
applications to the medical and healthcare domains [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ], we hypothesize that these
DL models can be trained to emulate the current building process.
1.2
        </p>
      </sec>
      <sec id="sec-1-2">
        <title>Supervised Deep Learning</title>
        <p>
          Supervised DL is a learning function that maps an input to an output based
on examples of input-output pairs through layers of dense networks [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. The
Metathesaurus comprises of approximately 10 million English atoms with each
assigned a CUI. One can simply train a supervised classifier to predict which
CUI should be labeled to a "new" atom (since atoms having the same CUI
are synonymous) as an approach to insert new resources to the current
Metathesaurus. However, this approach is considered as an extreme classification task [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]
due to the huge prediction space of 3.85 million CUIs. Nonetheless, the CUI is
merely a "mechanism" to cluster synonymous terms under the same "bucket".
We are primarily interested in whether two atoms are synonymous and hence be
labeled with the same CUI regardless of whether this CUI has already existed
in the Metathesaurus. Hence, this project is modeled as a similarity task where
we want to assess similarity based not only on the lexical features of an atom
but also based on its context (represented by the lexical features of neighboring
concepts in this source vocabulary). Concretely, a fully-trained model should
identify and learn scenarios where
1. Atoms that are lexically similar in nature but are not synonymous, e.g.,
"Lung disease and disorder" versus "Head disease and disorder"
2. Atoms that are lexically dissimilar but are synonymous, e.g., "Addison’s
disease" versus "Primary adrenal deficiency"
        </p>
        <p>
          Similarity assessment between words and sentences, also known as
Semantic Text Similarity (STS) task is an active research area in Natural Language
Processing (NLP) due to its crucial role in various downstream tasks such as
information retrieval, machine translation, and in our case, synonyms clustering.
The STS task can be expressed as follows: given two sentences, a system returns a
probability score of 0 to 1 indicating the degree of similarity. STS is a challenging
task due to the inherent complexity in language expressions, word ambiguities,
and variable sentence lengths. Traditional approach relies on hand-engineering
lexical features (e.g. word overlap and subwords [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], syntactic relationship [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ],
structural representations [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]), linguistic resources (e.g. corpora), bag-of-words
and term frequency–inverse document frequency (TF-IDF) models that
incorporate a variety of similarity measures [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] for example string-based [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] and
termbased [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. However, most are syntactically and semantically constrained. Recent
successes in STS [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] in predicting sentence similarity and relatedness have been
obtained by using corpus-based [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] and knowledge-based similarity, e.g. word
embedding for feature representation [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] with supervised DL approaches, e.g.
Siamese Network with Recurrent Neural Network (RNN) [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] and Convolutional
Neural Networks (CNN) [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] to perform deep analysis of words and sentences to
learn the necessary semantics and structure.
1.3
        </p>
      </sec>
      <sec id="sec-1-3">
        <title>Siamese Recurrent Architecture</title>
        <p>
          Contrary to the traditional neural network which takes in one input at a time,
the Siamese network is an architecture that takes in a pair of inputs and learns
representations based on the explicit similarity and dissimilarity information (i.e.
the pair of similar and dissimilar inputs) [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. It was originally used for
signature verification [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] and has since been applied to various applications such as
face verification [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], unsupervised acoustic modeling [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ], and learning semantic
entailment [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] as well as text similarity [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ]. A series of DL models can be
incorporated within the Siamese architecture. RNN is a type of DL model that excels
at processing sequential information due to the presence of memory cell to store
and "remember" data read over time [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ]. Another variant of RNN is the Long
Short-Term Memory (LSTM). It enhances the standard RNN to handle
longterm dependencies and to minimize the inherent vanishing gradient problem of
RNN with the introduction of "gates" (input, output and forget gates) to control
the flow of and retain information better through time. It is more accurate in
handling long sequences, however, it comes at the cost of higher memory
consumption and slower training times compared to standard RNN which is faster
but less accurate. Nonetheless, a combination of Siamese network with RNN and
LSTM have been applied to various NLP tasks including similarity assessment
with great success [
          <xref ref-type="bibr" rid="ref14 ref21 ref22">14,21,22</xref>
          ]. On the other hand, CNN (another type of DL
model) has also performed well in NLP due to its ability to extract distinctive
features at a higher granularity [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ]. A Siamese CNN model learns sentence
embedding and predicts sentence similarity with features from various convolution
and pooling operations [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ].
        </p>
        <p>In this paper, we explore the use of DL, specifically the Siamese recurrent
architecture with a combination of LSTM and CNN for the following
contributions:
1. Identify synonymy and non-synonymy among English UMLS concepts at
the atom level (i.e. given two English atoms, are they synonymous and thus
belong to the same CUI?)
2. Investigate whether the DL approach could emulate the current
Metathesaurus building process
2</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>Methodology</title>
      <p>The scope of this project can be divided into four components: (i) retrieving
and parsing the UMLS dataset, (ii) generating features for learning, (iii)
designing the Siamese architecture, and (iv) evaluating the Siamese network with
different data enrichment strategies (i.e., infusing various knowledge
provided by the source vocabularies). The UMLS dataset used in this study can be
retrieved with a UMLS license at https://www.nlm.nih.gov/research/umls/
licensedcontent/umlsknowledgesources.html.
2.1</p>
      <sec id="sec-2-1">
        <title>Dataset</title>
        <p>We use the active subset of the 2019AA UMLS and remove the derivative,
duplicative, and spelling variants sources. The final dataset consists of 9,533,853
atoms grouped into 3,793,516 CUIs. Table 2 shows the sources removed.
2.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Feature Engineering</title>
        <p>The goal is to learn the similarities between pairs of atoms within a CUI and
dissimilarities between pairs of atoms from different CUIs. Prior to generating
the positive and negative pairs, we preprocess the lexical features of the atoms</p>
        <sec id="sec-2-2-1">
          <title>Derivative and</title>
        </sec>
        <sec id="sec-2-2-2">
          <title>Duplicative</title>
        </sec>
        <sec id="sec-2-2-3">
          <title>Spelling Variants</title>
        </sec>
        <sec id="sec-2-2-4">
          <title>Sources Removed</title>
        </sec>
        <sec id="sec-2-2-5">
          <title>Sources</title>
          <p>
            similar to how [
            <xref ref-type="bibr" rid="ref25">25</xref>
            ] preprocess their dataset (remove all punctuation except
hyphen, lowercase, and tokenize by space) to ensure conformity as we leverage their
pre-trained BioWordVec embedding in our downstream network (Section 2.4).
Synonyms. We generate positive pairs based on CUI-asserted synonymy
between atoms. Table 3 shows examples of positive pairs generated from one CUI.
Non-Synonyms. On the contrary, it is computationally infeasible, time and
space complexities wise, to generate all the negative pairs, which is
approximately 9.5 million atoms squared since it is one atom against all other atoms
from non-related CUIs. In addition, the class imbalance between positive and
negative will induce learning bias in which the model will suffer from lower
precision in detecting synonyms due to a higher preference towards non-synonyms.
Intuitively, we want the DL model to learn interesting negative pairs that are
lexically similar but differ in semantics. Hence, we adopt a heuristic approach to
reduce the sample space where we compute Jaccard index between atoms to
include only negative pairs with high Jaccard similarity from different CUIs (with
a cut-off threshold of 0.6 Jaccard index) (Table 4). The pairs are then sorted
from the highest to lowest Jaccard index and the number of inclusion pairs is
shown in Table 5. The final dataset consists of pairs of strings sampled in a
1:1, 3:1, 4:1, 6:1, and 10:1 ratio of between-CUI (negative) pairs to within-CUI
(positive) pairs. These ratios are adopted from [
            <xref ref-type="bibr" rid="ref18 ref19">18,19</xref>
            ] for Siamese networks.
          </p>
          <p>J accardIndex(A; B) = jA \ Bj =
jA [ Bj</p>
          <p>jA \ Bj
jAj + jBj jA \ Bj
(1)
2.3</p>
        </sec>
      </sec>
      <sec id="sec-2-3">
        <title>Experiments</title>
        <p>The entry point of our experiment is the lexical features of an atom. However, in
order to disambiguate concepts with lexically identical atoms, e.g. the concept
"nail" with CUI "C0222001" and "C0021885" shown in Figure 1, there is a need
to contextualize the two different "nail" concepts (denoted by two distinct CUIs)
with additional features/ knowledge that indicate different meanings. Hence, we
compose the experiments (Table 6) with different data enrichment strategies
i.e. infusing various knowledge that reflect the information available to the
UMLS editors during manual construction of the Metathesaurus including the
source synonymy, hierarchical context, and source semantic group.
Base. The base consists of only the lexical features of an atom for all synonym
(positive) and non-synonym (negative) pairs.</p>
        <p>Source synonymy. Some source vocabularies provide synonyms to the atoms
which enrich the original atom with additional lexical features that are
synonymous. We generate these source synonyms based on the Source Concept Unique
Identifier (SCUI) of each atom.</p>
        <p>Hierarchical context. Some source vocabularies provide hierarchical
relationships (ancestor-descendant or parent-child or broader-narrow relations) which
extend the original atom with surrounding contexts. We generate the
hierarchical context using the unique lexical features of immediate (1-level) parents and
children based on the source relations.</p>
        <p>Semantic group. The semantic group provides an additional layer of high-level
semantic categorization to an atom. Figure 1 shows the two concepts "nail" are
syntactically similar but they differ in semantics in which one refers to "anatomy"
and another refers to the "devices". We assign semantic group based on the
second-level concept from the root node of the original atom as a proxy to
semantic categorization. For source vocabularies that do not provide hierarchical
relationships, we assign a semantic group to the best knowledge of the human
editors to the source of these atoms.
pathological conditions
anatomical disease finding
Synonyms provided by the
source vocabulary</p>
        <p>nails,
fingernails,
toenails
Synonyms provided by the
source vocabulary
pathological conditions
anatomical</p>
        <p>nail
C0222001</p>
        <p>Anatomy</p>
        <p>CONCEPT</p>
        <p>DISAMBIGUATION
malformed nail</p>
        <p>dystrophic nail
congenital malformed nails,
congenital onychodystrophy
Synonyms provided by the
source vocabulary
onychodystrophy,
poor nail formation,</p>
        <p>nail dystrophy
Synonyms provided by the
source vocabulary</p>
        <p>Devices
device physical object</p>
        <p>nail</p>
        <p>C0021885
intramedullary nail
fracture fixation intramedullary,
osteosynthesis fracture intramedullary,
intramedullary nailing
Synonyms provided by the
source vocabulary
Two different Siamese Models are designed: the Siamese LSTM and Siamese
CNN-LSTM.</p>
        <p>
          Siamese LSTM. This model adopts the Siamese structure from [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] (Figure
2). A pair of atoms are first transformed into their respective numerical word
representations, i.e. embedding of word vectors. A word embedding is a language
modeling and feature learning techniques in NLP where words are mapped to
vectors of real numbers with varying dimensions. These word vectors are
positioned in the vector space in a manner where words that share similar contexts
in the corpus are situated close to one another in the space [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ]. Instead of
training the word vectors from scratch, we leverage the pre-trained biomedical word
embedding (BioWordVec-intrinsic) with dimension size of 200 per word vector
that is trained on PubMed text corpus and MeSH data [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ]. The rationale is to
"precondition" the Siamese network with prior knowledge of the inherent
similarity between words in the UMLS vocabulary. Upon plotting a word length
distribution, approximately 97% of atoms in the UMLS have a word length of
lesser or equal to 30. Hence, we apply padding or truncation to restrict the word
length of each atom to a maximum of length 30 to ensure a uniformity in
dimension to speed up the training process. The embedding of the pair of atoms
are fed to LST MA and LST MB which each processes one of the atoms in the
given pair and consists of 50 hidden learning units. These units learn the specific
semantic and syntactic features based on word orders of each individual atoms
through time. The output of the model is a Manhattan distance similarity
function, exp( jjLST MA LST MBjj1) 2 [0; 1], a function that is well-suited for
high dimensional space [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ]. We apply this model to Experiment 1.
        </p>
        <p>Similarity between 0...1</p>
        <p>Manhattan Distance Similarity Function
l
e
d
o
M
d
e
r
a
h
S</p>
        <p>LSTMA</p>
        <p>LSTMB
=
=
BioWordVec Embedding</p>
        <p>BioWordVec Embedding
use BioWordVec to “precondition” the model with the</p>
        <p>inherent similarity between words
Truncate/ Pad to 30 words</p>
        <p>Truncate/ Pad to 30 words
Lung disease and disorder</p>
        <p>Head disease and disorder</p>
        <p>
          Siamese CNN-LSTM. We use this model for Experiment 2, 3, 4, and 5 to
infuse the additional knowledge and features: source synonymy, hierarchical
context, and semantic group information. This model adopts the Siamese structure
from [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ] (Figure 3). It differs from the first architecture in its hidden learning
layers. For this model, instead of having only one embedding from the lexical
features of the atoms, we concatenate two extra vectors learned from the
embedding that represents the extra context information to the original atom vector.
To generate the "context bag", we extract 60 unique lexical features from source
synonyms and/or hierarchical context to enrich the base features of an atom and
sort them in alphabetical order to minimize word order randomness as the word
order is less prioritized prior to transforming them into a context embedding.
We apply one layer of CNN with 100 filters and a window size of 5 [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ] with
batch normalization (to reduce overfitting) to extract and generate an
intermediary representation and subsequently apply a layer of LSTM with 50 hidden
learning units to learn these features. Similarly, the semantic group information
is "infused" by transforming it using BioWordVec embedding and subsequently
feeding it to a layer of LSTM with 50 hidden units. The outputs of each LSTM
layer (base, context, and semantic group) are averaged over time and these three
50-dimensional vectors are concatenated and used as input to a 2-layer dense
Fully Connected (FC) network with learning units of 128 and 50 respectively
and Manhattan distance similarity function, exp( jjF CA F CBjj1) 2 [0; 1], as
the final output layer. The parameters of both models are optimized using the
Adam method [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ].
Fully Connected Layer (50)
        </p>
        <p>Fully Connected Layer (128)
Concatenated Vectors
“Base” Vector
“Context” Vector</p>
        <p>“SG” Vector</p>
        <p>LSTM
Learn word order and features</p>
        <p>LSTM
Learn word features/ context</p>
        <p>LSTM</p>
        <p>Learn word order and features
200
30 BioWordVec</p>
        <p>Embeddings
30</p>
        <p>200
BioWordVec</p>
        <p>Embeddings
nail</p>
        <p>anatomy</p>
        <p>CNN Conv1D
Extract word features</p>
        <p>200
60 BioWordVec</p>
        <p>Embeddings
anatomical
conditions
congenital
disease
dystrophic
dystrophy
finding
fingernails
formation
malformed
nails
onychodystrophy
pathological
poor
toenails
Extract only unique lexical features to</p>
        <p>enrich the “base” and sort to
“eliminate” word order randomness</p>
        <p>Context Bag</p>
        <p>Each experiment (Experiment 1, 2, 3, 4, 5) is trained against five various
proportions (1:1, 3:1, 4:1, 6:1, and 10:1 ratio) of negative to positve pairs
independently for 20 epochs and validated with 5-fold cross-validation with Biowulf
Cluster from the National Institute of Health (NIH) High-Performance
Computing (HPC) Systems using a mix of Nvidia Tesla P100 and V100 graphical
processing unit. A set of experiments are conducted prior on a small data set
(training and validation size of 100,000 and 20,000 respectively) to gauge the
performance and desired capabilities of the models as well as to fine-tune the
hyper-parameters with different incremental range (e.g. learning rate with a
range of 0.0005 to 0.001, batch size with a range from 128 to 512). Table 7
summarizes the final set of parameters and hyper-parameters that are used for
Siamese LSTM (baseline experiment 1) and Siamese CNN-LSTM (enriched
experiment 2, 3, 4, and 5) respectively.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Results and Evaluations</title>
      <p>We evaluate the performance of the models in terms of validation accuracy,
precision, recall, overall F1-Score, specificity, sensitivity, and false-positive rate.
Out of all the various proportions of negative to positive pairs, the 6:1 ratio
achieves the best performance in terms of validation accuracy in identifying
and classifying synonyms and non-synonyms. Table 8 shows the full performance
metrics achieved by the 6:1 ratio of negative to positive pairs and Table 9 shows
various examples of true positives and true negatives correctly identified, false
positives identified, and false negatives not identified by experiment 5.
Based on Table 8, we observe that using only the lexical features of atom yields an
overall F1-score of 75.97%. Infusing source synonymy to the base yields a higher
precision and overall F-1 score of 86.54% and 87.63% respectively. Whereas,
infusing hierarchical context trades precision for higher recall of 90.38%. Infusing
source synonymy, hierarchical context, and the semantic group gives an overall
boost to the accuracy of 95.20%. However, infusing source synonymy of
hierarchical context does not yield any noticeable improvement. Some of the plausible
explanations are synonyms provided by the source are closely related and they
are alternative variants to the base atom, hence the higher precision. Whereas,
hierarchical contexts or parents and children relationships represent broader and
narrower relations that encompass a wider variety of lexical features to the base
atom, hence the higher recall. However, extending the hierarchical context to
include the source synonymy of the parents and children atoms may be
overstretched from the original semantics of the base atom and the model may
perceive them as noise.</p>
      <p>Based on Table 9, we observe the performance of the trained Siamese model
from Experiment 5 on real-scenario examples. With the incorporation of LSTM,
the model is able to handle both short and long sequences as well as learn the
positional variants of the atoms, e.g. "injury of salivary gland" versus "salivary
gland injury". Combining with CNN, the model is able to extract and learn
pairs that are lexically similar in nature but are not synonymous, e.g., "product
containing only iron medicinal product" versus "product containing only
levorphanol medicinal product" and vice versa, atoms that are lexically dissimilar but
are synonymous, e.g., "avulsion" versus "fracture sprain". Nonetheless, for words
that are closely related to each other semantically such as "wrist" and "knee",
and "wound" and "cyst", the model fails to recognize them as non-synonyms.
In addition, the model fails to identify synonyms with lexical features that are
rare such as "pyelotomy" which indicates that there is still room for fine-tuning
the model e.g. expanding the capability of the current architecture to learn from
more examples.
5</p>
    </sec>
    <sec id="sec-4">
      <title>Conclusion</title>
      <p>In conclusion, this study demonstrates the feasibility of using DL to identify
synonymy and non-synonymy among atoms with relatively good performance
indicating a promising potential for emulating the current Metathesaurus building
process. In addition, a knowledge-infused DL approach leveraging multiple
streams of knowledge provides the necessary contextualization to disambiguate
lexically identical features and achieves an overall higher performance compared
to vanilla DL approach. Future works include (a) evaluations with the manual
rule-based normalization process of constructing the Metathesaurus since the
current evaluations are done within the scope of DL, i.e. evaluating whether
infusing additional knowledge (features) provide better performance, but not
between the traditional and automatic building process, and (b) investigation of
the scalability, maintenance, and applicability aspects of these models to
complement the current lexical processing and the UMLS human editors.
6</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgment</title>
      <p>This work was supported by the Intramural Research Program of the NIH,
National Library of Medicine. This research was also supported in part by an
appointment to the National Library of Medicine Research Participation Program.
This program is administered by the Oak Ridge Institute for Science and
Education through an inter-agency agreement between the U.S. Department of Energy
and the National Library of Medicine.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Bodenreider</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>The Unified Medical Language System (UMLS): integrating biomedical terminology</article-title>
          .
          <source>Nucleic Acids Research</source>
          .
          <volume>32</volume>
          ,
          <fpage>267D</fpage>
          -
          <lpage>270</lpage>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Esteva</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Robicquet</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ramsundar</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuleshov</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>DePristo</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chou</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cui</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corrado</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thrun</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dean</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>A guide to deep learning in healthcare</article-title>
          .
          <source>Nature Medicine</source>
          .
          <volume>25</volume>
          ,
          <fpage>24</fpage>
          -
          <lpage>29</lpage>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Russell</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Norvig</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Artificial intelligence: a modern approach</article-title>
          . (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Bengio</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dembczyński</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Joachims</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kloft</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Varma</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          : Extreme Classification.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Lai</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hockenmaier</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>A denotational and distributional approach to semantics</article-title>
          .
          <source>In Proceedings of the 8th International Workshop on Semantic Evaluation (SemEval</source>
          <year>2014</year>
          ), pp.
          <fpage>329</fpage>
          -
          <lpage>334</lpage>
          . (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhu</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          : Ecnu:
          <article-title>One stone two birds: Ensemble of heterogeneous measures for semantic relatedness and textual entailment</article-title>
          .
          <source>In Proceedings of the 8th International Workshop on Semantic Evaluation (SemEval</source>
          <year>2014</year>
          ), pp.
          <fpage>271</fpage>
          -
          <lpage>277</lpage>
          . (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Severyn</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nicosia</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moschitti</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Learning semantic textual similarity with structural representations</article-title>
          .
          <source>In Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)</source>
          , pp.
          <fpage>714</fpage>
          -
          <lpage>718</lpage>
          . (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Gomaa</surname>
            ,
            <given-names>W. H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fahmy</surname>
            ,
            <given-names>A. A.</given-names>
          </string-name>
          :
          <article-title>A survey of text similarity approaches</article-title>
          .
          <source>International Journal of Computer Applications</source>
          .
          <volume>68</volume>
          (
          <issue>13</issue>
          ),
          <fpage>13</fpage>
          -
          <lpage>18</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Hall</surname>
            ,
            <given-names>P. A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dowling</surname>
            ,
            <given-names>G. R.</given-names>
          </string-name>
          :
          <article-title>Approximate string matching</article-title>
          .
          <source>ACM computing surveys (CSUR)</source>
          .
          <volume>12</volume>
          (
          <issue>4</issue>
          ),
          <fpage>381</fpage>
          -
          <lpage>402</lpage>
          (
          <year>1980</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Salton</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Buckley</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Term-weighting approaches in automatic text retrieval</article-title>
          .
          <source>Information processing &amp; management. 24</source>
          (
          <issue>5</issue>
          ),
          <fpage>513</fpage>
          -
          <lpage>523</lpage>
          (
          <year>1988</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corrado</surname>
            ,
            <given-names>G. S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dean</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Distributed representations of words and phrases and their compositionality</article-title>
          .
          <source>In Advances in neural information processing systems</source>
          , pp.
          <fpage>3111</fpage>
          -
          <lpage>3119</lpage>
          . (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Landauer</surname>
            ,
            <given-names>T. K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dumais</surname>
          </string-name>
          , S. T.:
          <article-title>A solution to Plato's problem: The latent semantic analysis theory of acquisition, induction, and representation of knowledge. Psychological review</article-title>
          .
          <volume>104</volume>
          (
          <issue>2</issue>
          ),
          <volume>211</volume>
          (
          <year>1997</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Mihalcea</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corley</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Strapparava</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Corpus-based and knowledge-based measures of text semantic similarity</article-title>
          .
          <source>In AAAI</source>
          (Vol.
          <volume>6</volume>
          , No.
          <year>2006</year>
          ), pp.
          <fpage>775</fpage>
          -
          <lpage>780</lpage>
          . (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Mueller</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thyagarajan</surname>
            ,
            <given-names>A.:</given-names>
          </string-name>
          <article-title>Siamese recurrent architectures for learning sentence similarity</article-title>
          .
          <source>In Thirtieth AAAI Conference on Artificial Intelligence</source>
          . (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>He</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gimpel</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>Multi-perspective sentence similarity modeling with convolutional neural networks</article-title>
          .
          <source>In Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing</source>
          , pp.
          <fpage>1576</fpage>
          -
          <lpage>1586</lpage>
          . (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Bromley</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guyon</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          , LeCun,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Säckinger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Shah</surname>
          </string-name>
          , R.:
          <article-title>Signature verification using a "siamese" time delay neural network</article-title>
          .
          <source>In Advances in neural information processing systems</source>
          , pp.
          <fpage>737</fpage>
          -
          <lpage>744</lpage>
          . (
          <year>1994</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Chopra</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hadsell</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , LeCun, Y.:
          <article-title>Learning a similarity metric discriminatively, with application to face verification</article-title>
          .
          <source>In CVPR (1)</source>
          , pp.
          <fpage>539</fpage>
          -
          <lpage>546</lpage>
          . (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Synnaeve</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dupoux</surname>
          </string-name>
          , E.:
          <article-title>A temporal coherence loss function for learning unsupervised acoustic embeddings</article-title>
          .
          <source>Procedia Computer Science</source>
          .
          <volume>81</volume>
          ,
          <fpage>95</fpage>
          -
          <lpage>100</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Neculoiu</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Versteegh</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rotaru</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Learning text similarity with siamese recurrent networks</article-title>
          .
          <source>In Proceedings of the 1st Workshop on Representation Learning for NLP</source>
          , pp.
          <fpage>148</fpage>
          -
          <lpage>157</lpage>
          . (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Rychalska</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pakulska</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chodorowska</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Walczak</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Andruszkiewicz</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Samsung Poland NLP Team at SemEval-2016 Task 1: Necessity for diversity; combining recursive autoencoders, WordNet and ensemble methods to measure semantic similarity</article-title>
          .
          <source>In Proceedings of the 10th International Workshop on Semantic Evaluation (SemEval-2016)</source>
          , pp.
          <fpage>602</fpage>
          -
          <lpage>608</lpage>
          . (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Greff</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Srivastava</surname>
            ,
            <given-names>R. K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koutník</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Steunebrink</surname>
            ,
            <given-names>B. R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmidhuber</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>LSTM: A search space odyssey</article-title>
          .
          <source>IEEE transactions on neural networks and learning systems</source>
          .
          <volume>28</volume>
          (
          <issue>10</issue>
          ),
          <fpage>2222</fpage>
          -
          <lpage>2232</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Tai</surname>
            ,
            <given-names>K. S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Socher</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manning</surname>
          </string-name>
          , C. D.:
          <article-title>Improved semantic representations from tree-structured long short-term memory networks</article-title>
          .
          <source>arXiv preprint arXiv:1503</source>
          .
          <fpage>00075</fpage>
          . (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Convolutional neural networks for sentence classification</article-title>
          .
          <source>arXiv preprint arXiv:1408</source>
          .
          <fpage>5882</fpage>
          . (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>He</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gimpel</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>Multi-perspective sentence similarity modeling with convolutional neural networks</article-title>
          .
          <source>In Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing</source>
          , pp.
          <fpage>1576</fpage>
          -
          <lpage>1586</lpage>
          . (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>BioWordVec, improving biomedical word embeddings with subword information and MeSH</article-title>
          .
          <source>Scientific data. 6</source>
          (
          <issue>1</issue>
          ),
          <volume>52</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corrado</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dean</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Efficient estimation of word representations in vector space</article-title>
          .
          <source>arXiv preprint arXiv:1301</source>
          .
          <fpage>3781</fpage>
          . (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Aggarwal</surname>
            ,
            <given-names>C. C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hinneburg</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Keim</surname>
            ,
            <given-names>D. A.</given-names>
          </string-name>
          :
          <article-title>On the surprising behavior of distance metrics in high dimensional space</article-title>
          .
          <source>In International conference on database theory</source>
          , pp.
          <fpage>420</fpage>
          -
          <lpage>434</lpage>
          . Springer, Berlin, Heidelberg (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Pontes</surname>
            ,
            <given-names>E. L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huet</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Linhares</surname>
            ,
            <given-names>A. C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Torres-Moreno</surname>
            ,
            <given-names>J. M.</given-names>
          </string-name>
          :
          <article-title>Predicting the Semantic Textual Similarity with Siamese CNN and LSTM</article-title>
          . arXiv preprint arXiv:
          <year>1810</year>
          .
          <fpage>10641</fpage>
          . (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Kingma</surname>
            ,
            <given-names>D. P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ba</surname>
          </string-name>
          , J.:
          <article-title>Adam: A method for stochastic optimization</article-title>
          .
          <source>arXiv preprint arXiv:1412</source>
          .
          <fpage>6980</fpage>
          . (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>