Space-separated query words: ?One main thing: this is not a full-text word search. It is based on the principle of distributional semantics: having a query vector compiled from the query words, we use cosine distance to find the nearest texts in a bilingual vector space — this is how we search for papers that are close seamantically, regardless of the language and the presence of specific words. If you want to find papers that contain specific words in the title, use the metadata search below.

Show advanced filters

Conferences:

Years (since-till):

Paper author: ?In Latin script! You can use metasymbols * (to match 0 or more characters) and ? (to match 1 character)

Affiliation: ?In Latin script! You can use metasymbols * (to match 0 or more characters) and ? (to match 1 character)

Paper title: ?You can use metasymbols * (to match 0 or more characters) and ? (to match 1 character) to find titles with specific words

Number of results:


Papers by: Biemann Chris

Paper title Paper author Affiliation Conference Year Tasks
Fighting With The Sparsity Of Synonymy Dictionaries For Automatic Synset Induction url annotation Biemann Chris
Chernoskutov Mikhail
Panchenko A. I.
Ustalov D. A.
University of Hamburg, Germany
Krasovskii Institute of Mathematics and Mechanics, Yekaterinburg, Russia
Ural Federal University, Yekaterinburg, Russia
AIST 2017
Show tasks (experimental!) Морфологический анализ
Дистрибутивная семантика
Построение конкордансов
Human And Machine Judgements For Russian Semantic Relatedness url annotation Loukachevitch N. V.
Arefyev N. V.
Biemann Chris
Paperno Denis
Konstantinova Natalia
Panchenko A. I.
Ustalov D. A.
University of Wolverhampton, Wolverhampton, UK
Darmstadt University of Technology, Germany
University of Trento, Rovereto, Italy
Ural Federal University, Yekaterinburg, Russia
Lomonosov Moscow State University, Moscow, Russia
AIST 2016
Show tasks (experimental!) Морфологический анализ
Построение конкордансов
Дистрибутивная семантика

Creative Commons License
RusNLP by https://nlp.rusvectores.org is licensed under a
Creative Commons Attribution-ShareAlike 4.0 International License.