<!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>A Preliminary Evaluation of a Privacy-Preserving Dialogue System</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Bettina Fazzinga?</string-name>
          <email>bettina.fazzinga@unical.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andrea Galassi?</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Paolo Torroni?</string-name>
          <email>paolo.torroni@unibo.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>DISI, University of Bologna</institution>
          ,
          <addr-line>Bologna</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>ICAR CNR</institution>
          ,
          <addr-line>Rende</addr-line>
          ,
          <country country="IT">Italy;</country>
          <institution>DICES, University of Calabria</institution>
          ,
          <addr-line>Rende</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Dialogue systems are AI applications widely used in many contexts requiring user interaction. However, unconstrained interaction may lead to users communicating sensitive data. This raises concerns about how these systems handle personal data, and about their compliance with relevant laws, regulations, and ethical principles. We propose to integrate advanced natural language processing techniques in a dialogue system architecture based on computational argumentation, ensuring that user data are ethically managed and regulations are respected. A preliminary experimental evaluation of our proposal over a COVID-19 vaccine information case study shows promising results.</p>
      </abstract>
      <kwd-group>
        <kwd>Dialogue systems Sentence embeddings Data Protection Expert systems Chatbots COVID-19</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The idea of an arti cial agent capable of communicating with the user through
natural language has inspired researchers since the early days of arti cial
intelligence. The recent development in language technologies has nourished this
ambition further and now the full maturation of intelligent dialogue systems
does not seem a far dream any longer. Their adoption allows immediate support
to any user, making them incredibly valuable for companies and public
administrations alike. In fact, they are being used by public administrations to help
citizens to request services,3 but also to provide updates and information on
pressing matters, such as COVID-19 [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ].4
? Equal contribution.
3
https://www.canada.ca/en/employment-social-development/services/myaccount/terms-use-chatbot.html
4
https://government.economictimes.indiatimes.com/news/digital-india/covid-19govt-launches-facebook-and-messenger-chatbot/74843125
Copyright c 2021 for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0)
      </p>
      <p>The pervasive presence of information-providing chatbots and assistive
dialogue systems in many delicate context raises the need for trustworthy AI
methods, which can guarantee citizens protection against possible misuses of
technology. We believe that trustworthiness demands transparency,
explainability, correctness, and that it requires architectural choices that take data access
into account from the very beginning. In fact, chatbots should not only process
data through transparent and veri able methods following appropriate
regulations, but also provide explanations of their outputs in a manner adapted to the
intended (human) user. This is especially true in the public sector and when the
interaction among di erent legal entities is involved.</p>
      <p>
        In our earlier work [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], we identi ed a combination of computational
argumentation and language technology as a possible answer to some of these
challenges. We described an architecture for AI dialogue systems where user
interaction is carried out in natural language, both for providing information to the
user and to answer user queries about the reasons leading to the system output
(explainability). We proposed to use computational argumentation techniques
to realize a transparent reasoning module with a rigorous, veri able semantics
(transparency, auditability). We also underlined the importance of modularity
in the architecture's design, to decouple the natural language interface, where
user data is processed, and the reasoning module, where expert knowledge is
used to generate outputs (privacy and data governance). In [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], we focused on
the computational argumentation module, describing how the system works to
compute answers.
      </p>
      <p>The focus of this work, instead, is on the language module's design and its
initial evaluation. The main idea is simple: to use sentence embeddings and a
similarity function to match user inputs with a set of natural language sentences
describing relevant facts. In order to evaluate whether this concept may work in
practice, we constructed a tiny dataset of sentences describing user information
in possible dialogues regarding COVID-19 vaccines. For example, we encoded
di erent ways users may express whether they su er from drug allergies, or are
immunosuppressed. We run a preliminary experimentation to compare di erent
sentence embeddings and hyperparameters, obtaining encouraging results.</p>
      <p>Our presentation starts by discussing related approaches (Section 2).
