Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Prikl. Diskr. Mat., 2018, Number 40, Pages 114–126 (Mi pdm620)  

This article is cited in 1 scientific paper (total in 1 paper)

Discrete Models for Real Processes

Formal grammar of Russian language in examples

Ya. M. Mirzabekov, Sh. B. Shihiev

Dagestan State University, Makhachkala, Russia

Abstract: 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, syntax, 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.

DOI: https://doi.org/10.17223/20710410/40/10

Full text: PDF file (534 kB)
References: PDF file   HTML file

Bibliographic databases:

UDC: 519.17

Citation: Ya. M. Mirzabekov, Sh. B. Shihiev, “Formal grammar of Russian language in examples”, Prikl. Diskr. Mat., 2018, no. 40, 114–126

Citation in format AMSBIB
\Bibitem{MirShi18}
\by Ya.~M.~Mirzabekov, Sh.~B.~Shihiev
\paper Formal grammar of Russian language in examples
\jour Prikl. Diskr. Mat.
\yr 2018
\issue 40
\pages 114--126
\mathnet{http://mi.mathnet.ru/pdm620}
\crossref{https://doi.org/10.17223/20710410/40/10}
\elib{https://elibrary.ru/item.asp?id=35155729}


Linking options:
  • http://mi.mathnet.ru/eng/pdm620
  • http://mi.mathnet.ru/eng/pdm/y2018/i2/p114

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Sh. B. Shikhiev, F. Sh. Shikhiev, “Inkapsulyatsiya semanticheskikh predstavlenii v elementy grammatiki”, Inform. i ee primen., 14:1 (2020), 121–127  mathnet  crossref
  • Прикладная дискретная математика
    Number of views:
    This page:132
    Full text:46
    References:6

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021