Human and Machine Judgements for Russian Semantic Relatedness

08/31/2017 ∙ by Alexander Panchenko, et al. ∙ University of Wolverhampton Università di Trento Mail.Ru Group Ural Federal University 0

Semantic relatedness of terms represents similarity of meaning by a numerical score. On the one hand, humans easily make judgments about semantic relatedness. On the other hand, this kind of information is useful in language processing systems. While semantic relatedness has been extensively studied for English using numerous language resources, such as associative norms, human judgments, and datasets generated from lexical databases, no evaluation resources of this kind have been available for Russian to date. Our contribution addresses this problem. We present five language resources of different scale and purpose for Russian semantic relatedness, each being a list of triples (word_i, word_j, relatedness_ij). Four of them are designed for evaluation of systems for computing semantic relatedness, complementing each other in terms of the semantic relation type they represent. These benchmarks were used to organize a shared task on Russian semantic relatedness, which attracted 19 teams. We use one of the best approaches identified in this competition to generate the fifth high-coverage resource, the first open distributional thesaurus of Russian. Multiple evaluations of this thesaurus, including a large-scale crowdsourcing study involving native speakers, indicate its high accuracy.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

Semantic relatedness numerically quantifies the degree of semantic alikeness of two lexical units, such as words and multiword expressions. The relatedness score is high for pairs of words in a semantic relation (e.g., synonyms, hyponyms, free associations) and low for semantically unrelated pairs. Semantic relatedness and semantic similarity have been extensively studied in psychology and computational linguistics, see [1, 2, 3, 4] inter alia. While both concepts are vaguely defined, similarity is a more restricted notion than relatedness, e.g. ‘‘apple’’ and ‘‘tree’’ would be related but not similar. Semantically similar word pairs are usually synonyms or hypernyms, while relatedness also can also refer to meronyms, co-hyponyms, associations and other types of relations. Semantic relatedness is an important building block of NLP techniques, such as text similarity [5, 6], word sense disambiguation [7], query expansion [8] and some others [9].

While semantic relatedness was extensively studied in the context of the English language, NLP researchers working with Russian language could not conduct such studies due to the lack of publicly available relatedness resources. The datasets presented in this paper are meant to fill this gap. Each of them is a collection of weighted word pairs in the format , e.g. . Here, the is the source word, is the destination word and is the semantic relatedness score (see Table 1).

More specifically, we present (1) four resources for evaluation and training of semantic relatedness systems varying in size and relation type and (2) the first open distributional thesaurus for the Russian language (see Table 2). All datasets contain relations between single words.

The paper is organized as follows: Section 2 describes approaches to evaluation of semantic relatedness in English. Section 3 presents three datasets where semantic relatedness of word was established manually. The HJ dataset, further described in Section 3.1, is based on Human Judgements about semantic relatedness; the RuThes (RT) dataset is based on synonyms and hypernyms from a handcrafted thesaurus (see Section 3.2); the Associative Experiment (AE) dataset, introduced in Section 3.3, represents cognitive associations between words. Section 4 describes datasets where semantic relatedness between words is established automatically: the Machine Judgements (MJ) dataset, presented in Section 4.1, is based on a combination of submissions from a shared task on Russian semantic similarity; Section 4.2 describes the construction and evaluation of the Russian Distributional Thesaurus (RDT).

Source Word, Destination Word, Semantic Relatedness,
книга (book) книжка (book, little book)
книга (book) книжечка (little book)
книга (book) сборник (proceedings)
книга (book) монография (monograph)
книга (book) том (volume)
книга (book) трест (trust as organization)
книга (book) одобрение (approval)
книга (book) киль (keel)
книга (book) Марокко (Marocco)
книга (book) Уругвай (Uruguay)
Table 1: Example of semantic relations from the datasets described in this paper: the five most and least similar terms to the word ‘‘книга’’ (book) in the MJ dataset
Dataset HJ RT AE MJ RDT
# relations | * | *
# source words, | * | *
# destination words, | * | *
types of relations relatedness

synonyms,

hypernyms

associations relatedness relatedness
similarity score, from 0 to 1 0 or 1 0 or 1 from 0 to 1 from 0 to 1
part of speech nouns nouns nouns nouns any
Table 2: Language resources presented in this paper. The pipe () separates the sizes of two dataset versions: one with manual filtering of negative examples and the other version, marked by an asterix (*), where negative relations were generated automatically, i.e. without manual filtering

