<!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>FANCY: A Diagnostic Data-Set for NLI Models</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Guido Rocchietti</string-name>
          <email>guido.rocchietti@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Flavia Achena</string-name>
          <email>flavia.achena@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Giuseppe Marziano</string-name>
          <email>marzianogiuseppe@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sara Salaris</string-name>
          <email>sarasalaris16@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alessandro Lenci</string-name>
          <email>alessandro.lenci@unipi.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Pisa</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <fpage>2</fpage>
      <lpage>7</lpage>
      <abstract>
        <p>We present here FANCY (FActivity, Negation, Common-sense, hYpernimy), a new dataset with 4000 sentence pairs concerning complex linguistic phenomena such as factivity, negation, common-sense knowledge, hypernymy and hyponymy. The analysis is developed on two levels: coarse-grained for the labels of the Natural Language Inference (NLI), that is to say the task of determining whether a hypothesis is true (entailment), false (contradiction), or undetermined (neutral) and finegrained for the linguistic features of each phenomenon. For our experiments, we analyzed the quality of the sentence embeddings generated from two transformerbased neural models, BERT (Devlin et al., 2018) and RoBERTa (Liu et al., 2019b), that were fine-tuned on MNLI and were tested on our dataset, using CBOW as a baseline. The results obtained are lower than the performance of the same models on benchmarks like GLUE (Wang et al., 2018) and SuperGLUE (Wang et al., 2019) and allow us to understand which linguistic features are the most difficult to understand.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>Nowadays it has become more and more
important to understand how much neural models
applied to Natural Language Processing can
understand about language features.</p>
      <p>
        The probing task methodology is a simple but
effective approach to address this issue
        <xref ref-type="bibr" rid="ref4">(Conneau
et al., 2018)</xref>
        . A network is trained on a specific
      </p>
      <p>Copyright © 2021 for this paper by its authors. Use
permitted under Creative Commons License Attribution 4.0
International (CC BY 4.0).
task and then the representations are passed to
a classifier. The performance of the classifier is
evaluated with a dataset constructed to test the
understanding of specific linguistic phenomena. If
the classifier performs well, then it can be deduced
that the neural embeddings have stored syntactic
and semantic knowledge relative to those specific
linguisitc phenomena.</p>
      <p>One of the most widely used tasks for this
approach is Natural Language Inference, in which
the model must decide whether a hypothesis is an
entailment, a contradiction, or simply neutral with
respect to the premise.</p>
      <p>Another approach consists in using
benchmarks, i.e. datasets relating to various types of
tasks, which are able, on the basis of the results
obtained, to provide a general judgment on the
performance of the model. Although benchmarks are
very useful in evaluating the average performance
of models, they are less effective in representing a
wide range of linguistic phenomena that the
models are able to deal with.</p>
      <p>
        It is in this context that the challenge sets are
born, (also called adversarial sets, stress sets or
diagnostic sets) such as the SNLI (Stanford
Natural Language Inference)
        <xref ref-type="bibr" rid="ref3">(Bowman et al., 2015)</xref>
        and the MultiNLI (Multi-genre Natural Language
Inference)
        <xref ref-type="bibr" rid="ref24">(Williams et al., 2018)</xref>
        . This datasets
provide the possibility of more specific evaluation
frameworks compared to traditional benchmarks
        <xref ref-type="bibr" rid="ref1 ref12 ref19 ref2">(Belinkov and Glass, 2019)</xref>
        : as in the case of the
probing task, the aim is to evaluate the quality of
linguistic information encoded by vector
representations.
      </p>
      <p>For our research we built a diagnostic dataset
that addresses key aspects of the human
knowledge of lexical and compositional meaning, in
order to test the deep semantic abilities of the latest
computational models.</p>
      <p>In this paper, we introduce FANCY, a dataset
with 4,000 different hand-annotated sentence pairs
with inference relation between them. In
Section 3 we will briefly present the linguistic
phenomena we decided to analyze. In Section 4 we
will present the methods of dataset construction
and in Section 5 we will discuss the results of the
experiments conducted on FANCY.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>Despite the progress made in recent years in the
study of vector representations, it is still difficult
to understand exactly what kind of linguistic
properties they capture. The main approaches used in
this area are probing tasks and diagnostic datasets.</p>
      <p>
        A probing task is a classification problem
