Hugging Face's logo

Datasets:
WINGNUS
/
ACL-OCL

Tasks:
Token Classification
Languages:
English
Size:
10K<n<100K
Tags:
research papers
acl
License:
Dataset card Files Community
5
ACL-OCL / Base_JSON /prefixE /json /eval4nlp /2021.eval4nlp-1.11.json
Benjamin Aw
Add updated pkl file v3
6fa4bc9
raw
history blame contribute delete
126 kB
 {
"paper_id": "2021",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T10:38:28.807587Z"
},
"title": "Statistically Significant Detection of Semantic Shifts using Contextual Word Embeddings",
"authors": [
{
"first": "Yang",
"middle": [],
"last": "Liu",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Helsinki",
"location": {}
},
"email": "yang.liu@helsinki.fi"
},
{
"first": "Alan",
"middle": [],
"last": "Medlar",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Helsinki",
"location": {}
},
"email": "alan.j.medlar@helsinki.fi"
},
{
"first": "Dorota",
"middle": [],
"last": "G\u0142owacka",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Helsinki",
"location": {}
},
"email": "dorota.glowacka@helsinki.fi"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Detecting lexical semantic change in smaller data sets, e.g. in historical linguistics and digital humanities, is challenging due to a lack of statistical power. This issue is exacerbated by non-contextual embedding models that produce one embedding per word and, therefore, mask the variability present in the data. In this article, we propose an approach to estimate semantic shift by combining contextual word embeddings with permutation-based statistical tests. We use the false discovery rate procedure to address the large number of hypothesis tests being conducted simultaneously. We demonstrate the performance of this approach in simulation where it achieves consistently high precision by suppressing false positives. We additionally analyze real-world data from SemEval-2020 Task 1 and the Liverpool FC subreddit corpus. We show that by taking sample variation into account, we can improve the robustness of individual semantic shift estimates without degrading overall performance.",
"pdf_parse": {
"paper_id": "2021",
"_pdf_hash": "",
"abstract": [
{
"text": "Detecting lexical semantic change in smaller data sets, e.g. in historical linguistics and digital humanities, is challenging due to a lack of statistical power. This issue is exacerbated by non-contextual embedding models that produce one embedding per word and, therefore, mask the variability present in the data. In this article, we propose an approach to estimate semantic shift by combining contextual word embeddings with permutation-based statistical tests. We use the false discovery rate procedure to address the large number of hypothesis tests being conducted simultaneously. We demonstrate the performance of this approach in simulation where it achieves consistently high precision by suppressing false positives. We additionally analyze real-world data from SemEval-2020 Task 1 and the Liverpool FC subreddit corpus. We show that by taking sample variation into account, we can improve the robustness of individual semantic shift estimates without degrading overall performance.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Semantic change detection methods are used in historical linguistics and digital humanities to study the evolution of word meaning over time and in different domains (Kutuzov et al., 2018) . While semantic shift estimates have been shown to correlate with simulated Shoemark et al., 2019) and manual (Schlechtweg et al., 2020) annotations of meaning change, to our knowledge, no existing methods attempt to characterize the uncertainty of the estimated semantic shift for each individual word. This is especially problematic because semantic change detection is usually based on word embeddings (Kutuzov et al., 2018) and recently it has been observed that their stability can vary widely across term frequencies (Wendlandt et al., 2018; Antoniak and Mimno, 2018) , implying that many semantic shift estimates are erroneously inflated or underestimated. Prior studies have addressed this issue by filtering out words that fall below a term frequency threshold. While this approach can remove a majority of false positives, it risks the introduction of false negatives. A more robust approach would take into account the sample variation to determine whether there is evidence that an estimated semantic shift is sufficiently different from zero to be considered statistically significant. Unfortunately, non-contextual word embeddings lose this information, flattening all instances of the same term into a single word embedding.",
"cite_spans": [
{
"start": 166,
"end": 188,
"text": "(Kutuzov et al., 2018)",
"ref_id": "BIBREF18"
},
{
"start": 266,
"end": 288,
"text": "Shoemark et al., 2019)",
"ref_id": "BIBREF26"
},
{
"start": 300,
"end": 326,
"text": "(Schlechtweg et al., 2020)",
"ref_id": "BIBREF25"
},
{
"start": 595,
"end": 617,
"text": "(Kutuzov et al., 2018)",
"ref_id": "BIBREF18"
},
{
"start": 713,
"end": 737,
"text": "(Wendlandt et al., 2018;",
"ref_id": "BIBREF27"
},
{
"start": 738,
"end": 763,
"text": "Antoniak and Mimno, 2018)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this paper, we focus on the problem of robust semantic change detection in scenarios where there is either limited data or low frequency terms of interest (e.g. Del Tredici et al. (2019)). Our approach is based on contextual word embeddings, such as those produced by BERT (Devlin et al., 2019) , and permutation-based statistical tests. Contextual word embeddings have several advantages over non-contextual embeddings for inferring semantic shift when there is limited data. First, we can leverage pre-trained models that were trained on large-scale data, encoding prior knowledge of the language. Second, as contextual word embeddings are generated for every instance of a given word, there is an opportunity to characterize the strength of evidence for each semantic shift using statistical testing.",
"cite_spans": [
{
"start": 276,
"end": 297,
"text": "(Devlin et al., 2019)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The approach we propose in this paper focuses on the application and evaluation of statistical testing in semantic change detection. Our contributions are as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "\u2022 We show how to apply statistical significance tests to any semantic change detection method based on contextual word embeddings. To our knowledge, this is the first paper to use statistical testing in the context of individual words in semantic change detection. \u2022 We show in simulation that using permutation tests while controlling the false discovery rate improves precision and scales to estimating the uncertainty for all words in a vocabulary. \u2022 We evaluate the impact of statistical testing on overall performance using manually annotated data sets in multiple languages. In a majority of cases, our approach improves performance, resulting in higher Spearman correlations between estimated semantic shifts and annotations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Computational methods for semantic change detection are used to compare corpora spanning decades or even centuries. They have been used, for example, to analyze historical word usage (Hamilton et al., 2016a) and to identify statistical laws of language change (Hamilton et al., 2016b) . More recently, there has been increased interest in detecting short-term meaning change, such as novel slang terms, in Amazon reviews (Kulkarni et al., 2015) , Twitter data (Shoemark et al., 2019) and specialist online communities . Prior to the wide-spread use of word embeddings, numerous methods were developed to detect semantic change, including dynamic topic models (Blei and Lafferty, 2006) , word co-occurrence statistics (Gulordava and Baroni, 2011) and graphbased methods (Mitra et al., 2014) . Methods for semantic change detection based on word embeddings exploit their distributional properties to identify words whose relative position in the embedding space has changed over time, implying a concordant change in meaning (Kutuzov et al., 2018) . The earliest work in this area was based on continuous training, initializing each embedding model with embeddings from the previous time step (Kim et al., 2014) . Subsequent methods improved performance by training independent embedding models for each corpus (Kulkarni et al., 2015; Hamilton et al., 2016b) . Embeddings are invariant under rotation and therefore need to be aligned by solving the orthogonal Procrustes problem (Hamilton et al., 2016b) . This alignment step can be avoided altogether by, for example, comparing word neighborhoods (Hamilton et al., 2016a) or using temporal referencing (Dubossarsky et al., 2019) .",
"cite_spans": [
{
"start": 183,
"end": 207,
"text": "(Hamilton et al., 2016a)",
"ref_id": "BIBREF10"
},
{
"start": 260,
"end": 284,
"text": "(Hamilton et al., 2016b)",
"ref_id": "BIBREF11"
},
{
"start": 421,
"end": 444,
"text": "(Kulkarni et al., 2015)",
"ref_id": "BIBREF16"
},
{
"start": 460,
"end": 483,
"text": "(Shoemark et al., 2019)",
"ref_id": "BIBREF26"
},
{
"start": 659,
"end": 684,
"text": "(Blei and Lafferty, 2006)",
"ref_id": "BIBREF3"
},
{
"start": 717,
"end": 745,
"text": "(Gulordava and Baroni, 2011)",
"ref_id": "BIBREF9"
},
{
"start": 769,
"end": 789,
"text": "(Mitra et al., 2014)",
"ref_id": "BIBREF22"
},
{
"start": 1023,
"end": 1045,
"text": "(Kutuzov et al., 2018)",
"ref_id": "BIBREF18"
},
{
"start": 1191,
"end": 1209,
"text": "(Kim et al., 2014)",
"ref_id": "BIBREF14"
},
{
"start": 1309,
"end": 1332,
"text": "(Kulkarni et al., 2015;",
"ref_id": "BIBREF16"
},
{
"start": 1333,
"end": 1356,
"text": "Hamilton et al., 2016b)",
"ref_id": "BIBREF11"
},
{
"start": 1477,
"end": 1501,
"text": "(Hamilton et al., 2016b)",
"ref_id": "BIBREF11"
},
{
"start": 1596,
"end": 1620,
"text": "(Hamilton et al., 2016a)",
"ref_id": "BIBREF10"
},
{
"start": 1651,
"end": 1677,
"text": "(Dubossarsky et al., 2019)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "Semantic shift detection with contextual word embeddings is becoming increasingly popular. Hu et al. (2019) used BERT embeddings to define exemplar representations for pre-defined word senses to track usage over time. Several meth-ods have side-stepped the need for known word senses by clustering BERT embeddings Martinc et al., 2020b) and shown that clustering-based approaches can scale to the whole vocabulary (Montariol et al., 2021) . Another benefit of using contextual word embeddings is that pre-trained models are widely available for many different languages. These models can be used for fine-tuning to perform semantic change detection using more limited data (Martinc et al., 2020a) . Lastly, researchers have started to experiment with ensembling multiple types of word embeddings and distance metrics to improve overall performance (Kutuzov and Giulianelli, 2020; Martinc et al., 2020b) .",
"cite_spans": [
{
"start": 91,
"end": 107,
"text": "Hu et al. (2019)",
"ref_id": "BIBREF13"
},
{
"start": 314,
"end": 336,
"text": "Martinc et al., 2020b)",
"ref_id": "BIBREF20"
},
{
"start": 414,
"end": 438,
"text": "(Montariol et al., 2021)",
"ref_id": "BIBREF23"
},
{
"start": 673,
"end": 696,
"text": "(Martinc et al., 2020a)",
"ref_id": "BIBREF19"
},
{
"start": 848,
"end": 879,
"text": "(Kutuzov and Giulianelli, 2020;",
"ref_id": "BIBREF17"
},
{
"start": 880,
"end": 902,
"text": "Martinc et al., 2020b)",
"ref_id": "BIBREF20"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "Recently, there have been several benchmarking studies of semantic change detection methods using simulated data (Shoemark et al., 2019; and manually annotated data sets (Schlechtweg et al., 2020) . These studies found that variations on the method proposed by Hamilton et al. (2016b) performed best, however, methods based on contextual word embeddings were either absent or the study was based on data where contextual information was partially lost due to shuffling the order of sentences in the corpus (Schlechtweg et al., 2020) .",
"cite_spans": [
{
"start": 113,
"end": 136,
"text": "(Shoemark et al., 2019;",
"ref_id": "BIBREF26"
},
{
"start": 170,
"end": 196,
"text": "(Schlechtweg et al., 2020)",
"ref_id": "BIBREF25"
},
{
"start": 261,
"end": 284,
"text": "Hamilton et al. (2016b)",
"ref_id": "BIBREF11"
},
{
"start": 506,
"end": 532,
"text": "(Schlechtweg et al., 2020)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "In this paper, we use contextual word embeddings to identify statistically significant semantic shifts. Statistical significance has not been the subject of much investigation in the semantic shift literature. Indeed, the only approach we are aware of was proposed by Kulkarni et al. (2015) , which used bootstrapping to perform change-point detection in time series. However, their method is not applicable to scenarios where there is only two time points nor does it take into account the sample variance within each corpus. Our approach addresses both of these issues and can be applied to any semantic change detection method based on contextual word embeddings. Table 1 lists the data sets used in this article. The Liverpool FC corpus collects data from the Liverpool Football Club subreddit from the Reddit online discussion forum. The corpus is in English and split into two time periods from 2011-2013 and 2017 . SemEval-2020 Task 1 was created to benchmark semantic change detection methods using two subtasks: binary classifica- tion of whether a word sense has been gained or lost (subtask 1) and ranking words according to their degree of semantic change (subtask 2). The data set contains English, German, Latin and Swedish corpora, all of which contain data from two time periods. All sentences were shuffled and the words lemmatized. We only used the manual annotations from subtask 2 (Schlechtweg et al., 2020) .",
"cite_spans": [
{
"start": 268,
"end": 290,
"text": "Kulkarni et al. (2015)",
"ref_id": "BIBREF16"
},
{
"start": 1401,
"end": 1427,
"text": "(Schlechtweg et al., 2020)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [
{
"start": 667,
"end": 674,
"text": "Table 1",
"ref_id": "TABREF1"
}
],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "Our approach uses contextual word embeddings and permutation-based statistical testing to detect semantic shifts in scenarios where data is limited. While our approach can be applied to any method based on contextual embeddings, we used the method proposed by Martinc et al. (2020a) because of its conceptual simplicity and faster runtime compared to other methods. We generated all contextual word embeddings with BERT (Devlin et al., 2019) using the implementation from HuggingFace's Transformers library (Wolf et al., 2019) . In all experiments, we used a base version of BERT (the exact pre-trained models used are specified in later sections) with 12 attention layers and a hidden layer size of 768. All parameters were set to the default values used in the Transformers library ver. 2.5.0, unless stated otherwise.",
"cite_spans": [
{
"start": 260,
"end": 282,
"text": "Martinc et al. (2020a)",
"ref_id": "BIBREF19"
},
{
"start": 507,
"end": 526,
"text": "(Wolf et al., 2019)",
"ref_id": "BIBREF28"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Methodology",
"sec_num": "4"
},
{
"text": "Following the approach outlined by Martinc et al. (2020a) , we fine-tune a pre-trained BERT model for each data set, combining both time periods. After fine-tuning, we use the following procedure to generate word representations: we feed sentences of up to 512 tokens into BERT and extract contextual embeddings for each token in the sequence. Following Devlin et al. 2019, we extract embeddings by summing the last 4 encoder layers in the model. As BERT uses byte-pair input encoding, not all tokens correspond to individual words (Kudo and Richardson, 2018) . We therefore create contextual embeddings for each word by averaging the embeddings of its constituent tokens. For each word, we create a non-contextual embedding for each time period by averaging over all contexts for that word. We estimate semantic shift using the cosine distance between these two noncontextual embeddings. To assess the uncertainty in these estimates, we calculate p-values using permutation tests, which are adjusted for multiple comparisons using a false discovery rate procedure (described below). If the p-value is greater than 0.05, there is insufficient evidence to reject the null hypothesis of no difference in meaning between time periods and, therefore, any observed differences can be attributed to random sample variation.",
"cite_spans": [
{
"start": 35,
"end": 57,
"text": "Martinc et al. (2020a)",
"ref_id": "BIBREF19"
},
{
"start": 532,
"end": 559,
"text": "(Kudo and Richardson, 2018)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Estimating Semantic Shifts",
"sec_num": "4.1"
},
{
"text": "Permutation tests are non-parametric significance tests. Non-parametric tests make no assumptions with respect to the underlying sampling distribution of the data. The goal of the permutation test is to determine whether the observed test statistic (i.e. the cosine distance) is significantly different from zero (the null hypothesis being that there is no semantic shift between the two time periods). Permutation tests generate the sampling distribution by reassigning group labels (i.e. time periods) to all observations by sampling without replacement. We then recalculate the test statistic between the two randomized groups. This procedure is repeated many times, either by enumerating all possible combinations of group assignments or by randomly sampling n permutations. We calculate the p-value as the proportion of the sampling distribution that is greater than or equal to the observed test statistic and reject the null hypothesis for all p-values < \u03b1, where \u03b1, the significance threshold, is usually set to 0.05. Clearly, this procedure limits the smallest non-zero p-value to 1 n . When we cannot calculate the p-value exactly (i.e. if all combinations cannot be enumerated), we first use n = 10 3 . If the p-value is < 0.05, we increase n to 10 4 . Finally, if the p-value is < 0.005, we increase n to 10 5 . P-values with a value of 0.0 are reported as 1 n . For example, from the Liverpool FC data set, the word shovel appears 5 and 35 times in the 2011-2013 and 2017 corpora, respectively. The number of combinations, 40 5 , is too large to enumerate exhaustively, forcing us to use random sampling. with the observed distance of 0.104 (dashed red line). As 2.12% of the sampling distribution is greater than or equal to 0.104, the p-value is 0.0212 and, therefore, statistically significant.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Permutation Tests",
"sec_num": "4.2"
},
{
"text": "If we want to investigate many words in the same experiment, however, then we need to consider the issue of multiple comparisons (Hsu, 1996) . In brief, the multiple comparisons problem is where we reject the null hypothesis too often due to the number of simultaneous independent hypothesis tests performed. It is, therefore, desirable to set a lower (more stringent) significance threshold for the set of simultaneous significance tests. We do this in a principled way using a false discovery rate procedure.",
"cite_spans": [
{
"start": 129,
"end": 140,
"text": "(Hsu, 1996)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Permutation Tests",
"sec_num": "4.2"
},
{
"text": "We use the Benjamini-Hochberg procedure to adjust p-values for multiple comparisons (Benjamini and Hochberg, 1995) . In doing so, we are limiting the false discovery rate (FDR), i.e. the proportion of false positives, which can potentially be very large if we perform a significance test for every word in the vocabulary.",
"cite_spans": [
{
"start": 84,
"end": 114,
"text": "(Benjamini and Hochberg, 1995)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "False Discovery Rate",
"sec_num": "4.3"
},
{
"text": "The Benjamini-Hochberg procedure assumes that we perform m significance tests producing a list of p-values, P 1 , P 2 . . . P m , ranked into ascending order. We control the FDR at the significance threshold, \u03b1, by finding the largest value of k, such that P (k) \u2264 k m \u03b1. We reject the null hypothesis for all p-values less than P k (Benjamini and Hochberg, 1995) . The implementation of FDR that we use additionally makes the corresponding corrections to all other p-values, allowing for any \u03b1 to be used post-correction.",
"cite_spans": [
{
"start": 333,
"end": 363,
"text": "(Benjamini and Hochberg, 1995)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "False Discovery Rate",
"sec_num": "4.3"
},
{
"text": "Returning to our previous example, the significance test for shovel was only one of 97 tests performed to analyze the Liverpool FC data set. Controlling for FDR adjusts the original (significant) p-value of 0.0212 to 0.0605, suggesting there is insufficient evidence, given the number of independent significance tests performed, to believe the observed distance of 0.104 is different from zero. We, therefore, attribute the observed difference between time periods to random variation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "False Discovery Rate",
"sec_num": "4.3"
},
{
"text": "We created multiple simulated data sets to highlight the importance of significance testing when performing semantic change detection across the whole vocabulary. Previous work also used simulated data to compare methods (Kulkarni et al., 2015; Shoemark et al., 2019) , however, they focused on simulating time series, whereas we only simulate two time periods.",
"cite_spans": [
{
"start": 221,
"end": 244,
"text": "(Kulkarni et al., 2015;",
"ref_id": "BIBREF16"
},
{
"start": 245,
"end": 267,
"text": "Shoemark et al., 2019)",
"ref_id": "BIBREF26"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Synthetic Evaluation",
"sec_num": "5"
},
{
"text": "We create synthetic data sets using a method similar to Shoemark et al. (2019) . For each simulation run, we create two synthetic corpora: C1 and C2. Each synthetic corpus is created by randomly sampling with replacement 70% of the sentences from the Liverpool FC 2017 corpus (the larger of the two time periods). C1 and C2 have the same distributional characteristics, but vary due to sampling noise. We insert controlled shifts by copying and editing sentences in the data set, altering both the term frequency and co-occurrence distributions of shifted words (described below). Finally, we finetune the English BERT-base-uncased model for 5 epochs using all unique sentences from C1 and C2, before calculating cosine distances, permutation tests and FDR correction.",
"cite_spans": [
{
"start": 56,
"end": 78,
"text": "Shoemark et al. (2019)",
"ref_id": "BIBREF26"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Synthetic Data Set Construction",
"sec_num": "5.1"
},
{
"text": "Our procedure for inserting semantic shifts is as follows. We select n pairs of words: an acceptor word, that gains new meanings, and a donor word, where these new meanings come from. We pick word pairs by (i) filtering out words with low (< 5) or high (> 500) term frequencies and those with > 5 word senses according to WordNet (very few words in WordNet have only a single word sense, the threshold was chosen to limit the number of word senses without being too restrictive), (ii) we then sort words into descending order by term fre-quency, (iii) we pair up consecutive words and, (iv) randomly select word pairs. For each word pair, we randomly generate a proportion, p, and sample p of the sentences containing the donor word from C2 and replaced the donor word with the acceptor word. We only simulated gains in word meaning because they are equivalent to losses with only two time points, i.e. a gain from C1 \u2192 C2 is equivalent to a loss from C2 \u2192 C1. To ensure that we do not create any unintentional changes in the meaning of the donor words, these changes were made to copies of the sampled sentences, i.e. the term frequency of donor words is unchanged.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Synthetic Data Set Construction",
"sec_num": "5.1"
},
{
"text": "We created 10 data sets using this procedure, each simulating 500 semantic shifts. Given that p is randomly generated, these shifts can result in anything from a term frequency gain of 1 (which is undetectable due to sampling variation) to the term frequency approximately doubling. As a result of the initial random sampling to create the corpora, the number of non-artificially shifted words with a difference in term frequency of at least +50% was \u223c1200 and +100% was \u223c150. The size of the shared vocabulary between C1 and C2 was \u223c31,000 words in all simulation runs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Synthetic Data Set Construction",
"sec_num": "5.1"
},
{
"text": "Model fine-tuning took < 2 hours on an Nvidia Volta V100 GPU with 32GB of RAM. P-value calculations were parallelized, taking a total of 170 CPU hours per simulation run on Intel Xeon CPUs running at 2.1 GHz.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Synthetic Data Set Construction",
"sec_num": "5.1"
},
{
"text": "As a baseline, we compared our approach to the method proposed by Martinc et al. (2020a) , described in Section 4.1, i.e. cosine distance between average embeddings without significance testing. To set the term frequency threshold to even consider a word for semantic shift detection, we found the optimal threshold that maximised precision@500. This baseline represents the best-case scenario and is, therefore, impossible to replicate in real-world settings as we would not know a priori which words have undergone semantic shift. The optimal term frequency threshold varied for each simulation run, ranging between 19-25. We refer to this method as Optimal TF.",
"cite_spans": [
{
"start": 66,
"end": 88,
"text": "Martinc et al. (2020a)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Baseline Optimization",
"sec_num": "5.2"
},
{
"text": "We evaluated how well FDR adjusted p-values compare with those from the permutation tests and the baseline. We used precision@K averaged over the 10 simulation runs. Precision@K = T P (K)/K, Figure 2: Precision@K averaged over 10 simulation runs. Perm and FDR were filtered using the p-values from permutation tests and FDR correction, respectively. Optimal TF filters at the optimal term frequency threshold to maximise precision@500.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results",
"sec_num": "5.3"
},
{
"text": "where K is the rank and T P (K) is the count of true positives found in the top-K ranks. We used all values of K from 1-500. Figure 2 shows how precision@K varied for the three methods tested. FDR outperformed TF Optimal for all values of K where there was at least K significant results, with the exception of precision@1, where they were equal. FDR output the fewest results of all three methods, ranging from 177 to 189 words across the 10 simulation runs. For precision@177 (the last rank with FDR results in all 10 simulation runs), the lowest precision for FDR was 0.96 compared to 0.86 for TF Optimal, an improvement of 11.6%. For TF Optimal, performance starts to drop from around rank 100, falling to 0.55 at rank 500.",
"cite_spans": [],
"ref_spans": [
{
"start": 125,
"end": 133,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "5.3"
},
{
"text": "We additionally included the p-values from the permutation tests without FDR correction (Perm in Figure 2 ). Overall, the permutation tests had the highest precision lower in the ranking, but suffered from more false positives at the top of the ranking compared to the more conservative FDR. While FDR and Optimal TF had an average precision@10 close to 1.0, the unadjusted p-values from the permutation test had an average precision@10 of 0.71. For precision@335 (the last rank with permutation test results in all simulation runs), the lowest precision was 0.86. ",
"cite_spans": [],
"ref_spans": [
{
"start": 97,
"end": 105,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Precision@K",
"sec_num": "5.3.1"
},
{
"text": "\u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Precision@K",
"sec_num": "5.3.1"
},
{
"text": "\u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 10 100 1000 0.0 0.1 0.2 0.3",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Precision@K",
"sec_num": "5.3.1"
},
{
"text": "Term Frequency",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Cosine Distance",
"sec_num": null
},
{
"text": "\u2022 \u2022 \u2022",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Cosine Distance",
"sec_num": null
},
{
"text": "Perm, P > 0.05 Perm, P < 0.05 FDR, P < 0.05 Figure 3 : Cosine distance between average BERT embeddings vs term frequency (log scaled). Colors show whether P < 0.05 for permutation test and FDR (yellow and blue dots, respectively). Figure 3 shows the cosine distance for each word with a simulated semantic shift across all 10 simulation runs versus term frequency on a log scale. The colors indicate whether the distance was not statistically significant (gray), significant for the permutation test, but not after FDR correction (yellow) or significant after FDR correction (blue). Significance testing makes a complex trade-off between the effect size (cosine distance), sample size (term frequency) and the number of significance tests performed. Semantic shift studies usually threshold on term frequency, however, it is clear from Figure 3 that thresholding on any combination of term frequency or cosine distance will filter out words where the estimated semantic shift achieves statistical significance, unnecessarily introducing false negatives and potentially omitting important results.",
"cite_spans": [],
"ref_spans": [
{
"start": 44,
"end": 52,
"text": "Figure 3",
"ref_id": null
},
{
"start": 231,
"end": 239,
"text": "Figure 3",
"ref_id": null
},
{
"start": 836,
"end": 844,
"text": "Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Cosine Distance",
"sec_num": null
},
{
"text": "We hypothesized that confounding factors, such as the distance between acceptor and donor words in the embedding space, could spuriously influence whether a semantic shift estimate achieves significance. To investigate this concern, we created a logistic regression model with a binary response variable of whether the FDR p-value was < 0.05. We used the following explanatory variables from the simulations: gain in term frequency of the acceptor word and two confounding variables (i) the final term frequency of the acceptor word and (ii) the original cosine distance between donor and acceptor words. We standardized all ex-planatory variables so we could rank them by their relative effect size. All regression coefficients were highly significant (P < 2 \u00d7 10 \u221216 ). The gain in term frequency from donor to acceptor word had the strongest effect on whether semantic change could be detected by FDR (\u03b2 = 10.7). The confounding variables, however, had a comparatively modest effect. The term frequency of the acceptor word had a negative effect (-1.52) and the distance between acceptor and donor words had a small positive effect (0.53). These findings suggest that significance testing supports semantic change detection and is not strongly biased towards potential confounders.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Factors Influencing Detection",
"sec_num": "5.3.3"
},
{
"text": "We used five manually annotated data sets (see Table 1) to evaluate whether our approach impacts overall performance. We hypothesized that erroneous estimates of semantic change will have a negative impact on the Spearman correlation between cosine distance and manual annotations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Empirical Evaluation",
"sec_num": "6"
},
{
"text": "Each corpus from SemEval-2020 and Liverpool FC was composed of data from two time periods. As in our simulations, we fine-tuned a single BERT model on the entire corpus (i.e. the concatenation of both time periods) for 5 epochs. We used the BERT-base-uncased pre-trained BERT model for English, bert-base-german-dbmdz-uncased for German, Latin BERT (Bamman and Burns, 2020) for Latin and af-ai-center/ bert-base-swedish-uncased for Swedish. As each corpus provides a list of target words with known semantic shift, we calculated cosine distances, permutation tests and FDR correction for only these words. We evaluated performance with the Spearman correlation between the estimated semantic shifts and the ground truth. We did this between (i) all target words (the baseline), (ii) words where the p-value from the permutation test was < 0.05 and (iii) words where the FDR corrected p-value was < 0.05. We note that our chosen baseline Martinc et al. (2020a) does not have state-of-the-art performance on SemEval-2020, however, we are only concerned with the relative differences in performance from applying significance testing. Table 2 : Spearman correlations of cosine distance vs. semantic shift for English, German, Latin and Swedish from SemEval-2020. Data sets were randomly sampled without replacement using sampling rates of 0.2, 0.15 and 0.1 (with the exception of Swedish, which was subsampled to 0.1 and 0.05). Each result is the mean over 100 runs.",
"cite_spans": [
{
"start": 349,
"end": 373,
"text": "(Bamman and Burns, 2020)",
"ref_id": "BIBREF1"
},
{
"start": 937,
"end": 959,
"text": "Martinc et al. (2020a)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [
{
"start": 1132,
"end": 1139,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "6.1"
},
{
"text": "Many of the target words in SemEval-2020 have high term frequencies of up to several thousand per time period. Given that words with high term frequencies will be highly significant, we created artificially smaller data sets using random subsampling. For English, German and Latin, we randomly sampled without replacement using sampling rates of 0.2, 0.15 and 0.1. For Swedish, we used sampling rates of 0.1 and 0.05. These sampling rates were chosen to cover the range of almost all words achieving significance to only \u223c30 achieving significance (below which, the Spearman correlation was often not statistically significant). Swedish has only 31 words in the target set and the highest term frequencies, necessitating lower sampling rates. We created 100 randomly subsampled data sets per sampling rate for each language. Model fine-tuning took approximately 1, 24, 2.5 and 36 hours for English, German, Latin and Swedish, respectively, using the same computing resources as previously. P-value calculation varied per language and sampling rate from 25 minutes to 2 hours. Table 2 shows the average Spearman correlation for each data set in SemEval-2020 for each sampling rate tested. Despite the small size of the target sets, significance testing generally had a positive impact on Spearman correlation. FDR correction had the highest or joint highest correlation in 8/11 experiments. The baseline outperformed both permutation tests and FDR correction in two experiments, however, the difference was at most only 0.01. At the lowest sampling rates, the margin by which our approach outperformed the baseline varied widely: with a sampling rate of 0.1 there was an improvement of 11.5% and 19.2%, for German and Latin, respectively. However, for English the improvement was only 2.5%.",
"cite_spans": [],
"ref_spans": [
{
"start": 1076,
"end": 1083,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "SemEval-2020",
"sec_num": "6.2"
},
{
"text": "In these experiments, performing FDR correction, compared to permutation tests, made a min-imal difference to correlation because there were only 31-48 significance tests compared to \u223c31, 000 simultaneous tests performed in Section 5.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results",
"sec_num": "6.2.1"
},
{
"text": "Compared to SemEval-2020, words in the Liverpool FC corpus tend to have lower term frequencies. Additionally, the Liverpool FC corpus had a higher proportion of words with a ground truth semantic shift of zero (40/97). The Liverpool FC corpus better represents the kind of observational studies we focus on with our approach, where data is sparse and therefore noisier. Model fine-tuning and p-value calculation took < 3 hours in total. Figure 4 shows a scatter plot of the cosine distance versus semantic shift index for the 97 words in the target set. Each word is colored by p-value: gray were not statistically significant (57/97), yellow were significant for the permutation test, but not after FDR correction (10/97) and blue were significant after FDR correction (30/97). For a majority of words, there is insufficient evidence to reject the null hypothesis that the semantic change is zero.",
"cite_spans": [],
"ref_spans": [
{
"start": 437,
"end": 445,
"text": "Figure 4",
"ref_id": "FIGREF2"
}
],
"eq_spans": [],
"section": "Liverpool FC Subreddit",
"sec_num": "6.3"
},
{
"text": "Some words failed to achieve significance due to low term frequency: dank and roast, for example, only occur once in the 2011-2013 corpus. Other words had a high term frequency, but a low estimated shift -requiring substantial evidence to be considered significantly different from zero. Of the 40 target words with a ground truth semantic shift of zero, FDR correction found that 35 were not significantly different from zero (compared to 32 using raw p-values from the permutation test).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results",
"sec_num": "6.3.1"
},
{
"text": "The number of words filtered out by significance testing is so great that it negatively impacts correlation. Table 3 shows the Spearman correlations. The method with the highest correlation was using permutation tests without FDR correction, outperforming the baseline by 4.7%. The loss in correlation in FDR correction is caused by three outliers (clench, election and parked). The negative influence of these words would be lessened if more words had achieved statistical significance, as was the case with using just permutation tests. Significance testing highlights how we can be misled by randomness. Del Tredici et al. 2019stated that false positives with a semantic shift index of zero may be caused by a referential effect, i.e. words that refer to different people or events in different time periods, such as independence which referred to events in Catalonia (Figure 4 , bottom left). However, a simpler explanation is that there is insufficient evidence to support the cosine distance being significantly different from zero. Similarly, the estimates for pharaoh and shovel are not too low because they are being used metaphorically , but because the estimated semantic shift is not statistically significant.",
"cite_spans": [],
"ref_spans": [
{
"start": 109,
"end": 116,
"text": "Table 3",
"ref_id": "TABREF5"
},
{
"start": 871,
"end": 880,
"text": "(Figure 4",
"ref_id": "FIGREF2"
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "6.3.1"
},
{
"text": "We presented an approach to identify statistically significant semantic change using contextual word embeddings, permutation tests and false discovery rate. Our work was motivated by the fact that while there are many methods for semantic change detection, they only estimate the magnitude of a given shift and ignore the uncertainty in their estimates. As a result, existing semantic change detection methods are problematic to apply if (i) the data set is of limited size or (ii) you need to estimate the semantic shift for words with low term frequencies.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "7"
},
{
"text": "In simulation, we demonstrated that using a combination of permutation tests and false discovery rate allows us to scale semantic shift estimation to every word in the vocabulary while avoiding false positives and achieving high precision (Figure 2) . In our analysis of the SemEval-2020 data sets, we showed that significance testing has a generally positive impact on Spearman correlation (Table 2) .",
"cite_spans": [],
"ref_spans": [
{
"start": 239,
"end": 249,
"text": "(Figure 2)",
"ref_id": null
},
{
"start": 391,
"end": 400,
"text": "(Table 2)",
"ref_id": null
}
],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "7"
},
{
"text": "In these examples, the false discovery rate procedure made less of a difference due to the limited number of significance tests performed. In the Liverpool FC corpus, less than a third of target words achieved significance with FDR correction, causing outliers to have a greater influence on correlation than they did on permutation tests (Table 3) . However, we were able to highlight how conclusions from Del Tredici et al. (2019) could be more easily explained by semantic shift estimates not being statistically significant due to insufficient evidence. Our work has several limitations. First, the need to recalculate semantic shifts for each permutation increases computational requirements substantially. While this did not prevent us from calculating pvalues for the whole vocabulary in our simulations, it will be challenging to scale to more complex methods that are based on, for example, clustering. Second, false discovery rate assumes that simultaneous significance tests are independent, which is not the case for word usage. A better approach would account for correlations in usage between words to calibrate the significance threshold more appropriately.",
"cite_spans": [],
"ref_spans": [
{
"start": 339,
"end": 348,
"text": "(Table 3)",
"ref_id": "TABREF5"
}
],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "7"
},
{
"text": "In this paper, we used a semantic shift method which did not exploit the full potential of contextual word embeddings, i.e. to disambiguate between word senses. In future work, we are going to investigate whether more scalable techniques (e.g. Dwass (1957) ) could be applied at the word sense level, where even large data sets could potentially start to suffer from the small data problems we focused on in this article.",
"cite_spans": [
{
"start": 244,
"end": 256,
"text": "Dwass (1957)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "7"
}
],
"back_matter": [
{
"text": "The authors were supported by a grant from Business Finland grant number 3283/31/2019. The authors wish to acknowledge CSC -IT Center for Science, Finland, for computational resources.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgements",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Evaluating the stability of embedding-based word similarities",
"authors": [
{
"first": "Maria",
"middle": [],
"last": "Antoniak",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Mimno",
"suffix": ""
}
],
"year": 2018,
"venue": "Transactions of the Association for Computational Linguistics",
"volume": "6",
"issue": "",
"pages": "107--119",
"other_ids": {
"DOI": [
"10.1162/tacl_a_00008"
]
},
"num": null,
"urls": [],
"raw_text": "Maria Antoniak and David Mimno. 2018. Evaluating the stability of embedding-based word similarities. Transactions of the Association for Computational Linguistics, 6:107-119.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Latin bert: A contextual language model for classical philology",
"authors": [
{
"first": "David",
"middle": [],
"last": "Bamman",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Patrick",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Burns",
"suffix": ""
}
],
"year": 2020,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:2009.10053"
]
},
"num": null,
"urls": [],
"raw_text": "David Bamman and Patrick J Burns. 2020. Latin bert: A contextual language model for classical philology. arXiv preprint arXiv:2009.10053.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Controlling the false discovery rate: a practical and powerful approach to multiple testing",
"authors": [
{
"first": "Yoav",
"middle": [],
"last": "Benjamini",
"suffix": ""
},
{
"first": "Yosef",
"middle": [],
"last": "Hochberg",
"suffix": ""
}
],
"year": 1995,
"venue": "Journal of the Royal statistical society: series B (Methodological)",
"volume": "57",
"issue": "1",
"pages": "289--300",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yoav Benjamini and Yosef Hochberg. 1995. Control- ling the false discovery rate: a practical and pow- erful approach to multiple testing. Journal of the Royal statistical society: series B (Methodological), 57(1):289-300.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Dynamic topic models",
"authors": [
{
"first": "M",
"middle": [],
"last": "David",
"suffix": ""
},
{
"first": "John",
"middle": [
"D"
],
"last": "Blei",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Lafferty",
"suffix": ""
}
],
"year": 2006,
"venue": "Machine Learning, Proceedings of the Twenty-Third International Conference (ICML 2006)",
"volume": "148",
"issue": "",
"pages": "113--120",
"other_ids": {
"DOI": [
"10.1145/1143844.1143859"
]
},
"num": null,
"urls": [],
"raw_text": "David M. Blei and John D. Lafferty. 2006. Dynamic topic models. In Machine Learning, Proceedings of the Twenty-Third International Conference (ICML 2006), Pittsburgh, Pennsylvania, USA, June 25-29, 2006, volume 148 of ACM International Conference Proceeding Series, pages 113-120. ACM.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Short-term meaning shift: A distributional exploration",
"authors": [
{
"first": "Marco",
"middle": [],
"last": "Del Tredici",
"suffix": ""
},
{
"first": "Raquel",
"middle": [],
"last": "Fern\u00e1ndez",
"suffix": ""
},
{
"first": "Gemma",
"middle": [],
"last": "Boleda",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "1",
"issue": "",
"pages": "2069--2075",
"other_ids": {
"DOI": [
"10.18653/v1/N19-1210"
]
},
"num": null,
"urls": [],
"raw_text": "Marco Del Tredici, Raquel Fern\u00e1ndez, and Gemma Boleda. 2019. Short-term meaning shift: A distri- butional exploration. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), pages 2069-2075, Minneapolis, Minnesota. Association for Computational Linguistics.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "BERT: Pre-training of deep bidirectional transformers for language understanding",
"authors": [
{
"first": "Jacob",
"middle": [],
"last": "Devlin",
"suffix": ""
},
{
"first": "Ming-Wei",
"middle": [],
"last": "Chang",
"suffix": ""
},
{
"first": "Kenton",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Kristina",
"middle": [],
"last": "Toutanova",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "1",
"issue": "",
"pages": "4171--4186",
"other_ids": {
"DOI": [
"10.18653/v1/N19-1423"
]
},
"num": null,
"urls": [],
"raw_text": "Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. BERT: Pre-training of deep bidirectional transformers for language under- standing. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), pages 4171-4186, Minneapolis, Minnesota. Associ- ation for Computational Linguistics.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Time-out: Temporal referencing for robust modeling of lexical semantic change",
"authors": [
{
"first": "Haim",
"middle": [],
"last": "Dubossarsky",
"suffix": ""
},
{
"first": "Simon",
"middle": [],
"last": "Hengchen",
"suffix": ""
},
{
"first": "Nina",
"middle": [],
"last": "Tahmasebi",
"suffix": ""
},
{
"first": "Dominik",
"middle": [],
"last": "Schlechtweg",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "457--470",
"other_ids": {
"DOI": [
"10.18653/v1/P19-1044"
]
},
"num": null,
"urls": [],
"raw_text": "Haim Dubossarsky, Simon Hengchen, Nina Tahmasebi, and Dominik Schlechtweg. 2019. Time-out: Tem- poral referencing for robust modeling of lexical se- mantic change. In Proceedings of the 57th Annual Meeting of the Association for Computational Lin- guistics, pages 457-470, Florence, Italy. Association for Computational Linguistics.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Modified randomization tests for nonparametric hypotheses",
"authors": [
{
"first": "Meyer",
"middle": [],
"last": "Dwass",
"suffix": ""
}
],
"year": 1957,
"venue": "The Annals of Mathematical Statistics",
"volume": "",
"issue": "",
"pages": "181--187",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Meyer Dwass. 1957. Modified randomization tests for nonparametric hypotheses. The Annals of Mathe- matical Statistics, pages 181-187.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Analysing lexical semantic change with contextualised word representations",
"authors": [
{
"first": "Mario",
"middle": [],
"last": "Giulianelli",
"suffix": ""
},
{
"first": "Marco",
"middle": [
"Del"
],
"last": "Tredici",
"suffix": ""
},
{
"first": "Raquel",
"middle": [],
"last": "Fern\u00e1ndez",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "3960--3973",
"other_ids": {
"DOI": [
"10.18653/v1/2020.acl-main.365"
]
},
"num": null,
"urls": [],
"raw_text": "Mario Giulianelli, Marco Del Tredici, and Raquel Fer- n\u00e1ndez. 2020. Analysing lexical semantic change with contextualised word representations. In Pro- ceedings of the 58th Annual Meeting of the Asso- ciation for Computational Linguistics, pages 3960- 3973, Online. Association for Computational Lin- guistics.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "A distributional similarity approach to the detection of semantic change in the Google Books ngram corpus",
"authors": [
{
"first": "Kristina",
"middle": [],
"last": "Gulordava",
"suffix": ""
},
{
"first": "Marco",
"middle": [],
"last": "Baroni",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the GEMS 2011 Workshop on GEometrical Models of Natural Language Semantics",
"volume": "",
"issue": "",
"pages": "67--71",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kristina Gulordava and Marco Baroni. 2011. A distri- butional similarity approach to the detection of se- mantic change in the Google Books ngram corpus. In Proceedings of the GEMS 2011 Workshop on GE- ometrical Models of Natural Language Semantics, pages 67-71, Edinburgh, UK. Association for Com- putational Linguistics.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Cultural shift or linguistic drift? comparing two computational measures of semantic change",
"authors": [
{
"first": "William",
"middle": [
"L"
],
"last": "Hamilton",
"suffix": ""
},
{
"first": "Jure",
"middle": [],
"last": "Leskovec",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Jurafsky",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "2116--2121",
"other_ids": {
"DOI": [
"10.18653/v1/D16-1229"
]
},
"num": null,
"urls": [],
"raw_text": "William L. Hamilton, Jure Leskovec, and Dan Jurafsky. 2016a. Cultural shift or linguistic drift? compar- ing two computational measures of semantic change. In Proceedings of the 2016 Conference on Empiri- cal Methods in Natural Language Processing, pages 2116-2121, Austin, Texas. Association for Compu- tational Linguistics.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Diachronic word embeddings reveal statistical laws of semantic change",
"authors": [
{
"first": "William",
"middle": [
"L"
],
"last": "Hamilton",
"suffix": ""
},
{
"first": "Jure",
"middle": [],
"last": "Leskovec",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Jurafsky",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "1489--1501",
"other_ids": {
"DOI": [
"10.18653/v1/P16-1141"
]
},
"num": null,
"urls": [],
"raw_text": "William L. Hamilton, Jure Leskovec, and Dan Jurafsky. 2016b. Diachronic word embeddings reveal statisti- cal laws of semantic change. In Proceedings of the 54th Annual Meeting of the Association for Compu- tational Linguistics (Volume 1: Long Papers), pages 1489-1501, Berlin, Germany. Association for Com- putational Linguistics.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Multiple comparisons: theory and methods",
"authors": [
{
"first": "Jason",
"middle": [],
"last": "Hsu",
"suffix": ""
}
],
"year": 1996,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jason Hsu. 1996. Multiple comparisons: theory and methods. CRC Press.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Diachronic sense modeling with deep contextualized word embeddings: An ecological view",
"authors": [
{
"first": "Renfen",
"middle": [],
"last": "Hu",
"suffix": ""
},
{
"first": "Shen",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Shichen",
"middle": [],
"last": "Liang",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "3899--3908",
"other_ids": {
"DOI": [
"10.18653/v1/P19-1379"
]
},
"num": null,
"urls": [],
"raw_text": "Renfen Hu, Shen Li, and Shichen Liang. 2019. Di- achronic sense modeling with deep contextualized word embeddings: An ecological view. In Proceed- ings of the 57th Annual Meeting of the Association for Computational Linguistics, pages 3899-3908, Florence, Italy. Association for Computational Lin- guistics.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Temporal analysis of language through neural language models",
"authors": [
{
"first": "Yoon",
"middle": [],
"last": "Kim",
"suffix": ""
},
{
"first": "Yi-I",
"middle": [],
"last": "Chiu",
"suffix": ""
},
{
"first": "Kentaro",
"middle": [],
"last": "Hanaki",
"suffix": ""
},
{
"first": "Darshan",
"middle": [],
"last": "Hegde",
"suffix": ""
},
{
"first": "Slav",
"middle": [],
"last": "Petrov",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the ACL 2014 Workshop on Language Technologies and Computational Social Science",
"volume": "",
"issue": "",
"pages": "61--65",
"other_ids": {
"DOI": [
"10.3115/v1/W14-2517"
]
},
"num": null,
"urls": [],
"raw_text": "Yoon Kim, Yi-I Chiu, Kentaro Hanaki, Darshan Hegde, and Slav Petrov. 2014. Temporal analysis of lan- guage through neural language models. In Proceed- ings of the ACL 2014 Workshop on Language Tech- nologies and Computational Social Science, pages 61-65, Baltimore, MD, USA. Association for Com- putational Linguistics.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "SentencePiece: A simple and language independent subword tokenizer and detokenizer for neural text processing",
"authors": [
{
"first": "Taku",
"middle": [],
"last": "Kudo",
"suffix": ""
},
{
"first": "John",
"middle": [],
"last": "Richardson",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing: System Demonstrations",
"volume": "",
"issue": "",
"pages": "66--71",
"other_ids": {
"DOI": [
"10.18653/v1/D18-2012"
]
},
"num": null,
"urls": [],
"raw_text": "Taku Kudo and John Richardson. 2018. SentencePiece: A simple and language independent subword tok- enizer and detokenizer for neural text processing. In Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing: System Demonstrations, pages 66-71, Brussels, Belgium. Association for Computational Linguistics.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Statistically significant detection of linguistic change",
"authors": [
{
"first": "Vivek",
"middle": [],
"last": "Kulkarni",
"suffix": ""
},
{
"first": "Rami",
"middle": [],
"last": "Al-Rfou",
"suffix": ""
},
{
"first": "Bryan",
"middle": [],
"last": "Perozzi",
"suffix": ""
},
{
"first": "Steven",
"middle": [],
"last": "Skiena",
"suffix": ""
}
],
"year": 2015,
"venue": "Proceedings of the 24th International Conference on World Wide Web",
"volume": "",
"issue": "",
"pages": "625--635",
"other_ids": {
"DOI": [
"10.1145/2736277.2741627"
]
},
"num": null,
"urls": [],
"raw_text": "Vivek Kulkarni, Rami Al-Rfou, Bryan Perozzi, and Steven Skiena. 2015. Statistically significant detec- tion of linguistic change. In Proceedings of the 24th International Conference on World Wide Web, WWW 2015, Florence, Italy, May 18-22, 2015, pages 625- 635. ACM.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "UiO-UvA at SemEval-2020 task 1: Contextualised embeddings for lexical semantic change detection",
"authors": [
{
"first": "Andrey",
"middle": [],
"last": "Kutuzov",
"suffix": ""
},
{
"first": "Mario",
"middle": [],
"last": "Giulianelli",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the Fourteenth Workshop on Semantic Evaluation",
"volume": "",
"issue": "",
"pages": "126--134",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Andrey Kutuzov and Mario Giulianelli. 2020. UiO- UvA at SemEval-2020 task 1: Contextualised em- beddings for lexical semantic change detection. In Proceedings of the Fourteenth Workshop on Seman- tic Evaluation, pages 126-134, Barcelona (online). International Committee for Computational Linguis- tics.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Diachronic word embeddings and semantic shifts: a survey",
"authors": [
{
"first": "Andrey",
"middle": [],
"last": "Kutuzov",
"suffix": ""
},
{
"first": "Lilja",
"middle": [],
"last": "\u00d8vrelid",
"suffix": ""
},
{
"first": "Terrence",
"middle": [],
"last": "Szymanski",
"suffix": ""
},
{
"first": "Erik",
"middle": [],
"last": "Velldal",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 27th International Conference on Computational Linguistics",
"volume": "",
"issue": "",
"pages": "1384--1397",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Andrey Kutuzov, Lilja \u00d8vrelid, Terrence Szymanski, and Erik Velldal. 2018. Diachronic word embed- dings and semantic shifts: a survey. In Proceedings of the 27th International Conference on Computa- tional Linguistics, pages 1384-1397, Santa Fe, New Mexico, USA. Association for Computational Lin- guistics.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Leveraging contextual embeddings for detecting diachronic semantic shift",
"authors": [
{
"first": "Matej",
"middle": [],
"last": "Martinc",
"suffix": ""
},
{
"first": "Petra",
"middle": [
"Kralj"
],
"last": "Novak",
"suffix": ""
},
{
"first": "Senja",
"middle": [],
"last": "Pollak",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the 12th Language Resources and Evaluation Conference",
"volume": "",
"issue": "",
"pages": "4811--4819",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Matej Martinc, Petra Kralj Novak, and Senja Pollak. 2020a. Leveraging contextual embeddings for de- tecting diachronic semantic shift. In Proceedings of the 12th Language Resources and Evaluation Con- ference, pages 4811-4819, Marseille, France. Euro- pean Language Resources Association.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Discovery team at",
"authors": [
{
"first": "Matej",
"middle": [],
"last": "Martinc",
"suffix": ""
},
{
"first": "Syrielle",
"middle": [],
"last": "Montariol",
"suffix": ""
},
{
"first": "Elaine",
"middle": [],
"last": "Zosa",
"suffix": ""
},
{
"first": "Lidia",
"middle": [],
"last": "Pivovarova",
"suffix": ""
}
],
"year": 2020,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Matej Martinc, Syrielle Montariol, Elaine Zosa, and Lidia Pivovarova. 2020b. Discovery team at",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Context-sensitive embeddings not always better than static for semantic change detection",
"authors": [],
"year": null,
"venue": "Proceedings of the Fourteenth Workshop on Semantic Evaluation",
"volume": "",
"issue": "",
"pages": "67--73",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "SemEval-2020 task 1: Context-sensitive embed- dings not always better than static for semantic change detection. In Proceedings of the Four- teenth Workshop on Semantic Evaluation, pages 67- 73, Barcelona (online). International Committee for Computational Linguistics.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "That's sick dude!: Automatic identification of word sense change across different timescales",
"authors": [
{
"first": "Sunny",
"middle": [],
"last": "Mitra",
"suffix": ""
},
{
"first": "Ritwik",
"middle": [],
"last": "Mitra",
"suffix": ""
},
{
"first": "Martin",
"middle": [],
"last": "Riedl",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Biemann",
"suffix": ""
},
{
"first": "Animesh",
"middle": [],
"last": "Mukherjee",
"suffix": ""
},
{
"first": "Pawan",
"middle": [],
"last": "Goyal",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "1020--1029",
"other_ids": {
"DOI": [
"10.3115/v1/P14-1096"
]
},
"num": null,
"urls": [],
"raw_text": "Sunny Mitra, Ritwik Mitra, Martin Riedl, Chris Bie- mann, Animesh Mukherjee, and Pawan Goyal. 2014. That's sick dude!: Automatic identification of word sense change across different timescales. In Pro- ceedings of the 52nd Annual Meeting of the As- sociation for Computational Linguistics (Volume 1: Long Papers), pages 1020-1029, Baltimore, Mary- land. Association for Computational Linguistics.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Scalable and interpretable semantic change detection",
"authors": [
{
"first": "Syrielle",
"middle": [],
"last": "Montariol",
"suffix": ""
},
{
"first": "Matej",
"middle": [],
"last": "Martinc",
"suffix": ""
},
{
"first": "Lidia",
"middle": [],
"last": "Pivovarova",
"suffix": ""
}
],
"year": 2021,
"venue": "Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "",
"issue": "",
"pages": "4642--4652",
"other_ids": {
"DOI": [
"10.18653/v1/2021.naacl-main.369"
]
},
"num": null,
"urls": [],
"raw_text": "Syrielle Montariol, Matej Martinc, and Lidia Pivo- varova. 2021. Scalable and interpretable semantic change detection. In Proceedings of the 2021 Con- ference of the North American Chapter of the Asso- ciation for Computational Linguistics: Human Lan- guage Technologies, pages 4642-4652, Online. As- sociation for Computational Linguistics.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "A wind of change: Detecting and evaluating lexical semantic change across times and domains",
"authors": [
{
"first": "Dominik",
"middle": [],
"last": "Schlechtweg",
"suffix": ""
},
{
"first": "Anna",
"middle": [],
"last": "H\u00e4tty",
"suffix": ""
},
{
"first": "Marco",
"middle": [
"Del"
],
"last": "Tredici",
"suffix": ""
},
{
"first": "Sabine",
"middle": [],
"last": "Schulte Im Walde",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "732--746",
"other_ids": {
"DOI": [
"10.18653/v1/P19-1072"
]
},
"num": null,
"urls": [],
"raw_text": "Dominik Schlechtweg, Anna H\u00e4tty, Marco Del Tredici, and Sabine Schulte im Walde. 2019. A wind of change: Detecting and evaluating lexical seman- tic change across times and domains. In Proceed- ings of the 57th Annual Meeting of the Association for Computational Linguistics, pages 732-746, Flo- rence, Italy. Association for Computational Linguis- tics.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "SemEval-2020 task 1: Unsupervised lexical semantic change detection",
"authors": [
{
"first": "Dominik",
"middle": [],
"last": "Schlechtweg",
"suffix": ""
},
{
"first": "Barbara",
"middle": [],
"last": "Mcgillivray",
"suffix": ""
},
{
"first": "Simon",
"middle": [],
"last": "Hengchen",
"suffix": ""
},
{
"first": "Haim",
"middle": [],
"last": "Dubossarsky",
"suffix": ""
},
{
"first": "Nina",
"middle": [],
"last": "Tahmasebi",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the Fourteenth Workshop on Semantic Evaluation",
"volume": "",
"issue": "",
"pages": "1--23",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dominik Schlechtweg, Barbara McGillivray, Simon Hengchen, Haim Dubossarsky, and Nina Tahmasebi. 2020. SemEval-2020 task 1: Unsupervised lexical semantic change detection. In Proceedings of the Fourteenth Workshop on Semantic Evaluation, pages 1-23, Barcelona (online). International Committee for Computational Linguistics.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Room to Glo: A systematic comparison of semantic change detection approaches with word embeddings",
"authors": [
{
"first": "Philippa",
"middle": [],
"last": "Shoemark",
"suffix": ""
},
{
"first": "Ferdousi",
"middle": [],
"last": "Farhana",
"suffix": ""
},
{
"first": "Dong",
"middle": [],
"last": "Liza",
"suffix": ""
},
{
"first": "Scott",
"middle": [],
"last": "Nguyen",
"suffix": ""
},
{
"first": "Barbara",
"middle": [],
"last": "Hale",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Mcgillivray",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)",
"volume": "",
"issue": "",
"pages": "66--76",
"other_ids": {
"DOI": [
"10.18653/v1/D19-1007"
]
},
"num": null,
"urls": [],
"raw_text": "Philippa Shoemark, Farhana Ferdousi Liza, Dong Nguyen, Scott Hale, and Barbara McGillivray. 2019. Room to Glo: A systematic comparison of seman- tic change detection approaches with word embed- dings. In Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natu- ral Language Processing (EMNLP-IJCNLP), pages 66-76, Hong Kong, China. Association for Compu- tational Linguistics.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Factors influencing the surprising instability of word embeddings",
"authors": [
{
"first": "Laura",
"middle": [],
"last": "Wendlandt",
"suffix": ""
},
{
"first": "Jonathan",
"middle": [
"K"
],
"last": "Kummerfeld",
"suffix": ""
},
{
"first": "Rada",
"middle": [],
"last": "Mihalcea",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "1",
"issue": "",
"pages": "2092--2102",
"other_ids": {
"DOI": [
"10.18653/v1/N18-1190"
]
},
"num": null,
"urls": [],
"raw_text": "Laura Wendlandt, Jonathan K. Kummerfeld, and Rada Mihalcea. 2018. Factors influencing the surprising instability of word embeddings. In Proceedings of the 2018 Conference of the North American Chap- ter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Pa- pers), pages 2092-2102, New Orleans, Louisiana. Association for Computational Linguistics.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Huggingface's transformers: State-of-the-art natural language processing",
"authors": [
{
"first": "Thomas",
"middle": [],
"last": "Wolf",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Debut",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Sanh",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Chaumond",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Delangue",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Moi",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Cistac",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Rault",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Louf",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Funtowicz",
"suffix": ""
}
],
"year": 2019,
"venue": "ArXiv",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Thomas Wolf, L Debut, V Sanh, J Chaumond, C De- langue, A Moi, P Cistac, T Rault, R Louf, M Fun- towicz, et al. 2019. Huggingface's transformers: State-of-the-art natural language processing. ArXiv, abs/1910.03771.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "Histogram of the sampling distribution for shovel from the Liverpool FC data set. The red dashed line at x = 0.104 is the observed cosine distance between average BERT embeddings. The p-value is 0.0212 (the proportion of the histogram colored red).",
"uris": null,
"num": null,
"type_str": "figure"
},
"FIGREF2": {
"text": "Cosine distance vs. semantic shift index for Liverpool FC data set. Colors show whether P < 0.05 for permutation test and FDR (yellow and blue dots).",
"uris": null,
"num": null,
"type_str": "figure"
},
"TABREF1": {
"content": "<table/>",
"text": "Number of annotated words and corpus sizes for Liverpool FC and SemEval-2020 Task 1 corpora.",
"num": null,
"html": null,
"type_str": "table"
},
"TABREF3": {
"content": "<table><tr><td/><td/><td>English</td><td/><td/><td>German</td><td/><td/><td>Latin</td><td/><td colspan=\"2\">Swedish</td></tr><tr><td/><td>0.2</td><td>0.15</td><td>0.1</td><td>0.2</td><td>0.15</td><td>0.1</td><td>0.2</td><td>0.15</td><td>0.1</td><td>0.1</td><td>0.05</td></tr><tr><td>Baseline</td><td colspan=\"2\">0.287 0</td><td/><td/><td/><td/><td/><td/><td/><td/></tr></table>",
"text": ".312 0.332 0.512 0.481 0.419 0.302 0.272 0.240 0.134 0.141 + Permutation Tests 0.301 0.330 0.341 0.502 0.496 0.460 0.304 0.285 0.273 0.127 0.162 + False Discovery Rate 0.301 0.332 0.339 0.502 0.498 0.467 0.304 0.285 0.286 0.127 0.162",
"num": null,
"html": null,
"type_str": "table"
},
"TABREF5": {
"content": "<table/>",
"text": "Spearman correlations of cosine distance vs. semantic shift for the Liverpool FC corpus.",
"num": null,
"html": null,
"type_str": "table"
}
}
}
}