activity
20142023
most citedBest Prompts for Text-to-Image Models and How to Find Them

65 citations · 292 across the 21 of their papers we have counts for

collaborators
Showing 2017Show all

6 papers · 1 filter

cs.CL2017★ 1 cited

Improving Hypernymy Extraction with Distributional Semantic Classes

Alexander Panchenko, Dmitry Ustalov, Stefano Faralli +2

In this paper, we show how distributionally-induced semantic classes can be helpful for extracting hypernyms. We present methods for inducing sense-aware semantic classes using dis…

cs.CL2017★ 41 cited

Human and Machine Judgements for Russian Semantic Relatedness

Alexander Panchenko, Dmitry Ustalov, Nikolay Arefyev +4

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, th…

cs.CL2017★ 2 cited

Fighting with the Sparsity of Synonymy Dictionaries

Dmitry Ustalov, Mikhail Chernoskutov, Chris Biemann +1

Graph-based synset induction methods, such as MaxMax and Watset, induce synsets by performing a global clustering of a synonymy graph. However, such methods are sensitive to the st…

cs.CL2017★ 5 cited

Unsupervised, Knowledge-Free, and Interpretable Word Sense Disambiguation

Alexander Panchenko, Fide Marten, Eugen Ruppert +4

Interpretability of a predictive model is a powerful feature that gains the trust of users in the correctness of the predictions. In word sense disambiguation (WSD), knowledge-base…

cs.CL2017★ 28 cited

Negative Sampling Improves Hypernymy Extraction Based on Projection Learning

Dmitry Ustalov, Nikolay Arefyev, Chris Biemann +1

We present a new approach to extraction of hypernyms based on projection learning and word embeddings. In contrast to classification-based approaches, projection-based methods requ…

cs.CL2017★ 34 cited

Watset: Automatic Induction of Synsets from a Graph of Synonyms

Dmitry Ustalov, Alexander Panchenko, Chris Biemann

This paper presents a new graph-based approach that induces synsets using synonymy dictionaries and word embeddings. First, we build a weighted graph of synonyms extracted from com…