2 Related Work

There are three main approaches to evaluating semantic relatedness: using human judgements about word pairs, using semantic relations from lexical-semantic resources, such as WordNet [10], and using data from cognitive word association experiments. We built three evaluation datasets for Russian each based on one of these principles to enable a comprehensive comparison of relatedness models.

2.1 Datasets Based on Human Judgements about Word Pairs

Word pairs labeled manually on a categorical scale by human subjects is the basis of this group of benchmarks. High scores of subjects indicate that words are semantically related, low scores indicate that they are unrelated. The HJ dataset presented in Section 3.1 belongs to this group of evaluation datasets.

Research on relatedness starts from the pioneering work of Rubenstein and Goodenough [11], where they aggregated human judgments on the relatedness of noun pairs into the RG dataset. 51 human subjects rated the pairs on a scale from to according to their similarity. Later, Miller and Charles [12] replicated the experiment of Rubenstein and Goodenough, obtaining similar results on a subset of noun pairs. They used words from the high level (between and ), from the intermediate level (between and ), and from the low level ( to ) of semantic relatedness, and then obtained similarity judgments from subjects, given the RG annotation guidelines, on those pairs. This dataset is known as the MC dataset.

A larger set of word pairs was put forward by Filkenstein et al. [13] as the WordSim353 dataset. The dataset contains word pairs, each associated with or human judgements. In this case, the subjects were asked to rate word pairs for relatedness, although many of the pairs also exemplify semantic similarity. That is why, Agirre et al. [14]

subdivided the WordSim353 dataset into two subsets: the WordSim353 similarity set and the WordSim353 relatedness set. The former set consists of word pairs classified as synonyms, antonyms, identical, or hyponym-hypernym and unrelated pairs. The relatedness set contains word pairs connected with other relations and unrelated pairs. The similarity set contains

pairs and the relatedness set includes pairs.

The three abovementioned datasets were created for English. There have been several attempts to translate those datasets into other languages. Gurevych translated the RG and MC datasets into German [15]; Hassan and Mihalcea translated them into Spanish, Arabic and Romanian [16]; Postma and Vossen [17] translated the datasets into Dutch; Jin and Wu [18] presented a shared task for Chinese semantic similarity, where the authors translated the WordSim353 dataset. Yang and Powers [19] proposed a dataset specifically for measuring verb similarity, which was later translated into German by Meyer and Gurevych [20].

Hassan and Mihalcea [16] and Postma and Vossen [17] used three stages to translation pairs: (1) disambiguation of the English word forms; (2) translation for each word; (3) ensuring that translations are in the same class of relative frequency as the English source word.

More recently, SimLex-999 was released by Hill et al. [21], focusing specifically on similarity and not relatedness. While most datasets are only available in English, SimLex-999 became a notable exception and has been translated into German, Russian and Italian. The Russian version of SimLex-999 is similar to the HJ dataset presented in our paper. In fact, these Russian datasets were created in parallel almost at the same time111The HJ dataset was first released in November 2014 and first published in June 2015, while the SimLex-999 was first published December 2015.. SimLex-999 contains 999 word pairs, which is considerably larger than the classical MC, RG and WordSim353 datasets.

The creators of the MEN dataset [22] went even further, annotating via crowdsourcing 3 000 word pairs sampled from the ukWaC corpus [23]. However, this dataset is also available only for English. A comprehensive list of datasets for evaluation of English semantic relatedness, featuring 12 collections, was gathered by Faruqui and Dyer [24]

. This set of benchmarks was used to build a web application for evaluation and visualization of word vectors.

222http://wordvectors.org/suite.php

2.2 Datasets Based on Lexical-Semantic Resources

Another group of evaluation datasets evaluates semantic relatedness scores with respect to relations described in lexical-semantic resources such as WordNet. The RT dataset presented in Section 3.2 belongs to this group of evaluation datasets.

Baroni and Lenci [25] stressed that semantically related words differ in the type of relation between them, so they generated the BLESS dataset containing tuples of the form . Types of relations included co-hyponyms, hypernyms, meronyms, attributes (relation between a noun and an adjective expressing its attribute), event (relation between a noun and a verb referring to actions or events). BLESS also contains, for each target word, a number of random words that were checked to be semantically unrelated to the this word. BLESS includes English concrete single-word nouns having reasonably high frequency that are not very polysemous. The destination words of the non-random relations are English nouns, verbs and adjectives selected and validated manually using several sources including WordNet, and collocations from the Wikipedia and the ukWaC corpora.

