<!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 />
    <article-meta>
      <title-group>
        <article-title>The Electronic Digests Formation and Categorization for Textual Commercial Content</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Lyubomyr</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Chyrun</string-name>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andrunyk</string-name>
          <email>vasyl.a.andrunyk@lpnu.ua</email>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Liliya</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Chyrun</string-name>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gozhyj</string-name>
          <email>alex.gozhyj@gmail.com</email>
          <xref ref-type="aff" rid="aff5">5</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anatolii</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vysotskyi</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oksana Tereshchuk</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Nadiya Shykh</string-name>
          <email>shykh.nadiya@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vadim Schuchmanng</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Anat Company</institution>
          ,
          <addr-line>Chervona Kalyna Avenue, 104, Lviv, 79049</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Drohobych Ivan Franko State Pedagogical University</institution>
          ,
          <addr-line>Ivan Franko Street, 24,Drohobych, 82100</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Hetman Petro Sahaidachnyi National Army Academy</institution>
          ,
          <addr-line>Heroes of Maidan Street, 32, Lviv, 79012</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Ivan Franko National University of Lviv</institution>
          ,
          <addr-line>University Street, 1, Lviv, 79000</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff4">
          <label>4</label>
          <institution>Lviv Polytechnic National University</institution>
          ,
          <addr-line>S. Bandera Street, 12, Lviv, 79013</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff5">
          <label>5</label>
          <institution>Petro Mohyla Black Sea National University</institution>
          ,
          <addr-line>Desantnykiv Street, 68, Mykolayiv, 54000</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This article proposes a practical and logistic method of content processing as a stage of the digests formation. The content processing method describes the digests formation and categorisation as one-step of content life cycle and simplifies the information technology of managing commercial textual content. The paper analyses the main problems of available services for processing commercial content. The proposed method allows you to create tools for processing information resources and implement subsystems for managing commercial content. Content, intelligent system, information technology, text mining, information flow, content monitoring, automated abstracting, thematic proximity, source text, latent semantic analysis, commercial content, text analysis, content analysis, internet environment, electronic digest, information retrieval, textual content, content search, text mining method, spatial vector model, information system, text data, modern machine learning technology COLINS-2021: 5th International Conference on Computational Linguistics and Intelligent Systems, April 22-23, 2021, Kharkiv, Ukraine ORCID: 0000-0002-9448-1751 (L. Chyrun); 0000-0003-0697-7384 (V. Andrunyk); 0000-0003-4040-7588 (L. Chyrun); 0000-0002-3517580X (A. Gozhyj); 0000-0001-9190-7051 (A. Vysotskyi); 0000-0002-6444-0609 (O. Tereshchuk); 0000-0003-0059-7137 (N. Shykh); 00000002-1427-3312 (V. Schuchmann)</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The solution to complex problems in any sphere of life requires information support. Meeting
information needs is a prerequisite for innovation. However, the difficulty of obtaining information
affects the efficiency and quality of decision-making. The Internet environment is a large-scale mass
media (mass media) in various information resource content [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4 ref5 ref6">1-7</xref>
        ]. However, the randomness of the
emergence and functioning of information resources, the lack of an apparent periodicity of most of them
being maintained and updated, and the existing shortcomings in the implementation of effective content
searches do not allow using the Internet environment as the complex media. It is customary to consider
individual network elements as full-fledged media. Network media is portals with a certain periodicity
of updating, electronic versions of printed periodicals, electronic newspapers, and magazines. The
Internet environment does not compete with traditional media in many respects. However, according to
some criteria, it has advantages due to its technical characteristics. The Internet environment
successfully serves as a source and means of distributing content [
        <xref ref-type="bibr" rid="ref10 ref11 ref12 ref13 ref14 ref15 ref7 ref8 ref9">8-16</xref>
        ].
anat1957@gmail.com
(A.
      </p>
      <p>Vysotskyi);</p>
      <p>2021 Copyright for this paper by its authors.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Related works</title>
      <p>
        A feature of the Internet environment is the constant growth in the production and distribution of
various types of content and an increase in its volume to the extent that it makes it impossible to process
it directly [1]. There are some specific problems associated with the rapid development of information
technology (IT). On the one hand, a robust information array as Internet resources for decision-making
in various spheres of life of the state, society and an individual or legal entity. On the other hand, there
is a lack of content necessary for decision-making through its dynamics, volumes, production rates,
sources and lack of structure [
        <xref ref-type="bibr" rid="ref16 ref17 ref18">17-19</xref>
        ]. The coverage/generalisation of extensive dynamic content
information flows continuously generating in the media requires qualitatively new approaches [
        <xref ref-type="bibr" rid="ref19 ref20 ref21 ref22 ref23">20-24</xref>
        ].
The situation of a sharp increase in the rate of commercial textual content and an increase in its volume
in the Internet environment led to several problems [
        <xref ref-type="bibr" rid="ref1 ref10 ref11 ref12 ref13 ref14 ref2 ref3 ref4 ref5 ref6 ref7">1-8, 11-15</xref>
        ]:
 A disproportionate increase in information noise due to poorly structured content;
 The appearance of spurious content (obtained as applications);
 Mismatch of formally relevant content (thematically appropriate) to the actual needs of its
consumers;
 Repeated duplication of content (for example, publication in various publications).
      </p>
      <p>
        The exponential increase in the rate of commercial textual content significantly reduces the
efficiency of data processing by traditional methods [
        <xref ref-type="bibr" rid="ref24 ref25 ref26 ref27 ref28 ref29 ref30 ref31 ref32 ref33">25-34</xref>
        ]. Essential data are duplicated many times
on information resources, which increases according to the exponential law. At the beginning of the
computer era, automated word processing programs are created that implemented fragmentation,
abstracting, annotation, indexing, and other forms of content analysis and synthesis. However, most
processes for creating annotations and automatic abstracting are inefficient; the need for scalable
methodologies and information systems (IS) remains [
        <xref ref-type="bibr" rid="ref34 ref35 ref36 ref37 ref38 ref39 ref40 ref41">35-42</xref>
        ]. There are many ways to solve the
problem through two directions: automated abstracting and a summary of the content of primary
documents. Automated abstracting based on the extraction of document fragments, selecting the most
informative phrases and then forming automated abstracting using them [
        <xref ref-type="bibr" rid="ref8">9</xref>
        ]. A summary of the source
material is based on selecting the most relevant information from the texts using artificial intelligence
methods and unique languages and new readers that summarise the primary documents. Using this
approach, you can get more instructions containing information that complements the source text
[4351]. Based on a formal presentation of the semantics of the source document, such systems are
configured for a high degree of compression, which is necessary, for example, for sending messages to
mobile devices. Therefore, the main difference between the abstracting tools is forming a set of excerpts
or a summary of the document. All existing intelligent systems of the Text mining class include digests
generation, which are integral module [
        <xref ref-type="bibr" rid="ref51 ref52 ref53 ref54 ref55 ref56 ref57 ref58">52-61</xref>
        ]. One of the basic procedures for integral systems of this
class (digests generation) is automated abstracting based on a large number of documents. For the
digest, papers are selected in which the trends of the entire input stream are most clearly reflected. Such
digests most closely correspond to the user’s information needs, at which this input information stream
is formed. Based on the abstract, which amounts to an insignificant part of the source text, users can
draw a reasonable conclusion about the primary document, having spent much less effort on this than
acquainting it [
        <xref ref-type="bibr" rid="ref7">8</xref>
        ]. When automated abstracting, the abstract should be 5-30% of the content source. The
preparation of annotations contents (digests) from several sources provides an even greater degree of
compression. Automated abstracting is reduced to extracting from contents the minimum relevant
fragments using analysis of surface-synthetic relations of lexical units in the text [
        <xref ref-type="bibr" rid="ref8 ref9">9-10</xref>
        ]. Automated
