activity
20142026
most citedLowResourceEval-2019: a shared task on morphological analysis for low-resource languages

6 citations · 11 across the 6 of their papers we have counts for

collaborators

6 papers

cs.CL2026

CEFR-oriented Russian Text Simplification Using Reinforcement Learning

Kristina Mustakova, Alexey Sorokin

We present a study on controlled automatic simplification of Russian texts using preference-based optimization algorithms with a focus on adapting texts to the A1, A2 and B1 profic…

cs.LO2025

Properties of UTxO Ledgers and Programs Implemented on Them

Polina Vinogradova, Alexey Sorokin

Trace-based properties are the gold standard for program behaviour analysis. One of the domains of application of this type of analysis is cryptocurrency ledgers, both for the purp…

cs.CL2020★ 6 cited

LowResourceEval-2019: a shared task on morphological analysis for low-resource languages

Elena Klyachko, Alexey Sorokin, Natalia Krizhanovskaya +2

The paper describes the results of the first shared task on morphological analysis for the languages of Russia, namely, Evenki, Karelian, Selkup, and Veps. For the languages in que…

cs.FL2015★ 1 cited

Normal forms for linear displacement context-free grammars

Alexey Sorokin

In this paper we prove several results on normal forms for linear displacement context-free grammars. The results themselves are rather simple and use well-known techniques, but th…

cs.FL2014★ 2 cited

Monoid automata for displacement context-free languages

Alexey Sorokin

In 2007 Kambites presented an algebraic interpretation of Chomsky-Schutzenberger theorem for context-free languages. We give an interpretation of the corresponding theorem for the…

cs.FL2014★ 2 cited

Pumping lemma and Ogden lemma for displacement context-free grammars

Alexey Sorokin

The pumping lemma and Ogden lemma offer a powerful method to prove that a particular language is not context-free. In 2008 Kanazawa proved an analogue of pumping lemma for well-nes…