Van de Cruys [26] used Dutch WordNet to evaluate distributional similarity measures. His approach uses the structure of the lexical resource, whereby distributional similarity is compared to shortest-path-based distance. Biemann and Riedl [27] follow a similar approach based on the English WordNet to assess quality of their distributional semantics framework.

Finally, Sahlgren [28] evaluated distributional lexical similarity measures comparing them to manually-crafted thesauri, but also associative norms, such as those described in the following section.

2.3 Datasets Based on Human Word Association Experiments

The third strain of research evaluates the ability of current automated systems to simulate the results of human word association experiments. Evaluation tasks based on associative relations originally captured attention of psychologists, such as Griffiths and Steyvers [29]. One such task was organized in the framework of the Cogalex workshop [30]. The participants received lists of five words (e.g. ‘‘circus’’, ‘‘funny’’, ‘‘nose’’, ‘‘fool’’, and ‘‘Coco’’) and were supposed to select the word most closely associated to all of them. In this specific case, the word ‘‘clown’’ is the expected response. sets of five input words, together with the expected target words (associative responses) were provided as a training set to participants. The test dataset contained another sets of five input words. The training and the test datasets were both derived from the Edinburgh Associative Thesaurus (EAT) [31]. For each stimulus word, only the top five associations, i.e. the associations produced by the largest number of respondents, were retained, and all other associations were discarded. The AE dataset presented in Section 3.3 belongs to this group of evaluation datasets.

3 Human Judgements about Semantic Relatedness

In this section, we describe three datasets designed for evaluation of Russian semantic relatedness measures. The datasets were tested in the framework of the shared task on RUssian Semantic Similarity Evaluation (RUSSE) [32].333http://russe.nlpub.ru Each participant had to calculate similarities between a collection of word pairs. Then, each submission was assessed using the three benchmarks presented below, each being a subset of the input word pairs.

3.1 HJ: Human Judgements of Word Pairs

3.1.1 Description of the Dataset.

The HJ dataset is a union of three widely used benchmarks for English: RG, MC and WordSim353, see [33, 34, 35, 35, 36, 14] inter alia. The dataset contains 398 word pairs translated to Russian and re-annotated by native speakers. In addition to the complete dataset, we also provide separate parts that correspond to MC, RG and WordSim353.

To collect human judgements, an in-house crowdsourcing system was used. We set up a special section on the RUSSE website and asked volunteers on Facebook and Twitter to participate in the experiment. Each annotator received an assignment consisting of 15 word pairs randomly selected from the 398 pairs, and has been asked to assess the relatedness of each pair on the following scale: 0 – not related at all, 1 – weak relatedness, 2 – moderate relatedness, and 3 – high relatedness. We provided annotators with simple instructions explaining the procedure and goals of the study.444Annotation guidelines for the HJ dataset: http://russe.nlpub.ru/task/annotate.txt

A pair of words was added to the annotation task with the probability inversely proportional to the number of current annotations. We obtained a total of 4 200 answers, i.e. 280 submissions of 15 judgements. Ordinal Krippendorff’s alpha of

indicates a moderate agreement of annotators. The scores included in the HJ dataset are average human ratings scaled to the range.

3.1.2 Using the Dataset.

To evaluate a relatedness measure using this dataset one should (1) calculate relatedness scores for each pair in the dataset; (2) calculate Spearman’s rank correlation coefficient between the vector of human judgments and the scores of the system (see Table 4 for an example).

3.2 RT: Synonyms and Hypernyms

3.2.1 Description of the Dataset.

This dataset follows the structure of the BLESS dataset [25]. Each target word has the same number of related and unrelated source words. The dataset contains relations for nouns (see Table 2). Half of these relations are synonyms and hypernyms from the RuThes-lite thesaurus [37] and half of them are unrelated words. To generate negative pairs we used the automatic procedure described in Panchenko et al. [32]. We filtered out false negative relations for source words with the help of human annotators. Each negative relation in this subset was annotated by at least two annotators: Masters’ students of an NLP course, native speakers of Russian.

As the result, we provide a dataset featuring relations of 1 008 source words, where each source word has the same number of negative random relations and positive (synonymous or hypernymous) relations. In addition, we provide a larger dataset of relations for source words, where negative relations have not been verified manually.

