<!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>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Alessio Miaschi</string-name>
          <email>alessio.miaschi@phd.unipi.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Chiara Alzetta</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dominique Brunato</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Felice Dell'Orletta</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Giulia Venturi</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pisa ItaliaNLP Lab - www.italianlp.it</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science, University of Pisa</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Probing tasks are frequently used to evaluate whether the representations of Neural Language Models (NLMs) encode linguistic information. However, it is still questioned if probing classification tasks really enable such investigation or they simply hint for surface patterns in the data. We present a method to investigate this question by comparing the accuracies of a set of probing tasks on gold and automatically generated control datasets. Our results suggest that probing tasks can be used as reliable diagnostic methods to investigate the linguistic information encoded in NLMs representations.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>
        In recent years we saw the raise of a consistent
body of work dealing with the use of probing tasks
to test the linguistic competence learned by Neural
Language Models (NLMs)
        <xref ref-type="bibr" rid="ref10 ref11 ref14 ref15 ref21 ref3">(Conneau et al., 2018;
Warstadt et al., 2019; Hewitt and Liang, 2019;
Miaschi et al., 2020)</xref>
        . The idea behind the probing
paradigm is actually quite simple: using a
diagnostic classifier, the probing model or probe, that
takes the output representations of a NLM as input
to perform a probing task, e.g. predict a given
language property. If the probing model will predict
the property correctly, then we can assume that
the representations somehow encode that property.
Studies relying on this method reported that NLMs
representations do encode several properties
related to morphological, syntactic and semantic
information.
      </p>
      <p>
        Despite the amount of work, there are still
several open questions concerning their use
        <xref ref-type="bibr" rid="ref1 ref18">(Belinkov, 2021)</xref>
        : which probing model should we use
      </p>
      <p>Copyright © 2021 for this paper by its authors. Use
permitted under Creative Commons License Attribution 4.0
International (CC BY 4.0).
for assessing the linguistic competence of a NLM?
Are probes the most effective strategy to achieve
such goal? These questions fostered two
complementary lines of research. The first one is devoted
to modifying the architecture of the current
probing models; the other one is focused on evaluating
the effectiveness of probing models. Both are still
not well investigated issues, although their
importance for advancing the research on the evaluation
of NLMs linguistic competences has been widely
recognized.</p>
      <p>
        Among the first line of research, dealing with
the design of probing classifiers, several works
investigate which model should be used as probe
and which metric should be employed to
measure their performance. With this respect, it is
still questioned if one should rely on simple
models
        <xref ref-type="bibr" rid="ref10 ref11 ref13 ref17 ref7">(Hewitt and Manning, 2019; Liu et al., 2019;
Hall Maudslay et al., 2020)</xref>
        or complex ones
        <xref ref-type="bibr" rid="ref17 ref20 ref4 ref7">(Pimentel et al., 2020; Voita and Titov, 2020)</xref>
        in terms of model parametrization. Specifically,
Voita and Titov (2020) suggest to design
alternative probes using a novel information-theoretic
approach which balances the probe inner complexity
with its task performance.
      </p>
      <p>Concerning works facing the issue of
investigating the effectiveness of the probing paradigm,
Hewitt and Liang (2019) observe that probing tasks
might conceal the information about the NLM
representation behind the ability of the probe to learn
surface patterns in the data. To test this idea, they
introduced control tasks, a set of tasks that
associate word types with random outputs that can be
solved by simply learning regularities. Along the
same line, Ravichander et al. (2021) test probing
tasks by creating control datasets where a property
is always reported in a dataset with the same value,
thus it is not discriminative for testing the
information contained in the representations. Their
experiments highlight that the probe may learn a
property also incidentally, thus casting doubts on the
effectiveness of probing tasks.</p>
      <p>
        The scenario defined by the latter two works is