focused on the simple linguistic properties of
sentences
        <xref ref-type="bibr" rid="ref4">(Conneau et al., 2018)</xref>
        . This approach has
been used on a wide variety of linguistic
phenomena. The work of Ettinger (2016), for
example, focused on semantic role and negation scope:
the sentence embeddings used are Skip-Thought
        <xref ref-type="bibr" rid="ref10">(Kiros et al., 2015)</xref>
        , Paragram
        <xref ref-type="bibr" rid="ref11 ref15 ref18">(Le and Mikolov,
2014)</xref>
        and those obtained from the average of
GloVe word embeddings
        <xref ref-type="bibr" rid="ref18">(Pennington et al., 2014)</xref>
        .
Adi et al. (2016) verified whether sentence
embeddings are able to encode information such as the
order, length and content of words in a sentence.
These elements were evaluated on sentence
embedding produced by CBOW (Continuous
Bag-ofWords) and Encoder-Decoder (ED) models, both
pre-trained on Wikipedia.
      </p>
      <p>On the other hand, the importance of challenge
sets is demonstrated by the fact that some
traditional benchmarks have been equipped, in
addition to the standard datasets, with challenge sets
dedicated entirely to the NLI task. In fact, both
GLUE and SuperGLUE have a diagnostic dataset,
consisting of about 1000 pairs of manually
constructed sentences involving 30 linguistic
phenomena, including anaphora, factivity, negation,
redundancy, hyponymy, etc. Similar challenge sets
have been developed and described in the
publications of Naik et al. (2018), a dataset in which
the errors committed related to negation,
antinomies and numerical reasoning are also
investigated, Glockner et al. (2018), a challenge set
created with particular reference to common
knowledge and McCoy et al. (2019), an evaluation
dataset that contains 30,000 specific examples on
which neural models perform incorrect
classifications, such as lexical overlap, subsequence,
constituent, etc.</p>
    </sec>
    <sec id="sec-3">
      <title>Linguistic Phenomena</title>
      <p>We selected four different kinds of linguistic
phenomena to analyze: (1) the factivity, which
address the truthfulness and the factuality of the
events mentioned inside the phrases, (2) the
negation, which in the English language can be
expressed by several terms and situations, (3)
hierarchical relations, i.e. semantic relations like
hypernymy between a general term and a more specific
term, and (4) the common-sense knowledge, which
relates to the shared knowledge among speakers
about events and facts concerning the real world.
3.1</p>
      <sec id="sec-3-1">
        <title>Factivity</title>
        <p>Factivity is a linguistic phenomenon related to the
truthfulness of events or concepts that are
mentioned and expressed in a sentence: each event,
based on the elements contained in the sentence,
can assume a certain degree of certainty.
a. John thinks it’s raining.
b. John knows it’s raining.</p>
        <p>When a speaker reads the non-factive verb think
(a.), he understands that the event mentioned in the
sentence (it’s raining) is just a possibility, while he
deduces that it’s a fact when the factive verb know
is used (b.).</p>
        <p>
          When we talk of situations and events that
occur, have occurred or will surely occur in the
world, we present them as facts, while we usually
complete our tales using approximations in cases
where we do not know whether the things we are
talking about have actually happened and we are
not completely sure of their certainty. It is in this
context that we can observe the phenomenon of
factivity
          <xref ref-type="bibr" rid="ref21">(Saur´ı and Pustejovsky, 2012)</xref>
          .
3.2
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>Negation</title>
        <p>
          Negation is a complex phenomenon that
characterize human language among all
          <xref ref-type="bibr" rid="ref8">(Horn, 1989)</xref>
          .
From a logical perspective, it is the opposite of
afifrmation, which means that the truth value of the
statement is reversed by the negative. The main
challenge is to identify the scope of the negative
marker within the sentence, i.e. which element
is semantically negated
          <xref ref-type="bibr" rid="ref9">(Jackendoff, 1969)</xref>
          . If we
consider a sentence such as Mary does not read
carefully, we can observe that the scope is partial,
because the negation refers only to the adverb.
Besides the most common not, nobody and nothing,
we have taken into account all possible negative
cases in the English language.
        </p>
        <p>
          Negation may be implicit, such as forget
