<!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>OP-IMS @ DIACR-Ita: Back to the Roots: SGNS+OP+CD still Rocks Semantic Change Detection</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jens Kaiser</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dominik Schlechtweg</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sabine Schulte im Walde</string-name>
          <email>schulteg@ims.uni-stuttgart.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Institute for Natural Language Processing, University of Stuttgart</institution>
        </aff>
      </contrib-group>
      <fpage>2116</fpage>
      <lpage>2121</lpage>
      <abstract>
        <p>We present the results of our participation in the DIACR-Ita shared task on lexical semantic change detection for Italian. We exploit one of the earliest and most influential semantic change detection models based on Skip-Gram with Negative Sampling, Orthogonal Procrustes alignment and Cosine Distance and obtain the winning submission of the shared task with near to perfect accuracy (:94). Our results once more indicate that, within the present task setup in lexical semantic change detection, the traditional typebased approaches yield excellent performance.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>
        Lexical Semantic Change (LSC) Detection has
drawn increasing attention in recent years
        <xref ref-type="bibr" rid="ref24 ref9">(Kutuzov et al., 2018; Tahmasebi et al., 2018)</xref>
        .
Recently, SemEval-2020 Task 1 provided a
multilingual evaluation framework to compare the
variety of proposed model architectures
        <xref ref-type="bibr" rid="ref20 ref6">(Schlechtweg
et al., 2020)</xref>
        . The DIACR-Ita shared task extends
parts of this framework to Italian by providing
an Italian data set for SemEval’s binary subtask
(Basile et al., 2020a; Basile et al., 2020b).
      </p>
      <p>
        We present the results of our participation in
the DIACR-Ita shared task exploiting one of the
earliest and most established semantic change
detection models based on Skip-Gram with
Negative Sampling, Orthogonal Procrustes alignment
and Cosine Distance
        <xref ref-type="bibr" rid="ref4">(Hamilton et al., 2016a)</xref>
        .
Based on our previous research
        <xref ref-type="bibr" rid="ref19 ref6">(Schlechtweg et
al., 2019; Kaiser et al., 2020)</xref>
        we optimize the
dimensionality parameter assuming that high
dimensionalities reduce alignment error. With our
“Copyright © 2020 for this paper by its authors. Use
permitted under Creative Commons License Attribution 4.0
International (CC BY 4.0).”
setting win the shared task with near to perfect
accuracy (:94). Our results once more demonstrate
that, within the present task setup in lexical
semantic change detection, the traditional type-based
approaches yield excellent performance.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        As evident in Schlechtweg et al. (2020) the field
of LSCD is currently dominated by Vector Space
Models (VSMs), which can be divided into
typebased
        <xref ref-type="bibr" rid="ref25">(Turney and Pantel, 2010)</xref>
        and token-based
        <xref ref-type="bibr" rid="ref21">(Schu¨tze, 1998)</xref>
        models. Prominent type-based
models include low-dimensional embeddings such
as the Global Vectors
        <xref ref-type="bibr" rid="ref14 ref3">(Pennington et al., 2014,
GloVe)</xref>
        the Continuous Bag-of-Words (CBOW),
the Continuous Skip-gram as well as a slight
modification of the latter, the Skip-gram with Negative
Sampling model
        <xref ref-type="bibr" rid="ref12 ref12 ref13 ref13">(Mikolov et al., 2013a; Mikolov
et al., 2013b, SGNS)</xref>
        . However, as these
models come with the deficiency that they aggregate
all senses of a word into a single representation,
token-based embeddings have been proposed
        <xref ref-type="bibr" rid="ref15">(Peters et al., 2018; Devlin et al., 2019)</xref>
        . According
to Hu et al. (2019) these models can ideally
capture complex characteristics of word use, and how
they vary across linguistic contexts. The results of
SemEval-2020 Task 1
        <xref ref-type="bibr" rid="ref20 ref6">(Schlechtweg et al., 2020)</xref>
        ,
however, show that contrary to this, the
tokenbased embedding models
        <xref ref-type="bibr" rid="ref1 ref11 ref16 ref2 ref26 ref6 ref8">(Beck, 2020; Kutuzov
and Giulianelli, 2020)</xref>
        are heavily outperformed