the one we deal with in this paper. Specifically,
we introduce a new approach to put increasingly
under pressure the effectiveness of a suite of
probing tasks to test the linguistic knowledge
implicitly encoded by BERT
        <xref ref-type="bibr" rid="ref5">(Devlin et al., 2019)</xref>
        , one of
the most prominent NLMs. To achieve this goal,
we set up a number of experiments (see Section 2)
aimed at comparing the performance of a
regression model trained with BERT representations to
predict the values of a set of linguistic properties
extracted from the Italian Universal Dependency
Treebank
        <xref ref-type="bibr" rid="ref23">(Zeman et al., 2020)</xref>
        and from a suite of
control datasets we specifically built for the
purpose of this study. We define a control dataset as a
set of linguistic features whose values were
automatically altered in order to be increasingly
different from the values in the treebank, referred to as
gold values. Our underlying hypothesis is that if
the predictions of the increasingly altered values
progressively diverge from the predictions of the
gold values, this possibly suggests that the
corresponding probing tasks are effective strategies to
test the linguistic knowledge embedded in BERT
representation We will discuss the results of our
experiments in light of this hypothesis in Section
3. In Section 4 we will draw the conclusions.
      </p>
      <p>
        Note that this is one of the few studies focused
on non-English NLMs. In fact, with the
exception of
        <xref ref-type="bibr" rid="ref15 ref4 ref6">(de Vries et al., 2020; Miaschi et al., 2021;
Guarasci et al., 2021)</xref>
        , the majority of research
related to interpretability issues is focused on
English or, at most, multilingual models.
      </p>
      <p>Contributions To the best of our knowledge this
is the first paper that (i) introduces a methodology
to test the reliability of probing tasks by building
control tasks at increasing level of complexity, (ii)
puts under pressure the probing approach
considering the Italian language.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Methodology</title>
      <p>Our methodology seeks to investigate the
effectiveness of probing tasks for evaluating the
linguistic competences encoded in NLM
representations. To this aim, we trained a probing model
(described in Section 2.1) using BERT sentence
representations and then tested its performance when
predicting the values of a set of linguistic features
(see Section 2.3) in multiple scenarios. In one
scenario, the model shall predict gold values, thus
corresponding to the real values of the features in
the corpus. In the other scenarios, we
automatically altered the feature values at different control
levels each corresponding to increasing degrees of
pressure for the probing model, as discussed in
Section 2.4.</p>
      <p>Our methodology will allow us to test whether
the probing model really encodes linguistic
competences or simply learns regularities in the task
and data distributions by checking the results
obtained in the different scenarios. If the predictions
of the probing model will be more similar to the
gold values than to the automatically altered ones,
then we might assume that the information
captured by the probed feature is encoded in the
representations.
2.1</p>
      <sec id="sec-2-1">
        <title>Model</title>
        <p>
          Our model is a pre-trained Italian BERT.
Specifically, we used the base cased BERT
developed by the MDZ Digital Library Team,
available trough the Huggingface’s Transformers
library
          <xref ref-type="bibr" rid="ref22">(Wolf et al., 2020)</xref>
          1. The model was trained
using Wikipedia and the OPUS corpus
          <xref ref-type="bibr" rid="ref19">(Tiedemann and Nygaard, 2004)</xref>
          . For the
sentencelevel representations, we leveraged the activation
of the first input token [CLS]. The probing model
is a linear Support Vector Regression model
(LinearSVR).
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Data</title>
        <p>
          Our experiments are carried out on the Italian
Universal Dependencies Treebank (IUDT),
version 2.5
          <xref ref-type="bibr" rid="ref23">(Zeman et al., 2020)</xref>
          , containing a total
of 35,480 sentences. Due to the IUDT high
variability in terms of sentence length2, we focused
on a sub-set of sentences with a ± 10 tokens
variation with respect to the median sentence length
(i.e. 20 tokens). As a result, we selected 21,991
sentences whose length ranges between 10 and 30
tokens. This way our dataset is balanced, viz., the
amount of sentences with exact same length
considered for the experiments is comparable.
Specifically, our dataset accounts for around 1,000
sentences for each reported value of sentence length,
which makes the results of our analyses reliable
and comparable.
        </p>
        <p>1https://huggingface.co/dbmdz/bert-base-italian-xxlcased</p>
        <p>2IUDT contains sentences ranging from 1 to 308 token
