Geodesic
Formal grammar of Russian language in examples
Prikladnaâ diskretnaâ matematika, no. 2 (2018), pp. 114-126.

Voir la notice de l'article provenant de la source Math-Net.Ru

The possibility of a constructive theory creation for a natural language and of its morphology and syntax implementation on a computer by formalizing the appropriate rules is shown in the article. There are a few words in the lexicon of the example under consideration. The grammar of the Russian language is simplified. The morphology model is determined by the vocabulary and the rules of morphology which are stored in the word-morphological (morphological) dictionary. In the computer model of morphology, two algorithms are implemented: synthesis and analysis of word forms. The syntax model is defined by the morphology and syntax rules. Syntax rules generate word combinations used in the language. The rules of syntax are presented in the form of pairs (direct products) of lexical groups. A lexical group is a set of word forms that have the same morphological parameters. Phrases are defined in the lexicon of some graph which is a syntax. The concepts of syntax are defined in terms of graph theory. In particular, the concept of the sentence in a syntax is defined. Then, two problems are formulated: synthesis and analysis of the sentence. Algorithms for solution of them are described and implemented in the Delphi 7.0 programming environment.
Keywords: natural language, morphology, word form, morphology rules, syntax rules, the combinations of two words, the implementation of the algorithm on the computer, the computer model, graph, tree, analysis of the sentence.
Mots-clés : syntax 
@article{PDM_2018_2_a9,
     author = {Ya. M. Mirzabekov and Sh. B. Shihiev},
     title = {Formal grammar of {Russian} language in examples},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {114--126},
     publisher = {mathdoc},
     number = {2},
     year = {2018},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2018_2_a9/}
}
TY  - JOUR
AU  - Ya. M. Mirzabekov
AU  - Sh. B. Shihiev
TI  - Formal grammar of Russian language in examples
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2018
SP  - 114
EP  - 126
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2018_2_a9/
LA  - ru
ID  - PDM_2018_2_a9
ER  - 
%0 Journal Article
%A Ya. M. Mirzabekov
%A Sh. B. Shihiev
%T Formal grammar of Russian language in examples
%J Prikladnaâ diskretnaâ matematika
%D 2018
%P 114-126
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2018_2_a9/
%G ru
%F PDM_2018_2_a9
Ya. M. Mirzabekov; Sh. B. Shihiev. Formal grammar of Russian language in examples. Prikladnaâ diskretnaâ matematika, no. 2 (2018), pp. 114-126. http://geodesic.mathdoc.fr/item/PDM_2018_2_a9/

[1] Mel'chuk I. A., The Experience of the Theory of Linguistic Models “SENSE – TEXT”, Shkola “Yazyki russkoy kul'tury”, Moscow, 1999, 346 pp. (in Russian)

[2] Zaliznyak A. A., Russian Grammar Dictionary, Russkiy Yazyk Rubl., Moscow, 1977, 880 pp. (in Russian)

[3] Harary F., Graph Theory, Addison-Wesley Pub. Co., 1969, 274 pp. | MR | MR | Zbl

[4] Testelets Ya. G., Introduction to the Common Syntax, RSUH Publ., Moscow, 2001, 796 pp. (in Russian)

[5] Vinogradov V. V., Russian Grammar, USSR AS Publ., Moscow, 1960, 1864 pp. (in Russian)

[6] Shikhiev F. Sh., Formalization and Network Formulation of the Task of Parsing, PhD Thesis, SPBU, St. Petersburg, 2006, 171 pp. (in Russian)