by the type-based ones
        <xref ref-type="bibr" rid="ref17">(Prazˇ a´k et al., 2020;
Asgari et al., 2020)</xref>
        . The SGNS model was not
only widely used, but also performed best among
the participants in the task. Its fast
implementation and combination possibilities with different
alignment types further solidify SGNS as the
standard in LSCD. A common and surprisingly
robust
        <xref ref-type="bibr" rid="ref19 ref6">(Schlechtweg et al., 2019; Kaiser et al., 2020)</xref>
        practice is to align the time-specific SGNS
embeddings with Orthogonal Procrustes (OP) and
measure change with Cosine Distance (CD)
        <xref ref-type="bibr" rid="ref4 ref7">(Kulkarni et al., 2015; Hamilton et al., 2016b)</xref>
        . This has
been shown in several small but independent
experiments
        <xref ref-type="bibr" rid="ref19 ref22 ref4 ref6">(Hamilton et al., 2016b; Schlechtweg
et al., 2019; Kaiser et al., 2020; Shoemark et al.,
2019)</xref>
        and SGNS+OP+CD has produced two of
three top-performing submissions in Subtask 2 in
SemEval-2020 Task 1 including the winning
submission
        <xref ref-type="bibr" rid="ref1 ref1 ref11 ref11 ref16 ref16 ref2 ref2 ref26 ref26 ref6 ref6 ref8 ref8">(Po¨msl and Lyapin, 2020; Arefyev and
Zhikov, 2020)</xref>
        .
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>System overview</title>
      <p>
        Most VSMs in LSC detection combine three
subsystems: (i) creating semantic word
representations, (ii) aligning them across corpora, and (iii)
measuring differences between the aligned
representations
        <xref ref-type="bibr" rid="ref19">(Schlechtweg et al., 2019)</xref>
        .
Alignment is needed as columns from different vector
spaces may not correspond to the same coordinate
axes, due to the stochastic nature of many
lowdimensional word representations
        <xref ref-type="bibr" rid="ref4">(Hamilton et al.,
2016b)</xref>
        . Following the above-described success,
we use SGNS to create word representations in
combination with Orthogonal Procrustes (OP) for
vector space alignment and Cosine Distance (CD)
        <xref ref-type="bibr" rid="ref18">(Salton and McGill, 1983)</xref>
        to measure differences
between word vectors. From the resulting graded
change predictions we infer binary change values
by comparing the target word distribution to the
full distribution of change predictions between the
target corpora. For our experiments we use the
code provided by Schlechtweg et al. (2019).1
3.1
      </p>
      <sec id="sec-3-1">
        <title>Semantic Representation</title>
        <p>SGNS is a shallow neural network trained on pairs
of word co-occurrences extracted from a corpus
with a symmetric window. It represents each word
w and each context c as a d-dimensional vector to
solve
arg max</p>
        <p>
          X log (vc vw) +
log ( vc vw);
where (x) = 1+1e x , D is the set of all
observed word-context pairs and D0 is the set of
randomly generated negative samples
          <xref ref-type="bibr" rid="ref12 ref12 ref13 ref13 ref14 ref3">(Mikolov et al.,
2013a; Mikolov et al., 2013b; Goldberg and Levy,
2014)</xref>
          . The optimized parameters are vwi and
vci for i 2 1; :::; d. D0 is obtained by drawing k
contexts from the empirical unigram distribution
1https://github.com/Garrafao/
LSCDetection
P (c) = #(c) for each observation of (w; c), cf.
Levy et al.jD( 2j015). After training, each word w is
represented by its word vector vw.
        </p>
        <p>
          Previous research on the influence of
parameter settings on SGNS+OP+CD lays the
foundation for our parameter choices
          <xref ref-type="bibr" rid="ref19 ref6">(Schlechtweg et al.,
2019; Kaiser et al., 2020)</xref>
          . Although this
subsystem combination is extremely stable regardless
of parameter settings, subtle improvements can be
achieved by modifying the window size and
dimensionality. A common hurdle in LSC detection
is the small corpus size, increasing the standard
setting for window size from 5 to 10 leads to the
creation of more word-context pairs used for
training the model. In addition, we also experiment
with dimensionalities of 300 and 500. Higher
dimensionalities alleviate the introduction of noise
during the alignment process
          <xref ref-type="bibr" rid="ref6">(Kaiser et al., 2020)</xref>
          .