long.</p>
        <p>Morphosyntactic information
Distibution of UD POS
Lexical density
Inflectional morphology
Distribution of lexical verbs and auxiliaries for inflectional categories
(tense, mood, person, number)
Verbal Predicate Structure
Distribution of verbal heads and verbal roots
Average verb arity and distribution of verbs by arity
Global and Local Parsed Tree Structures
Depth of the whole syntactic tree
Average length of dependency links and of the longest link
Average length of prepositional chains and distribution by depth
Average clause length
Relative order of elements
Distribution of subjects and objects in post- and pre-verbal position
Syntactic Relations
Distribution of dependency relations
Use of Subordination
Distribution of subordinate and principal clauses
Average length of subordination chains and distribution by depth
Distribution of subordinates in post- and pre-principal clause position
The probing tasks we defined consist in
predicting the value of multiple linguistic features, each
corresponding to a specific property of sentence
structure. The set includes 77 linguistic features
and it is based on the ones described in Brunato et
al. (2020) modeling 7 main aspects of the
structure of a sentence, which are reported in Table
1. They range from morpho-syntactic and
inflectional properties, to more complex aspects of
sentence structure (e.g. the depth of the whole
syntactic tree), to features referring to the structure
of specific sub-trees, such as the order of subjects
and objects with respect to the verb, to the use of
subordination.</p>
        <p>
          We chose to rely on these features for two main
reasons. Firstly, they have been shown to be
highly predictive when leveraged by traditional
learning models on a variety of classification
problems where the linguistic information plays a
fundamental role. In addition, they are multilingual as
they are based on the Universal Dependency
formalism for sentence representation
          <xref ref-type="bibr" rid="ref16">(Nivre, 2015)</xref>
          .
In fact, they have been successfully used to
proifle the knowledge encoded in the language
representations of contextual NLMs for both the Italian
          <xref ref-type="bibr" rid="ref15">(Miaschi et al., 2021)</xref>
          and English language
          <xref ref-type="bibr" rid="ref14 ref15">(Miaschi et al., 2020)</xref>
          .
        </p>
        <p>In this study, the values of each feature acquired
from IUDT represent the gold dataset and they
have been automatically altered in order to
generate additional control datasets.
We created two main types of control datasets,
obtained by automatically altering gold feature
values. The first main type (hereafter referred to as
Swapped) is built by shuffling the original
values of each feature across sentences; while the
second type (Random) contains values randomly
generated within the maximum and the minimum
value that each feature shows in the whole gold
dataset. To clarify, consider the following example
involving the feature average link length,
which captures the average linear distance
between dependents and their syntactic head within a
sentence. In the Swapped variant we simply swap
the feature values, thus a sentence which
originally showed an average link length of,
e.g., 2.86 could be changed to 8.83. Note that both
are real values extracted from our dataset. When
building the Random variant, all sentences
considered for the study show a feature value randomly
generated between 1.33 and 9.78, which are the
reported minimum and maximum average link
length values in the dataset, respectively
associated to sentences with length 11 and 21.</p>
        <p>Since the values of the considered features are
strongly related to the length of the sentence, for
each type of control dataset we built two sub-types
of datasets. In a first sub-type ( Bins), we grouped
sentences falling into the same predefined range
of sentence lengths (i.e., 10-15, 15-20, 20-25 and
25-30 tokens). In a second sub-type (Lengths),
we included groups of sentences having exactly
the same length. This motivates the choice of
sentences whose length ranges in an interval for
which we have a reliable amount of instances (as
introduced in Section 2.2).</p>
        <p>Note that the different data altering strategies