abstracting emphasises the selection of characteristic pieces by the phrasal matching method. As a
result, blocks of the most remarkable linguistic and statistical relevance are distinguished. Automatic
determination of the frequency of use of combinations and individual words in the source content allows
you to determine paragraphs and sentences in which the subject of the content is presented most
accurately. The creation of the resulting content is carried out by simply connecting the selected
fragments. The generated quasi-abstract is a readable text. The abstract quality depends on the processed
text genre. The content of a quasi-abstract depends on other features of the content source. Building a
high-quality abstract from fragments of the original document without considering semantic laws is
practically impossible for compelling content. The basis of the analytical stage of quasi-reference is the
procedure for calculating the weighting coefficients for each block of text following characteristics such
as the location of this block in the original, the frequency of occurrence in the text, the frequency of use
in key phrases, etc. [
        <xref ref-type="bibr" rid="ref19">20</xref>
        ].
      </p>
      <p>
        Text Mining is a set of text processing methods because new knowledge appears [
        <xref ref-type="bibr" rid="ref15">16</xref>
        ]. It is an
interdisciplinary field where the essential Data Mining technologies are used in combination with
techniques from other research areas such as Information Retrieval (IR), Information Extraction (IE),
mathematical linguistics, classification, clustering, and ontology creation [
        <xref ref-type="bibr" rid="ref16">17, 62-65</xref>
        ]. In each of these
areas, they solve their specific applied problems. Still, it is difficult to draw a clear line between Text
Mining and another field of research: they all deal with texts, so the general problems and approaches
to solving them intersect. The difference lies in the ultimate goal. For example, in IR, the goal is to find
documents that at least partially match the search query and, among those found, select those for which
the most complete has expired [
        <xref ref-type="bibr" rid="ref16">17, 66-75</xref>
        ]. In addition, Text Mining methods aimed at identifying
unknown facts and hidden relationships in the analysis of semantic, lexical and statistical features in
arrays of texts. However, the algorithms for this use the same. So IE differs from Text Mining. In this
area, we consider methods for extracting specific information, structured data, such as people’s names,
geographical names, book titles using predefined relationships [
        <xref ref-type="bibr" rid="ref17">18</xref>
        ]. It is not known which data can be
detected in Text Mining. Text Mining methods are effectively used when creating and populating
databases. Due to these circumstances, traditional retrieval IS are gradually losing relevance [1, 76-79].
The reason for this lies not so much in the physical volumes of content flows but in their dynamics, that
is, the constant systematic updating of content, far from always-obvious regularity. The coverage and
generalisation of large dynamic content flow continuously generated in the media require qualitatively
new approaches [
        <xref ref-type="bibr" rid="ref1 ref2">1-3</xref>
        ].
      </p>
      <p>
        Find the way out can only in automation tools for identifying the essential components in
information flows. In recent years, resource-monitoring systems have increasingly used. This promising
area is called content monitoring. Its appearance was due to the systematic tracking of trends and
processes in the information environment, which is constantly updated. Text monitoring is most often
understood as a meaningful analysis of content flows to obtain the necessary quantitative and qualitative
slices, which is carried out continuously for a period not determined in advance [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4 ref5 ref6 ref7 ref8">1-9</xref>
        ]. The most critical
component of text monitoring is content analysis [
        <xref ref-type="bibr" rid="ref7">8</xref>
        ]. The technology of practical (in-depth) text
analysis of text mining is most often used to obtain slices of information flows. Using computing power
allows you to identify relationships that can lead to new knowledge. The task of Text mining is to select
the key and most important information for the user. It no needs for the user to view a considerable
amount of unstructured content. Developed is based on statistical and linguistic analysis and artificial
intelligence methods. Text mining technologies are designed to conduct meaningful research, provide
navigation, and search in unstructured texts. Using systems of the Tech mining class, users receive new
valuable information in the form of knowledge. The technology of deep text analysis historically
preceded deep data analysis, the methodology and approached widely used in Text mining methods.
Like most cognitive technologies, Text mining is the algorithmic identification of previously unknown
relationships and correlations in existing textual data. The exponential growth for information on the
Internet is the reason for the ever-increasing difficulty of finding the necessary documents and
organising them in the form of repositories structured by content. It is becoming increasingly difficult
for the user to find the required information; traditional search mechanisms are ineffective. Therefore,
the topic’s relevance is caused by an exponential increase in the number of documents, making it
impossible to process data by traditional methods without loss of quality.
      </p>
      <p>The purpose of the study is the design and development of the intellectual components of the
automatic formation and categorisation of electronic digests.</p>
      <p>It is necessary to solve the following tasks to achieve this goal:
1. To conduct a systematic analysis of the subject area.
2. To develop a module for the formation and categorisation of digests.</p>
      <p>The object of research is the analysis of the formation processes (processing, rubric) of information
flows in the media. The subject of the study is text processing and digest generation algorithms. The
scientific novelty of the obtained research results is due to the set of tasks, consists of comprehensive
research and systematisation of theoretical and applied problems of getting the necessary qualitative
and quantitative information slices in the form of digests. When solving the tasks, the context model of
the system for the automatic formation and categorisation of digests of media publications is proposed
for the first time.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Material and methods</title>
      <p>
        The key elements include summarisation, selection of phenomena, feature extraction, clustering,
classification, question answering, thematic indexing, and keyword searching in Text Mining [
        <xref ref-type="bibr" rid="ref1 ref10 ref11 ref12 ref13 ref14 ref15 ref16 ref17 ref18 ref2 ref3 ref4 ref5 ref6 ref7 ref8 ref9">1-19</xref>
        ]. In
addition, there will be supplemented the set using support and creation of taxonomies and thesauri in
some cases. Alexander Linden, director of Gartner Research, identified four main types of Text Mining
IT applications [
        <xref ref-type="bibr" rid="ref19 ref20 ref21 ref22 ref23">20-24</xref>
        ].
      </p>
      <p>1. Text classification using statistical correlation to build rules for placing documents in
conditional categories. For example, they are used to solve the following problems: grouping
documents on Internet networks, placing documents in specific folders, selectively distributing
news to subscribers.
2. Clustering is based on document attributes using linguistic and mathematical methods without
using conditional categories. They are used when abstracting large document arrays,
determining interconnected groups of content, simplifying information visualisation, identifying
duplicates or content similar documents.
3. Semantic networks or link analysis determine the appearance of descriptors (key phrases) in a
document to provide navigation. The visualisation used for this is a critical link in the
presentation of unstructured text document schemes. It is used to present the entire array of
content and implement the navigation mechanism for the study of documents and their classes.
4. Extracting facts is intended to obtain facts from the text to improve classification, search, and
clustering.</p>
      <p>
        There are several more tasks of Text Mining technology, for example, forecasting and finding
exceptions (searching for objects with characteristics, stand out from the crowd) [
        <xref ref-type="bibr" rid="ref10">11</xref>
        ].
      </p>
      <p>Stemming reduces a word to the base by discarding auxiliary parts such as the ending or suffix.
Stemming is used in content retrieval and linguistic morphology. Many search engines use stemmer
from merging, combining words in which the forms after stemmer coincide (consider such words
synonyms). This algorithm uses the principle of searching the table, which contains all possible variants
of words and their forms after stemming. The advantages of this method are the simplicity, speed, and
convenience of handling exceptions to language rules. The disadvantages include the fact that the search
table must contain all forms of words.</p>
      <p>
        The presentation of the text depends on the task, which determines the ease and effectiveness of
data manipulation. The most widely used view is the Vector Space Model (VSM) [
        <xref ref-type="bibr" rid="ref13">14</xref>
        ]. Then a vector
whose dimensions are given by the number of text parameters describes the text. The values of these
parameters are functions of the frequencies with which these parameters appear in the text box. This
process is referred to as a bag model of words since the order. And the relationship between words is
not considered. Most of the proposed text presentation algorithms are extensions to the Vector Space
Model. Some of them are based on phrases. Others believe the semantics of words or the relation
between them. In the third is the hierarchical structure of the text is used [
        <xref ref-type="bibr" rid="ref17">18</xref>
        ]. The frequency is with