We keep the rest of the parameter settings at their
default values (learning rate =0:025, #negative
samples k=5 and sub-sampling t=0:001).
3.2
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>Alignment</title>
        <p>SGNS is trained on each corpus separately,
resulting in matrices A and B. To align them we
follow Hamilton et al. (2016b) and calculate an
orthogonally-constrained matrix W :</p>
        <p>W
= arg min kBW</p>
        <p>W 2O(d)</p>
        <p>
          AkF
where the i-th row in matrices A and B correspond
to the same word. Using W we get the aligned
matrices AOP = A and BOP = BW . Prior
to this alignment step we length-normalize and
mean-center both matrices
          <xref ref-type="bibr" rid="ref19">(Artetxe et al., 2017;
Schlechtweg et al., 2019)</xref>
          .
3.3
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>Threshold</title>
        <p>
          The DIACR-Ita shared task requires a binary
label for each of the target words. However,
CD produces graded values between 0:0 and 2:0
when measuring differences in word vectors
between the two time periods. We tackle this
problem by defining a threshold parameter, similar to
many approaches applied in SemEval-2020 Task 1
          <xref ref-type="bibr" rid="ref20 ref6">(Schlechtweg et al., 2020)</xref>
          . All words with a CD
greater or equal than the threshold are labeled ‘1’,
indicating change. Words with a CD less than the
threshold are assigned ‘0’, indicating no change.
        </p>
        <p>A simplified approach is to set the threshold
such that the number of words is equal in both
groups. This has many disadvantages: Mainly, it
(w;c)2D</p>
        <p>X
(w;c)2D0
relies on the assumption that the two groups are of
equal size. This is rarely given in real world
applications, especially if the focus is in one word
at a time. Thus a more sophisticated approach is
needed. In SemEval-2020’s Subtask 1 many
participants faced the same problem and developed
various methods to solve it. Similar to the
simplified approach, Zhou and Li (2020) only look
at target words, and after fitting the histogram of
CDs to a gamma distribution, set the threshold at
the 75% density quantile. This approach resulted
in good performance but is not always applicable
due to its dependence on underlying properties of
the test set. Amar and Liebeskind (2020) avoid
the dependence on target words by randomly
selecting 200 words and setting the threshold such
that 90% of the 200 words have a lower distance
than the threshold. A more careful selection of
words is taken by Martinc et al. (2020), they look
at the CD of semantically stable stop words,
accumulate them in different bins and set the threshold
to the upper limit of the bin containing fewer than
#stopwords=#bins words. Prazˇa´k et al. (2020)
propose several methods. One of them is setting
the threshold at the mean of the distances of all
words in the corpus vocabulary. Our method for
determining a threshold is very similar to Prazˇa´k
et al. (2020), but instead of taking the mean, we
use the mean + one standard deviation ( + ) of
all words in the corpus vocabulary.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Experimental setup</title>
      <p>
        The DIACR-Ita task definition is taken from
SemEval-2020 Task 1 Subtask 1 (binary change
detection): Given a list of target words and a
diacronic corpus pair C1 and C2, the task is to
identify the respective target words which have
changed their meaning between the time periods
t1 and t2
        <xref ref-type="bibr" rid="ref20 ref6">(Basile et al., 2020a; Schlechtweg et al.,
2020)</xref>
        .2 C1 and C2 have been extracted from
Italian newspapers and books. Target words which
have changed their meaning are labeled with the
value ‘1’, the remaining target words are labeled
with ‘0’. Gold data for the 18 target words is
semiautomatically generated from Italian online
dictionaries. According to the gold data, 6 of the 18
target words are subject to semantic change between
t1 and t2. This gold data was only made public
after the evaluation phase. During the evaluation
2The time periods t1 and t2 were not disclosed to
participants.
entry dim
#2 300
#4 500
#1 300
#3 500
major. baseline
freq. baseline
colloc. baseline
phase each team was allowed to submit 4
predictions for the full list of target words, which were
scored using classification accuracy between the
predicted labels and the gold data. The final
competition ranking compares only the highest of the
4 scores achieved by each team.
5
      </p>
    </sec>
    <sec id="sec-5">
      <title>Results</title>
      <p>
        We created target word rankings using