3.2.2 Using the Dataset.

To evaluate a similarity measure using this dataset one should (1) calculate relatedness scores for each pair in the dataset; (2) first sort pairs by the score; and then (3) calculate the average precision metric:

where is the rank of each non-random pair, is the total number of non-random pairs, and is the precision of the top- pairs. See Table 4 and [32] for examples. Besides, the dataset can be used to train classification models for predicting hypernyms and synonyms using the binary scores.

3.3 AE: Cognitive Associations

3.3.1 Description of the Dataset.

The structure of this dataset is the same as the structure of the RT dataset: each source word has the same number of related and unrelated target words. The difference is that, related word pairs of this dataset were sampled from a Russian web-based associative experiment.555The associations were sampled from the sociation.org database in July 2014. In the experiment, users were asked to provide a reaction to an input stimulus source word, e.g.: man woman, time money, and so on. The strength of association in this experiment is quantified by the number of respondents providing the same stimulus-reaction pair. Associative thesauri typically contain a mix of synonyms, hyponyms, meronyms and other types, making relations asymmetric. To build this dataset, we selected target words with the highest association with the stimulus in Sociation.org data. Like with the other datasets, we used only single-word nouns. Similarly to the RT dataset, we automatically generated negative word pairs and filtered out false negatives with help of annotators.

As the result, we provide a dataset featuring relations of source words (see Table 2), where each source word has the same number of negative random relations and positive associative relations. In addition, we provide the larger dataset of relations for source words, where negative relations were not verified manually.

3.3.2 Using the Dataset.

Evaluation procedure using this dataset is the same as for the RT dataset: one should calculate the average precision . Besides, the dataset can be used to train classification models for predicting associative relations using the binary scores.

4 Machine Judgements about Semantic Relatedness

4.1 MJ: Machine Judgements of Word Pairs

4.1.1 Description of the Dataset.

This dataset contains word pairs of source words coming from HJ, RT, and AE datasets. Only word pairs from the HJ dataset have continuous scores, while the other pairs which come from the RT and the AE datasets have binary relatedness scores. However, for training and evaluation purposes it is desirable to have continuous relatedness scores as they distinguish between the shades of relatedness. Yet, manual annotation of a big number of pairs is problematic: the largest dataset of this kind available to date, the MEN, contains word pairs. Thus, unique feature of the MJ dataset is that it is at the same time large-scale, like BLESS, and has accurate continuous scores, like WordSim-353.

To estimate continuous relatedness scores with high confidence without any human judgements, we used

submissions of the shared task on Russian semantic similarity (RUSSE). We assumed that the top-scored systems can be used to bootstrap relatedness scores. Each run of the shared task consisted of word pairs along with their relatedness scores. We used the following procedure to average these scores and construct the dataset:

  1. Select one best submission for each of the participating teams for HJ, RT and AE datasets (total number of submissions is 105).

  2. Rank the best submissions according to their results in HJ, RT and AE: , where is the place in the respective track. The best system obtains the rank ; the worst one has the rank .

  3. Combine scores of these 19 best submissions as follows: , where is the similarity between words of the -th submission; is the weight of the -th submission. We considered three combination strategies each discounting differently teams with low ranks in the final evaluation. Thus the best teams impact more the combined score. In the first strategy, the weight is the rank . In the second strategy, the equals exponent of this rank: . Finally, in the third strategy, the weight equals to the square root of rank: . We tried to use and as weights, but this did not lead to better fit.

  4. Union pairs of HJ, RT and AE datasets into the MJ dataset. Table 1 presents example of the relatedness scores obtained using this procedure.

4.1.2 Evaluation of the Dataset.

Combination of the submissions using any of the three methods yields relatedness scores that outperforms all single submissions of the shared task (see Table 3). Note that ranks of the systems were obtained using the HJ, RT and AE datasets. Thus we can only claim that MJ provides continuous relatedness scores that fit well to the binary scores. Among the three weightings, using inverse ranks provides the top scores on the HJ and the AE datasets and the second best scores on the RT dataset. Thus, we selected this strategy to generate the released dataset.

4.1.3 Using the Dataset.

To evaluate a relatedness measure using the MJ dataset, one should (1) calculate relatedness scores for each pair in the dataset; (2) calculate Spearman’s rank correlation between the vector of machine judgments and the scores of the evaluated system. Besides, the dataset can be used to train regression models for predicting semantic relatedness using the continuous scores.