Section 3 gives a high-level description of the system architecture, while we illustrate
the implementation in more detail in Section 4. In Section 5 we o er an initial
empirical evaluation of the language module, pointing to the feasibility of the
approach in real-world contexts. We conclude and address future developments
in Section 6.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        Our work is positioned at the intersection of two areas: computational
argumentation and natural language understanding. While computational
argumentation has had signi cant applications in the context of automated dialogues
among software agents, its combination with systems able to interact in natural
language in socio-technical systems has been more recent [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>
        Dialogue systems are typically divided between conversational agents, which
support open-domain dialogues, and task-oriented agents, which assist the user
in a speci c task [
        <xref ref-type="bibr" rid="ref7 ref8">7,8</xref>
        ]. Our proposal falls in the second category. The task is
to obtain information on a speci c topic. The advancement of deep learning
techniques and their successful application in many Natural Language Processing
tasks has lead researchers to investigate the use of neural architectures for
endto-end dialogue systems [
        <xref ref-type="bibr" rid="ref22 ref27">27,22</xref>
        ]. However, these architectures have downsides
too. Their training phase usually has a heavy computational footprint, and it
requires the construction of large corpora for the speci c use cases. Moreover,
they are often vulnerable to biases, privacy violations, adversarial attacks, and
safety concerns [
        <xref ref-type="bibr" rid="ref1 ref10 ref14 ref21">1,10,14,21</xref>
        ]. Finally, reuse and adaptation to a di erent domain
typically require building a new training corpus and a complete retrain. Given
our focus on user protection and our aim to develop a general, data-independent
approach, our system is modular (as opposed to end-to-end), and does not involve
any training phase. Since it only uses o -the-shelf tools, it can be applied to new
contexts without having to construct new training corpora.
      </p>
      <p>
        The protection of users' identity and personal information is usually
addressed through redaction [
        <xref ref-type="bibr" rid="ref34">34</xref>
        ] or sanitization [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] methods. Such techniques are
usually built on large but domain-speci c datasets [
        <xref ref-type="bibr" rid="ref24 ref31">24,31</xref>
        ]. Nonetheless, these
techniques are still far from guaranteeing zero-risk to the user [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], and often
focus only prede ned categories of entities, ignoring elements that may play a
role in re-identifying the individual [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ].
      </p>
      <p>
        Our proposal is general-purpose and aims at maximizing user protection. The
main idea is that user information is neither shared nor stored in the
application. Instead, it is replaced by a collection of general, \sanitized" information
elements that are pertinent to the case at hand. Our approach is akin to
Information Retrieval-based chatbots, where dialogue agents retrieve their answer from
a knowledge base made of dialogues, treating the user's sentences as queries. In
the same vein, Charras et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] use sentence similarity to retrieve the desired
answer from a knowledge base made of dialogues, while Chalaguine and Hunter [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]
retrieve an answer from a graph. Both work compare sentences through the
cosine similarity between the TF-IDF representation of the sentences, but Charras
et al. explore also the use of doc-to-vec [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] representation. However, the design
of these approaches does not include a history of conversation, nor the
possibility to retrieve multiple information elements within a single interaction. This
is a strong limitation in real-world scenarios, where information cannot be
considered in isolation, but on the contrary, multiple pieces must be considered at
the same time, independently whether they have been communicated in a single
sentence or at di erent points in the dialogue. Another limitation of previous
approaches is their relying on lexical, instead of semantic similarity. Conversely,
we use sentence-level embeddings, which enables semantic similarity measures.
Moreover, we consider the possibility of retrieving multiple information in a
      </p>
      <sec id="sec-2-1">
        <title>User</title>
        <p>1
SBU
SR</p>
      </sec>
      <sec id="sec-2-2">
        <title>Knowledge Base</title>
        <p>NA</p>
        <p>NB
SA1 SA2</p>
        <p>SB1 SB2 SB3
2</p>
        <p>NA
SR
5</p>
        <p>NB</p>
        <p>R
single interaction, and to maintain a history of retrieved concept thanks to a
reasoning module based on argumentation.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>System Architecture</title>
      <p>
        Our architecture consists of two main modules: the language module and the