meaning not remember, or affixal in such terms as
illegal or dis-agreement. It could be related to
quantifiers, in cases such as not all veggies are
tasty which contradicts all veggies are not tasty.
Some sentences can occur with double negative
markers, such as John called neither his father
nor his mother. Moreover, we can observe
contrastive negation
          <xref ref-type="bibr" rid="ref16">(McCawley, 1991)</xref>
          , in sentences
like John drank not coffee but tea. So, although
characteristic of all languages and frequently used,
negation is a complex phenomenon to investigate.
3.3
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>Hierarchical Relations</title>
        <p>
          In many cases, the entailment relations can
occur not only at a sentence level but also at a word
level, if we consider the meaning relations that
exist between words: these kinds of relations are
deifned as lexical entailment
          <xref ref-type="bibr" rid="ref20">(Roller, 2017)</xref>
          and they
are determined for example by subtype/type
hierarchical relations such as hyponymy (dog is
hyponym of animal) and troponymy (run is troponym
of move)
          <xref ref-type="bibr" rid="ref1 ref12 ref19">(Pustejovsky and Batiukova, 2019)</xref>
          . We
define the subtype/type relation as entailment (dog
entails animal) and the type/subtype relation as
neutral (animal does not entail dog)
          <xref ref-type="bibr" rid="ref14">(MacCartney
and Manning, 2009)</xref>
          . However, the logical
relations between lexical elements can be differently
projected by the properties (upward monotone,
downward monotone and non-monotone) of some
semantic functions (projectivity signatures) such
as restrictive quantifiers (some, any, every, etc.),
negation and superlative
          <xref ref-type="bibr" rid="ref11 ref15 ref18">(MacCartney and
Manning, 2014)</xref>
          . A function is upward monotone if
the logical relation between premise and
hypothesis is projected without change: the sentence some
parrots talk entails some birds talk. A function is
downward monotone if it reverses the logical
relations between premise and hypothesis: no fish talk
entails no carp talk. A function is non-monotone
if it projects the logical relation between premise
and hypothesis as neutral: most humans talk does
not entail most animals talk (and vice-versa).
3.4
        </p>
      </sec>
      <sec id="sec-3-4">
        <title>Common-Sense Knowledge</title>
        <p>
          The concept of common-sense is hard to define
because it is strictly entangled with the way we
humans reason. Even though its definition is
controversial, we adopt here what Feldman called The
Standard View
          <xref ref-type="bibr" rid="ref6">(Feldman, 2003)</xref>
          . In his book he
defined eleven categories that give us an idea of the
things we know as human beings. He stated two
different thesis that constitute the Standard View:
the first one states that We know a large variety
of things in categories (a)-(k)1 and the second one
states that Our primary sources of knowledge are
(a)-(f)2.
        </p>
        <p>Starting from the types suggested by LoBue and
Yates (2011), we grouped common-sense into vfie
macro-categories.</p>
        <p>Causal Relations The categories in which the
statement of the premise causes the hypothesis
statement, e.g. the man had a bath entails the man
got wet: here we can see how the fact that the man
took a bath is the cause for him of being wet, hence
there is a Cause/Effect relation. At the same time
the fact that Mary was married to John
automatically implies John was married to Mary, therefore
the relation is of Simultaneous Condition.</p>
        <p>Spatial Relations This category includes
sentences that specify the physical position of an
agent or an object with respect to someone or
something, e.g. the fact that John is inside his
home contradicts the sentence John is close to his
home because: in this case, the spatial prepositions
inside and close to cannot subsist at the same time.</p>
        <p>Temporal Relations In this category are
included texts that specify the time of en event with
respect to someone or something, e.g. the fact that
Julius Caesar was assassinated in 44 B.C. implies
that Julius Caesar died before the birth of Christ.
In this example the reader is supposed to know that
B.C. indicates the birth of Christ, which is not
trivial.</p>
        <p>World Knowledge Relations All the categories
that suppose a previous knowledge of the
phenomenal or human world, for example all the sentences
that suppose a geographic knowledge to be
correctly tagged, e.g. Charles Dickens is buried in
Westminster Abbey implies that Charles Dickens
rests in London only if we know that Westminster
is in London.</p>
        <p>Other Relations In this set we put all the