which the term appears in the text body clarifies the meaning of this term in a separate document. The
frequency is determined in two ways: to emphasise the presence/absence of a term, it varies within [0;
1], or is specified by a mathematical function. Normalisation is performed taking into account the size
of the document, taking into account all unique terms. Statistics are collected for both individual words
and phrases. Phrases provide more semantic information than single words, for they give a general idea
of the context. Its environment characterises a comment. Through the polysemy of most terms, it is
necessary to know at least one phrase that contains the word in question to determine its semantic
meaning with greater certainty. In table 1, there are formulated the advantages and disadvantages of
presenting a document in individual dishes or whole phrases. The use of terms compensates for the
shortcomings of the analysis of individual words and vice versa.
      </p>
      <p>
        The task of classifying a document varies depending on previously identified relationships within
the content and between content flows. The classification criteria are preliminarily determined before
deciding which algorithm to apply. The grouping criteria are the general theme of the work, the author,
relevance or degree of interest in the text by regular users. In the case of thematic classification, they
focus on nouns that can characterise the topic. The development of automatic learning methods is the
main application for implementing this type of classification. Young and Lew [
        <xref ref-type="bibr" rid="ref18">19</xref>
        ] compared some
training algorithms, proving, for example, that SVM, k nearest neighbours, and linear regression
methods work better than neural networks and the Bayesian approach.
      </p>
      <p>
        A digest is an annotated text built based on the content analysis. Most algorithms for automatically
abstracting documents involve three main stages: analysis of the source text, determination of
significant fragments (sentences or entire paragraphs) and the formation of a conclusion. The digest is
an annotated source of links to the documents underlying it. When forming digests using
quasireferenced methods, it is almost impossible to obtain a coherent text. The combination of abstracts of
each of the content will contain redundant incoherent information. However, subject to abstract
submission, consisting of a certain number of announcements of incoming documents and divided into
units by these documents, the method described above is quite acceptable [
        <xref ref-type="bibr" rid="ref7">8</xref>
        ].
      </p>
      <p>
        Content monitoring is a semantic analysis of content flows to obtain the necessary quantitative and
qualitative sections [
        <xref ref-type="bibr" rid="ref1 ref2">1-3</xref>
        ]. A typical task of content monitoring is constructing diagrams of the dynamics
of the appearance of concepts in time [
        <xref ref-type="bibr" rid="ref11">12</xref>
        ].
      </p>
      <p>Automated content monitoring technology has several important features [62-65]:
 Use of the key fragment of the publication as a unit for the formation of a text information
array;
 Formation of a bank of critical fragments of publications as a combination of two interrelated
processes: synthetic and analytical processing and a multi-level procedure for the content analysis
of published texts;
 Indexing key fragments of publications using faceted classification.</p>
      <p>
        Clustering. As a result, the search procedure is presented with lists of documents sorted in
descending order of compliance with the query. Inevitable inaccuracies in ranking search results, this
type of presentation are not always convenient. Then, the clustering of search results is used, which
allows you to submit the results in a generalised form, which simplifies the choice of the area
corresponding to the information needs of the user [
        <xref ref-type="bibr" rid="ref15">16, 76-83</xref>
        ]. In this case, two classes of clustering
methods are used - hierarchical or non-hierarchical. In hierarchical clustering (bottom to top or top to
bottom), a cluster tree is formed. Non-hierarchical clustering methods provide high-quality clustering
due to more complex algorithms. There is a certain threshold function of the quality of clustering for
these methods, the maximisation of which is achieved through the distribution of documents between
individual clusters.
      </p>
      <p>Topic indexing (proximity). The vocabulary determines the content subject, and the thematic
proximity of the terms is characterised by how often these terms are used in documents of the same
issue. It does not always mean the obligatory use of these terms in the same documents.</p>
      <p>
        Denote the thematic proximity of the two terms wi and w j as FSR(wi , w j ) . Estimates calculation
of the thematic proximity of assignments and tasks of the function FSR(wi , w j ) is performed
according to the terms analysis in an array of content that describes topics [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4 ref5 ref6 ref7">1-8, 66-75</xref>
        ]. A matrix A is
constructed from the output array of content, the rows of which reflect the terms distribution across the
text. As an assessment of the thematic proximity of two terms, the scalar product of the corresponding
rows of this matrix is used. To calculate the proximity estimates between all pairs of words, it suffices
to calculate the matrix AT . This approach is similar to the classical methods of presenting information
based on a vector-spatial model.
      </p>
      <p>Further development of this approach is the use of the so-called latent-semantic analysis. The matrix
A is used to construct its approximation of A, obtained by latent-semantic analysis. The matrix uniquely
defines the thematic proximity function of two terms AT :</p>
      <p>FSR(wi , w )  AT [wi , w j ]. (1)</p>
      <p>j</p>
      <p>Note that matrix A has a dimension k, where k is the dimension of the theme space chosen at
approximation. With this approach, the complexity of calculating the thematic proximity of two terms
is x k , so it does not depend on the number of documents being analysed and the size of the general
dictionary.</p>
      <p>
        Table of interrelated concepts. A concept is used as a basis for grouping documents in an
information array (not separate terms, but some semantic entities), which can be expressed in a query
language theoretically. In the same way as in the case of individual words, the clustering of documents
is compared with the clustering of concepts. In contrast, the concept more accurately reflects the
thematic properties of documents. It is achieved by complicating the algorithmic part of clustering. The
construction of concept relationship tables (VLT) is based on the language tools of the information
retrieval system and cluster analysis methods. The semantic meaning of concepts is determined based
on information retrieval language [
        <xref ref-type="bibr" rid="ref34 ref35 ref36 ref37 ref38 ref39 ref40 ref41 ref42 ref43 ref44">35-45</xref>
        ].
      </p>
      <p>The table of conceptual relationships, which is built as a statistical report that reflects the proximity
(joint occurrence in documents) of individual concepts from the real world, is a symmetric matrix A –
|| aij || , whose elements aij are the relationship coefficients of the corresponding pairs concepts. The
coefficient aij corresponds to the number of documents in the input information stream, including ideas
(terms or phrases are presented in the language of queries corresponding to the concept i), and the
coefficient aij , where (i  j) is the number of content in the input stream, which simultaneously
corresponds to the concepts i and j.</p>
      <p>Qualitative signs are quite adequately expressed in the information retrieval language. This solution
is, in most cases, effective and efficient. The cluster analysis algorithm is used to reorganise concepts
to identify block sets of the most related terms.</p>
      <p>The Boolean search model is a classic and widely used information representation model (based
on set theory) and an information search model (based on mathematical logic) [69-76]. The popularity
of this model is due to its ease of implementation, which allows indexing and searching in large
document arrays. It is popular to combine a Boolean model with an algebraic vector-spatial model of
data representation. On the one hand, this provides a quick search using mathematical logic operators,
and on the other hand, high-quality ranking of documents based on keyword weights. Within the
framework of the Boolean model, documents and queries are presented in the form of a set of
morphemic keyword stems (terms). In a Boolean model, a user query is a logical expression in which
keywords (query terms) are associated with the logical operators AND, OR, and NOT. By default,
various Internet search engines do not explicitly use logical operations but simply list keywords. By
default, it is often assumed that all keywords are connected by a logical AND operation. In these cases,
only those contents are included in the search results that contain all the keywords of the query
simultaneously. In those systems where the space between words is equated to the OP operator,
documents that include at least one of the query keywords are included in the search results . When
using the Boolean model, the database consists of an index organised as an inverted array. For each
term from the database dictionary, there is a list of documents in which this term occurs. The index can
also store the value of the occurrence frequency of a given term in each content; it allows you to sort
the list in descending order of occurrence frequency. The classical database, which corresponds to the
Boolean model, is organised so that you can quickly access the corresponding list of documents for
each term. The structure of the inverted array ensures quick modification when new contents are
included in the database. Due to these requirements, an inverted array is often implemented as a B-tree.</p>
      <p>
        Latent-semantic analysis, or indexing, is a method for extracting hidden context-sensitive values