SGNS+OP+CD with a dimensionality of 300
and 500 as described above. From these rankings
our predictions are calculated using two different
thresholding methods: (i) Splitting the targets
into two equally-sized groups (50:50) and (ii)
using the mean + one standard deviation ( + )
as threshold, refer to Section 3.3. The accuracy
scores achieved in this way are listed in Table 1,
alongside the official baselines freq. and colloc.
and an additional major. baseline. Submission
#2 is our highest scoring submission and won
the DIACR-Ita task together with one other
undisclosed submission. For both of our rankings
the 50:50 threshold yielded lower accuracy than
the + threshold. This is due to the imbalance
of changed to unchanged target words in the
test set. Using + as threshold resulted in an
optimal split for the ranking created with d=300.
For d=500 this threshold was slightly too high
with a value of 0:78. The target word palmare
which, according to the gold data, has undergone
semantic change (label ‘1’) has CD of 0:76 and
was thus incorrectly labeled by our system. Figure
1 shows the histogram of CD values for all words
of the corpus dictionary in gray. The green and
red colored bars correspond target words. If
the target word was correctly labeled the bar is
green, incorrect labeled target words have red
bars. From this visualisation we can see that there
is a pronounced gap between the CDs of target
words which have changed and those which have
not. Our proposed threshold method of + tends
to slightly overshoot this gap. This has lead to
the lower accuracy of submission #4, despite the
ranking allowing for a higher accuracy. In order to
measure the quality of the rankings independent
from the threshold we also report AP
        <xref ref-type="bibr" rid="ref23">(Shwartz
et al., 2017)</xref>
        in Table 1, confirming the potential
equal performance.
      </p>
      <p>
        The method of using the mean + one standard
deviation of the CDs of all words in the corpus
dictionary resulted in good accuracy, but leaves room
for improvement. It tends to over-shoot the gap
between unchanged and changed words slightly.
Only using the mean shifts the tendency towards
under-shooting the gap. The optimal threshold
seems to lie somewhere in between. Though, this
needs the be confirmed on other, larger, data sets.
Furthermore, not all binary classification tasks are
suitable for the approach of first creating a ranked
list of graded change predictions and then
choosing a threshold. The data set of SemEval-2020
Task 1 comprises two tasks, a binary and a ranked
task for the same target words. It is not possible to
achieve an accuracy of 1 on the binary task even if
all the ranks are predicted correctly for the graded
task, i.e., binary change is not just high graded
change
        <xref ref-type="bibr" rid="ref20 ref6">(Schlechtweg et al., 2020)</xref>
        .
      </p>
      <p>
        The one target word which our model labels
incorrectly, across a variety of parameter settings, is
piovra. According to the gold data this word has
not undergone semantic change between t1 and t2,
while our system labels it as changed. A
possible explanation for the error may be differences
in frequency: In C1 piovra appears 35 times and
in C2 it appears 643 times. SGNS often struggles
to create reliable embeddings for low frequency
words
        <xref ref-type="bibr" rid="ref6">(Kaiser et al., 2020)</xref>
        . Alternatively, the
error could be caused by discrepancies between gold
labels and corpora. Basile et al. (2020a) state that
the gold data is initially based on Italian online
dictionaries such as ‘Sabatini Coletti’. In a
manual annotation process the gold data is further
refined by providing human judges with up to 100
occurrences of each target word, for which they
have to identify the used meaning according to
the meanings listed in the dictionaries. A target
word is labeled as changed if a meaning is
observed in C2 which has not been observed in C1.
Although not very likely, it is possible that this
annotation method fails to detect novel senses in
C2. Sabatini Coletti reports that in addition to the
sense “squid” piovra acquired a new sense “a
secret criminal organisation deeply rooted in
society” in 1983. This might explain why we detect
piovra as a word which has undergone semantic
change given that C1 comprises texts from 1948
to 1970 and C2 comprises texts from 1990 to 2014
(Basile et al., 2020a).
      </p>
      <p>The DIACR-Ita task dataset is a very valuable