categories which are not included in the previous ones
(e.g., arithmetic relations and mutually exclusive
relations). For example, On the train, there are
340 passengers and 40 employees implies that On
the train, there are 380 people because we know
that if there are 340 + 40 people on the train then
the total of the people will be 380.</p>
        <p>1The categories that we know, such as the past, morality,
science etc.</p>
        <p>2He individuated six different sources of knowledge such
as perception, memory,reasoning etc.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Dataset Construction</title>
      <p>The dataset created for the experiments consists
in 4000 pairs of sentences that were built
manually by the authors, and this is because we decided
to only include sentences that were as simple and
clear as possible, in order to specifically focus on
the linguistic features of the phenomena and to
exclude other external factors of complexity that
could have affected the performance of the neural
models. For the construction of FANCY, we
followed the diagnostic dataset schema provided with
the SuperGlue3 benchmark for models evaluation,
so all the data were inserted in a tabular framework
and tagged with the following columns and labels.</p>
      <sec id="sec-4-1">
        <title>Premise and Hypothesis Are the first two</title>
        <p>columns of the dataset and indicate which
sentence is the premise and which is the hypothesis.</p>
        <p>FW and BW These two columns point out
which one of the sentences should be used as the
premise. For instance, if we find the sentence
Granada is in Spain as the premise, and Granada
is in Europe as the hypothesis in the database, the
column FW (forward) considers the first as the
premise and the second as the hypothesis while
the columns BW (backward) considers the second
sentence as the premise and the first as the
hypothesis. In both of the columns we inserted the
correct output: in the example above, the column FW
would contain the tag entailment, because the first
sentence implies the second one, while the column
BW would contain the tag neutral because the
second sentence does not imply the first one but does
not contradict that either.</p>
      </sec>
      <sec id="sec-4-2">
        <title>Phenomenon Category This column is very</title>
        <p>important for this study because it specifies which
kind of feature regarding a particular phenomenon
is represented by the sentence pairs.</p>
        <p>Phenomenon
Factivity
Negation
Hierarchical
Common-sense</p>
        <p>In Table 1 we can see that FANCY is composed
of 1406 pairs of sentences that lead to an
entailment, 1622 sets of neutral sentences and 968
contradictions.</p>
        <sec id="sec-4-2-1">
          <title>3https://super.gluebenchmark.com/diagnostics</title>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Experiments</title>
      <p>In this section, we report the results of the
experiments conducted using our dataset FANCY. We
tested state-of-the-art models for NLI on the four
different linguistic phenomena in the dataset. We
selected bert-base-uncased-MNLI and
robertalarge-mnli, both of which were finetuned on the
MNLI dataset, and also a baseline model based
on CBOW. The BERT and RoBERTa models are
based on the Transformer architecture and are
available on the Hugging Face web page.4 For
what concerns the CBOW model, it was built
using the tensorflow library, 5 with the word
embeddings generated by GloVe pretrained with 840
Billions tokens, a vocabulary of 2.2 millions cased
words and the resulting word vectors with 300
dimensions.6 The model was then trained on the
MultiNLI dataset, so that all three models were
trained on the same data.</p>
      <p>Set
MNLI
Factivity
Negation
Hierarchical
Common-sense</p>
      <p>BERT
84.6
65.2
70.0
49.7
57.0</p>
      <p>RoBERTa
90.2
74.6
82.0
60.4
68.0</p>
      <p>CBOW
65.2
45.1
45.0
37.8
41.0</p>
      <p>We tested every model on the examples of
FANCY. The results in Table 5 show how the
models struggled to address these kind of phenomena,
if compared with the results on the MNLI. We
can see that the baseline model performed quite
poorly on all the subsets of our data. RoBERTa
is the best performing one, even though it showed
poor performances on linguistic phenomena such
as common-sense and hierarchical relations while
performing better on factivity and negations.</p>
      <p>Label
Possibly Fact
Possibly Counterfact
Fact
Counterfact</p>
      <p>In Table 3 we can see the errors that RoBERTa
