Alexey Sorokin

According to our database1, Alexey Sorokin authored at least 20 papers between 2009 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
LowResourceEval-2019: a shared task on morphological analysis for low-resource languages.
CoRR, 2020

2018
What can we gain from language models for morphological inflection?
Proceedings of the CoNLL SIGMORPHON 2018 Shared Task: Universal Morphological Reinflection, Brussels, October 31, 2018


2017
Spelling Correction for Morphologically Rich Language: a Case Study of Russian.
Proceedings of the 6th Workshop on Balto-Slavic Natural Language Processing, 2017

2016
Using longest common subsequence and character models to predict word forms.
Proceedings of the 14th SIGMORPHON Workshop on Computational Research in Phonetics, 2016

Ogden Property for Linear Displacement Context-Free Grammars.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2016

2015
Normal forms for linear displacement context-free grammars.
CoRR, 2015

2014
Minimum vertex cover problem for coupled interdependent networks with cascading failures.
Eur. J. Oper. Res., 2014

Pumping lemma and Ogden lemma for tree-adjoining grammars.
CoRR, 2014

The Conjoinability Relation in Discontinuous Lambek Calculus.
Proceedings of the Formal Grammar - 19th International Conference, 2014

Pumping Lemma and Ogden Lemma for Displacement Context-Free Grammars.
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

Conjoinability in 1-Discontinuous Lambek Calculus.
Proceedings of the Categories and Types in Logic, Language, and Physics, 2014

2013
Topology design for on-demand dual-path routing in wireless networks.
Optimization Letters, 2013

Computational risk management techniques for fixed charge network flow problems with uncertain arc failures.
J. Comb. Optim., 2013

Normal Forms for Multiple Context-Free Languages and Displacement Lambek Grammars.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

On the Generative Power of Discontinuous Lambek Calculus.
Proceedings of the Formal Grammar, 2013

Monoid Automata for Displacement Context-Free Languages.
Proceedings of the Pristine Perspectives on Logic, Language, and Computation, 2013

Lower and Upper Bounds for the Length of Joins in the Lambek Calculus.
Proceedings of the Computer Science - Theory and Applications, 2013

2012
On the Completeness of Lambek Calculus with Respect to Cofinite Language Models.
Proceedings of the Logical Aspects of Computational Linguistics, 2012

2009
Mathematical Programming Techniques for Sensor Networks.
Algorithms, 2009


  Loading...