activity
20172023
most citedProbably approximately correct learning of Horn envelopes from queries

15 citations · 30 across the 5 of their papers we have counts for

collaborators

5 papers

cs.CL2023★ 1 cited

A Language Model for Grammatical Error Correction in L2 Russian

Nikita Remnev, Sergei Obiedkov, Ekaterina Rakhilina +2

Grammatical error correction is one of the fundamental tasks in Natural Language Processing. For the Russian language, most of the spellcheckers available correct typos and other s…

cs.SI2019★ 7 cited

Large-Scale Parallel Matching of Social Network Profiles

Alexander Panchenko, Dmitry Babaev, Sergei Obiedkov

A profile matching algorithm takes as input a user profile of one social network and returns, if existing, the profile of the same person in another social network. Such methods ha…

cs.AI2018★ 15 cited

Probably approximately correct learning of Horn envelopes from queries

Daniel Borchmann, Tom Hanika, Sergei Obiedkov

We propose an algorithm for learning the Horn envelope of an arbitrary domain using an expert, or an oracle, capable of answering certain types of queries about this domain. Attrib…

cs.CL2018

Neologisms on Facebook

Nikita Muravyev, Alexander Panchenko, Sergei Obiedkov

In this paper, we present a study of neologisms and loan words frequently occurring in Facebook user posts. We have analyzed a dataset of several million publically available posts…

cs.AI2017★ 7 cited

On the Usability of Probably Approximately Correct Implication Bases

Daniel Borchmann, Tom Hanika, Sergei Obiedkov

We revisit the notion of probably approximately correct implication bases from the literature and present a first formulation in the language of formal concept analysis, with the g…