made in labeling examples regarding factivity.
Most of the errors concern examples where the
hypothesis gave place to a Possible fact and therefore
should be tagged as neutral.</p>
      <sec id="sec-5-1">
        <title>4https://huggingface.co/ 5https://www.tensorflow.org/ 6https://nlp.stanford.edu/projects/glove/</title>
        <p>In Table 5 it is evident that the largest number
of errors belongs to the Negation macro-category.
In this case, the sentences contained elements such
as quantifiers, modals, temporal adverbs and
relative pronouns. Therefore, it appears that the
comprehension of negation is more difficult when it is
related to these elements.</p>
        <p>In Table 6 we can see the errors made by the
RoBERTa in dealing with hierarchical
relationships. Most errors relate to Downward Monotone
and Non-Monotone sentences.</p>
        <p>In Table 7 we show only the most relevant
categories for what concerns the errors
committed by the model dealing with common-sense and
common-knowledge.</p>
        <p>As we can see, Temporal Relation,
Preconditions and Spatial Relation are the most difficult
categories for the model to label correctly.</p>
        <p>As illustrative examples, in Table 4 are four
sentences mislabelled by RoBERTa. We note that the</p>
        <sec id="sec-5-1-1">
          <title>Premise</title>
          <p>The man was born in 1950.
No arrow hit the target.</p>
          <p>Bob believes that Twin Peaks
is the best tv show ever.
All seagulls fly.</p>
        </sec>
        <sec id="sec-5-1-2">
          <title>Hypothesis</title>
          <p>The man was 18 in 1968.
Not all arrows hit the target.
Twin Peaks is the best tv
show ever.</p>
          <p>All birds fly.</p>
        </sec>
        <sec id="sec-5-1-3">
          <title>Gold</title>
          <p>E
C
N
N</p>
        </sec>
        <sec id="sec-5-1-4">
          <title>Pred.</title>
          <p>
            C
E
E
E
Following a large number of recent studies
            <xref ref-type="bibr" rid="ref17">(Naik
et al., 2018)</xref>
            ,
            <xref ref-type="bibr" rid="ref7">(Glockner et al., 2018)</xref>
            ,
            <xref ref-type="bibr" rid="ref1 ref2">(Belinkov
et al., 2019)</xref>
            ,
            <xref ref-type="bibr" rid="ref12 ref13">(Liu et al., 2019a)</xref>
            , we also tried to
investigate whether the latest neural models were
able to understand certain linguistic phenomena.
On the one hand, we wanted to test the models on
the real understanding of the English language, on
the other hand, we wanted to build a fine-grained
dataset, which allows a detailed analysis of each
phenomenon. We tested two of the the most
highperformance models such as BERT and RoBERTa
and we observed how they struggle dealing with
linguistic features that are quite simple to
understand for a human being.
          </p>
          <p>We have shown how the models can better