of terms and the structure of semantic relationships between them by statistical processing of large sets
of text data [
        <xref ref-type="bibr" rid="ref7">8</xref>
        ]. This method is widely used in the field of search and the problems of information
classification. This approach allows you to automatically recognise the content of the shades of words
depending on the context of use. It uses the found indicators of thematic proximity of terms, which are
then used to calculate estimates of the thematic proximity of documents. The method is widely used in
factor analysis, which is to single out the main factors from the space of elementary ones.
      </p>
      <p>Matrix latent semantic analysis. The mathematical apparatus of this method is based on the
singular decomposition of matrices. The technique allows revealing hidden semantic relationships when
processing large arrays of documents. As initial information, the latent-semantic analysis uses the same
matrix as in the vector-spatial model. Elements of this matrix contain values of the frequency of use of
individual terms in documents. From matrix analysis, it is known that any rectangular matrix A can be
decomposed into a product of three matrices:</p>
      <p>A  UXV T (2)
The matrices U and V consist of orthonormal columns, and X the diagonal matrix of singular values,
the diagonal elements of the unique numbers of the matrix A, that is, the integral square roots of the
eigenvalues of the matrix. The most common option is based on using a matrix schedule for singular
values. The original matrix is decomposed into a set of orthogonal matrices, a linear combination of a
good approximation of the original matrix.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Experiments, results and discussion</title>
      <p>The system’s ultimate goal is the automated compilation of summaries of materials - digests of
electronic publications in the media, extracting the most critical content from one or more documents
and the generation of concise and information-rich reports on their basis. The system should carry out
information monitoring, receive large volumes of data, analyse, systematise data using an automatic
rubricator, accumulate information, index material and save it in the database, solve thematic filtering
and generate digests in automatic mode. The choice of the final single compromise solution, considering
various criteria, is a rather difficult task when planning and making decisions. Therefore, it is advisable
to select relevant information in a hierarchical form using the hierarchy analysis method. Content is
chosen using an algorithm that processes the source text and selects its most informationally sound
parts, fragments. So at the top level of the hierarchy is the goal - the selection of meaningful information.
At the second level are criteria clarifying the purpose: the basis of the text, the completeness of the
glossary of terms and the number of keywords. At the third level are alternatives of choice - fragments
of the source text (Fig. 1).</p>
      <p>The use case diagram depicts various scenarios of interaction between actors (users) and use cases
(use cases); describes the functional aspects of the system. Fig. 2 precedent diagram of a method for
automatically forming and categorising digests for electronic media is presented. The article developed
by the journalist is processed by the system, in which the statistical indicators of the terms, as a result,
are determined. Thematic classification allows you to attribute the article to a specific category. After
that, using the Text Mining algorithms, a digest is formed. A class diagram is built to visualise the
statistical aspects of the system. Fig. 3 shows a class diagram that describes the system. The Content is
part of Analysis, which is part of the Rubricator. The Dictionary is offered as part of the headings and
analysis. In Fig. 3b, a state diagram of the system of automatic formation and categorisation of digests
for electronic media is presented. It presents a finite state machine with simple states and transitions.</p>
      <p>The purpose of the development is a capable, ready-to-use intelligent system of automatic formation
and categorisation of electronic digests. The Web monitoring module allows you to bypass
userspecified pages and download updates to Web pages. Special modules that are focused on receiving
information of this type read the data received. After receipt and preliminary study, the categorisation
module processes all materials. First, the construction and training of the rubricator by an expert is
required. The essence of activity is in the expert analysis of educational materials with their
classification in one or another rubric; the expert must indicate the degree of the relation of the given
text to a particular topic. An activity diagram is a diagram on which the schedule of some activities on
its parts is presented (Fig. 4). By activity diagram, we mean a specification of behaviour performed in
the form of coordinated sequential and parallel execution of subordinate elements - nested activities
and separate actions (actions), interconnected by flows that go from the outputs of one node to the inputs
of another. An analogue of activity diagrams is algorithm diagrams.</p>
      <p>a)
Figure 3: Diagram of (a) classes and (b) states
b)</p>
      <p>The sequence diagram shows a message exchange (a method call) between several objects in a
particular limited time situation. The time is also steep, directed downward, and arrows with the terms
of the operation and parameters (Fig. 5) indicate messages sent from one object to another.</p>
      <p>The cooperation diagram (Fig. 6, a) is intended to specify the structural aspects of the system’s
interaction. Cooperation is helpful when modelling design patterns. Based on expert assessments, the
categorisation module conducts a semantic and morphological analysis of texts, highlighting the main
thematic concepts and analysing the structure of their placement in the text. The systematisation of data
in automatic mode is based on the learning outcomes. The source text refers to one or more rubrics with
affixing the degree of relationship. After categorisation, the materials should be indexed for all the
words of their content. This procedure provides flexible search options based on material attributes and
content. The results of the system are presented in the form of thematic digests, which are created
automatically. When implementing text processing, it is necessary to consider the existing problems of
the formation of dictionaries, the definition of part of speech and the human factor. Firstly, all
dictionaries are different and not equivalent to each other. Most often, the task of distinguishing the
meaning of words from each other is not difficult. However, in some cases, different definitions of a
word can be semantically close (for example, if they are a metaphor or metonymy).</p>
      <p>
        In such situations, the separation of meaning in different dictionaries and thesauruses is significant
is different. The solution to this problem is the everyday use of the same data source: one standard
dictionary. Speaking globally, the results of studies using a more generalised system of separation in
meaning are more effective. Secondly, in some languages, determining the part of speech (English
Partof-speech tagging) of a word is very closely related to resolving ambiguity, which these two tasks
interfere with each other as a result [
        <xref ref-type="bibr" rid="ref6">7</xref>
        ]. There is no consensus, it is worth dividing them into two
autonomous components, but the advantage is on the side of those who believe that this is necessary.
      </p>
      <p>The third problem is the human factor. The system is evaluated by comparing the results with the
result of the work of experts. In addition, in the case of stylistic writing of articles, the task of
constructing meaningful digests and their correct categorisation is performed by an expert.</p>
      <p>Digest building. The same strategy of constructing a quasi-abstract is to fix the moments of a profile
change, transitioning from low to higher levels and vice versa. The advantage of quasi-reference
methods lies in the simplicity of their implementation. However, the selection of text blocks does not
consider the relationship between them, which often leads to the formation of inertia essays. Some
sentences may appear to be omitted or contain phrases or words that cannot be understood without the
preliminary but missing text in the abstract. Attempts to solve this problem boil down to the exclusion
of such proposals from abstracts. Less commonly, there are attempts to solve links using linguistic
analysis methods.</p>
      <p>
        Unique interfaces are created with the help of which the presence of a significant gap is determined.
This approach is not suitable for any mass word processing. As in the case of a quasi-referenced textual
content, at the first stage of the formation of the digest, the most significant lexical units are included
in the array of output content (input information stream), based on which the dictionary of the system
is built. The selection of output documents from the input array of the digest is also carried out, taking
into account their weights. Each content weight is determined to consider the sum of the consequences
of the individual words included in this content, normalised along the length of the content. The stage
of selecting content for the digest consists of such steps as determining the weight of each range, sorting
the input document stream by weight, determining the content duplicates of documents according to
statistical criteria, rejecting content unsuitable for building digests (invalid types of documents, for
example, inspections), and substantial copies (detected by frequency algorithms). The last stage of
selecting documents for the formation of the digest is to choose a predetermined number of important
content from the array sorted and filtered at the previous locations [
        <xref ref-type="bibr" rid="ref7">8</xref>
        ]. The selected contents are
submitted in the digest by a predetermined number of significant proposals. In the case of the formation
of digests based on the information, it dynamically changes from the Internet; a hypertext representation
of the digest is automatically generated, which is considered as an independent document containing
links to primary documents on the network. The above procedure provides the formation of a digest
that reflects the main trends presented in the source information array. It makes sense to form a
fanshaped multi-aspect digest, reflecting next to the primary trend several other aspects that are ignored in
the first type digests. A multi-aspect digest can be built based on technological solutions used in the
previous approach when implementing the following algorithm [
        <xref ref-type="bibr" rid="ref7">8</xref>
        ].
      </p>
      <p>Stage 1. Build a digest that reflects the primary trend.</p>
      <p>Stage 2. Removal from the input information flow of documents corresponding to the trend that was