are conceived to represent increasingly
challenging testbeds to assess the effectiveness of our
probing tasks. The Swapped control datasets are the
most challenging ones as the swapped feature
values might be quite similar to the gold ones, thus
possibly predicted with an high accuracy by the
probing model. Such intuition is confirmed by the
results of the 2-dimensional Principal Component
Analysis (PCA) reported in Figure 13. As we can
see, all the data points representing the feature
values contained in the Swapped datasets fully
overlap with the gold ones, thus confirming their
similarity. On the contrary, randomly generated values
are progressively more distant being less
plausible, even if the constraints of sentence length yield
values that are closer to the gold ones.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Results</title>
      <p>
        For both gold and control datasets, probing scores
are computed as a Spearman correlation between
the feature values predicted by the probing model
and the values contained in each dataset. Such
correlation values are computed by averaging the
3PCA is a classical data analysis method that reduces the
dimensionality of the data while retaining most of the
variation in the data set by identifying n principal components,
along which the variation of the data is maximal
        <xref ref-type="bibr" rid="ref12">(Jolliffe and
Cadima, 2016)</xref>
        .
      </p>
      <p>NLM’s layer–wise scores as, for all datasets, we
observed small differences between the scores
obtained across the 12 layers. We experimentally
verified that these differences were not significant
by computing the slope of a linear regression line
between BERT layers and the scores of the gold
dataset, obtaining -0.0017 as mean value
considering all features. Our intuition is that the small
range of lengths of the sentences here
considered may have yielded such insignificant variation
across layers, which on the contrary Miaschi et al.
(2021) showed to be significant on the whole set of
IUDT sentences. Namely, being highly related to
the length of the sentence, the feature values have
little variations. However, a more in-depth
investigation of the underlying reasons of this outcome
is one of the future directions of this work.</p>
      <p>Figure 2 shows the scores obtained on the
gold and the 6 control datasets, both for the 7
macro-groups of linguistic features and on average
(AVG). Additionally, in order to properly
appreciate the differences between the results obtained on
the gold and control datasets, in Figure 3 we report
the error reduction rate for each control dataset
computed as the difference between the scores
obtained when predicting gold and altered features.
General Results. We can observe that on
average the highest probing scores are obtained on the
gold dataset and that, accordingly, there is a great
difference (i.e. almost 1.0, see Figure 3) between
the accuracy of the probing model when
predicting the authentic and altered feature values. This
seems suggesting that the model is able to
recognize that the feature values contained in the
control datasets have been altered, even when they are
not fully random but plausible, i.e. in the Swapped
datasets. As a consequence, we can hypothesize
that the model is relying on some implicit
linguistic knowledge when it predicts the authentic
feature values, rather than learning some regularities
possibly found in the dataset.</p>
      <p>However, if we take a closer look at the scores
obtained for the Random and Swapped datasets
when we constrain the length of the sentences, we
can observe that the accuracy in predicting the
feature values contained in the Swapped datasets is
sightly higher than in the Random ones (see ‘AVG’
column in Figure 2). This is in line with our
starting hypothesis and shows that feature values
artificially created simply by shuffling gold ones
across sentences of the same lengths (or of the
same range of lengths) are more similar to the gold
values and thus are predicted with higher accuracy
than randomly altered values. Nevertheless, their
error rate, namely the difference from the accuracy
of gold predictions, is still quite high, i.e. about
0.80 (see the ‘AVG’ column, Figure 3).</p>
      <p>Linguistic Features Analysis. Also when we
focus on the results obtained with respect to the
7 macro-groups of linguistic features, we can
observe that the probing model is more accurate in
the prediction of the gold values. Again, the scores
on the control datasets are slightly higher when
we constrain the values with respect to sentence
length, since we narrow the range of possible
values. In particular, we see that the feature values
related to the sentence tree structure are those
predicted most closely to the gold ones (see column
‘TreeStructure’, Figure 3). Note that these
sentence properties are the most sensitive to the
sentence length, that BERT encodes with a very high
accuracy. This may suggest that in the resolution
of these tasks the probing model is possibly
relying on some regularities related to sentence length.</p>
      <p>Similar observations hold for the results
