default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexey Sorokin
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[e1]Michael Hahn, Alexey Sorokin, Ritesh Kumar, Andreas Scherbakov, Yulia Otmakhova, Jinrui Yang, Oleg Serikov, Priya Rani, Edoardo M. Ponti, Saliha Muradoglu, Rena Gao, Ryan Cotterell, Ekaterina Vylomova:
Proceedings of the 6th Workshop on Research in Computational Linguistic Typology and Multilingual NLP, SIGTYPE 2024, St. Julian's, Malta, March 22, 2024. Association for Computational Linguistics 2024, ISBN 979-8-89176-071-4 [contents]- 2022
- [c20]Alexey Sorokin:
Improved grammatical error correction by ranking elementary edits. EMNLP 2022: 11416-11429 - 2021
- [c19]Alexey Sorokin
:
Improving Morpheme Segmentation Using BERT Embeddings. AIST 2021: 148-161 - 2020
- [c18]Ulyana Isaeva, Alexey Sorokin:
Investigating the Robustness of Reading Difficulty Models for Russian Educational Texts. AIST (Supplement) 2020: 65-77 - [c17]Alexander Okhotin, Alexey Sorokin:
Cyclic Shift on Multi-component Grammars. LATA 2020: 287-299 - [c16]Arya D. McCarthy, Christo Kirov, Matteo Grella, Amrit Nidhi, Patrick Xia, Kyle Gorman, Ekaterina Vylomova, Sabrina J. Mielke, Garrett Nicolai, Miikka Silfverberg, Timofey Arkhangelskiy, Nataly Krizhanovsky, Andrew Krizhanovsky, Elena Klyachko, Alexey Sorokin, John Mansfield, Valts Ernstreits, Yuval Pinter, Cassandra L. Jacobs, Ryan Cotterell, Mans Hulden, David Yarowsky:
UniMorph 3.0: Universal Morphology. LREC 2020: 3922-3931 - [c15]Alexey Sorokin:
Getting More Data for Low-resource Morphological Inflection: Language Models and Data Augmentation. LREC 2020: 3978-3983 - [i4]Elena Klyachko, Alexey Sorokin, Natalia Krizhanovskaya, Andrew Krizhanovsky, Galina Ryazanskaya:
LowResourceEval-2019: a shared task on morphological analysis for low-resource languages. CoRR abs/2001.11285 (2020)
2010 – 2019
- 2019
- [c14]Mikhail Y. Arkhipov, Maria Trofimova, Yuri Kuratov, Alexey Sorokin:
Tuning Multilingual Transformers for Language-Specific Named Entity Recognition. BSNLP@ACL 2019: 89-93 - 2018
- [c13]Mikhail Burtsev, Alexander V. Seliverstov, Rafael Airapetyan, Mikhail Y. Arkhipov, Dilyara Baymurzina, Nickolay Bushkov, Olga Gureenkova, Taras Khakhulin, Yuri Kuratov, Denis Kuznetsov, Alexey Litinsky, Varvara Logacheva, Alexey Lymar, Valentin Malykh, Maxim Petrov, Vadim Polulyakh, Leonid Pugachev, Alexey Sorokin, Maria Vikhreva, Marat Zaynutdinov:
DeepPavlov: Open-Source Library for Dialogue Systems. ACL (4) 2018: 122-127 - [c12]Alexey Sorokin:
What can we gain from language models for morphological inflection? CoNLL Shared Task (1) 2018: 99-104 - 2017
- [c11]Alexey Sorokin:
Spelling Correction for Morphologically Rich Language: a Case Study of Russian. BSNLP@EACL 2017: 45-53 - 2016
- [c10]Alexey Sorokin:
Ogden Property for Linear Displacement Context-Free Grammars. LFCS 2016: 376-391 - [c9]Alexey Sorokin:
Using longest common subsequence and character models to predict word forms. SIGMORPHON 2016: 54-61 - 2015
- [i3]Alexey Sorokin:
Normal forms for linear displacement context-free grammars. CoRR abs/1507.08600 (2015) - 2014
- [j4]Alexander Veremyev, Alexey Sorokin, Vladimir Boginski, Eduardo L. Pasiliao:
Minimum vertex cover problem for coupled interdependent networks with cascading failures. Eur. J. Oper. Res. 232(3): 499-511 (2014) - [c8]Alexey Sorokin:
Conjoinability in 1-Discontinuous Lambek Calculus. Categories and Types in Logic, Language, and Physics 2014: 393-401 - [c7]Alexey Sorokin:
Pumping Lemma and Ogden Lemma for Displacement Context-Free Grammars. Developments in Language Theory 2014: 154-165 - [c6]Alexey Sorokin:
The Conjoinability Relation in Discontinuous Lambek Calculus. FG 2014: 171-184 - [i2]Alexey Sorokin:
Monoid automata for displacement context-free languages. CoRR abs/1403.6060 (2014) - [i1]Alexey Sorokin:
Pumping lemma and Ogden lemma for tree-adjoining grammars. CoRR abs/1403.6230 (2014) - 2013
- [j3]Alexey Sorokin, Vladimir Boginski, Artyom G. Nahapetyan, Panos M. Pardalos:
Computational risk management techniques for fixed charge network flow problems with uncertain arc failures. J. Comb. Optim. 25(1): 99-122 (2013) - [j2]Marco Carvalho, Alexey Sorokin, Vladimir Boginski, Balabhaskar Balasundaram:
Topology design for on-demand dual-path routing in wireless networks. Optim. Lett. 7(4): 695-707 (2013) - [c5]Alexey Sorokin:
Lower and Upper Bounds for the Length of Joins in the Lambek Calculus. CSR 2013: 150-161 - [c4]Alexey Sorokin:
Monoid Automata for Displacement Context-Free Languages. ESSLLI Student Sessions 2013: 154-173 - [c3]Alexey Sorokin:
On the Generative Power of Discontinuous Lambek Calculus. FG 2013: 250-262 - [c2]Alexey Sorokin:
Normal Forms for Multiple Context-Free Languages and Displacement Lambek Grammars. LFCS 2013: 319-334 - 2012
- [c1]Alexey Sorokin:
On the Completeness of Lambek Calculus with Respect to Cofinite Language Models. LACL 2012: 229-233
2000 – 2009
- 2009
- [j1]Alexey Sorokin, Nikita Boyko, Vladimir Boginski, Stan Uryasev, Panos M. Pardalos:
Mathematical Programming Techniques for Sensor Networks. Algorithms 2(1): 565-581 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
