<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>Information Technology and Interactions, December</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>National Aviation University</institution>
          ,
          <addr-line>Liubomyra Huzara ave,1, Kyiv, 03058</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2020</year>
      </pub-date>
      <volume>0</volume>
      <fpage>2</fpage>
      <lpage>03</lpage>
      <abstract>
        <p>In this article had been analyzed actual software services, that can build relation's tree and make syntactical analysis. Each of them transforms primary text into the data structure with special features. But none of them can identify context units from the sentence of natural language. The author proposed to use components of logic and linguistic models for automatic generation of grammar colocations. Also author suggested the rules for context units identification for complex sentences of natural language. It had been demonstrated the outcome of using these rules. It is a program, that extract all collocations from different types of natural language sentences. Context units, identification, analysis, knowledge, syntactical parser, logic and linguistic</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>model.</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>
        All early efforts to extract knowledge from the textual information by difference scientists leads in
grammars by Homskiy and transformation grammars [
        <xref ref-type="bibr" rid="ref1 ref12">1, 12</xref>
        ]. Grammars of regularity do not come up
with collocations like analysis ones. However, almost all linguistic theories describe linear sequence
of the sentence units by mean of hierarchic structure of gramma components [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>
        R. Shenk proposed an approach, that based on using equal concept constructions for identity
sentences [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. It assumes emergency of elementary situations and making a great number of
templates.
      </p>
      <p>
        Inevitably, it was not effectively used method for knowledge representation. Ch. Filmor offered
the system of semantic roles, reflected logical structure, not only grammar. Semantic relations in this
case are between context of the verb and context of noun group [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ].
      </p>
      <p>Nowadays many creators of analytical systems use APIs, that make the process of syntactical
analysis easier. After syntactical parsing primary text transformed into the data structure for future
processing.It had been analyzed some of these syntactical parsers.</p>
      <p>
        The results of on-line transformer progaonline.com [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] work reflects on Figure 1.
      </p>
      <p>
        System Aot.tu [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] transforms Russian and Germany sentences into relation’s tree (Figure 2).
      </p>
      <p>2020 Copyright for this paper by its authors.</p>
      <p>
        Demo version of abroad open online parser erg.delph-in [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] builds a relation’s tree for simple
sentence according to the Filmor’s scheme: each world in the sentence relate to the verb “love”
(Figure 3).
      </p>
      <p>
        The results of syntactical analysis by Link Grammar [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] for the same sentence are on Figure 4.
As we can see, there are no open parsers for Ukrainian language. Parsers appropriate for transforming
only Russian or English language. The results of transforming the same sentences are different for all
testing parsers. Not surprisingly, traditional ways of analysis by key parameters and standard answers
are not possible to analyze natural language text at all and are not helpful for context analysis [
        <xref ref-type="bibr" rid="ref4 ref5">4–5</xref>
        ].
      </p>
      <p>Today the main aim of natural language researches is automatic creation of context data structures
for formalization of logical links by mean of particular algebraic construction. From the other hand,
these researches give practical value for automatic analysis and synthesis of natural language texts by
computer technologies.</p>
      <p>The article is the result of the author’s research in the text linguistics and formal semantics,
combined with mathematical apparatus of first order predicate logic.</p>
    </sec>
    <sec id="sec-3">
      <title>2. Materials and Methods</title>
      <p>
        The most popular automatic operations for concept processing of text are searching, word’s
definition, abstracting and translation. All these types suppose searching and detection some regular
expressions or textual fragments, that fulfilled some conditions. For instance, such type of detection is
possible for recognizing telephone numbers, addresses and template’s elements. Is this case,
definition is realized by means of symbol comparison. The second treatment of textual fragments
searching and detection is based on previously created database of indexes. For example, there are
many bases with informal fragments, special thesauruses [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Despite almost a century of research in
artificial intelligence, context units identification still can not be realized in correct form for complex
sentences.
      </p>
      <p>
        One of the most essential thing for all systems that woks with natural languages must be using the
process of grammatical analysis [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. Grammar is a set of rules expressed relations between the
members of a sentence.
      </p>
      <p>
        F. George [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] proposed the scheme on Figure 5 for interpretation the simple sentence “Jack hit
the ball”.
      </p>
      <p>The variables N, V, NP, VP, A, Adj, AP, AdjP on the scheme are used for designation of noun,
verb, group of subject, group of predicate, adjective, participle, group of participle and group of
adjective and ect.</p>
      <p>For more complex sentence “The large black dog fiercely chased the small boy away from the
house” F. Jorge proposed the scheme on the Figure 6 and the syntactical graph on the Figure 7.</p>
      <p>
        We can see different representation of the same content and any rules for that. As the author said,
the number of variables can be increase. For instance, composite sentence “The fine silver veil
fluttered from the shoulders of the dancer as if a summer breeze were blowing the shadow of clouds
away from the white town, and came to rest on the dark ground” [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] will be represented as
syntactical graph on Figure 8.
      </p>
      <p>
        So the question “how to formalize textual fragments with a set of complex, logically connected
sentences”, come up and must be responded. Almost all methods of automatic analysis of natural
language texts divide sentences on group of words according to the words’ places, not according to
the context. As distinct from these procedures of natural language sentence dividing, logic and
linguistic modelling based on idea of collocations identification or finding context units. There is a
full correspondence between grammar structure and logic form of natural language sentence of
natural language sentence [
        <xref ref-type="bibr" rid="ref6 ref7">6–7</xref>
        ].
      </p>
      <p>
        Considering grammar organization of the sentences, we have such graduation of sentences’
members [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]:
– subject of the sentence – subject x ;
– predicate of the sentence – relation p ;
– object of the sentence – object y or subject-matter of relation z ;
– definition – characteristic of subject g , characteristic of object q or characteristic of
subjectmatter of relation r ;
      </p>
      <p>– circumstance – characteristic of relation h .</p>
      <p>A set of words connected between each other by logic links, will be lettered sp j , j  1, m , where
m – amount of the collocations in the sentence.</p>
      <p>
        According to the Ukrainian and English language rules, collocations can be formed between those
members of sentence [
        <xref ref-type="bibr" rid="ref16 ref9">9, 16</xref>
        ]:
– “definition – subject” – sp j  g  x ;
– “predicate – object” – sp j  p  y ;
– “definition – object” – sp j  q  y ;
– “object – object” – sp j  y  z ;
– “object – object” – sp j  r  z ;
– “circumstance – predicate” – sp j  h  p .
      </p>
      <p>For instance, we need to detect collocations in the simple sentence “Математичне моделювання
часто використовують у навчальному процесі”. Firstly, roles for each world in the sentence are
identified:
– subject of the sentence – subject x – 0;
– predicate of the sentence – relation p – використовують;
– object of the sentence – object y – моделювання;
– object of the sentence – subject-matter of relation z – процесі;
– definition – characteristic of subject g – 0;
– definition – characteristic of object q – математичне;
– definition – characteristic of subject-matter of relation r – навчальних;
– circumstance – characteristic of relation h – часто.</p>
      <p>
        Thus, there are next collocations in this sentence [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]:
– “definition – object” – sp j  q  y – математичне моделювання;
– “object – object” – sp j  y  z – процесі моделювання;
– “definition – object” – sp j  r  z – навчальному процесі;
– “circumstance – predicate” – sp j  h  p – часто використовують.
      </p>
      <p>Collocations for the similar English sentence “Mathematical modelling often used in educational
process”:
– “predicate – object” – sp j  p  y – used modelling;
– “definition – object” – sp j  q  y – mathematical modelling;
– “object – object” – sp j  y  z – modelling process;
– “definition – object” – sp j  r  z – educational process;
– “circumstance – predicate” – sp j  h  p – often used.</p>
      <p>Every world in the sentence S i ( i  1, n , n – the amount of words in the sentence) can be
represented by the set of characteristics:</p>
      <p>Zi (Si )  {cmi , gi , ni , k 2i , ti , hi , li , chi } ,
where cmi  1,11 – grammar characteristic, that means a part of speech, each number is
responsible for one part of speech: noun – 1, adjective – 2, numeral – 3, pronoun – 4, verb –5,
participle I – 6, participle II – 7, adverb – 8, preposition – 9, union –10 or particle – 11;
gi  1,7 – morphologic characteristic, that is responsible for case;
ni  1,2 – grammar parameter, which means the number;
k2i  1,4 – grammar parameter, which means the genus;
ti  0,3 – grammar parameter, which means the time;
hi  1,3 – grammar parameter, which means the mode;
li  1,3 – grammar parameter, which means the person;
chi  1,5 – parameter, that is responsible for syntactical role (subject, predicate, object, definition
and circumstance).</p>
      <p>So, all characteristics of the world can be represented as unidimensional massif.</p>
      <p>The author formulated special rules for identification context units according to the rules for
creating different collocations in flexional natural languages, examples of what were depicted above.
It was developed 32 rules with additions for punctuation symbols in complex sentences and for
considering homogeneous parts of the sentence.</p>
      <p>The most applicable twelve rules are represented below.
1. If the first world is adjective, numeral, pronoun or participle and the part of speech for second
word is noun, their characteristics of case, number and genus are similar, the words are made
collocation. For example, “mathematical modelling”, “computer modelling”, “three pets”, “her
name”, “designed room”.</p>
      <p>if (cm(Si )  2) and (cm(Si1)  1)and g(Si )  g(Si1)
and n(Si )  n(Si1)and k 2(Si )  k 2(Si1)
thenS j  Si  Si1 
.
2. If the first world is noun and second word is noun of personal name too, their characteristics of
case and number are similar, the words are made collocation. For example, “Dnipro river”.
if (cm(Si )  1) and (cm(Si1 )  1)and g(Si )  g(Si1 )
and n(Si )  n(Si1 ) thenS j  Si  Si1 
.
3. If the first world is verb and the second word is noun in genitive case, the words are made
collocation. For instance, “read book”.
4. If the first world is verb, second word is preposition and third word is noun in subjective case
the words first and third are made collocation. For example, “created for children”.
if (cm(Si )  5) and (cm(Si1 )  9) and (cm(Si2 )  1)and
g(Si2 )  1then S j  Si  Si1  Si2 
.
5. If the first world is verb and second word is pronoun not in subjective case, the words are made
collocation. For instance, “integrated scheme”.</p>
      <p>if (cm(Si )  1) and (cm(Si1 )  1)and g(Si )  g(Si1 )
and n(Si )  n(Si1 ) thenS j  Si  Si1 
8. If the first world is noun, the second word is preposition and the third word is noun in
genitive case, their characteristics of degree and number are similar, the words first and third are
made collocation. For example, “book children”.</p>
      <p>if (cm(Si )  1) and (cm(Si1)  9) and (cm(Si2 )  1)and
(g(Si2 )  2)  (g(Si2 )  4) g(Si2 )  1
thenS j  Si  Si1  Si2 
.
9. If the first world is noun and second word is verb infinitive, the words are made collocation.
For example, “indicate person”.</p>
      <p>if (cm(Si )  1) and (cm(Si1 )  5)and h(Si1 )  0
thenS j  Si  Si1 
.
10. If the first world is participle I and second word is adverb, the words are made collocation. For
example, “quickly integrated ”.</p>
      <p>if (cm(Si )  6) and (cm(Si1 )  8)
thenS j  Si  Si1 
.
11. If the first world is numeral, second word is preposition and third word is pronoun in genitive
case, the words first and third are made collocation. For example, “three us”.</p>
      <p>if (cm(Si )  3) and (cm(Si1)  9) and (cm(Si2 )  4)and
12.If the first world is numeral, second word is preposition and third word is pronoun in genitive
case, the words first and third are made collocation.</p>
      <p>For example, “three us”.</p>
      <p>if (cm(Si )  3) and (cm(Si1)  9) and (cm(Si2 )  4)and
(g(Si2 )  2)  (g(Si2 )  4) g(Si2 )  1
thenS j  Si  Si1  Si2 
(g(Si2 )  2)  (g(Si2 )  4) g(Si2 )  1
thenS j  Si  Si1  Si2 </p>
      <p>Created rules give us opportunity for context units identification, in spite of the words’ order in
natural language sentence.</p>
    </sec>
    <sec id="sec-4">
      <title>3. Experiment</title>
      <p>Using developed rules and according finding regularity it had been possible to create a system for
context units identification. This system is based on usage of thesaurus. It is a tables of different
grammar forms of words, where every column is responsible for particular grammar characteristics.
On the Figure 9 we can see the table for adjective.</p>
      <p>
        For the complex Ukrainian language sentence [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]:
“Шляхом зведення до двох різних типів систем сингулярних інтегральних рівнянь
проведено чисельне дослідження задачі математичної фізики про дію стаціонарних хвиль
плоскої деформації на нерухоме включення з довільним контуром, що інтегрований у
нескінчене ізотропне середовище”
the system creates such context units (Figure 10).
      </p>
      <p>
        It was made research for detection limitations and lacks of the system. For instance, identification
of context units for natural language sentences, that consist unknown for database worlds or
mathematical values, are not completely correct. This fact is demonstrated on Figure 11 [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. On
Figure 11 we see the words “Мак-Еліса” and incorrect word “ширфованих”. The system did not
recognize these words, and there are no collocations with them. So it is needed additional conditions
for detection and correction mistakes in words of the natural language sentences.
      </p>
    </sec>
    <sec id="sec-5">
      <title>4. Conclusions</title>
      <p>In grammatical terms, the connectivity of text is determined by the harmonization laws, rules of
statement construction using morphological and syntactic means of language. In pragmatic terms,
connectivity is induced by the general communicative function of the text, it is realized in subjective
text organization, the system of spatial and temporal characteristics that permeate the text from
beginning to end.</p>
      <p>For this reason, it is essential to use special grammar, syntactical and semantic formal rules for
context units identification.</p>
      <p>Proposed in this article rules solve a problem of automatic identification of context collocations
into the natural language sentence. For automatic generation of those colocations author suggested to
use components of logic and linguistic models.</p>
      <p>This task plays a significant part in linguistic analysis of electronic textual documents. So far as
the main step in algorithm of construction of meaningful model of text is a synthesis of logic and
linguistic models, based on rules of construction and searching for elementary relations.</p>
      <p>The above relations have identical content and conclusively interpret natural language sentences of
an arbitrary structure. Logic and linguistic model of text document is a kind of pattern, which an
arbitrary text document can be reduced to. Such models can be intellectual tool for searching
information, word’s definition, abstracting and translation.</p>
    </sec>
    <sec id="sec-6">
      <title>5. References</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>V.</given-names>
            <surname>Evans</surname>
          </string-name>
          ,
          <article-title>Lexical concepts, cognitive models and meaning-construction, in: Cognitive Linguistics</article-title>
          , Edinburg university press Publ. Vol.
          <volume>17</volume>
          ,
          <year>2006</year>
          , pp.
          <fpage>73</fpage>
          -
          <lpage>107</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>W.</given-names>
            <surname>Che</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y. Zhang,</surname>
          </string-name>
          <article-title>Deep learning in lexical analysis</article-title>
          and parsing, Springer Nature Singapure Pte Ltd.,
          <source>ch.4</source>
          , in: Deep learning in
          <source>Natural Language Processing</source>
          ,
          <year>2018</year>
          . http:// doi.org/10.1007/
          <fpage>978</fpage>
          - 981-10-5209-
          <issue>5</issue>
          _
          <fpage>4</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wilks</surname>
          </string-name>
          ,
          <article-title>An Intelligent Analyzer and Understander of English, in: Communications of the ACM</article-title>
          , Vol.
          <volume>18</volume>
          (
          <issue>5</issue>
          ),
          <year>1975</year>
          , pp.
          <fpage>264</fpage>
          -
          <lpage>274</lpage>
          . https://doi.org/10.1145/360762.360770.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zhang Discriminative</surname>
          </string-name>
          syntax
          <article-title>-based word ordering for text generation</article-title>
          ,
          <source>in: Computational linguistics</source>
          , Vol.
          <volume>41</volume>
          ,
          <year>2015</year>
          , pp.
          <fpage>503</fpage>
          -
          <lpage>538</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          ,
          <article-title>A fast and accurate dependency parser using neural networks</article-title>
          ,
          <source>in: proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)</source>
          ,
          <year>2014</year>
          , pp.
          <fpage>740</fpage>
          -
          <lpage>750</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A.</given-names>
            <surname>Vavilenkova</surname>
          </string-name>
          ,
          <article-title>Basic principles of the synthesis of logical-linguistic models, in: Cybernetics and systems analysis</article-title>
          , Vol.
          <volume>51</volume>
          (
          <issue>5</issue>
          ),
          <year>2015</year>
          , pp.
          <fpage>826</fpage>
          -
          <lpage>834</lpage>
          , http:// doi.org/10.1007/s10559-015-9776-z.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Freitas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.C.</given-names>
            <surname>Pereira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Curry</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Buitelaar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A Distributional</given-names>
            <surname>Semantic</surname>
          </string-name>
          <article-title>Approach for selective Reasoninig on Commonsense Graph Knowledge bases</article-title>
          ,
          <source>in: proceedings of the 19th International Conference on Applications of Natural Language to Information Systems, NLDB</source>
          ,
          <year>2014</year>
          , Montpellier, France, pp.
          <fpage>21</fpage>
          -
          <lpage>32</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>A.</given-names>
            <surname>Vavilenkova</surname>
          </string-name>
          ,
          <article-title>Modelling of the context links between the natural language sentences</article-title>
          ,
          <source>in: Proceedings of the 9th International Scientific and Practical Conference "Information Control Systems &amp; Technologies" (ICST2020)</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>282</fpage>
          -
          <lpage>293</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J. H.</given-names>
            <surname>Martin</surname>
          </string-name>
          <article-title>A corpus-based analysis of context effects on metaphor comprehension</article-title>
          , in: CorpusBased Approaches to Metaphor and Metonymy, Berlin,
          <year>2006</year>
          , pp.
          <fpage>214</fpage>
          -
          <lpage>236</lpage>
          , https://doi.org/10.1515/ 9783110199895.214.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>B.E.</given-names>
            <surname>Panchenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.D.</given-names>
            <surname>Kovalev</surname>
          </string-name>
          and
          <string-name>
            <given-names>I.N.</given-names>
            <surname>Saiko</surname>
          </string-name>
          ,
          <article-title>Numerical Analysis of Systems of Singular Integral Equations of the First Kind with an Indefinable Index in the Problem of Diffraction of Plane Waves on a Rigid Inclusion, in: Cybernetics and System Analysis</article-title>
          , Vol.
          <volume>56</volume>
          ,
          <year>2020</year>
          , pp.
          <fpage>521</fpage>
          -
          <lpage>533</lpage>
          . https://doi.org/10.1007/s10559-020-00268-z.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>S.V.</given-names>
            <surname>Mitin</surname>
          </string-name>
          ,
          <article-title>Amount of Key Information Contained in Plain and Encrypted Text Sets of the Symmetric Randomized McEliece Cryptosystem</article-title>
          ,
          <source>in: Cybernetics and System Analysis</source>
          , Vol.
          <volume>56</volume>
          ,
          <year>2020</year>
          , pp.
          <fpage>726</fpage>
          -
          <lpage>730</lpage>
          . https://doi.org/10.1007/s10559-020-00288-9
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>F. H. George</surname>
          </string-name>
          <article-title>The foundations of cybernetics, Gordon and breach science publishers Ltd</article-title>
          ., U.K.,
          <year>1977</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Stefan</given-names>
            <surname>Th. Gries</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Stefanovich (eds.), Corpora in Cognitive Linguistics.
          <article-title>Corpus-Based Approaches to Syntax and Lexis</article-title>
          , in: Trends in Linguistics, Berlin/New York, Mouton de Gruyter,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>N.</given-names>
            <surname>Lukashevich</surname>
          </string-name>
          ,
          <article-title>Thezauruses into the tasks of information searching</article-title>
          , SPB, Published by Vilyams,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>A.</given-names>
            <surname>Bashmakov</surname>
          </string-name>
          , I. Bashmakov Intellectual information technologies, M.,
          <string-name>
            <given-names>MGTU</given-names>
            <surname>Publish</surname>
          </string-name>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>M.</given-names>
            <surname>Plusch</surname>
          </string-name>
          ,
          <string-name>
            <surname>N.</surname>
          </string-name>
          <article-title>Grupas Ukrainian language</article-title>
          , Kiyv, Published by Radyanska school,
          <year>1990</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>A.</given-names>
            <surname>Vavilenkova</surname>
          </string-name>
          ,
          <article-title>Analysis and synthesis of logic and linguistic models</article-title>
          , TOV “SIK GROUP Ukraine”,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Progaonline</surname>
          </string-name>
          .com,
          <year>2020</year>
          , URL: https://progaonline.com/syntax/result/ cc86fc72309e0d21c2590c073df987d3.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          <source>[19] Automatic text processing</source>
          ,
          <year>2020</year>
          , URL: http://aot.ru/.
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Erg.</surname>
          </string-name>
          delpfi-in,
          <year>2020</year>
          , URL: http://erg.delph-in.net/logon.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>Link</given-names>
            <surname>Grammar</surname>
          </string-name>
          ,
          <year>2020</year>
          , URL: http://www.link.cs.cmu.edu/link.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>