argumentation module. The former, which is the focus of this work, is responsible
for user interaction: it processes user input and generates answers, all in natural
language. The latter, described in our previous work [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], receives the processed
information and reasons over it, so as to nd the appropriate answer, according
to a knowledge base (KB) of the domain of interest. The KB is built by domain
experts and consists of an argumentation graph, having a node for each possible
relevant piece of information that could be communicated to the system by users,
called status nodes (that thus contain factual information about possible users
conditions/statuses), and a node for each possible answer, called reply nodes.
A set of natural language sentences is also associated with each status node.
In this way, we have a natural language representation of possible ways a user
would express what a node is meant to encode. These di erent representations
of facts could be produced by domain experts or crowd-sourced as proposed by
Chalaguine and Hunter [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>The interaction with the user is represented in Figure 1 and it is structured
as follows:
1. The user inputs one or more sentences.
2. The language module compares each sentence with the KB sentences
associated with status nodes, obtaining a set of \matched" sentences,
corresponding to a set of \activated" status nodes. These nodes, collectively, represent
the speci c use case described by the user.
3. The list of activated status nodes is sent to the argumentation module.
4. The argumentation module performs reasoning over the activated nodes,
resulting in an answer, or in the request for more information. Either way, a
node is selected and this selection is communicated to the language module.
5. The language module elaborates the output of the argumentation module
and produces a natural language reply to the user.</p>
      <p>Since the sentence provided by the user may match multiple KB sentences,
multiple nodes may be activated in a single interaction. At the same time, the
system allows to provide information over multiple interaction, since the
argumentation module stores the history of activated nodes in its \memory".</p>
      <p>
        We shall remark that such an architecture protects the privacy of its users
on two levels. First of all, the system ignores any information that does not
match a KB sentence. The KB is not user-speci c: it only represents general
knowledge, in a user-independent way. Therefore, any information not strictly
relevant to the scenario is ltered out. Then, during step 3, the argumentation
module receives only the list of activated nodes, not the sentences as the user
has formulated it. The outcome of this procedure is similar to the one produced
by a \sanitization" process [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], since the all the relevant information are kept,
but in a form that is general and does not contain any information that may
lead to the identi cation of the user.
      </p>
      <p>Our proposal is therefore suited with any scenarios where the language
module is authorized and entrusted to manage the user's data, but the argumentation
module is not. One of them is a client-server implementation, where the client
side includes the language module, while the argumentation module resides on
the server side. In this case, all the personal information of the user will
remain on the client side, and only the sanitized version of them will reach the
server. Another possibility would be a multi-agent system, where the two
modules are managed by di erent organizations, e.g. a service provided jointly by a
government and by a private company.</p>
      <p>
        Last but not least, the reasoning module is transparent, rigorous, and veri
able, allowing the users to request for more information regarding the provided
answer. More details about this process are discussed in Fazzinga et al. [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Language Module</title>
      <p>
        One of the main objectives of our proposal is keeping the approach as general as
possible. While many scenarios may gain advantage from tailored NLP solutions,
their construction may be too costly, even impossible. We have therefore decided
to follow previous works [
        <xref ref-type="bibr" rid="ref5 ref6">6,5</xref>
        ] and to assess which KB sentences match the user's
ones by computing the similarity between their embedded representation. But
instead of relying on simple syntactical representation, we propose to use
stateof-the-art techniques, apt to capture the semantic content of the sentences.
      </p>
      <p>
        In particular, we encode both the user sentences and the KB sentences
using sentence embeddings. These are high-dimensional numerical representations
of textual sentences that can be computed using (pre-trained) neural
architectures. Many embeddings have been proposed along the years [
        <xref ref-type="bibr" rid="ref25 ref26">26,25</xref>
        ], and modern
attention-based [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] sentence embeddings such as BERT [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] do not only model
the syntactic content and structure of a sentence, but also capture its meaning.
Ideally, if two sentences have a similar meaning, they will be mapped onto
similar sentence embeddings. Sentence embeddings have been used successfully in a
variety of NLP tasks, including hard ones such as understanding negations and
speculations, and have shown to outperform traditional rule-based systems [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ].
      </p>
      <p>
        Among the many possible models, we have decided to focus on
SentenceBERT models [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ], which are speci cally trained to perform well on tasks of
sentence similarity. While it is possible to train new models for speci c domains
or tasks, many pre-trained models are already available and can be used as o
the-shelf tools without the need of creating a corpus, nor to perform a training
or ne-tuning steps.
      </p>
      <p>
        The similarity between two embeddings can be computed using any similarity
function that operates on high-dimensional numerical vectors. We use the
BrayCurtis similarity [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] since it has led to satisfactory results in related settings
before [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], but other measures, such as cosine similarity [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], may be equally valid
options. A possible alternative to the use of sentence embeddings combined with
a similarity measure may be the use of neural architectures speci cally trained
to perform this task, such as cross-encoders [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ]. However, the computational
footprint of these techniques may be too heavy in most contexts, since they
require to encode and process any possible pair at any step of iteration.
      </p>
      <p>Given a measure of similarity between two sentences, we transform it to
a Boolean value by applying a threshold, which is an hyper-parameter of the
architecture. In this way, we discriminate between the pairs of sentences that
are similar enough to be considered \a match", and those that are not.
To assess the e ectiveness of our language module based on sentence embeddings
and similarity measures, we run a preliminary experimentation on a small-sized
dataset built around the use case of vaccines for COVID-19. We are especially
interested in evaluating our method on sentences with a similar syntactic
structure, but di erent meaning (e.g., a sentence and its negation).
In the context of COVID-19 vaccines, our dialogue system helps the users to
understand whether or not, and eventually where (hospital or generic site), they
can get vaccinated, depending on their health status. Our KB has been built
from the information published by the Italian Medicines Agency (AIFA) on
their website (https://www.aifa.gov.it/en/). For example, for people su ering of
diabetes, no special recommendation is given, so our system will tell users that
they can be vaccinated at any site (without the need of going to the hospital),
while in the case that they su er from bronchial asthma, our system will tell
them to get vaccinated at the hospital. In this context, it is essential for our
system to perfectly understand users health conditions, so, in the following, we
focus on the matching phase between user sentences and the information stored
in KB.</p>
      <p>We consider a case study with a KB made of only 6 status nodes,
corresponding to the presence/absence of 3 particular medical conditions, i.e., celiac
disease, immunosuppression, and drug allergy. For each node, our KB contains
from 3 to 7 sentences that can be used to express the same concept (see Table 1).</p>
      <p>Instead of using an additional set of sentences to simulate the user input,
we compare the KB sentences between each other and verify whether sentences
belonging to the same node do match. To evaluate our method quantitatively,
we treat it as a binary classi cation task on every possible pair of (di erent)
sentences. If the two sentences belong to the same status node, their pair is
considered a positive instance, otherwise it is considered negative.</p>
      <p>
        In our experiment we compare di erent models of sentence embeddings and
di erent threshold criteria. For sentence embeddings we evaluate the following
Sentence-BERT [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ] models:5
{ stsb-mpnet: based on MPNet [
        <xref ref-type="bibr" rid="ref33">33</xref>
        ] and pre-trained for semantic similarity
on the STSbenchmark [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
{ paraphrase-mpnet: based on MPNet and pre-trained for paraphrase mining.
{ paraphrase-TinyBERT-L6: based on TinyBERT [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] and pre-trained for
paraphrase mining.
{ paraphrase-MiniLM-L3: based on MiniLM [
        <xref ref-type="bibr" rid="ref35">35</xref>
        ] and pre-trained for
paraphrase mining.
{ nq-distilbert: based on DistilBERT [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ] and pre-trained for question
answering on Googles Natural Questions dataset [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ].
{ paraphrase-multilingual-mpnet: multilingual extension [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ] of the
monolingual model. We have decided to include this model in the perspective of
future multi-lingual applications.
      </p>
      <p>
        We also include TF-IDF representation as in Charras et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], Chalaguine and
Hunter [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], using the entire set of sentences to create the vocabulary. As
thresholds, we use three arbitrary values (0.75, 0.70, 0.65), plus two values based on the
distribution of the similarity scores: one is given by the average of the similarities
(mean), and the other one is given by the sum between the average similarity
and the standard deviation (mean+std).
      </p>
      <p>For each combination of models and thresholds, we measure precision, recall,
and F1 score of the positive class (see Table 2). Precision is especially important:
5 All the implementations of the models are taken from http://www.sbert.net/.
false positives can be seen as cases where the system \misunderstands" the input
of the user, and therefore precision can be seen as a measure of correctness. Recall
instead can be seen as a measure of the ability of the system to not \miss"
information communicated by the user. For the purposes of our system, poor
recall is a less serious problem than poor precision, since the argumentation
module proactively asks the user for missing bits of information that would
in uence the nal result. In our perspective, the priority must be to guarantee
the correctness of the nal answer, even if this means that the system will, in
some cases, ask for information that the user has already submitted. For this
reason, we use precision as the main evaluation metric.
5.2</p>
      <p>Results and Discussion
Our results clearly show that the stsb-mpnet and the paraphrase-mpnet
models are the best ones, with the former achieving perfect precision with all the
xed similary scores and the latter achieving equivalent or even better F1 scores
with every threshold. In particular, they both achieve an almost perfect result
(only one false positive, no false negatives) using the mean+std threshold. The
paraphrase-multilingual-mpnet model perform slightly worse than the
monolingual version, providing encouraging results in the perspective of future
multilingual applications. The TF-IDF model is the one that performs worse with all
the threshold values, in part probably due to the small size of the vocabulary.</p>
      <p>Table 3 shows an example of matching using sentences from S1 to S19, which
are those related to the status nodes \Has celiac disease", \Has not celiac
disease", \Is immunosuppressed", \Is not immunosuppressed". The matches are
computed by the stsb-mpnet and the paraphrase-mpnet models using a
threshold value of 0.65. The former achieves perfect precision but not perfect recall,
and indeed we can see that it misses some matches, such as S8 and S10. The
latter reaches perfect recall but not precision, which indicates the presence of
false positives e.g. the pair S1 and S8. Some of these false positives might be
particularly dangerous in a real application since they mean that the system has
misunderstood a sentence for its negation, e.g. the sentence "I am not celiac" as
"I am celiac". The argumentation module would be able to detect such con icts
and in future works we plan to include con ict resolution modules and
procedures. A careful user experience design may also be able to mitigate the issue,
for instance by displaying relevant pieces of information interactively as they are
understood by the system.</p>
      <p>These results are encouraging and motivate us to continue along this research
direction. Nonetheless, our research is still in its early stages and we are aware
that a proper and sound evaluation of the whole proposal would require to
include more nodes, a rigorous split between calibration and test sentences, and
should eventually be validated by human testers.
We proposed the integration of advanced sentence embeddings into a modular
dialogue system architecture based on argumentation, so as to support privacy
by design.</p>
      <p>In particular, the language module is the only module that processes user
input, and its output to the argumentation module is devoid of any sensitive,</p>
      <p>S1 S2 S3 S4 S5 S6 S7 S8 S9 S10 S11 S12 S13 S14 S15 S16 S17 S18 S19
S1 + + + + + +
S2 + + + + + +
S3 + + + + + +
S4 + + + + + +
S5 + + + + + +
S6 + + + + + +
S7
S8
S9
S10
S11
S12
S13
S14
S15
S16
S17
S18
S19
+ + +
+ + +
+ + +
+ + +
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
personal, or irrelevant piece of information the user may have written. The
output of this module can therefore be seen as the anonymized and sanitized version
of the user's sentences. This makes the system amenable to distributed,
multiparty implementations, where domain knowledge representation and reasoning
may be left to third parties, and the user interface completely decouples the
user input from the arguments used in the reasoning. We shall point out that
guaranteeing the anonymization of user data, may not only a desirable feature,
but even a legal requirement in some contexts, such as those regulated by EU's
GDPR6. Importantly, the architecture is general-purpose and does not require
domain-speci c training or reference corpora.</p>
      <p>The COVID-19 vaccines case study has given the context for a preliminary
experimental evaluation. Our results indicate that the use of sentence embeddings
computed by pre-trained neural architectures greatly outperforms the TF-IDF
model used in other approaches, leading to precise matches. We also emphasized
the importance of precision and correctness over recall.</p>
      <p>In future developments we aim at extending our experimental evaluation,
including human testers in the loop. We also want to investigate additional case
studies, potentially involving languages other than English. It would also be
6 See https://eur-lex.europa.eu/eli/reg/2016/679/oj.
interesting to extend our architecture with techniques for the detection and the
resolution of con icts, especially false positives, both in the reasoning module and
in the language module. Finally, we would like to provide the user the possibility
to directly correct matches. That could further improve the transparency of
our architecture and reduce the number of false positives. However, that would
require redesigning user interaction, which is now intentionally simple, possibly
making it more complicated and less intuitive.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments References</title>
      <p>The research reported in this work was partially supported by the EU H2020
ICT48 project \Humane AI Net" under contract #952026.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Barikeri</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lauscher</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vulic</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Glavas</surname>
          </string-name>
          , G.:
          <article-title>Redditbias: A real-world resource for bias evaluation and debiasing of conversational language models</article-title>
          .
          <source>In: ACL/IJCNLP (1)</source>
          . pp.
          <year>1941</year>
          {
          <year>1955</year>
          .
          <article-title>Association for Computational Linguistics (</article-title>
          <year>2021</year>
          ). https://doi.org/10.18653/v1/
          <year>2021</year>
          .
          <article-title>acl-long.151</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Bray</surname>
            ,
            <given-names>J.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Curtis</surname>
            ,
            <given-names>J.T.</given-names>
          </string-name>
          :
          <article-title>An ordination of the upland forest communities of Southern Wisconsin</article-title>
          .
          <source>Ecological Monographs</source>
          <volume>27</volume>
          (
          <issue>4</issue>
          ),
          <volume>325</volume>
          {
          <fpage>349</fpage>
          (
          <year>1957</year>
          ). https://doi.org/10.2307/1942268
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Cer</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Diab</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Agirre</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lopez-Gazpio</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Specia</surname>
          </string-name>
          , L.:
          <article-title>SemEval-2017 task 1: Semantic textual similarity multilingual and crosslingual focused evaluation</article-title>
          .
          <source>In: Proceedings of the 11th International Workshop on Semantic Evaluation (SemEval2017)</source>
          . pp.
          <volume>1</volume>
          {
          <fpage>14</fpage>
          . Association for Computational Linguistics, Vancouver, Canada (Aug
          <year>2017</year>
          ). https://doi.org/10.18653/v1/
          <fpage>S17</fpage>
          -2001
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Chakaravarthy</surname>
          </string-name>
          , V.T.,
          <string-name>
            <surname>Gupta</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Roy</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mohania</surname>
            ,
            <given-names>M.K.</given-names>
          </string-name>
          :
          <article-title>E cient techniques for document sanitization</article-title>
          .
          <source>In: Proceedings of the 17th ACM Conference on Information and Knowledge Management</source>
          . p.
          <fpage>843852</fpage>
          . CIKM '
          <volume>08</volume>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA (
          <year>2008</year>
          ). https://doi.org/10.1145/1458082.1458194
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Chalaguine</surname>
            ,
            <given-names>L.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hunter</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>A persuasive chatbot using a crowd-sourced argument graph and concerns</article-title>
          . In: Prakken,
          <string-name>
            <given-names>H.</given-names>
            ,
            <surname>Bistarelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Santini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Taticchi</surname>
          </string-name>
          , C. (eds.)
          <source>COMMA. Frontiers in Arti cial Intelligence and Applications</source>
          , vol.
          <volume>326</volume>
          , pp.
          <volume>9</volume>
          {
          <fpage>20</fpage>
          . IOS Press (
          <year>2020</year>
          ). https://doi.org/10.3233/FAIA200487
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Charras</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dubuisson Duplessis</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Letard</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ligozat</surname>
            ,
            <given-names>A.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosset</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Comparing System-response Retrieval Models for Open-domain and Casual Conversational Agent</article-title>
          . In: WOCHAT. Los Angeles, United States (
          <year>2016</year>
          ), https://hal. archives-ouvertes.fr/hal-01782262
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yin</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tang</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>A survey on dialogue systems: Recent advances and new frontiers</article-title>
          .
          <source>SIGKDD Explor. Newsl</source>
          .
          <volume>19</volume>
          (
          <issue>2</issue>
          ),
          <volume>2535</volume>
          (Nov
          <year>2017</year>
          ). https://doi.org/10.1145/3166054.3166058
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Deriu</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rodrigo</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Otegi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Echegoyen</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosset</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Agirre</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cieliebak</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>Survey on evaluation methods for dialogue systems</article-title>
          .
          <source>Artif. Intell. Rev</source>
          .
          <volume>54</volume>
          (
          <issue>1</issue>
          ),
          <volume>755</volume>
          {
          <fpage>810</fpage>
          (
          <year>2021</year>
          ). https://doi.org/10.1007/s10462-020-09866-x
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Devlin</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chang</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Toutanova</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>BERT: pre-training of deep bidirectional transformers for language understanding</article-title>
          . In: Burstein,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Doran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Solorio</surname>
          </string-name>
          , T. (eds.)
          <article-title>NAACL-HLT (1</article-title>
          ). pp.
          <volume>4171</volume>
          {
          <fpage>4186</fpage>
          .
          <article-title>Association for Computational Linguistics (</article-title>
          <year>2019</year>
          ). https://doi.org/10.18653/v1/n19-
          <fpage>1423</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Dinan</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Williams</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Urbanek</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kiela</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weston</surname>
          </string-name>
          , J.:
          <article-title>Queens are powerful too: Mitigating gender bias in dialogue generation</article-title>
          .
          <source>In: EMNLP (1)</source>
          . pp.
          <volume>8173</volume>
          {
          <fpage>8188</fpage>
          . Association for Computational Linguistics,
          <source>Online (Nov</source>
          <year>2020</year>
          ). https://doi.org/10.18653/v1/
          <year>2020</year>
          .emnlp-main.
          <fpage>656</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Fazzinga</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Galassi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Torroni</surname>
            ,
            <given-names>P.:</given-names>
          </string-name>
          <article-title>An argumentative dialogue system for COVID-19 vaccine information</article-title>
          . In: Baroni,
          <string-name>
            <surname>P.</surname>
          </string-name>
          , Benzmuller,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y.N</surname>
          </string-name>
          . (eds.) Logic and Argumentation - 4th International Conference, CLAR 2021, Hangzhou, China,
          <source>October 20-22</source>
          ,
          <year>2021</year>
          ,
          <source>Proceedings. Lecture Notes in Computer Science</source>
          , vol.
          <volume>13040</volume>
          , pp.
          <volume>477</volume>
          {
          <fpage>485</fpage>
          . Springer (
          <year>2021</year>
          ). https://doi.org/10.1007/978-3-
          <fpage>030</fpage>
          -89391- 0 27
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Galassi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Drazewski</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lippi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Torroni</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Cross-lingual annotation projection in legal texts</article-title>
          .
          <source>In: COLING</source>
          . pp.
          <volume>915</volume>
          {
          <fpage>926</fpage>
          . International Committee on Computational Linguistics, Barcelona, Spain (Online) (
          <year>Dec 2020</year>
          ). https://doi.org/10.18653/v1/
          <year>2020</year>
          .coling-main.
          <fpage>79</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Galassi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lippi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Torroni</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Attention in natural language processing</article-title>
          .
          <source>IEEE Trans. Neural Networks Learn. Syst</source>
          .
          <volume>32</volume>
          (
          <issue>10</issue>
          ),
          <volume>4291</volume>
          {
          <fpage>4308</fpage>
          (
          <year>2021</year>
          ). https://doi.org/10.1109/TNNLS.
          <year>2020</year>
          .3019893
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Henderson</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sinha</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Angelard-Gontier</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ke</surname>
            ,
            <given-names>N.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fried</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lowe</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pineau</surname>
          </string-name>
          , J.:
          <article-title>Ethical challenges in data-driven dialogue systems</article-title>
          .
          <source>In: AIES</source>
          . p.
          <fpage>123129</fpage>
          .
          <article-title>Association for Computing Machinery</article-title>
          , New York, NY, USA (
          <year>2018</year>
          ). https://doi.org/10.1145/3278721.3278777
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Jiao</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yin</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shang</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jiang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          :
          <article-title>TinyBERT: Distilling BERT for natural language understanding</article-title>
          .
          <source>In: Findings of the Association for Computational Linguistics: EMNLP 2020</source>
          . pp.
          <volume>4163</volume>
          {
          <fpage>4174</fpage>
          . Association for Computational Linguistics,
          <source>Online (Nov</source>
          <year>2020</year>
          ). https://doi.org/10.18653/v1/
          <year>2020</year>
          . ndings-emnlp.
          <fpage>372</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Kenter</surname>
          </string-name>
          , T., de Rijke, M.:
          <article-title>Short text similarity with word embeddings</article-title>
          .
          <source>In: CIKM</source>
          . p.
          <fpage>14111420</fpage>
          . CIKM '
          <volume>15</volume>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA (
          <year>2015</year>
          ). https://doi.org/10.1145/2806416.2806475
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Kwiatkowski</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Palomaki</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , Red eld, O., Collins,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Parikh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.P.</given-names>
            ,
            <surname>Alberti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Epstein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Polosukhin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            ,
            <surname>Devlin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Toutanova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Kelcey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Dai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.M.</given-names>
            ,
            <surname>Uszkoreit</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Le</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            ,
            <surname>Petrov</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          :
          <article-title>Natural questions: a benchmark for question answering research</article-title>
          .
          <source>Trans. Assoc. Comput. Linguistics</source>
          <volume>7</volume>
          ,
          <issue>452</issue>
          {
          <fpage>466</fpage>
          (
          <year>2019</year>
          ). https://doi.org/https://doi.org/10.1162/tacl a 00276
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Le</surname>
            ,
            <given-names>Q.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Distributed representations of sentences and documents</article-title>
          .
          <source>In: ICML. JMLR Workshop and Conference Proceedings</source>
          , vol.
          <volume>32</volume>
          , pp.
          <volume>1188</volume>
          {
          <fpage>1196</fpage>
          . JMLR.org (
          <year>2014</year>
          ), http://proceedings.mlr.press/v32/le14.html
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vorobeychik</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Malin</surname>
            ,
            <given-names>B.A.</given-names>
          </string-name>
          :
          <article-title>Scalable iterative classi cation for sanitizing large-scale datasets</article-title>
          .
          <source>IEEE Trans. Knowl. Data Eng</source>
          .
          <volume>29</volume>
          (
          <issue>3</issue>
          ),
          <volume>698</volume>
          {
          <fpage>711</fpage>
          (
          <year>2017</year>
          ). https://doi.org/10.1109/TKDE.
          <year>2016</year>
          .2628180
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Lison</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pilan</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sanchez</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Batet</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>vrelid</surname>
          </string-name>
          , L.:
          <article-title>Anonymisation models for text data: State of the art, challenges and future directions</article-title>
          .
          <source>In: ACL/IJCNLP (1)</source>
          . pp.
          <volume>4188</volume>
          {
          <fpage>4203</fpage>
          .
          <article-title>Association for Computational Linguistics (</article-title>
          <year>2021</year>
          ). https://doi.org/10.18653/v1/
          <year>2021</year>
          .
          <article-title>acl-long.323</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dacon</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fan</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          , Liu,
          <string-name>
            <given-names>H.</given-names>
            ,
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            ,
            <surname>Tang</surname>
          </string-name>
          , J.:
          <article-title>Does gender matter? towards fairness in dialogue systems</article-title>
          .
          <source>In: COLING</source>
          . pp.
          <volume>4403</volume>
          {
          <fpage>4416</fpage>
          . International Committee on Computational Linguistics, Barcelona, Spain (Online) (
          <year>Dec 2020</year>
          ). https://doi.org/10.18653/v1/
          <year>2020</year>
          .coling-main.
          <fpage>390</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Luo</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zeng</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nie</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          :
          <article-title>Learning personalized end-to-end goal-oriented dialog</article-title>
          .
          <source>Proceedings of the AAAI Conference on Arti cial Intelligence</source>
          <volume>33</volume>
          (
          <issue>01</issue>
          ),
          <volume>6794</volume>
          {6801 (Jul
          <year>2019</year>
          ). https://doi.org/10.1609/aaai.v33i01.
          <fpage>33016794</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Miner</surname>
            ,
            <given-names>A.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Laranjo</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kocaballi</surname>
            ,
            <given-names>A.B.</given-names>
          </string-name>
          :
          <article-title>Chatbots in the ght against the COVID19 pandemic</article-title>
          .
          <source>npj Digital Medicine</source>
          <volume>3</volume>
          (
          <issue>1</issue>
          ) (
          <year>2020</year>
          ). https://doi.org/10.1038/s41746- 020-0280-0
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Nguyen</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cavallari</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Neural multi-task text normalization and sanitization with pointer-generator</article-title>
          .
          <source>In: Proceedings of the First Workshop on Natural Language Interfaces</source>
          . pp.
          <volume>37</volume>
          {
          <fpage>47</fpage>
          . Association for Computational Linguistics,
          <source>Online (Jul</source>
          <year>2020</year>
          ). https://doi.org/10.18653/v1/
          <year>2020</year>
          .nli-
          <volume>1</volume>
          .
          <fpage>5</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Pennington</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Socher</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manning</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          : GloVe:
          <article-title>Global vectors for word representation</article-title>
          .
          <source>In: EMNLP</source>
          . pp.
          <volume>1532</volume>
          {
          <fpage>1543</fpage>
          . Association for Computational Linguistics, Doha, Qatar (Oct
          <year>2014</year>
          ). https://doi.org/10.3115/v1/
          <fpage>D14</fpage>
          -1162
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Peters</surname>
            ,
            <given-names>M.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Neumann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Iyyer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gardner</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Clark</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zettlemoyer</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Deep contextualized word representations</article-title>
          . In: Walker,
          <string-name>
            <given-names>M.A.</given-names>
            ,
            <surname>Ji</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            ,
            <surname>Stent</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . (eds.) NAACL-HLT. pp.
          <volume>2227</volume>
          {
          <fpage>2237</fpage>
          .
          <article-title>Association for Computational Linguistics (</article-title>
          <year>2018</year>
          ). https://doi.org/10.18653/v1/n18-
          <fpage>1202</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Rajendran</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ganhotra</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Singh</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Polymenakos</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Learning end-toend goal-oriented dialog with multiple answers</article-title>
          .
          <source>In: EMNLP</source>
          . pp.
          <volume>3834</volume>
          {
          <fpage>3843</fpage>
          . Association for Computational Linguistics, Brussels, Belgium (Oct-Nov
          <year>2018</year>
          ). https://doi.org/10.18653/v1/
          <fpage>D18</fpage>
          -1418
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Reimers</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gurevych</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Sentence-BERT: Sentence embeddings using Siamese BERT-networks</article-title>
          .
          <source>In: EMNLP/IJCNLP (1)</source>
          . pp.
          <volume>3982</volume>
          {
          <fpage>3992</fpage>
          . Association for Computational Linguistics, Hong Kong,
          <source>China (Nov</source>
          <year>2019</year>
          ). https://doi.org/10.18653/v1/
          <fpage>D19</fpage>
          -1410
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Reimers</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gurevych</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Making monolingual sentence embeddings multilingual using knowledge distillation</article-title>
          . In: Webber,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Cohn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y</surname>
          </string-name>
          . (eds.) EMNLP. pp.
          <volume>4512</volume>
          {
          <fpage>4525</fpage>
          .
          <article-title>Association for Computational Linguistics (</article-title>
          <year>2020</year>
          ). https://doi.org/10.18653/v1/
          <year>2020</year>
          .emnlp-main.
          <fpage>365</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Rivera</surname>
            <given-names>Zavala</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Martinez</surname>
          </string-name>
          ,
          <string-name>
            <surname>P.:</surname>
          </string-name>
          <article-title>The impact of pretrained language models on negation and speculation detection in cross-lingual medical text: Comparative study</article-title>
          .
          <source>JMIR Med Inform</source>
          <volume>8</volume>
          (
          <issue>12</issue>
          ),
          <source>e18953 (Dec</source>
          <year>2020</year>
          ). https://doi.org/10.2196/18953
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <surname>Sanchez</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Batet</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Viejo</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Utility-preserving privacy protection of textual healthcare documents</article-title>
          .
          <source>J. Biomed. Informatics</source>
          <volume>52</volume>
          ,
          <issue>189</issue>
          {
          <fpage>198</fpage>
          (
          <year>2014</year>
          ). https://doi.org/10.1016/j.jbi.
          <year>2014</year>
          .
          <volume>06</volume>
          .008
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>Sanh</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Debut</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chaumond</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wolf</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Distilbert, a distilled version of BERT: smaller, faster, cheaper and lighter</article-title>
          .
          <source>In: The 5th Workshop on Energy E cient Machine Learning and Cognitive Computing @ NeurIPS</source>
          (
          <year>2019</year>
          ), http://arxiv.org/abs/
          <year>1910</year>
          .01108
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <surname>Song</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tan</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Qin</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lu</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , Liu,
          <string-name>
            <surname>T.</surname>
          </string-name>
          :
          <article-title>Mpnet: Masked and permuted pretraining for language understanding</article-title>
          . In: Larochelle,
          <string-name>
            <given-names>H.</given-names>
            ,
            <surname>Ranzato</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Hadsell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Balcan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Lin</surname>
          </string-name>
          , H. (eds.)
          <source>NeurIPS</source>
          (
          <year>2020</year>
          ), https://proceedings.neurips.cc/paper/ 2020/hash/c3a690be93aa602ee2dc0ccab5b7b67e-Abstract.html
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          34.
          <string-name>
            <surname>Szarvas</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Farkas</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Busa-Fekete</surname>
          </string-name>
          , R.: Research paper:
          <article-title>State-of-theart anonymization of medical records using an iterative machine learning framework</article-title>
          .
          <source>J. Am. Medical Informatics Assoc</source>
          .
          <volume>14</volume>
          (
          <issue>5</issue>
          ),
          <volume>574</volume>
          {
          <fpage>580</fpage>
          (
          <year>2007</year>
          ). https://doi.org/10.1197/jamia.M2441
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          35.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wei</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dong</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bao</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          : Minilm:
          <article-title>Deep self-attention distillation for task-agnostic compression of pre-trained transformers</article-title>
          . In: Larochelle,
          <string-name>
            <given-names>H.</given-names>
            ,
            <surname>Ranzato</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Hadsell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Balcan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Lin</surname>
          </string-name>
          , H. (eds.)
          <source>NeurIPS</source>
          (
          <year>2020</year>
          ), https://proceedings.neurips.cc/paper/2020/hash/ 3f5ee243547dee91fbd053c1c4a845aa-Abstract.html
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>