achieved in the resolution of the probing tasks
related to the use of subordination, which
heavily depends on sentence length. Interestingly, we
can note that the values of all the other groups of
features contained in the control datasets are
predicted by the probing model with a very low
accu</p>
      <sec id="sec-3-1">
        <title>Dataset</title>
        <p>Random
Random Bins
Random Lengths
Swapped
Swapped Bins
Swapped Lengths</p>
        <p>Gold Random Bins Swapped Lengths
dep dist root dep dist root dep dist root
dep dist punct avg max links len avg max links len
upos dist PUNCT max links len max links len
xpos dist FS xpos dist FB avg max depth
upos dist ADP avg token per clause verbal head per sent
dep dist det xpos dist FS xpos dist FS
upos dist PROPN n prep chains avg links len
upos dist DET avg max depth subord prop dist
xpos dist RD verbal head per sent avg subord chain len
dep dist case xpos dist RI n prep chains
verbal head per sent dep dist cop subord post
xpos dist FF xpos dist PC subord dist 1
xpos dist SP dep dist conj avg prep chain len
xpos dist E xpos dist B obj post
upos dist NOUN xpos dist VA avg verb edges
racy, possibly making the results not significant.
Features Correlations. Once we showed that
the probing tasks accuracy is very different if the
feature values are authentic or altered, in this
section we compare the ranking of linguistic features
ordered by decreasing prediction accuracy in the
gold and control scenarios. As we can see in
Table 2, which reports the Spearman correlations
between the rankings, the control rankings are
almost not related to the gold one and the
existing correlations in most cases are not even
statistically significant. The only exceptions are
represented by the rankings of values that were
randomly generated with sentence length constraints,
which have a weak and moderate correlation. Note
that however, as shown before, the probing scores
are very low.</p>
        <p>A more qualitative feature ranking analysis can
be carried out by inspecting Table 3 where we
report the first 15 top-ranked features predicted in
the gold and in the two most highly correlated
Swapped and Random datasets. As we can see,
the gold ranking diverges from the rankings of
the altered values with respect to the majority of
top-ranked features. The most visible exception
Starting from this preliminary finding, a possible
is represented by the distribution of syntactic root
future investigation could focus on whether using
(dep dist root) that the probing model always
prelonger or shorter sentences would also have an
efdicts with the highest accuracy. The result is quite
fect on the probing scores obtained with the
conexpected since this feature can be seen as a proxy
trol datasets.
of the length of the sentence, a linguistic
propIn future work we also plan to investigate which
erty properly encoded by BERT. Similarly, other
features are more diagnostic of the linguistic
comtwo features influenced by sentence length appear,
petence encoded by a NLM and which ones, on
as expected, on the top positions of all rankings,
the contrary, are more influenced by confounders,
namely the distribution of the sentence
boundsuch as sentence length.
ary punctuation (xpos dist FS) and of verbal heads
(verbal head per sent).
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Discussion and Conclusion</title>
      <p>In this paper we described a methodology to test
the effectiveness of a suite of probing tasks for
evaluating the linguistic competence encoded by
NLMs. To this aim, we analysed the performance
of a probing model trained with BERT
representations to predict the authentic and automatically
altered values of a set of linguistic features derived
from IUDT. We observed general higher
performance in the prediction of authentic values, thus
suggesting that the probing model relies on
linguistic competences to predict linguistic
properties. However, when we constrained automatically
altered values with respect to sentence length, the
model tends to learn surface patterns in the data.</p>
      <p>As a general remark, it should be pointed out