handle phenomena such as factivity and negation if
compared with the results obtained on
hierarchical relation and common-sense knowledge. More
in particular, we were able to stress how the
stateof-the-art models struggle in dealing with
linguistic phenomena that are essential for a correct
understanding of the language such as the
possibility generated by a statement, temporal
relations between entities, the negation when there
is a presence of temporal adverbs and relative
pronouns and cases of downward monotone
sentences. In future developments of our work we
could use FANCY in order to perform fine
tuning on Transformer-based models with the aim of
increasing model performance and inferential
capabilities. To do this it would be useful to produce
more data, possibly annotated by different people,
to test the models developed on different types of
natural language. At the same time, the dataset
could be implemented with other languages, such
as Italian.</p>
        </sec>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>Yonatan</given-names>
            <surname>Belinkov</surname>
          </string-name>
          and
          <string-name>
            <given-names>James</given-names>
            <surname>Glass</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Analysis methods in neural language processing: A survey</article-title>
          .
          <source>Trans. Assoc. Comput. Linguist.</source>
          ,
          <volume>7</volume>
          :
          <fpage>49</fpage>
          -
          <lpage>72</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>Yonatan</given-names>
            <surname>Belinkov</surname>
          </string-name>
          , Adam Poliak, Stuart Shieber, Benjamin Durme, and
          <string-name>
            <given-names>Alexander</given-names>
            <surname>Rush</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>On adversarial removal of hypothesis-only bias in natural language inference</article-title>
          . pages
          <fpage>256</fpage>
          -
          <lpage>262</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>Samuel R. Bowman</surname>
            , Gabor Angeli, Christopher Potts, and
            <given-names>Christopher D.</given-names>
          </string-name>
          <string-name>
            <surname>Manning</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>A large annotated corpus for learning natural language inference</article-title>
          .
          <source>In Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing</source>
          , pages
          <fpage>632</fpage>
          -
          <lpage>642</lpage>
          . Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <given-names>Alexis</given-names>
            <surname>Conneau</surname>
          </string-name>
          , German Kruszewski, Guillaume Lample, Lo¨ıc Barrault, and
          <string-name>
            <given-names>Marco</given-names>
            <surname>Baroni</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>What you can cram into a single vector: Probing sentence embeddings for linguistic properties</article-title>
          .
          <source>In Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</source>
          , pages
          <fpage>2126</fpage>
          -
          <lpage>2136</lpage>
          . Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          ,
          <string-name>
            <surname>Ming-Wei</surname>
            <given-names>Chang</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Kenton</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and Kristina</given-names>
            <surname>Toutanova</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Bert: Pre-training of deep bidirectional transformers for language understanding</article-title>
          .
          <source>In NAACL-HLT.</source>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <given-names>Richard</given-names>
            <surname>Feldman</surname>
          </string-name>
          .
          <year>2003</year>
          . Epistemology. Prentice Hall.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <given-names>Max</given-names>
            <surname>Glockner</surname>
          </string-name>
          , Vered Shwartz, and
          <string-name>
            <given-names>Yoav</given-names>
            <surname>Goldberg</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Breaking NLI systems with sentences that require simple lexical inferences</article-title>
          .
          <source>In Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume</source>
          <volume>2</volume>
          :
          <string-name>
            <surname>Short</surname>
            <given-names>Papers).</given-names>
          </string-name>
          <article-title>Association for Computational Linguistics</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>Laurence</given-names>
            <surname>Horn</surname>
          </string-name>
          .
          <year>1989</year>
          .
          <article-title>A Natural History of Negation</article-title>
          . University of Chicago Press.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <given-names>Ray S.</given-names>
            <surname>Jackendoff</surname>
          </string-name>
          .
          <year>1969</year>
          .
          <article-title>An interpretive theory of negation</article-title>
          .
          <source>Foundations of Language</source>
          ,
          <volume>5</volume>
          (
          <issue>2</issue>
          ):
          <fpage>218</fpage>
          -
          <lpage>241</lpage>
          . Publisher: Springer.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <given-names>Ryan</given-names>
            <surname>Kiros</surname>
          </string-name>
          , Yukun Zhu, Ruslan Salakhutdinov, Richard S Zemel, Antonio Torralba, Raquel Urtasun, and
          <string-name>
            <given-names>Sanja</given-names>
            <surname>Fidler</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Skip-thought vectors</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <surname>Quoc</surname>
            <given-names>V</given-names>
          </string-name>
          <string-name>
            <surname>Le</surname>
            and
            <given-names>Tomas</given-names>
          </string-name>
          <string-name>
            <surname>Mikolov</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Distributed representations of sentences and documents</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <surname>Nelson F. Liu</surname>
            ,
            <given-names>Roy</given-names>
          </string-name>
          <string-name>
            <surname>Schwartz</surname>
          </string-name>
          , and
          <string-name>
            <surname>Noah</surname>
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Smith</surname>
          </string-name>
          . 2019a.
          <article-title>Inoculation by fine-tuning: A method for analyzing challenge datasets</article-title>
          .
          <source>Proceedings of the</source>
          <year>2019</year>
          <article-title>Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <given-names>Yinhan</given-names>
            <surname>Liu</surname>
          </string-name>
          , Myle Ott, Naman Goyal, Jingfei Du, Mandar Joshi, Danqi Chen,
          <string-name>
            <surname>Omer Levy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Mike</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Luke</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Veselin</given-names>
            <surname>Stoyanov</surname>
          </string-name>
          .
          <year>2019b</year>
          .
          <article-title>RoBERTa: A robustly optimized BERT pretraining approach</article-title>
          . arXiv:
          <year>1907</year>
          .11692 [cs].
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <surname>Bill MacCartney and Christopher D. Manning</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <article-title>An extended model of natural logic</article-title>
          .
          <source>In Proceedings of the Eight International Conference on Computational Semantics</source>
          , pages
          <fpage>140</fpage>
          -
          <lpage>156</lpage>
          , Tilburg, The Netherlands.
          <article-title>Association for Computational Linguistics</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <surname>Bill MacCartney and Christopher D. Manning</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Natural logic and natural language inference</article-title>
          .
          <source>In Computing Meaning</source>
          , volume
          <volume>47</volume>
          , pages
          <fpage>129</fpage>
          -
          <lpage>147</lpage>
          . Springer Netherlands.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <surname>James D. McCawley</surname>
          </string-name>
          .
          <year>1991</year>
          .
          <article-title>The Syntactic Phenomena of English.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <string-name>
            <given-names>Aakanksha</given-names>
            <surname>Naik</surname>
          </string-name>
          , Abhilasha Ravichander, Norman Sadeh, Carolyn Rose, and
          <string-name>
            <given-names>Graham</given-names>
            <surname>Neubig</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Stress test evaluation for natural language inference</article-title>
          .
          <source>In Proceedings of the 27th International Conference on Computational Linguistics</source>
          , pages
          <fpage>2340</fpage>
          -
          <lpage>2353</lpage>
          . Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          <string-name>
            <surname>Jeffrey</surname>
            <given-names>Pennington</given-names>
          </string-name>
          , Richard Socher, and
          <string-name>
            <given-names>Christopher</given-names>
            <surname>Manning</surname>
          </string-name>
          .
          <year>2014</year>
          .
          <article-title>Glove: Global vectors for word representation</article-title>
          .
          <source>In Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)</source>
          .
          <article-title>Association for Computational Linguistics</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          <string-name>
            <given-names>James</given-names>
            <surname>Pustejovsky</surname>
          </string-name>
          and
          <string-name>
            <given-names>Olga</given-names>
            <surname>Batiukova</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>The Lexicon</article-title>
          . Cambridge University Press, Cambridge, England.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          <string-name>
            <given-names>Stephen</given-names>
            <surname>Creig Roller</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Identifying lexical relationships and entailments with distributional semantics</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          <source>Roser Saur´ı and James Pustejovsky</source>
          .
          <year>2012</year>
          .
          <article-title>Are you sure that this happened? assessing the factuality degree of events in text</article-title>
          .
          <source>Computational Linguistics - COLI</source>
          ,
          <volume>38</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>39</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          <string-name>
            <given-names>Alex</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Amanpreet</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <surname>Julian Michael</surname>
          </string-name>
          , Felix Hill,
          <string-name>
            <given-names>Omer Levy</given-names>
            , and
            <surname>Samuel</surname>
          </string-name>
          <string-name>
            <given-names>R.</given-names>
            <surname>Bowman</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Glue: A multi-task benchmark and analysis platform for natural language understanding</article-title>
          .
          <source>Proceedings of the 2018 EMNLP Workshop BlackboxNLP: Analyzing and Interpreting Neural Networks for NLP</source>
          , pages
          <fpage>353</fpage>
          -
          <lpage>355</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          <string-name>
            <given-names>Alex</given-names>
            <surname>Wang</surname>
          </string-name>
          , Yada Pruksachatkun, Nikita Nangia, Amanpreet Singh,
          <string-name>
            <surname>Julian Michael</surname>
          </string-name>
          , Felix Hill,
          <string-name>
            <surname>Omer Levy</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Samuel</given-names>
            <surname>Bowman</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>SuperGLUE: A stickier benchmark for general-purpose language understanding systems</article-title>
          .
          <source>In Advances in neural information processing systems</source>
          , volume
          <volume>32</volume>
          . Curran Associates, Inc.
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          <string-name>
            <given-names>Adina</given-names>
            <surname>Williams</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Nikita</given-names>
            <surname>Nangia</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Samuel</given-names>
            <surname>Bowman</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>A broad-coverage challenge corpus for sentence understanding through inference</article-title>
          .
          <source>In Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (
          <issue>Long Papers)</issue>
          , pages
          <fpage>1112</fpage>
          -
          <lpage>1122</lpage>
          . Association for Computational Linguistics.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>