arXiv subjects

T. M. Sadykov

Publications and source records attributed to T. M. Sadykov.

5 recordsLinked to original sources

arXiv2023

A big data approach towards sarcasm detection in Russian

We present a set of deterministic algorithms for Russian inflection and automated text synthesis. These algorithms are implemented in a publicly available web-service www.passare.ru. This service provides functions for inflection of single words, word matching and synthesis of grammatically correct Russian text. Selected code and datasets are available at https://github.com/passare-ru/PassareFunctions/ Performance of the inflectional functions has been tested against the annotated corpus of Russian language OpenCorpora, compared with that of other solutions, and used for estimating the morphological variability and complexity of different parts of speech in Russian.

cs.CL↗

arXiv2017

The Algorithmic Inflection of Russian and Generation of Grammatically Correct Text

We present a deterministic algorithm for Russian inflection. This algorithm is implemented in a publicly available web-service www.passare.ru which provides functions for inflection of single words, word matching and synthesis of grammatically correct Russian text. The inflectional functions have been tested against the annotated corpus of Russian language OpenCorpora.

cs.CL↗

arXiv2016

Hypergeometric polynomials are optimal

With any integer convex polytope $P\subset\midR^n$ we associate a multivariate hypergeometric polynomial whose set of exponents is $\midZ^{n}\cap P.$ This polynomial is defined uniquely up to a constant multiple and satisfies a holonomic system of partial differential equations of Horn's type. We prove that the zero locus of any such polynomial is optimal in the sense of Forsberg-Passare-Tsikh.

math.CV↗

arXiv2016

Algorithmic computation of polynomial amoebas

We present algorithms for computation and visualization of amoebas, their contours, compactified amoebas and sections of three-dimensional amoebas by two-dimensional planes. We also provide method and an algorithm for the computation of~polynomials whose amoebas exhibit the most complicated topology among all polynomials with a fixed Newton polytope. The presented algorithms are implemented in computer algebra systems Matlab 8 and Mathematica 9.

cs.CG↗

arXiv2010

Linear differential operators for generic algebraic curves

We give a computationally efficient method for constructing the linear differential operator with polynomial coefficients whose space of holomorphic solutions is spanned by all the branches of a function defined by a generic algebraic curve. The proposed method does not require solving the algebraic equation and can be applied in the case when its Galois group is not solvable.

math.CA↗