that our analyses dealt only with sentences
showing a standard length (i.e., between 10 and 30
tokens per sentence). This choice, if on the one hand
made our results more directly comparable across
bins of sentences sharing the same length, on the
other hand excluded from the analyses the
shortest and the longest sentences of IUDT. Our future
work will be devoted to replicate the probing task
experiments described in this paper also on control
datasets comprising sentences whose length is
outside of the range considered here. To this aim, we
performed preliminary analyses to test the scores
of probing tasks on gold IUDT sentences that are
less than 10-token and more than 30-token long.
Interestingly, we noticed that the probing model
is less accurate when predicting the linguistic
features extracted from the group of IUDT short
sentences. Specifically, the average Spearman
correlation obtained on such group is 0.47, while
probing scores on longer sentences (+30-token long)
and on those used in our experiments achieved an
average correlation of 0.56 and 0.66 respectively.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>Yonatan</given-names>
            <surname>Belinkov</surname>
          </string-name>
          .
          <year>2021</year>
          . Probing Classifiers: Promises, Shortcomings, and
          <string-name>
            <surname>Advances</surname>
          </string-name>
          .
          <source>Computational Linguistics</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>12</lpage>
          ,
          <fpage>10</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>Dominique</given-names>
            <surname>Brunato</surname>
          </string-name>
          , Andrea Cimino, Felice Dell'Orletta,
          <string-name>
            <given-names>Giulia</given-names>
            <surname>Venturi</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Simonetta</given-names>
            <surname>Montemagni</surname>
          </string-name>
          .
          <year>2020</year>
          .
          <article-title>Profiling-UD: a tool for linguistic profiling of texts</article-title>
          .
          <source>In Proceedings of The 12th Language Resources and Evaluation Conference</source>
          , pages
          <fpage>7147</fpage>
          -
          <lpage>7153</lpage>
          , Marseille, France, May. European Language Resources Association.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <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 $&amp;!#* 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>
          , Melbourne, Australia, July. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>Wietse de Vries</surname>
            , Andreas van Cranenburgh,
            <given-names>and Malvina</given-names>
          </string-name>
          <string-name>
            <surname>Nissim</surname>
          </string-name>
          .
          <year>2020</year>
          .
          <article-title>What's so special about BERT's layers? a closer look at the NLP pipeline in monolingual and multilingual models</article-title>
          .
          <source>In Findings of the Association for Computational Linguistics: EMNLP</source>
          <year>2020</year>
          , pages
          <fpage>4339</fpage>
          -
          <lpage>4350</lpage>
          , Online, November. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>Jacob</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>2019</year>
          .
          <article-title>BERT: Pre-training of deep bidirectional transformers for language understanding</article-title>
          .
          <source>In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (Long and Short Papers), pages
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          , Minneapolis, Minnesota, June. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <given-names>Raffaele</given-names>
            <surname>Guarasci</surname>
          </string-name>
          , Stefano Silvestri, Giuseppe De Pietro, Hamido Fujita, and
          <string-name>
            <given-names>Massimo</given-names>
            <surname>Esposito</surname>
          </string-name>
          .
          <year>2021</year>
          .
          <article-title>Assessing BERT's ability to learn Italian syntax: a study on null-subject and agreement phenomena</article-title>
          .
          <source>Journal of Ambient Intelligence and Humanized Computing</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>15</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <given-names>Rowan</given-names>
            <surname>Hall</surname>
          </string-name>
          <string-name>
            <surname>Maudslay</surname>
          </string-name>
          , Josef Valvoda, Tiago Pimentel,
          <string-name>
            <given-names>Adina</given-names>
            <surname>Williams</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and Ryan</given-names>
            <surname>Cotterell</surname>
          </string-name>
          .
          <year>2020</year>
          .
          <article-title>A tale of</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <article-title>a probe and a parser</article-title>
          .
          <source>In Proceedings of the 58th An-</source>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <surname>Linguistics</surname>
          </string-name>
          , pages
          <fpage>7389</fpage>
          -
          <lpage>7395</lpage>
          , Online, July. Associ-
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <given-names>John</given-names>
            <surname>Hewitt</surname>
          </string-name>
          and
          <string-name>
            <given-names>Percy</given-names>
            <surname>Liang</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Designing and interpreting probes with control tasks</article-title>
          .
          <source>In Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)</source>
          , pages
          <fpage>2733</fpage>
          -
          <lpage>2743</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <given-names>John</given-names>
            <surname>Hewitt and Christopher D Manning</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>A structural probe for finding syntax in word representations</article-title>
          .
          <source>In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (Long and Short Papers), pages
          <fpage>4129</fpage>
          -
          <lpage>4138</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <surname>Ian T Jolliffe</surname>
            and
            <given-names>Jorge</given-names>
          </string-name>
          <string-name>
            <surname>Cadima</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Principal component analysis: a review and recent developments</article-title>
          .
          <source>Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences</source>
          ,
          <volume>374</volume>
          (
          <year>2065</year>
          ):
          <fpage>20150202</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <surname>Nelson F. Liu</surname>
            , Matt Gardner, Yonatan Belinkov,
            <given-names>Matthew E.</given-names>
          </string-name>
          <string-name>
            <surname>Peters</surname>
          </string-name>
          , and
          <string-name>
            <surname>Noah</surname>
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Smith</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Linguistic knowledge and transferability of contextual representations</article-title>
          .
          <source>In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , Volume
          <volume>1</volume>
          (Long and Short Papers), pages
          <fpage>1073</fpage>
          -
          <lpage>1094</lpage>
          , Minneapolis, Minnesota, June. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <given-names>Alessio</given-names>
            <surname>Miaschi</surname>
          </string-name>
          , Dominique Brunato, Felice Dell'Orletta,
          <string-name>
            <given-names>and Giulia</given-names>
            <surname>Venturi</surname>
          </string-name>
          .
          <year>2020</year>
          .
          <article-title>Linguistic profiling of a neural language model</article-title>
          .
          <source>In Proceedings of the 28th International Conference on Computational Linguistics</source>
          , pages
          <fpage>745</fpage>
          -
          <lpage>756</lpage>
          , Barcelona, Spain (Online), December.
          <source>International Committee on Computational Linguistics.</source>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <given-names>Alessio</given-names>
            <surname>Miaschi</surname>
          </string-name>
          , Gabriele Sarti, Dominique Brunato, Felice Dell'Orletta,
          <string-name>
            <given-names>and Giulia</given-names>
            <surname>Venturi</surname>
          </string-name>
          .
          <year>2021</year>
          .
          <article-title>Italian transformers under the linguistic lens</article-title>
          . In Johanna Monti, Felice Dell'Orletta, and Fabio Tamburini, editors,
          <source>Proceedings of the Seventh Italian Conference on Computational Linguistics</source>
          (CLiC-it
          <year>2020</year>
          ), Online, March.
          <source>CEUR Workshop Proceedings (CEUR-WS.org).</source>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <given-names>Joakim</given-names>
            <surname>Nivre</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Towards a universal grammar for natural language processing</article-title>
          .
          <source>In Proceedings of The 16th Annual Conference on Intelligent Text Processing and Computational Linguistics (CICLing)</source>
          , pages
          <fpage>3</fpage>
          -
          <lpage>16</lpage>
          . Springer.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <string-name>
            <given-names>Tiago</given-names>
            <surname>Pimentel</surname>
          </string-name>
          , Josef Valvoda, Rowan Hall Maudslay, Ran Zmigrod,
          <string-name>
            <given-names>Adina</given-names>
            <surname>Williams</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and Ryan</given-names>
            <surname>Cotterell</surname>
          </string-name>
          .
          <year>2020</year>
          .
          <article-title>Information-theoretic probing for linguistic structure</article-title>
          .
          <source>In Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics</source>
          , pages
          <fpage>4609</fpage>
          -
          <lpage>4622</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          <string-name>
            <given-names>Abhilasha</given-names>
            <surname>Ravichander</surname>
          </string-name>
          , Yonatan Belinkov, and
          <string-name>
            <given-names>Eduard</given-names>
            <surname>Hovy</surname>
          </string-name>
          .
          <year>2021</year>
          .
          <article-title>Probing the probing paradigm: Does probing accuracy entail task relevance</article-title>
          ?
          <source>In Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume</source>
          , pages
          <fpage>3363</fpage>
          -
          <lpage>3377</lpage>
          , Online, April. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          <source>Jo¨rg Tiedemann and Lars Nygaard</source>
          .
          <year>2004</year>
          .
          <article-title>The OPUS corpus - parallel</article-title>
          and free: http://logos.uio. no/opus.
          <source>In Proceedings of the Fourth International Conference on Language Resources and Evaluation (LREC'04)</source>
          , Lisbon, Portugal, May.
          <source>European Language Resources Association (ELRA).</source>
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          <string-name>
            <given-names>Elena</given-names>
            <surname>Voita</surname>
          </string-name>
          and
          <string-name>
            <given-names>Ivan</given-names>
            <surname>Titov</surname>
          </string-name>
          .
          <year>2020</year>
          .
          <article-title>Informationtheoretic probing with minimum description length</article-title>
          .
          <source>In Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP)</source>
          , pages
          <fpage>183</fpage>
          -
          <lpage>196</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          <string-name>
            <given-names>Alex</given-names>
            <surname>Warstadt</surname>
          </string-name>
          , Yu Cao, Ioana Grosu, Wei Peng, Hagen Blix, Yining Nie, Anna Alsop, Shikha Bordia, Haokun Liu, Alicia Parrish,
          <string-name>
            <surname>Sheng-Fu</surname>
            <given-names>Wang</given-names>
          </string-name>
          , Jason Phang, Anhad Mohananey, Phu Mon Htut, Paloma Jeretic, and
          <string-name>
            <surname>Samuel</surname>
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Bowman</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Investigating BERT's knowledge of language: Five analysis methods with NPIs</article-title>
          .
          <source>In Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)</source>
          , pages
          <fpage>2877</fpage>
          -
          <lpage>2887</lpage>
          ,
          <string-name>
            <surname>Hong</surname>
            <given-names>Kong</given-names>
          </string-name>
          , China, November. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          <string-name>
            <given-names>Thomas</given-names>
            <surname>Wolf</surname>
          </string-name>
          , Lysandre Debut, Victor Sanh, Julien Chaumond, Clement Delangue, Anthony Moi, Pierric Cistac, Tim Rault, Remi Louf, Morgan Funtowicz, Joe Davison, Sam Shleifer, Patrick von Platen, Clara Ma, Yacine Jernite, Julien Plu, Canwen Xu, Teven Le Scao, Sylvain Gugger, Mariama Drame, Quentin Lhoest, and
          <string-name>
            <given-names>Alexander</given-names>
            <surname>Rush</surname>
          </string-name>
          .
          <year>2020</year>
          .
          <article-title>Transformers: State-of-the-art natural language processing</article-title>
          .
          <source>In Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations</source>
          , pages
          <fpage>38</fpage>
          -
          <lpage>45</lpage>
          , Online, October. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          <string-name>
            <given-names>Daniel</given-names>
            <surname>Zeman</surname>
          </string-name>
          , Joakim Nivre, Mitchell Abrams, Noe¨mi Aepli,
          <source>Zˇ eljko Agic</source>
          ,
          <string-name>
            <surname>Lars Ahrenberg</surname>
          </string-name>
          , et al.
          <year>2020</year>
          .
          <article-title>Universal dependencies 2.5. LINDAT/CLARIAHCZ digital library at the Institute of Formal and Applied Linguistics (UFAL)</article-title>
          ,
          <source>Faculty of Mathematics and Physics</source>
          , Charles University. url: http://hdl. handle. net/11234/1-
          <fpage>3226</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>