HJ, RT, AE,
The best RUSSE submissions for resp. datasets
MJ: is the rank
MJ: is the exponent of rank
MJ: is the sqrt of rank
Table 3: Performance of three combinations of submissions of the RUSSE shared task compared to the best scores for the HJ/RT/AE datasets across all submissions

4.2 RDT: Russian Distributional Thesaurus

While four resources presented above are accurate and represent different types of semantic relations, their coverage (222 – 1 519 source words) makes them best suited for evaluation and training purposes. In this section, we present a large-scale resource in the same format, the first open Russian distributional thesaurus. This resource, thanks to its coverage of target words can be directly used in NLP systems.

4.2.1 Description of the Dataset.

In order to build the distributional thesaurus, we used the Skip-gram model [38] trained on a 12.9 billion word collection of Russian texts extracted from the digital library lib.rus.ec. According to the results of the shared task on Russian semantic relatedness [32, 39], this approach scored in the top among submissions, obtaining different ranks depending on the evaluation dataset. At the same time, this method is completely unsupervised and language independent as we do not use any preprocessing except tokenization, in contrast to other top-ranked methods e.g. [40] who used extra linguistic resources, such as dictionaries.

Following our prior experiments [39], we selected the following parameters of the model: minimal word frequency – , number of dimensions in a word vector – , three or five iterations of the learning algorithm over the input corpus, context window size of , , , , and words. We calculated

nearest neighbours using the cosine similarity between word vectors for the 1.1 million of the most frequent tokens. Next we filtered all tokens with non-Cyrillic symbols which provided us a resource featuring

source words. In addition to the raw tokens we provide a lemmatized version based on the PyMorphy2 morphological analyzer [41]. We performed no part of speech filtering as it can be trivially performed if needed.

Figure 1 visualizes top 20 nearest neighbours of the word ‘‘физика’’ (physics) from the RDT. One can observe three groups of related words: morphological variants (e.g. ‘‘физике’’, ‘‘физику’’), physical terms, e.g. ‘‘квантовая’’ (quantum) and ‘‘термодинамика’’ (thermodynamics) and names of other scientific disciplines, e.g. ‘‘математика’’ (mathematics), ‘‘химия’’ (chemistry). Note that the thesaurus contains both raw tokens as displayed in Figure 1 and lemmatized neighbours.

An important added value of our work is engineering. While our approach is straightforward, training a large-scale Skip-gram model on a 12.9 billion tokens corpus with three iterations over a corpus takes up to five days on a r3.8xlarge Amazon EC2 instance featuring CPU cores and GB of RAM. Furthermore, computation of the neighbours takes up to a week for only one model using the large 500 dimensional vectors, not to mention the time needed to test different configurations of the model. Besides, to use the word embeddings directly, one needs to load more than seven millions of the 500 dimensional vectors, which is only possible on a similar instance to r3.8xlarge. On the other hand, the resulting RDT resource is a CSV file that can be easily indexed in an RDBMS system or an succinct in-memory data structure and subsequently efficiently used in most NLP systems. However, we also provide the original word vectors for non-standard use-cases.

4.2.2 Evaluation.

We evaluated the quality of the distributional thesaurus using the HJ, RT and AE datasets presented above. Furthermore, we estimated precision of extracted relations for words randomly sampled from the vocabulary of the HJ dataset. For each word we extracted the top similar words according to each model under evaluation resulting in unique word pairs. Each pair was annotated by three distinct annotators with a binary choice as opposed to a graded judgement, i.e. an annotator was supposed to indicate if a given word pair is plausibly related or not.666Annotation guidelines are available at http://crowd.russe.nlpub.ru. In this experiment, we used an open source crowdsourcing engine [42].777http://mtsar.nlpub.org Judgements were aggregated using a majority vote. In total, Russian-speaking volunteers participated in our crowdsourcing experiment with the substantial inter-rater agreement of in terms of Krippendorff’s alpha. The dataset obtained as a result of this crowdsourcing is publicly available (see download link below).

Figure 1: Visualization of the 20 most semantically related words to the word ‘‘физика’’ (physics) in the Russian Distributional Thesaurus in the form of a list (on the left) and an ego-network (on the right)

4.2.3 Discussion of the Results.