contribution to the research field of LSC
detection and extends the variety of available data sets
to the Italian language. Nonetheless, two points
are important when interpreting or results this data
set: (i) it contains a small number of target words
in combination with binary classification. This
makes the data set vulnerable to randomness. (ii)
The nature of the gold labels, in addition to
possibly not being directly related to the corpus, it is
unclear if they reflect semantic change as sense gain
and sense loss as in SemEval’s Subtask 1. The
online dictionaries which create the basis for the gold
data only state sense gains. Thus, it might possible
for a word to completely lose a sense but still be
labeled as unchanged.
6</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusion</title>
      <p>We participated in the DIACR-Ita shared task
using well-established type-based methods for
diacronic semantic representations in combination
with a carefully calculated threshold. We were
able to reach the first place with a nearly perfect
accuracy of :94 confirming once more the
reliability of the type-based embeddings created by
SGNS, OP as an alignment method and CD to
measure differences between word vectors. The
presented approach is very suitable for similar
tasks as no fine-tuning of parameters is needed.
Yet, the system relies on the assumption that
graded change is indicative of binary classes.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>Dominik Schlechtweg was supported by the
Konrad Adenauer Foundation and the CRETA
center funded by the German Ministry for Education
and Research (BMBF) during the conduct of this
study. We thank the task organizers and reviewers
for their efforts.
Barcelona, Spain. Association for Computational
Linguistics.</p>
      <p>Mikel Artetxe, Gorka Labaka, and Eneko Agirre.
2017. Learning bilingual word embeddings with
(almost) no bilingual data. In Proceedings of the
55th Annual Meeting of the Association for
Computational Linguistics, pages 451–462. Association for
Computational Linguistics.</p>
      <p>Ehsaneddin Asgari, Christoph Ringlstetter, and Hinrich
Schu¨tze. 2020. EmbLexChange at SemEval-2020
Task 1: Unsupervised Embedding-based Detection
of Lexical Semantic Changes. In Proceedings of
the 14th International Workshop on Semantic
Evaluation, Barcelona, Spain. Association for
Computational Linguistics.</p>
      <p>Pierpaolo Basile, Annalina Caputo, Tommaso Caselli,
Pierluigi Cassotti, and Rossella Varvara. 2020a.
DIACR-Ita @ EVALITA2020: Overview of
the EVALITA2020 Diachronic Lexical Semantics
(DIACR-Ita) Task. In Valerio Basile, Danilo Croce,
Maria Di Maro, and Lucia C. Passaro, editors,
Proceedings of the 7th evaluation campaign of Natural
Language Processing and Speech tools for Italian
(EVALITA 2020), Online. CEUR.org.</p>
      <p>Valerio Basile, Danilo Croce, Maria Di Maro, and
Lucia C. Passaro. 2020b. Evalita 2020: Overview
of the 7th evaluation campaign of natural language
processing and speech tools for italian. In Valerio
Basile, Danilo Croce, Maria Di Maro, and Lucia C.
Passaro, editors, Proceedings of Seventh
Evaluation Campaign of Natural Language Processing and
Speech Tools for Italian. Final Workshop (EVALITA
2020), Online. CEUR.org.</p>
      <p>Christin Beck. 2020. DiaSense at SemEval-2020
Task 1: Modeling sense change via pre-trained
BERT embeddings. In Proceedings of the 14th
International Workshop on Semantic Evaluation,
Barcelona, Spain. Association for Computational
Linguistics.</p>
      <p>Yoav Goldberg and</p>
      <p>Word2vec explained:
negative-sampling
arXiv:1402.3722.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>Efrat</given-names>
            <surname>Amar</surname>
          </string-name>
          and
          <string-name>
            <given-names>Chaya</given-names>
            <surname>Liebeskind</surname>
          </string-name>
          .
          <year>2020</year>
          . JCT at SemEval
          <article-title>-2020 Task 1: Combined Semantic Vector Spaces Models for Unsupervised Lexical Semantic Change Detection</article-title>
          .
          <source>In Proceedings of the 14th International Workshop on Semantic Evaluation</source>
          , Barcelona, Spain. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>Nikolay</given-names>
            <surname>Arefyev</surname>
          </string-name>
          and
          <string-name>
            <given-names>Vasily</given-names>
            <surname>Zhikov</surname>
          </string-name>
          .
          <year>2020</year>
          . BOS at SemEval
          <article-title>-2020 Task 1: Word Sense Induction via Lexical Substitution for Lexical Semantic Change Detection</article-title>
          .
          <source>In Proceedings of the 14th International Workshop on Semantic Evaluation</source>
          , Jacob Devlin,
          <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="ref3">
        <mixed-citation>
          <string-name>
            <given-names>Omer</given-names>
            <surname>Levy</surname>
          </string-name>
          .
          <year>2014</year>
          . Deriving Mikolov et al.'
          <article-title>s word-embedding method</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>William L. Hamilton</surname>
            , Jure Leskovec, and
            <given-names>Dan</given-names>
          </string-name>
          <string-name>
            <surname>Jurafsky</surname>
          </string-name>
          . 2016a.
          <article-title>Cultural shift or linguistic drift? Comparing two computational measures of semantic change</article-title>
          .
          <source>In Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing</source>
          , pages William L. Hamilton, Jure Leskovec, and
          <string-name>
            <given-names>Dan</given-names>
            <surname>Jurafsky</surname>
          </string-name>
          . 2016b.
          <article-title>Diachronic word embeddings reveal statistical laws of semantic change</article-title>
          .
          <source>In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics</source>
          , pages
          <fpage>1489</fpage>
          -
          <lpage>1501</lpage>
          , Berlin, Germany. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>Renfen</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Shen</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and Shichen</given-names>
            <surname>Liang</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Diachronic sense modeling with deep contextualized word embeddings: An ecological view</article-title>
          .
          <source>In Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics</source>
          , pages
          <fpage>3899</fpage>
          -
          <lpage>3908</lpage>
          , Florence, Italy. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <given-names>Jens</given-names>
            <surname>Kaiser</surname>
          </string-name>
          , Dominik Schlechtweg,
          <source>Sean Papay, and Sabine Schulte im Walde</source>
          .
          <year>2020</year>
          .
          <article-title>IMS at SemEval2020 Task 1: How low can you go? Dimensionality in Lexical Semantic Change Detection</article-title>
          .
          <source>In Proceedings of the 14th International Workshop on Semantic Evaluation</source>
          , Barcelona, Spain. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <given-names>Vivek</given-names>
            <surname>Kulkarni</surname>
          </string-name>
          , Rami Al-Rfou,
          <string-name>
            <given-names>Bryan</given-names>
            <surname>Perozzi</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Steven</given-names>
            <surname>Skiena</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Statistically significant detection of linguistic change</article-title>
          .
          <source>In Proceedings of the 24th International Conference on World Wide Web, WWW</source>
          , pages
          <fpage>625</fpage>
          -
          <lpage>635</lpage>
          , Florence, Italy.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>Andrey</given-names>
            <surname>Kutuzov</surname>
          </string-name>
          and
          <string-name>
            <given-names>Mario</given-names>
            <surname>Giulianelli</surname>
          </string-name>
          .
          <year>2020</year>
          .
          <article-title>UiOUvA at SemEval-2020 Task 1: Contextualised Embeddings for Lexical Semantic Change Detection</article-title>
          .
          <source>In Proceedings of the 14th International Workshop on Semantic Evaluation</source>
          , Barcelona, Spain. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <given-names>Andrey</given-names>
            <surname>Kutuzov</surname>
          </string-name>
          , Lilja Øvrelid, Terrence Szymanski, and
          <string-name>
            <given-names>Erik</given-names>
            <surname>Velldal</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Diachronic word embeddings and semantic shifts: a survey</article-title>
          .
          <source>In Proceedings of the 27th International Conference on Computational Linguistics</source>
          , pages
          <fpage>1384</fpage>
          -
          <lpage>1397</lpage>
          ,
          <string-name>
            <given-names>Santa</given-names>
            <surname>Fe</surname>
          </string-name>
          , New Mexico, USA. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <surname>Omer</surname>
            <given-names>Levy</given-names>
          </string-name>
          , Yoav Goldberg, and
          <string-name>
            <given-names>Ido</given-names>
            <surname>Dagan</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Improving distributional similarity with lessons learned from word embeddings</article-title>
          .
          <source>Transactions of the Association for Computational Linguistics</source>
          ,
          <volume>3</volume>
          :
          <fpage>211</fpage>
          -
          <lpage>225</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <given-names>Matej</given-names>
            <surname>Martinc</surname>
          </string-name>
          , Syrielle Montariol, Elaine Zosa, and
          <string-name>
            <given-names>Lidia</given-names>
            <surname>Pivovarova</surname>
          </string-name>
          .
          <year>2020</year>
          .
          <article-title>Discovery Team at SemEval-2020 Task 1: Context-sensitive Embeddings not Always Better Than Static for Semantic Change Detection</article-title>
          .
          <source>In Proceedings of the 14th International Workshop on Semantic Evaluation</source>
          , Barcelona, Spain. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <given-names>Tomas</given-names>
            <surname>Mikolov</surname>
          </string-name>
          , Kai Chen, Greg Corrado, and
          <string-name>
            <given-names>Jeffrey</given-names>
            <surname>Dean</surname>
          </string-name>
          .
          <year>2013a</year>
          .
          <article-title>Efficient estimation of word representations in vector space</article-title>
          .
          <source>In Yoshua Bengio and Yann LeCun</source>
          , editors,
          <source>1st International Conference on Learning Representations, ICLR</source>
          <year>2013</year>
          , Scottsdale, Arizona, USA, May 2-
          <issue>4</issue>
          ,
          <year>2013</year>
          , Workshop Track Proceedings.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <given-names>Tomas</given-names>
            <surname>Mikolov</surname>
          </string-name>
          , Ilya Sutskever, Kai Chen, Greg Corrado, and
          <string-name>
            <given-names>Jeffrey</given-names>
            <surname>Dean</surname>
          </string-name>
          .
          <year>2013b</year>
          .
          <article-title>Distributed representations of words and phrases and their compositionality</article-title>
          .
          <source>In Advances in Neural Information Processing Systems</source>
          <volume>26</volume>
          , pages
          <fpage>3111</fpage>
          -
          <lpage>3119</lpage>
          ,
          <string-name>
            <surname>Lake</surname>
            <given-names>Tahoe</given-names>
          </string-name>
          , Nevada, USA.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <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</source>
          , pages
          <fpage>1532</fpage>
          -
          <lpage>1543</lpage>
          , Doha, Qatar.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <given-names>Matthew</given-names>
            <surname>Peters</surname>
          </string-name>
          , Mark Neumann, Mohit Iyyer, Matt Gardner, Christopher Clark,
          <string-name>
            <given-names>Kenton</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>and Luke</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Deep contextualized word representations</article-title>
          .
          <source>In Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          , pages
          <fpage>2227</fpage>
          -
          <lpage>2237</lpage>
          , New Orleans, LA, USA.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <source>Martin Po¨msl and Roman Lyapin</source>
          .
          <year>2020</year>
          . CIRCE at SemEval-2020 Task 1:
          <string-name>
            <given-names>Ensembling</given-names>
            <surname>Context-Free</surname>
          </string-name>
          and
          <article-title>Context-Dependent Word Representations</article-title>
          .
          <source>In Proceedings of the 14th International Workshop on Semantic Evaluation</source>
          , Barcelona, Spain. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <string-name>
            <surname>Ondrˇej Prazˇa´k</surname>
            , Pavel Prˇiba´knˇ,
            <given-names>Stephen</given-names>
          </string-name>
          <string-name>
            <surname>Taylor</surname>
            , and
            <given-names>Jakub</given-names>
          </string-name>
          <string-name>
            <surname>Sido</surname>
          </string-name>
          .
          <year>2020</year>
          . UWB at SemEval
          <article-title>-2020 Task 1: Lexical Semantic Change Detection</article-title>
          .
          <source>In Proceedings of the 14th International Workshop on Semantic Evaluation</source>
          , Barcelona, Spain. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          <string-name>
            <given-names>Gerard</given-names>
            <surname>Salton and Michael J McGill</surname>
          </string-name>
          .
          <year>1983</year>
          .
          <article-title>Introduction to Modern Information Retrieval</article-title>
          .
          <string-name>
            <surname>McGraw-Hill Book</surname>
          </string-name>
          Company, New York.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          <string-name>
            <given-names>Dominik</given-names>
            <surname>Schlechtweg</surname>
          </string-name>
          , Anna Ha¨tty,
          <source>Marco del Tredici, and Sabine Schulte im Walde</source>
          .
          <year>2019</year>
          .
          <article-title>A Wind of Change: Detecting and evaluating lexical semantic change across times and domains</article-title>
          .
          <source>In Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics</source>
          , pages
          <fpage>732</fpage>
          -
          <lpage>746</lpage>
          , Florence, Italy. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          <string-name>
            <given-names>Dominik</given-names>
            <surname>Schlechtweg</surname>
          </string-name>
          ,
          <string-name>
            <surname>Barbara</surname>
            <given-names>McGillivray</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Simon</given-names>
            <surname>Hengchen</surname>
          </string-name>
          , Haim Dubossarsky, and
          <string-name>
            <given-names>Nina</given-names>
            <surname>Tahmasebi</surname>
          </string-name>
          .
          <year>2020</year>
          . SemEval
          <article-title>-2020 Task 1: Unsupervised Lexical Semantic Change Detection</article-title>
          .
          <source>In Proceedings of the 14th International Workshop on Semantic Evaluation</source>
          , Barcelona, Spain. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          <string-name>
            <given-names>Hinrich</given-names>
            <surname>Schu</surname>
          </string-name>
          ¨tze.
          <year>1998</year>
          .
          <article-title>Automatic word sense discrimination</article-title>
          .
          <source>Computational Linguistics</source>
          ,
          <volume>24</volume>
          (
          <issue>1</issue>
          ):
          <fpage>97</fpage>
          -
          <lpage>123</lpage>
          ,
          <year>March</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          <string-name>
            <given-names>Philippa</given-names>
            <surname>Shoemark</surname>
          </string-name>
          , Farhana Ferdousi Liza,
          <string-name>
            <given-names>Dong</given-names>
            <surname>Nguyen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Scott</given-names>
            <surname>Hale</surname>
          </string-name>
          , and
          <string-name>
            <surname>Barbara McGillivray</surname>
          </string-name>
          .
          <year>2019</year>
          .
          <article-title>Room to Glo: A systematic comparison of semantic change detection approaches with word embeddings</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</source>
          , pages
          <fpage>66</fpage>
          -
          <lpage>76</lpage>
          ,
          <string-name>
            <surname>Hong</surname>
            <given-names>Kong</given-names>
          </string-name>
          , China. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          <string-name>
            <given-names>Vered</given-names>
            <surname>Shwartz</surname>
          </string-name>
          , Enrico Santus, and
          <string-name>
            <given-names>Dominik</given-names>
            <surname>Schlechtweg</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Hypernyms under siege: Linguistically-motivated artillery for hypernymy detection</article-title>
          .
          <source>In Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics</source>
          , Valencia, Spain, pages
          <fpage>65</fpage>
          -
          <lpage>75</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          <string-name>
            <given-names>Nina</given-names>
            <surname>Tahmasebi</surname>
          </string-name>
          , Lars Borin, and
          <string-name>
            <given-names>Adam</given-names>
            <surname>Jatowt</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Survey of computational approaches to diachronic conceptual change</article-title>
          .
          <source>CoRR</source>
          , abs/
          <year>1811</year>
          .06278.
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          <string-name>
            <surname>Peter D. Turney</surname>
            and
            <given-names>Patrick</given-names>
          </string-name>
          <string-name>
            <surname>Pantel</surname>
          </string-name>
          .
          <year>2010</year>
          .
          <article-title>From frequency to meaning: Vector space models of semantics</article-title>
          .
          <source>J. Artif. Int. Res.</source>
          ,
          <volume>37</volume>
          (
          <issue>1</issue>
          ):
          <fpage>141</fpage>
          -
          <lpage>188</lpage>
          , January.
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          <string-name>
            <given-names>Jinan</given-names>
            <surname>Zhou</surname>
          </string-name>
          and
          <string-name>
            <given-names>Jiaxin</given-names>
            <surname>Li</surname>
          </string-name>
          .
          <year>2020</year>
          .
          <article-title>TemporalTeller at SemEval-2020 Task 1: Unsupervised Lexical Semantic Change Detection with Temporal Referencing</article-title>
          .
          <source>In Proceedings of the 14th International Workshop on Semantic Evaluation</source>
          , Barcelona, Spain. Association for Computational Linguistics.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>