determined in the previous step.</p>
      <p>Stage 3. Build a digest that reflects the primary trend of the rest of the information flow.
Stage 4. Combining received digests.</p>
      <p>Stage 5. If necessary (based on the required volumes of the resulting digest), the transition to step 2
is performed.</p>
      <p>Consider the algorithm of the system of automatic formation and categorisation of electronic digests
(Fig. 6, b). The system receives data from the database in the form of an array of articles. Then it checks
the user-defined request for processing the text of the article. When there is an article that needs
processing, then the lemmatisation of the text of the article is carried out to determine tokens, stemming
from dropping stop words and clustering. Such processing as a result, data on the position and weight
of word forms will be collected, which will allow you to place the article in a specific category and
build a digest.</p>
      <p>Logical database schema. Such informational relations in SQL represent all system characteristics:
 jos_content class is information and metadata of articles posted on an information resource;
 digest - information about created digests (identifier, name, digest text, creation date, category
identifier)
 rubric class is rubricked information (identifier, rubric name, weight)
 lexeme class is dictionary token table (identifier, token, counter)
 stem class is a table of standard dictionary forms (identifier, topic, counter)
 stopword class is a table of stop dictionary words (identifier, stop word, weight).</p>
      <p>The phpMyAdmin admin interface represents the database structure for the intelligent system for
the automatic generation and categorisation of digests in Fig. 7.</p>
      <p>The central software units that provide the functionality of the system include files:
 default.php is intended to form digest text and performs the function of selecting the short
central abstracts from the full text of the article in question;
 stemmer.php is intended for stemming text - cutting off the word endings and suffixes so that
the rest, called the stem, is the same for all grammatical forms of the word (in this form, stemmer
works only with languages that implement inflexion through affixes)
 lemmatizer.php is intended for lemmatisation of the text - reduction of individual words to
standard word forms;
 rubrick.php is an automatic text rubricator and performs the function of identifying the heading
for a particular text, using quantitative statistics of the appearance of words in the text obtained using
lemmatizer.php;
 content.php is intended to display information on the page.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusions</title>
      <p>In the work of information and analytical services, enterprises have to deal with a wide variety of
sources of information. These are online newspapers and other Internet resources. In this paper, online
media, their disadvantages, advantages, services are considered. Electronic media studies allow us to
conclude that the use of human labour in the processes related to the formation and rating of digests is
inappropriate. A vital part of this work is developing methods for the construction and categorisation
of digests. The experience of implementing the system in various organisations has shown the efficiency
and simplicity of adapting the system, thanks to the developed tool for automated generation of digests
and their categorisation. A universal data collection module allows you to fully automate the input of
electronic information from various sources with its reduction to a single internal format, that is, to
minimise the routine work of entering text data. The built-in system for automatically tracking the
updating of these pages on information sites on the Internet allows you to automate this part of
enterprises’ information and analytical services.</p>
    </sec>
    <sec id="sec-6">
      <title>6. References</title>
      <p>[1] O. Naum, L. Chyrun, O. Kanishcheva, V. Vysotska, Intellectual System Design for Content
Formation, in: Proceedings of the International Conference on Computer Sciences and Information
Technologies, CSIT, 2017, pp. 131-138.
[60] D. Dosyn, V. Lytvyn, V. Kovalevych, O. Oborska, R. Holoshchuk, Knowledge discovery as
planning development in knowledgebase framework, in: Proceedings of the Modern Problems of
Radio Engineering, Telecommunications and Computer Science, Proceedings of the 13th
International Conference on TCSET, 2016, pp. 449-451.
[61] D.G. Dosyn, O.L. Ivantyshyn, V.V. Koshovyy, I.M. Romanyshyn, S.O. Soroka, To a question on
the mechanism of formation of ionospheric disturbances at groundbased artificial acoustic
excitation, in: Proceedings of the International Seminar/Workshop on Direct and Inverse Problems
of Electromagnetic and Acoustic Wave Theory, DIPED, 2003, pp. 211-214.
[62] V. Lytvyn, D. Dosyn, M. Emmerich, I. Yevseyeva, Content formation method in the web systems,
volume 2136 of CEUR Workshop Proceedings, 2018, pp. 42-61.
[63] M. Davydov, O. Lozynska, Information system for translation into Ukrainian sign language on
mobile devices, in: Proceedings of the International Scientific and Technical Conference on
Computer Sciences and Information Technologies, CSIT, 2017, pp. 48-51.
[64] O.H. Lypak, V. Lytvyn, O. Lozynska, R. Vovnyanka, Y. Bolyubash, A. Rzheuskyi, D. Dosyn,
Formation of Efficient Pipeline Operation Procedures Based on Ontological Approach, volume
871 of Advances in Intelligent Systems and Computing, 2019, pp. 571-581.
[65] M. Davydov, O. Lozynska, Mathematical method of translation into ukrainian sign language based
on ontologies, volume 871 of Advances in Intelligent Systems and Computing, 2018, pp. 89-100.
[66] V. Savchuk, O. Lozynska, V. Pasichnyk, Architecture of the Subsystem of the Tourist Profile</p>
      <p>Formation, volume 871 of Advances in Intelligent Systems and Computing, 2019, pp. 561-570.
[67] V. Lytvyn, The similarity metric of scientific papers summaries on the basis of adaptive ontologies,
in: Proceedings of the 7th International Conference on Perspective Technologies and Methods in
MEMS Design, MEMSTECH, 2011, p. 162.
[68] V.V. Lytvyn, O.I. Tsmots, The process of managerial decision making support within the early
warning system, volume 149(11) of Actual Problems of Economics, 2013, pp. 222-229.
[69] P. Kravets, Game methods of construction of adaptive grid areas, in: Proceedings of the The
Experience of Designing and Application of CAD Systems in Microelectronics, CADSM, 2003,
pp. 513-516.
[70] P. Kravets, Adaptive method of pursuit game problem solution, in: Proceedings of the Modern
Problems of Radio Engineering, Telecommunications and Computer Science Proceedings of
International Conference, TCSET, 2006, pp. 62-65.
[71] P. Kravets, Game methods of the stochastic boundary problem solution, in: Proceedings of the</p>
      <p>Perspective Technologies and Methods in MEMS Design, MEMSTECH, 2007, pp. 71-74.
[72] P. Kravets, O. Prodanyuk, Game task of resource allocation, in: Proceedings of the Experience of</p>
      <p>Designing and Application of CAD Systems in Microelectronics, CADSM, 2009, pp. 437-438.
[73] P. Kravets, Game method for coalitions formation in multi-agent systems, in: Proceedings of the
International Scientific and Technical Conference on Computer Sciences and Information
Technologies, CSIT, 2018, pp. 1-4.
[74] P. Kravets, R. Kyrkalo, Fuzzy logic controller for embedded systems, in: Proceedings of the
International Conference on Perspective Technologies and Methods in MEMS Design,
MEMSTECH, 2009, pp. 58-59.
[75] P. Kravets, The game method for orthonormal systems construction, in: Proceedings of The</p>
      <p>Experience of Designing and Application of CAD Systems in Microelectronics, 2007, 296-298.