Evaluation of different configurations of the distributional thesaurus are presented in Table 4 and Figure 2. The model trained on the full 12.9 billion tokens corpus with context window size outperforms other models according to HJ, RT, AE and precision at 20 metrics. We used this model to generate the thesaurus presented in Table 2. However, the model trained on the 2.5 billion tokens sample of the full lib.rus.ec corpus (20% of the full corpus) yields very similar results in terms of precision. Yet, this model show slightly lower results according to other benchmarks. Models based on other context window sizes yield lower results as compared to these trained using the context window size 10 (see Figure 2).

Model #tok. HJ, RT, AE,
win10-iter3 B
win10-iter5 B
win5-iter3 B
win3-iter3 B
5-rt-3 [40] 0.763 0.923 0.975
9-ae-9 [32]
9-ae-6 [32]
17-rt-1 [32]
Table 4: Evaluation of different configurations of the Russian Distributional Thesaurus (RDT). The upper part of the table reports performance based on correlations with human judgements (HJ), semantic relations from a thesaurus (RT), cognitive associations (AE) and manual annotation of top 20 similar words assessed with precision at (). The lower part of the table reports result of the top 4 alternative approaches from the RUSSE shared task
Figure 2: Precision at top similar words of the RDT based on the Skip-gram model with dimensions evaluated using crowdsourcing. The plot shows dependence of the performance of size of the context window (window size ) and size of the training corpus ( and billions of tokens) and number of iterations during training ( or )

5 Conclusion

In this paper, we presented five new language resources for the Russian language, which can be used for training and evaluating semantic relatedness measures, and to create NLP applications requiring semantic relatedness. These resources were used to perform a large-scale evaluation of submissions in a shared task on Russian semantic relatedness. One of the best systems identified in this evaluation campaign was used to generate the first open Russian distributional thesaurus. Manual evaluation of this thesaurus, based on a large-scale crowdsourcing with native speakers, showed a precision of on the top similar words. All introduced resources are freely available for download.888http://russe.nlpub.ru/downloads Finally, the methodology for bootstrapping datasets for semantic relatedness presented in this paper can help to construct similar resources in other languages.

5.0.1 Acknowledgements.

We would like to acknowledge several funding organisations that partially supported this research. Dmitry Ustalov was supported by the Russian Foundation for Basic Research (RFBR) according to the research project no. 16-37-00354 мол_а. Denis Paperno was supported by the European Research Council (ERC) 2011 Starting Independent Research Grant no. 283554 (COMPOSES). Natalia Loukachevitch was supported by Russian Foundation for Humanities (RFH), grant no. 15-04-12017. Alexander Panchenko was supported by the Deutsche Forschungsgemeinschaft (DFG) under the project ‘‘Joining Ontologies and Semantics Induced from Text (JOIN-T)’’.