[76] P. Kravets, The control agent with fuzzy logic, in: Proceedings of the Perspective Technologies
and Methods in MEMS Design, MEMSTECH, 2010, pp. 40-41.
[77] P. Zhezhnych, O. Markiv, A linguistic method of web-site content comparison with tourism
documentation objects, in: Proceedings of the International Scientific and Technical Conference
on Computer Sciences and Information Technologies, CSIT, 2017, pp. 340-343.
[78] P. Zhezhnych, O. Markiv, Recognition of tourism documentation fragments from web-page posts,
in: Proceedings of the 14th International Conference on Advanced Trends in Radioelectronics,
Telecommunications and Computer Engineering, TCSET, 2018, pp. 948-951.
[79] P. Zhezhnych, O. Markiv, Linguistic comparison quality evaluation of web-site content with
tourism documentation objects, volume 689 of Advances in Intelligent Systems and Computing,
2018, pp. 656-667.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Chyrun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Chyrun</surname>
          </string-name>
          ,
          <article-title>The Commercial Content Digest Formation and Distributional Process</article-title>
          ,
          <source>in: Proceedings of the International Conference on Computer Sciences and Information Technologies</source>
          ,
          <string-name>
            <surname>CSIT</surname>
          </string-name>
          ,
          <year>2016</year>
          , pp.
          <fpage>186</fpage>
          -
          <lpage>189</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Gozhyj</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Chyrun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kowalska-Styczen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Lozynska</surname>
          </string-name>
          ,
          <source>Uniform Method of Operative Content Management in Web Systems</source>
          , volume
          <volume>2136</volume>
          <source>of CEUR Workshop Proceedings</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>62</fpage>
          -
          <lpage>77</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>L.</given-names>
            <surname>Chyrun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gozhyj</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Yevseyeva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dosyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Tyhonov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zakharchuk</surname>
          </string-name>
          ,
          <source>Web Content Monitoring System Development</source>
          , volume
          <volume>2362</volume>
          <source>of CEUR Workshop Proceedings</source>
          ,
          <year>2019</year>
          ,
          <fpage>126</fpage>
          -
          <lpage>142</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Burov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Veres</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Rishnyak</surname>
          </string-name>
          ,
          <source>The Contextual Search Method Based on Domain Thesaurus</source>
          , volume
          <volume>689</volume>
          <source>of Advances in Intelligent Systems and Computing</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>310</fpage>
          -
          <lpage>319</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>O.</given-names>
            <surname>Pavlenko</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Tymofieieva</surname>
          </string-name>
          ,
          <source>Search Query Data Analysis: Challenges and Opportunities</source>
          , volume Vol-
          <volume>2604</volume>
          <source>of CEUR workshop proceedings</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>452</fpage>
          -
          <lpage>461</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>N.</given-names>
            <surname>Antonyuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Medykovskyy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Chyrun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dverii</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Oborska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Krylyshyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Vysotsky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Tsiura</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Naum</surname>
          </string-name>
          ,
          <article-title>Online Tourism System Development for Searching and Planning Trips with User's Requirements</article-title>
          , volume
          <volume>1080</volume>
          <source>of Advances in Intelligent Systems and Computing IV</source>
          , Springer Nature Switzerland AG,
          <year>2020</year>
          , pp.
          <fpage>831</fpage>
          -
          <lpage>863</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>T.</given-names>
            <surname>Basyuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Vasyliuk</surname>
          </string-name>
          , V. Lytvyn,
          <source>Mathematical Model of Semantic Search and Search Optimization</source>
          , volume Vol-
          <volume>2362</volume>
          <source>of CEUR Workshop Proceedings</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>96</fpage>
          -
          <lpage>105</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>O.</given-names>
            <surname>Bisikalo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <article-title>Linguistic analysis method of Ukrainian commercial textual content for data mining</article-title>
          , volume Vol-
          <volume>2608</volume>
          <source>of CEUR Workshop Proceedings</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>224</fpage>
          -
          <lpage>244</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>O.</given-names>
            <surname>Veres</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Rusyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sachenko</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Rishnyak</surname>
          </string-name>
          ,
          <article-title>Choosing the Method of Finding Similar Images in the Reverse Search System</article-title>
          , volume
          <volume>2136</volume>
          <source>of CEUR Workshop Proceedings</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>99</fpage>
          -
          <lpage>107</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>P.</given-names>
            <surname>Radiuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Hrypynska</surname>
          </string-name>
          ,
          <article-title>A Framework for Exploring and Modelling Neural Architecture Search Methods</article-title>
          , volume Vol-
          <volume>2604</volume>
          <source>of CEUR workshop proceedings</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>1060</fpage>
          -
          <lpage>1074</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>B.</given-names>
            <surname>Rusyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Emmerich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Pohreliuk</surname>
          </string-name>
          ,
          <source>The Virtual Library System Design and Development</source>
          , volume
          <volume>871</volume>
          <source>of Advances in Intelligent Systems and Computing</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>328</fpage>
          -
          <lpage>349</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>O.</given-names>
            <surname>Kliuiev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Vnukova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hlibko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Brynza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Davydenko</surname>
          </string-name>
          ,
          <article-title>Estimation of the Level of Interest and Modeling of the Topic of Innovation Through Search in Google</article-title>
          , volume Vol-
          <volume>2604</volume>
          <source>of CEUR workshop proceedings</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>523</fpage>
          -
          <lpage>535</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>L.</given-names>
            <surname>Chyrun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Kis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          , L. Chyrun,
          <article-title>Content monitoring method for cut formation of person psychological state in social scoring</article-title>
          ,
          <source>in: Proceedings of the International Conference on Computer Sciences and Information Technologies</source>
          ,
          <string-name>
            <surname>CSIT</surname>
          </string-name>
          ,
          <year>2018</year>
          , pp.
          <fpage>106</fpage>
          -
          <lpage>112</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>D.</given-names>
            <surname>Hand</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Adams</surname>
          </string-name>
          ,
          <article-title>Data mining</article-title>
          , in: Wiley StatsRef: Statistics Reference Online,
          <year>2014</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>7</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>M. W.</given-names>
            <surname>Berry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kogan</surname>
          </string-name>
          ,
          <article-title>Text mining</article-title>
          .
          <source>Applications and Theory</source>
          , in: West Sussex,
          <year>PO19</year>
          8SQ, UK: John Wiley &amp; Sons,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>C. C.</given-names>
            <surname>Aggarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhai</surname>
          </string-name>
          ,
          <source>Mining text data. Springer Science &amp; Business Media</source>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Sharonova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Hamon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Grabar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kowalska-Styczen</surname>
          </string-name>
          ,
          <article-title>Computational linguistics and intelligent systems</article-title>
          , volume of Vol-2136
          <source>CEUR Workshop Proceedings</source>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>M.</given-names>
            <surname>Emmerich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Yevseyeva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. B.</given-names>
            <surname>Fernandes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dosyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <surname>Preface:</surname>
          </string-name>
          <article-title>Modern Machine Learning Technologies and Data Science (MoMLeT&amp;DS-</article-title>
          <year>2019</year>
          ), volume Vol-
          <volume>2386</volume>
          <source>of CEUR Workshop Proceedings</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Sharonova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Hamon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Cherednichenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Grabar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kowalska-Styczen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <source>Preface: Computational Linguistics and Intelligent Systems (COLINS-2019)</source>
          , volume of Vol-2362
          <source>CEUR Workshop Proceedings</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Hamon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Grabar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Sharonova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Cherednichenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Kanishcheva</surname>
          </string-name>
          ,
          <source>Preface: Computational Linguistics and Intelligent Systems (COLINS-2020)</source>
          , volume Vol-
          <volume>2604</volume>
          <source>of CEUR Workshop Proceedings</source>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>M.</given-names>
            <surname>Emmerich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Basto-Fernandes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvynenko</surname>
          </string-name>
          ,
          <source>Preface: Modern Machine Learning Technologies and Data Science (MoMLeT+DS</source>
          <year>2020</year>
          ), volume Vol-
          <volume>2631</volume>
          <source>of CEUR Workshop Proceedings</source>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Pukach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Nytrebych</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Demkiv</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Senyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Malanchuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sachenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Kovalchuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Huzyk</surname>
          </string-name>
          ,
          <article-title>Analysis of the developed quantitative method for automatic attribution of scientific and technical text content written in Ukrainian</article-title>
          , volume
          <volume>6</volume>
          (
          <issue>2</issue>
          -
          <fpage>96</fpage>
          ) of
          <source>EasternEuropean Journal of Enterprise Technologies</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>19</fpage>
          -
          <lpage>31</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Pukach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Nytrebych</surname>
          </string-name>
          , І. Demkiv,
          <string-name>
            <given-names>R.</given-names>
            <surname>Kovalchuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Huzyk</surname>
          </string-name>
          ,
          <article-title>Development of the linguometric method for automatic identification of the author of text content based on statistical analysis of language diversity coefficients</article-title>
          , volume
          <volume>5</volume>
          (
          <issue>2</issue>
          ) of Eastern-
          <source>European Journal of Enterprise Technologies</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>16</fpage>
          -
          <lpage>28</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.B.</given-names>
            <surname>Fernandes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Emmerich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hrendus</surname>
          </string-name>
          ,
          <article-title>Method for Determining Linguometric Coefficient Dynamics of Ukrainian Text Content Authorship</article-title>
          , volume
          <volume>871</volume>
          <source>of Advances in Intelligent Systems and Computing</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>132</fpage>
          -
          <lpage>151</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Kanishcheva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Hlavcheva</surname>
          </string-name>
          ,
          <article-title>Authorship Identification of the Scientific Text in Ukrainian with Using the Lingvometry Methods</article-title>
          ,
          <source>in: Proceedings of the International Conference on Computer Sciences and Information Technologies</source>
          ,
          <string-name>
            <surname>CSIT</surname>
          </string-name>
          ,
          <year>2018</year>
          , pp.
          <fpage>34</fpage>
          -
          <lpage>38</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          , I. Budz,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Pelekh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Sokulska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Kovalchuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Dzyubyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Tereshchuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Komar</surname>
          </string-name>
          ,
          <article-title>Development of the quantitative method for automated text content authorship attribution based on the statistical analysis of N-grams distribution</article-title>
          , volume
          <volume>6</volume>
          (
          <issue>2</issue>
          -
          <fpage>102</fpage>
          ) of Eastern-
          <source>European Journal of Enterprise Technologies</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>28</fpage>
          -
          <lpage>51</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <article-title>Designing architecture of electronic content commerce system</article-title>
          .
          <source>In: Computer Science and Information Technologies, in: Proceedings of the International Conference on Computer Sciences and Information Technologies</source>
          ,
          <string-name>
            <surname>CSIT</surname>
          </string-name>
          ,
          <year>2015</year>
          , pp.
          <fpage>115</fpage>
          -
          <lpage>119</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>V.</given-names>
            <surname>Starko</surname>
          </string-name>
          , Semantic Annotation for Ukrainian: Categorization Scheme, Principles, and Tools, volume Vol-
          <volume>2604</volume>
          <source>of CEUR workshop proceedings</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>239</fpage>
          -
          <lpage>248</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>I.</given-names>
            <surname>Gruzdo</surname>
          </string-name>
          , I. Kyrychenko,
          <string-name>
            <given-names>G.</given-names>
            <surname>Tereshchenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Cherednichenko</surname>
          </string-name>
          ,
          <article-title>Applıcatıon of Paragraphs Vectors Model for Semantıc Text Analysıs</article-title>
          , volume Vol-
          <volume>2604</volume>
          <source>of CEUR workshop proceedings</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>283</fpage>
          -
          <lpage>293</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>O.</given-names>
            <surname>Artemenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Pasichnyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Kunanets</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Shunevych</surname>
          </string-name>
          ,
          <article-title>Using sentiment text analysis of user reviews in social media for e-tourism mobile recommender systems</article-title>
          , volume Vol-
          <volume>2604</volume>
          <source>of CEUR workshop proceedings</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>259</fpage>
          -
          <lpage>271</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>V.</given-names>
            <surname>Vasyliuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Shyika</surname>
          </string-name>
          , T. Shestakevych,
          <source>Information System of Psycholinguistic Text Analysis</source>
          , volume Vol-
          <volume>2604</volume>
          <source>of CEUR workshop proceedings</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>178</fpage>
          -
          <lpage>188</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yusyn</surname>
          </string-name>
          , T. Zabolotnia,
          <article-title>Methods of Acceleration of Term Correlation Matrix Calculation in the Island Text Clustering Method</article-title>
          , volume
          <volume>2604</volume>
          <source>of CEUR workshop proceedings</source>
          ,
          <year>2020</year>
          ,
          <fpage>140</fpage>
          -
          <lpage>150</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [34]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Burov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Shakleina</surname>
          </string-name>
          ,
          <source>The Basic Ontology Development Process Automation Based on Text Resources Analysis, in: 15th International Scientific and Technical Conference on Computer Sciences and Information Technologies</source>
          ,
          <string-name>
            <surname>CSIT</surname>
          </string-name>
          ,
          <year>2020</year>
          , pp.
          <fpage>280</fpage>
          -
          <lpage>284</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>V.-A.</given-names>
            <surname>Oliinyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Burov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Mykich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Basto-Fernandes</surname>
          </string-name>
          ,
          <source>Propaganda Detection in Text Data Based on NLP and Machine Learning</source>
          , volume Vol-
          <volume>2631</volume>
          <source>of CEUR workshop proceedings</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>132</fpage>
          -
          <lpage>144</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [36]
          <string-name>
            <given-names>O.</given-names>
            <surname>Kuropiatnyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Shynkarenko</surname>
          </string-name>
          ,
          <article-title>Text Borrowings Detection System for Natural Language Structured Digital Documents</article-title>
          , volume
          <volume>2604</volume>
          <source>of CEUR workshop proceedings</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>294</fpage>
          -
          <lpage>305</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [37]
          <string-name>
            <given-names>M.</given-names>
            <surname>Sazhok</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Robeiko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Seliukh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Fedoryn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Yukhymenko</surname>
          </string-name>
          ,
          <article-title>Written Form Extraction of Spoken Numeric Sequences in Speech-to-Text Conversion for Ukrainian</article-title>
          , volume Vol-
          <volume>2604</volume>
          <source>of CEUR workshop proceedings</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>442</fpage>
          -
          <lpage>451</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [38]
          <string-name>
            <given-names>R.</given-names>
            <surname>Bekesh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Chyrun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Kravets</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Demchuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Matseliukh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Batiuk</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Peleshchak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Bigun</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Maiba</surname>
          </string-name>
          ,
          <source>Structural Modeling of Technical Text Analysis and Synthesis Processes</source>
          , volume
          <volume>Vol2604</volume>
          <source>of CEUR workshop proceedings</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>562</fpage>
          -
          <lpage>589</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          [39]
          <string-name>
            <given-names>N.</given-names>
            <surname>Shakhovska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Basystiuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Shakhovska</surname>
          </string-name>
          ,
          <article-title>Development of the Speech-to-Text Chatbot Interface Based on Google API</article-title>
          , volume
          <volume>2386</volume>
          <source>of CEUR Workshop Proceedings</source>
          ,
          <year>2019</year>
          ,
          <fpage>212</fpage>
          -
          <lpage>221</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          [40]
          <string-name>
            <surname>NB. Shakhovska</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Yu</surname>
          </string-name>
          . Noha,
          <article-title>Methods and tools for text analysis of publications to study the functioning of scientific schools</article-title>
          , volume
          <volume>47</volume>
          (
          <issue>12</issue>
          ) of
          <source>Journal of Automation and Information Sciences</source>
          ,
          <year>2015</year>
          , pp.
          <fpage>29</fpage>
          -
          <lpage>43</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          [41]
          <string-name>
            <given-names>T.</given-names>
            <surname>Batura</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bakiyeva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Charintseva</surname>
          </string-name>
          ,
          <article-title>A method for automatic text summarisation based on rhetorical analysis and topic modeling</article-title>
          , volume
          <volume>19</volume>
          (
          <article-title>1</article-title>
          ) of
          <source>International Journal of Computing</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>118</fpage>
          -
          <lpage>127</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          [42]
          <string-name>
            <given-names>B.</given-names>
            <surname>Rusyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          , L. Pohreliuk,
          <article-title>Model and architecture for virtual library information system</article-title>
          ,
          <source>in: Proceedings of the International Conference on Computer Sciences and Information Technologies</source>
          ,
          <string-name>
            <surname>CSIT</surname>
          </string-name>
          ,
          <year>2018</year>
          , pp.
          <fpage>37</fpage>
          -
          <lpage>41</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          [43]
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Rusyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Pohreliuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Berezin</surname>
          </string-name>
          , O.
          <source>Naum Textual Content Categorizing Technology Development Based on Ontology</source>
          , volume Vol-
          <volume>2386</volume>
          <source>of CEUR Workshop Proceedings</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>234</fpage>
          -
          <lpage>254</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          [44]
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          , I. Peleshchak,
          <string-name>
            <given-names>T.</given-names>
            <surname>Basyuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Kovalchuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kubinska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Chyrun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Rusyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Pohreliuk</surname>
          </string-name>
          , T. Salo,
          <source>Identifying Textual Content Based on Thematic Analysis of Similar Texts in Big Data, in: Proceedings of the International Conference on Computer Sciences and Information Technologies</source>
          ,
          <string-name>
            <surname>CSIT</surname>
          </string-name>
          ,
          <year>2019</year>
          , pp.
          <fpage>84</fpage>
          -
          <lpage>91</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref44">
        <mixed-citation>
          [45]
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Kovalchuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kubinska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dilai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Rusyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Pohreliuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Chyrun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chyrun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Brodyak</surname>
          </string-name>
          ,
          <source>Method of Similar Textual Content Selection Based on Thematic Information Retrieval, in: Proceedings of the International Conference on Computer Sciences and Information Technologies</source>
          ,
          <string-name>
            <surname>CSIT</surname>
          </string-name>
          ,
          <year>2019</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref45">
        <mixed-citation>
          [46]
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          , P. Pukach, І. Bobyk,
          <string-name>
            <given-names>D.</given-names>
            <surname>Uhryn</surname>
          </string-name>
          ,
          <article-title>Development of a method for the recognition of author's style in the Ukrainian language texts based on linguometry, stylemetry and glottochronology</article-title>
          , volume
          <volume>4</volume>
          (
          <issue>2</issue>
          -
          <fpage>88</fpage>
          ) of Eastern-
          <source>European Journal of Enterprise Technologies</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>10</fpage>
          -
          <lpage>19</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref46">
        <mixed-citation>
          [47]
          <string-name>
            <given-names>J.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sachenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dosyn</surname>
          </string-name>
          ,
          <article-title>Model of Touristic Information Resources Integration According to User Needs</article-title>
          ,
          <source>in: Proceedings of the International Conference on Computer Sciences and Information Technologies</source>
          ,
          <string-name>
            <surname>CSIT</surname>
          </string-name>
          ,
          <year>2018</year>
          , pp.
          <fpage>113</fpage>
          -
          <lpage>116</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref47">
        <mixed-citation>
          [48]
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <article-title>Linguistic Analysis of Textual Commercial Content for Information Resources Processing</article-title>
          , in: Proceedings of the Modern Problems of Radio Engineering, Telecommunications and Computer Science, TCSET,
          <year>2016</year>
          , pp.
          <fpage>709</fpage>
          -
          <lpage>713</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref48">
        <mixed-citation>
          [49]
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dosyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Lozynska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Oborska</surname>
          </string-name>
          ,
          <article-title>Methods of Building Intelligent Decision Support Systems Based on Adaptive Ontology</article-title>
          ,
          <source>in: Proceedings of the IEEE 2nd International Conference on Data Stream Mining and Processing</source>
          , DSMP,
          <year>2018</year>
          , pp.
          <fpage>145</fpage>
          -
          <lpage>150</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref49">
        <mixed-citation>
          [50]
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.B.</given-names>
            <surname>Fernandes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Emmerich</surname>
          </string-name>
          ,
          <article-title>Web content support method in electronic business systems</article-title>
          , volume Vol-
          <volume>2136</volume>
          <source>of CEUR Workshop Proceedings</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>20</fpage>
          -
          <lpage>41</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref50">
        <mixed-citation>
          [51]
          <string-name>
            <given-names>J.</given-names>
            <surname>Su</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sachenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Burov</surname>
          </string-name>
          ,
          <article-title>Information resources processing using linguistic analysis of textual content</article-title>
          ,
          <source>in: Proceedings of the Intelligent Data Acquisition and Advanced Computing Systems Technology and Applications</source>
          , Romania,
          <year>2017</year>
          , pp.
          <fpage>573</fpage>
          -
          <lpage>578</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref51">
        <mixed-citation>
          [52]
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dosyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Burov</surname>
          </string-name>
          ,
          <article-title>Method for ontology content and structure optimisation, provided by a weighted conceptual graph</article-title>
          , volume
          <volume>15</volume>
          (
          <article-title>2</article-title>
          ) of Webology,
          <year>2018</year>
          ,
          <fpage>66</fpage>
          -
          <lpage>85</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref52">
        <mixed-citation>
          [53]
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Demchuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Demkiv</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Ukhanska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Hladun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Kovalchuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Petruchenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Dzyubyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Sokulska</surname>
          </string-name>
          ,
          <article-title>Design of the architecture of an intelligent system for distributing commercial content in the internet space based on SEO-technologies, neural networks</article-title>
          ,
          <source>and Machine Learning</source>
          , volume
          <volume>2</volume>
          (
          <issue>2</issue>
          -
          <fpage>98</fpage>
          ) of Eastern-
          <source>European Journal of Enterprise Technologies</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>15</fpage>
          -
          <lpage>34</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref53">
        <mixed-citation>
          [54]
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Burov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Oleshek</surname>
          </string-name>
          ,
          <source>Automated Monitoring of Changes in Web Resources</source>
          , volume
          <volume>1020</volume>
          <source>of Advances in Intelligent Systems and Computing</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>348</fpage>
          -
          <lpage>363</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref54">
        <mixed-citation>
          [55]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Burov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Kravets</surname>
          </string-name>
          ,
          <article-title>Ontological approach to plot analysis and modeling</article-title>
          , volume Vol-
          <volume>2362</volume>
          <source>of CEUR Workshop Proceedings</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>22</fpage>
          -
          <lpage>31</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref55">
        <mixed-citation>
          [56]
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          , P. Pukach, І. Bobyk,
          <string-name>
            <given-names>D.</given-names>
            <surname>Uhryn</surname>
          </string-name>
          ,
          <article-title>Development of a method for the recognition of author's style in the Ukrainian language texts based on linguometry, stylemetry and glottochronology</article-title>
          , volume
          <volume>4</volume>
          (
          <issue>2</issue>
          -
          <fpage>88</fpage>
          ) of Eastern-
          <source>European Journal of Enterprise Technologies</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>10</fpage>
          -
          <lpage>19</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref56">
        <mixed-citation>
          [57]
          <string-name>
            <given-names>L.</given-names>
            <surname>Vasyl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Victoria</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dmytro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Roman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Zoriana</surname>
          </string-name>
          ,
          <article-title>Application of Sentence Parsing for Determining Keywords in Ukrainian Texts</article-title>
          ,
          <source>in: Proceedings of the International Conference on Computer Sciences and Information Technologies</source>
          ,
          <string-name>
            <surname>CSIT</surname>
          </string-name>
          ,
          <year>2017</year>
          , pp.
          <fpage>326</fpage>
          -
          <lpage>331</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref57">
        <mixed-citation>
          [58]
          <string-name>
            <given-names>V.</given-names>
            <surname>Andrunyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Chyrun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vysotska</surname>
          </string-name>
          ,
          <article-title>Electronic content commerce system development</article-title>
          ,
          <source>in: Proceedings of the 13th International Conference: The Experience of Designing and Application of CAD Systems in Microelectronics, CADSM</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref58">
        <mixed-citation>
          [59]
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dosyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Lytvyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Sachenko</surname>
          </string-name>
          ,
          <article-title>Smart data integration by goal driven ontology learning</article-title>
          , volume
          <volume>529</volume>
          <source>of Advances in Intelligent Systems and Computing</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>283</fpage>
          -
          <lpage>292</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>