References

  • [1] Budanitsky, A., Hirst, G.: Evaluating WordNet-based Measures of Lexical Semantic Relatedness. Computational Linguistics 32(1) (2006) 13–47
  • [2] Pedersen, T., Pakhomov, S.V., Patwardhan, S., G. Chute, C.: Measures of semantic similarity and relatedness in the biomedical domain. Journal of Biomedical Informatics 40(3) (2007) 288–299
  • [3] Gabrilovich, E., Markovitch, S.: Computing Semantic Relatedness Using Wikipedia-based Explicit Semantic Analysis. In: Proceedings of the 20th International Joint Conference on Artifical Intelligence. IJCAI’07, Morgan Kaufmann Publishers Inc. (2007) 1606–1611
  • [4] Batet, M., Sánchez, D., Valls, A.: An ontology-based measure to compute semantic similarity in biomedicine. Journal of Biomedical Informatics 44(1) (2011) 118–125
  • [5] Bär, D., Biemann, C., Gurevych, I., Zesch, T.: UKP: Computing Semantic Textual Similarity by Combining Multiple Content Similarity Measures. In: Proceedings of the First Joint Conference on Lexical and Computational Semantics - Volume 1: Proceedings of the Main Conference and the Shared Task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation. SemEval ’12, Association for Computational Linguistics (2012) 435–440
  • [6] Tsatsaronis, G., Varlamis, I., Vazirgiannis, M.: Text Relatedness Based on a Word Thesaurus.

    Journal of Artificial Intelligence Research

    37(1) (2010) 1–40
  • [7] Patwardhan, S., Banerjee, S., Pedersen, T.: Using Measures of Semantic Relatedness for Word Sense Disambiguation. In: Proceedings of the 4th International Conference on Computational Linguistics and Intelligent Text Processing. Springer Berlin Heidelberg (2003) 241–257
  • [8] Hsu, M.H., Tsai, M.F., Chen, H.H.: Query Expansion with ConceptNet and WordNet: An Intrinsic Comparison. In: Information Retrieval Technology: Third Asia Information Retrieval Symposium, AIRS 2006, Singapore, October 16-18, 2006. Proceedings. Springer Berlin Heidelberg (2006) 1–13
  • [9] Panchenko, A.: Similarity Measures for Semantic Relation Extraction. PhD thesis, UCLouvain (2013)
  • [10] Miller, G.A.: WordNet: A Lexical Database for English. Communications of the ACM 38(11) (1995) 39–41
  • [11] Rubenstein, H., Goodenough, J.B.: Contextual correlates of synonymy. Communications of the ACM 8(10) (1965) 627–633
  • [12] Miller, G.A., Charles, W.G.: Contextual correlates of semantic similarity. Language and Cognitive Processes 6(1) (1991) 1–28
  • [13] Finkelstein, L., Gabrilovich, E., Matias, Y., Rivlin, E., Solan, Z., Wolfman, G., Ruppin, E.: Placing Search in Context: The Concept Revisited. In: Proceedings of the 10th International Conference on World Wide Web. WWW ’01, ACM (2001) 406–414
  • [14] Agirre, E., Alfonseca, E., Hall, K., Kravalova, J., Paşca, M., Soroa, A.: A Study on Similarity and Relatedness Using Distributional and WordNet-based Approaches. In: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics. NAACL ’09, Association for Computational Linguistics (2009) 19–27
  • [15] Gurevych, I.: Using the Structure of a Conceptual Network in Computing Semantic Relatedness.

    In: Natural Language Processing – IJCNLP 2005: Second International Joint Conference, Jeju Island, Korea, October 11-13, 2005. Proceedings. Springer Berlin Heidelberg (2005) 767–778

  • [16] Hassan, S., Mihalcea, R.: Cross-lingual Semantic Relatedness Using Encyclopedic Knowledge. In: Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 3 - Volume 3. EMNLP ’09, Association for Computational Linguistics (2009) 1192–1201
  • [17] Postma, M., Vossen, P.: What implementation and translation teach us: the case of semantic similarity measures in wordnets. In: Proceedings of the Seventh Global Wordnet Conference. (2014) 133–141
  • [18] Jin, P., Wu, Y.: Semeval-2012 task 4: Evaluating chinese word similarity. In: Proceedings of the First Joint Conference on Lexical and Computational Semantics - Volume 1: Proceedings of the Main Conference and the Shared Task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation. SemEval ’12, Association for Computational Linguistics (2012) 374–377
  • [19] Yang, D., Powers, D.M.W.: Verb Similarity on the Taxonomy of WordNet. In: Proceedings of the Third International WordNet Conference — GWC 2006, Masaryk University (2006) 121–128
  • [20] Meyer, C.M., Gurevych, I.: To Exhibit is not to Loiter: A Multilingual, Sense-Disambiguated Wiktionary for Measuring Verb Similarity. In: Proceedings of COLING 2012: Technical Papers, The COLING 2012 Organizing Committee (2012) 1763–1780
  • [21] Hill, F., Reichart, R., Korhonen, A.: SimLex-999: Evaluating Semantic Models With (Genuine) Similarity Estimation. Computational Linguistics 41(4) (2015) 665–695
  • [22] Bruni, E., Tran, N.K., Baroni, M.: Multimodal Distributional Semantics. Journal of Artificial Intelligence Research 49(1) (2014) 1–47
  • [23] Ferraresi, A., Zanchetta, E., Bernardini, S., Baroni, M.: Introducing and evaluating ukWaC, a very large Web-derived corpus of English. In: Proceedings of the 4th Web as Corpus Workshop (WAC-4): Can we beat Google? (2008) 47–54
  • [24] Faruqui, M., Dyer, C.: Community Evaluation and Exchange of Word Vectors at wordvectors.org. In: Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics: System Demonstrations, Association for Computational Linguistics (2014) 19–24
  • [25] Baroni, M., Lenci, A.: How We BLESSed Distributional Semantic Evaluation. In: Proceedings of the GEMS 2011 Workshop on GEometrical Models of Natural Language Semantics. GEMS ’11, Association for Computational Linguistics (2011) 1–10
  • [26] Van de Cruys, T.: Mining for Meaning: The Extraction of Lexicosemantic Knowledge from Text. PhD thesis, University of Groningen (2010)
  • [27] Biemann, C., Riedl, M.: Text: Now in 2D! a framework for lexical expansion with contextual similarity. Journal of Language Modelling 1(1) (2013) 55–95
  • [28] Sahlgren, M.: The Word-Space Model: Using distributional analysis to represent syntagmatic and paradigmatic relations between words in high-dimensional vector spaces. PhD thesis, Stockholm University (2006)
  • [29] Griffiths, T.L., Steyvers, M.: Prediction and Semantic Association. In: Advances in Neural Information Processing Systems 15. MIT Press (2003) 11–18
  • [30] Rapp, R., Zock, M.: The CogALex-IV Shared Task on the Lexical Access Problem.

    In: Proceedings of the 4th Workshop on Cognitive Aspects of the Lexicon (CogALex), Association for Computational Linguistics and Dublin City University (2014) 1–14

  • [31] Kiss, G.R., Armstrong, C., Milroy, R., Piper, J.: An associative thesaurus of English and its computer analysis. In: The Computer and Literary Studies. Edinburgh University Press (1973) 153–165
  • [32] Panchenko, A., Loukachevitch, N.V., Ustalov, D., Paperno, D., Meyer, C.M., Konstantinova, N.: RUSSE: The First Workshop on Russian Semantic Similarity. In: Computational Linguistics and Intellectual Technologies: papers from the Annual conference ‘‘Dialogue’’. Volume 2. RGGU (2015) 89–105
  • [33] Resnik, P.: Using Information Content to Evaluate Semantic Similarity in a Taxonomy. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence - Volume 1. IJCAI’95, Morgan Kaufmann Publishers Inc. (1995) 448–453
  • [34] Lin, D.: An Information-Theoretic Definition of Similarity.

    In: Proceedings of the Fifteenth International Conference on Machine Learning. ICML ’98, Morgan Kaufmann Publishers Inc. (1998) 296–304

  • [35] Patwardhan, S., Pedersen, T.: Using WordNet-based Context Vectors to Estimate the Semantic Relatedness of Concepts. In: Proceedings of the Workshop on Making Sense of Sense: Bringing Psycholinguistics and Computational Linguistics Together, Association for Computational Linguistics (2006) 1–8
  • [36] Zesch, T., Müller, C., Gurevych, I.: Using Wiktionary for Computing Semantic Relatedness. In: Proceedings of the 23rd National Conference on Artificial Intelligence - Volume 2. AAAI’08, AAAI Press (2008) 861–866
  • [37] Loukachevitch, N.V., Dobrov, B.V., Chetviorkin, I.I.: RuThes-Lite, a publicly available version of Thesaurus of Russian language RuThes. In: Computational Linguistics and Intellectual Technologies: papers from the Annual conference ‘‘Dialogue’’, RGGU (2014) 340–349
  • [38] Mikolov, T., Sutskever, I., Chen, K., Corrado, G.S., Dean, J.: Distributed Representations of Words and Phrases and their Compositionality. In: Advances in Neural Information Processing Systems 26. Curran Associates, Inc. (2013) 3111–3119
  • [39] Arefyev, N., Panchenko, A., Lukanin, A., Lesota, O., Romanov, P.: Evaluating Three Corpus-Based Semantic Similarity Systems for Russian. In: Computational Linguistics and Intellectual Technologies: papers from the Annual conference ‘‘Dialogue’’. Volume 2. RGGU (2015) 106–118
  • [40] Lopukhin, K.A., Lopukhina, A.A., Nosyrev, G.V.: The Impact of Different Vector Space Models and Supplementary Techniques on Russian Semantic Similarity Task. In: Computational Linguistics and Intellectual Technologies: Papers from the Annual conference ‘‘Dialogue’’. Volume 2. RGGU (2015) 115–127
  • [41] Korobov, M.: Morphological Analyzer and Generator for Russian and Ukrainian Languages. In: Analysis of Images, Social Networks and Texts: 4th International Conference, AIST 2015, Revised Selected Papers. Springer International Publishing (2015) 320–332
  • [42] Ustalov, D.: A Crowdsourcing Engine for Mechanized Labor. Proceedings of the Institute for System Programming 27(3) (2015) 351–364