<!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>Comparative Research of Index Frequency - morphological Methods of Automatic Text Summarisation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Vladimir Fomin vv_fomin@mail.ru</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Alexsander Osochkin</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Herzen State Pedagogical University of Russia Saint Petersburg</institution>
          ,
          <addr-line>Russian Federation</addr-line>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Xenia Piotrowska</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Automatic analyses perspective and natural language processing (NLP) is being researched in the subject paper. The modified quantitative approach using a collocation algorithm is presented. This approach eliminates previously discovered issues of text processing using the vector model in the number of cases of thematic classification. The author's frequency method of extracting a set of numerical indicators taking into account the morphological features of words, as well as collocation between terms in text is proposed. The quantitative technology of automatic thematic classification using indicators which reflect morphological and parsing text features, methods of parameterization, text indexing, algorithms of artificial intelligence analysis and knowledge extraction is presented. The efficiency and advantage of the regression decision tree method in the tasks of finding of significant frequency indexes and their logical representation are demonstrated. The results of comparative experiments to assess the effectiveness of classification of natural language text data, using the author's, vector and set-theoretic models of text representation are stated.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>In the process of NLP methods evolution, the separate area, studying the language based
on statistical patterns with the inclusion of algorithms and models of linguistic and semantic
analysis, is appeared. [Martin Jurafsky, 2017], [Kang Y. et al, 2020]. Quantitative methods
use latent semantic links between text elements and enhance the capability [Johnson, 2020],
[Khalezova et al, 2020], [Kashcheyeva, 2013] of the statistic text analysis approach.</p>
      <p>The creation of different text representation models aimed at specific tasks solution has led
to the dynamic development of the quantitative text analysis approach. [Ribeiro et al., 2020],
[Maheshan et al, 2018], [Martin Jurafsky, 2017], [McCann et al, 2017]. A significant part of the
methods is based on the quantitative approach, containing complex computational linguistic text
analysis algorithms.</p>
      <p>The researches on the quantitative approach improvement considering national, professional,
linguistic language features remains relevant. The design of adaptation methods and their
application, address the shortcomings and limitations while NLP digitalization is promising.</p>
      <p>The separate field of possible NLP application in education is assistance to an actor in
the solution of educational tasks in informational and communicational redundancy of electronic
environment.</p>
      <p>These are principally new opportunities for automatic interaction with text information of
educational resources, identifying its content and quality characteristics.</p>
      <p>This approach provides expert support in the search for and extraction of knowledge from a
variety of information resources of the global environment, increase the criticality and practicality
of thinking, the formation of new competencies, the formation of new knowledge, etc. The
complexity of the knowledge extraction from text is caused by the specifics and variability of
language, the human brain works, the dynamics of thinking development.</p>
      <p>The part of tasks of substantial analysis of texts can be hardly formalized and described
and requires applying of mathematical tools of uncertainty, statistical methods and artificial
intelligence.</p>
      <p>The main technology of the quantitative approach is the data representation model -
Bidirectional Encoder Representations from Transformers (BERT), which has shown high efficiency
in solving a wide range of tasks [Ribeiro et al., 2020], and formed the basis of digital natural
language processing services. The BERT method is used in advanced technologies such as “Google
AI”, “Microsoft Azure Text Analysis”, “Amazon Comprehend”, “Facebook RoBERTa AI”, etc.</p>
      <p>The last researches in the field of NLP analysis have shown that this approach has a range
of significant shortcomings.</p>
      <p>The critical shortcomings of modern models of text processing based on the BERT method
were presented at one of the largest conference Association for Computational Linguistics
[Kolesnikova, 2016], [Ribeiro et al., 2020], dedicated to artificial intelligence development and
processing of computer texts, took part in 2020.</p>
      <p>The most important recommendations on improving text processing methods are defined in
the problems of development of grammatical and lexical text coherence, including the stability
of word combinations (collocation) in texts.</p>
      <p>The research area is the improvement of text representation models, procedures of the
digital analytical indexes formation and extraction of indicators, the development of algorithms
of linguistic analysis using artificial intelligence methods.</p>
      <p>The research aims to evaluate the effectiveness of the identification technology and clustering
subject field based on the quantitative approach using collocation algorithms and regression
decision trees.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Model of text representation</title>
      <p>Mathematical models using for text conversion allows characteristics extracting from
text data that can be represented as numeric parameters or indexes [Beel et al, 2017],
[Belinkov Bisk, 2018], [Wang Zhu, 2019]. Within the framework of the quantitative approach,
there were developed numerous models of text representation:
vector models
set-theoretic models.
the vector model,
the set-theoretic model,
Advanced computational models used in the computer industry of text processing will be
considered and compared further:
Despite the existence of quite a large number of approaches to text conversion, as well as their
modifications, all models we suggest to divide into two types:</p>
      <p>the author’s set-theoretic model with collocation.
2.1</p>
      <sec id="sec-2-1">
        <title>Vector model of text representation</title>
        <p>A vector text representation model is a mathematical model where each text’s object is
matched with a vector that can reflect different linguistics characteristics.</p>
        <p>The vector’s coordinates can be different text elements: individual words, concepts, noun
groups, sentences, semantic groups of sentences, paragraphs, so as word’s semantics: meaning
or fields of science. This model was proposed in the works of Salton [Salton et al, 1994] as an
alternative to lexical contextless indexing.</p>
        <p>Often vector model is called a thematic vector model because the basis of text class division
is rooted in a semantic word’s meaning. This meaning can characterise the field of science.</p>
        <p>The vector model of text representation proved its worth as it could diminish the main
disadvantages of frequency and theoretical models of data representation including the homonym
problems, so as the semantic meaning of sentences consideration problem.</p>
        <p>Because of the processing time problems, the vector model is mainly applied to small texts
processing.</p>
        <p>A significant disadvantage of vector model is the lack realization of structural characteristics
of isolating, agglutinating, and inflecting types of languages.</p>
        <p>We choose the “Word2Vec” library was chosen as the main tool for studying the vector
model of text representation, because of:
more than 40 languages, including Russian, support;
no need in supervised studying;
the using of the embedded model of replacing associative words, homonyms (Bag of Words).
2.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Set theoretic model of text representation</title>
        <p>Set-theoretic model supposes that every text consists from terms (word, n-grsam, sentences),
possessing common characteristics and unique traits. The main concept of the subject model
is the reflection of different text characteristics in relative indicators, to which mathematical
methods for identification of common and unique characteristics of each sample analysed text
are applied. At the heart of set-theoretic models the toolbox for frequency analysis, measures
and metric proximity (Dice, Ochiai, Jaccard, Simpson etc.) is used.</p>
        <p>As a metric of text converting into a set of numerical indicators, the interval similarity
coefficient of Jaccard was taken. This coefficient is the simplest to calculate, and its values are
equivalent in particular cases to other similarity metrics (Sorensen, Sokal-Snit).</p>
        <p>The algorithm of indicators calculating based on the similarity coefficient of Jaccard is
presented in detail in the work of R. Moulton [Moulton Jiang, 2018]. The generalized Jaccard
coefficient of comparing the proximity of two words A and B, is calculated by the formula:
K =</p>
        <p>n(A \ B))
n(A) + n(B) n(A \ B))))
(1)</p>
        <p>Similarity indexes can be calculated for words, n-gram words, sentences, etc. The freely
licensed Python library “Jaccard-index”, which is able to calculate the similarity index between
texts, is used to implement calculations of the Jaccard similarity index. In this paper a word
was chosen as the main unit of analysis. Set-theoretic model with collocation extraction.</p>
        <p>Following the recommendations of M. Ribeiro [Ribeiro et al., 2020], we set the task of
studying the impact on improving the accuracy of text classification not only in thematic aspects but
also of morphological features of words, as well as collocation between terms in the text.</p>
        <p>In this context, we developed the FaM software, which was described in details in
[Harish et al, 2012]. FaM uses the author’s algorithm for text representation as a
frequencymorphological set of indicators, considering collocations, and can be used to improve the
accuracy of classification in NLP purpose. The mathematical model of text representation with
collocation extractions considers texts only as interconnected sequences of terms. It is assumed
that taking into account sustainable links in phrases and the relationship between text elements
will create a more accurate model of text representation.</p>
        <p>In order to consider a collocation, FaM calculates a number of special indicators based on
the frequency of use of a sequence of words (n-grams) in the text that have certain characteristics.</p>
        <p>To consider this FaM’s feature, the author’s algorithm is used. It was implemented with
the help of several morphological libraries, which removes the function words and words that
were not in semantic connection with the sentence members when calculating n-gram sequences.
A normalized text is formed as a dataset, where each word is described as an object with its
features: part of speech and morphological characteristics. For each sequence of objects and
for each combination of their morphological characteristics, a separate frequency indicator is
calculated. This indicator is presented as a sequence occurrence counts of objects in a normalized
text, divided by the total number of objects.</p>
        <p>Thus, the set of n-gram indicators is determined by the type of natural language and by
the length of the n-sequence. The total set of extracted bigrams for the Russian language can
reach more than 200 indicators.</p>
        <p>A key factor in improving the efficiency of classification is the conversion of text into a
set of numerical indicators using frequency-morphological analysis. Morphological analysis is
performed by a special hybrid algorithm that uses two well-known modules for
morphological analysis: Natural language processing (AOT)[Fomin et al, 2018] and http://www.solarix.ru/
[Osochkin et al, 2020]. The author’s algorithm embedded in FaM allows you to use two libraries
simultaneously, allowing you to get information about the analyzed word, its semantic
relationship with other words in the sentence, and conduct morphological, syntactic, and frequency
analysis. The algorithm aimed to find a semantic connection conducts syntactic analysis, which
identifies parts of speech and functional words in a sentence and builds a syntactic tree. In
the next stages, the algorithm searches for words that are syntactically related to the subject
or predicate in the sentence and checks for semantic connections. The semantic relationship is
checked by synthesizing a new sentence without the analyzed word, building a new syntactic tree,
and analyzing nodes changes in the tree. If the context changes in the tree nodes associated with
the deleted word did not occur, the normalized text in the form of a dataset does not include
this word.</p>
        <p>Using the term collocation we focused on the concept of a stable semantically interconnected
binary phrase (sequence of bigrams) in the Russian academic texts.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Normalization and relevance of indicators</title>
      <p>Almost all intelligent text analysis packages perform preprocessing to normalize the received
data. Text preprocessing allows you to get more accurate and reliable data and a more detailed
description of the features of the text.</p>
      <p>The main procedure that allows you to significantly reduce the size of the vector space by
reducing the variation of words is the lemmatization procedure. The variance reduction also
has a positive effect on the vectors indexes, reducing the dimension of the vector space. The
NLTK4Russian library was chosen to texts lemmatizing [Moskvina et al, 2016]. Normalization
of data, received in the framework of the set-theoretic model, is carried out using the TF-IDF
technology, the Scikit-learn library [Roul et al., 2017].</p>
      <p>TFij indexes are defined as the frequency of word’s use in the analysed text, regarding the
total number of words in the text:</p>
      <p>T Fij =</p>
      <p>fij
f i1 + f i2 + ::: + f in
; i = 1; m
where TFij is the index for the j -th word in the i -th text, fij is the frequency of use of the
fj -th word in the i -th text, and fn is the n - th word in the i -th text.</p>
      <p>The TF-IDF method [Roul et al., 2017], [Salton et al, 1994] calculates the value of the j-th
term IDFij in the i-th text as the product of the frequency of term usage in the tfij document
and the normalized inverse frequency of term content in the documents.
(2)
(3)
IDFij = T Fij log</p>
      <p>; i = 1; m; j = 1; n
jDj</p>
      <p>Dfi
where D is the total number of documents in the collection. Dfi – the number of documents
in which the term fj occurs.</p>
      <p>This approach allows to determine the importance of the term in the entire collection of
analyzed documents. Terms with high uniqueness, which are less common in other documents,
and often occur in the analyzed document, have the highest value.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Artificial intelligence algorithms</title>
      <p>For tasks of parametric analysis, regression, classification, identification and knowledge
extraction, NLP uses an extensive toolkit of artificial intelligence, which uses machine learning
methods and algorithms (neural networks, genetic algorithms, metric algorithms, reference
vectors, decision trees, etc.). Based on the study of classification methods in the previous works
[Fomin et al, 2018], [Osochkin et al, 2020], [Osochkin et al, 2021] it was concluded that the use
of regression decision tree algorithms for identifying the style and gender of the author of literary
works was effective. The efficiency is due to obtaining higher classification accuracy when using
small text bodies, compared to neural networks and the support vector method. A significant
advantage of all methods of regression decision trees is the representation of results in the form
of a hierarchical set of logical rules “if-then”, which allows meaningful identification,
interpretation, verification of classification results; it impacts assessment and value significance of each
indicator. The variety of algorithms for constructing regression decision trees (Random Forest,
ID3, C4.5, C5.0, CRT, CHAID, etc.) allows you to use the full potential of statistical analysis
in the framework of a quantitative approach to natural language text processing. In this paper,
several algorithms were used for building decision trees in the IBM SPSS data analysis package
[Fomin et al, 2018].
Field of science
IT
History
Chemistry
Jurisprudence
Biology
Medicine
Pedagogy
Physics
Philosophy
Economics</p>
    </sec>
    <sec id="sec-5">
      <title>Research material</title>
      <p>The texts corpus is represented by various educational materials, divided into 10 fields of
sciences (clusters): IT, History, Chemistry, Jurisprudence, Biology, Medicine, Pedagogy, Physics,
Philosophy, Economics.</p>
      <p>Text materials are represented by various types of documents, including training manuals,
textbooks, lecture notes, abstracts, scientific articles, dissertations, dissertation abstracts, etc.
(Table 1).</p>
    </sec>
    <sec id="sec-6">
      <title>The experiment of the field of science classification</title>
      <p>The comparative experiments on the effectiveness of two classical methods of field of science
identification and the collocation method proposed by the authors were conducted.</p>
      <p>The task of the experiment is to classify the corpus of texts by field of sciences (without
taking into account the type of document). The calculated data is extracted using the previously
described text transformation models (vector, multiple, collocation).</p>
      <p>The “exhaustive CHAID” algorithm using the Gini coefficient was chosen as the main
algorithm for building the decision tree. The choice of this algorithm is due to the complexity
of classification by more than 10 clusters at the same time, high accuracy [Fomin et al, 2018],
[Kang Y. et al, 2020], [Yang et al, 2020] and a decrease in the tree dimension because of
nonbinary tree division algorithms.</p>
      <p>The ratio of the training and test samples is 50%, without observing the proportions of the
cluster dimension. The maximum tree depth is 10. Due to the small number of objects, the
number of texts that can be located in the father node for division into child nodes is 2 objects.
The Pierson Chi-square test is used to check the hypothesis of finding common characteristics.
Since all indicators are relative, the node split significance criteria are 0.005. We studied the
influence of the setting ”number minimum of objects in a node“ on the classification accuracy.</p>
      <p>Table 2 shows data on the experiments which set the minimum number of objects in the
node of the decision tree algorithm: from 50 to 10 with a decrease of 5.</p>
      <p>The accuracy of identification of the field of science is reflected based on the parameters of
three mathematical models of texts.
Minimum samples split
50
45
40
35
30
25
20
15
10</p>
      <p>This setting significantly affects the accuracy of the classification, due to the processing of
statistical outliers and the creation of the rules for a small number of unique texts.</p>
      <p>The text models obtained using the collocation method showed better overall classification
accuracy compared with the vector and set-theoretic text representation models. The minimum
difference in accuracy between the methods has been achieved with the algorithm setting to
split node if at least 10 objects have fallen into it and it is 2.49% higher than the vector text
representation model has and is 5.59% higher than the set-theoretic model has.</p>
      <p>The maximum difference in accuracy is 10,08% compared with vector model and 15,13%
compared with the set-theoretic model (with the algorithm setting to split node if at least 40
objects have fallen into it).</p>
      <p>The average accuracy using collocation method has become 6,51% higher than using the
vector model and 11,32% higher than using the set-theoretic text representation model. The
greatest number of mistakes were made when identifying texts related to the field of
“Jurisprudence”. The texts of Jurisprudence were included into the field of History, Philosophy and
Economics.</p>
      <p>This mistake in identifying the field of science is due to the specifics of jurisprudence, which
includes Roman law, civil law, international law, criminal law, tax code, etc. Due to this feature,
some texts were included in similar clusters that use common terminology. From the classification
results table, it can be also seen the tendency of increasing the accuracy of classification, with a
decrease in the number of texts required to split a node into children nodes.</p>
      <p>This tendency is due to the presence of statistical outliers, deviations in the content of texts,
as well as the detailing of individual groups of educational materials.</p>
      <p>Table 3 shows the detailed results of the classification using a mathematical model of text
representation based on the set-theoretic text representation with collocation.</p>
      <p>Table 4 shows the indicators and their values that were used by the algorithm of the
exhaustive CHIAD decision tree construction method.</p>
      <p>The results of the experiments indicate the effectiveness of the collocation method, which
was achieved through the use of more complex indicators, such as bigrams of parts of speech,
morphological features and syntactic characteristics.</p>
      <p>To evaluate the significance of these indicators, we also decided to conduct additional
researches with settings, where the best result was obtained (the minimum number of samples
required node is 10). Three experiments were conducted, with the removal of one of the
significant indicators from the general dataset. When removing the “Latin characters per sentence”
indicator, the overall accuracy decreased by 8,68%, to 89,52%. Table 5 shows the most significant
10 recalculated indicators.</p>
      <p>When removing the “Noun + Adjective” indicator, the overall accuracy decreased by 9,54%,
to 88,66%.</p>
      <p>Table 6 shows the 10 most significant indicators.</p>
      <p>When removing the indicator “Adverb + Adverb”, the overall accuracy decreased by 2,74%
to 95,46%. Table 7 shows the 10 recalculated most significant indicators.</p>
      <p>As a result of three experiments considering the removal of indicators with different
significance, the accuracy significantly decreased, which indicates the importance of using these
indicators when classifying texts by field of science.</p>
      <p>Three indicators include bigrams, the removal of which reduced the accuracy by from 2%
to 9%, and the CHAID algorithm itself replaced these indicators in the classification with other
bigrams. The extraction of indicators related to the use of parts of speech and their features from
the text made it possible to significantly increase the accuracy of classification when identifying
the subject field of educational material.</p>
      <p>Experiments have shown the advantage of the model with collocation extraction in
comparison with the two classical models. The obtained results indicate that the text representation
model based on the set-theoretic representation of the text with collocation is effective.</p>
    </sec>
    <sec id="sec-7">
      <title>Conclusions</title>
      <p>The use of a quantitative approach with collocation extraction allows to increase the
accuracy of the subject field identification. The experiment results of the subject field identification
accuracy evaluation confirmed the effectiveness of the proposed modification of the set-theoretic
model of text processing.</p>
      <p>Algorithms of frequency-morphological extraction of numerical indicators and the formation
of text indexes that reflect the frequency of individual parts of speech and n-gram parts of speech
use can be successfully used to identify the field of science. Experiments have confirmed an
increase in the total classification accuracy using collocation compared to the vector model of
text representation.</p>
      <p>Using the set-theoretic model with collocation extraction allows eliminating some of the
disadvantages of the BERT data representation model that were identified earlier. In conjunction
with the methods of regression decision trees, the potential of text mining can be expanded.
We also plan to conduct further experiments aimed to analyse the accuracy of identifying the
emotional colours of messages</p>
    </sec>
    <sec id="sec-8">
      <title>Acknowledgements</title>
      <p>The research was supported by the Ministry of Science and Higher Education of the Russian
Federation (project No. FSZN-2020-0027)
obrazovaniya i nauki [Text-minig experiments on the classification of texts in the
framework of the problems of personalization of the educational environment //
Informatization of education and science]. Vol. 2 (38). 2018. Pp. 38-50 (In Rus.)</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [Allahyari et al,
          <year>2017</year>
          ]
          <string-name>
            <surname>Allahyari</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pouriyeh</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Assefi</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Safaei</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Trippe</surname>
            <given-names>E. Mehdi A.</given-names>
          </string-name>
          , (
          <year>2017</year>
          )
          <article-title>A Brief Survey of Text Mining: Classification, Clustering and Extraction Techniques</article-title>
          .
          <source>Computer Science</source>
          ,
          <volume>260</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [Beel et al,
          <year>2017</year>
          ]
          <string-name>
            <given-names>Beel J.</given-names>
            ,
            <surname>Langer</surname>
          </string-name>
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Gipp</surname>
          </string-name>
          <string-name>
            <surname>B.</surname>
          </string-name>
          (
          <year>2017</year>
          )
          <article-title>TF-IDuF: A Novel Term-Weighting Scheme for User Modeling based on Users' Personal Document Collections</article-title>
          .
          <source>iConference Preliminary Results Papers</source>
          ,
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <given-names>[Belinkov</given-names>
            <surname>Bisk</surname>
          </string-name>
          ,
          <year>2018</year>
          ] Belinkov Y. Bisk
          <string-name>
            <surname>Y.</surname>
          </string-name>
          (
          <year>2018</year>
          )
          <article-title>Synthetic and natural noise both break neural machine translation</article-title>
          .
          <source>International Conference on Learning Representations</source>
          . URL: https://arxiv.org/abs/1711.02173
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <given-names>[Belinkov</given-names>
            <surname>Glass</surname>
          </string-name>
          ,
          <year>2019</year>
          ]
          <string-name>
            <surname>Belinkov</surname>
            <given-names>Y. Glass J</given-names>
          </string-name>
          . (
          <year>2019</year>
          )
          <article-title>Analysis methods in neural language processing: A survey. Transactions of the Association for Computational Linguistics</article-title>
          .
          <volume>7</volume>
          ,
          <fpage>49</fpage>
          -
          <lpage>72</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <given-names>[Devlin</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <year>2018</year>
          ]
          <string-name>
            <given-names>Devlin</given-names>
            <surname>J. Chang M-W (2018) Open Sourcing</surname>
          </string-name>
          <string-name>
            <surname>BERT</surname>
          </string-name>
          :
          <article-title>State-of-theArt Pre-training for Natural Language Processing</article-title>
          .
          <source>Google AI Language</source>
          . URL: https://ai.googleblog.com/
          <year>2018</year>
          /11/open-sourcing
          <article-title>-bert-state-of-art-pre</article-title>
          .html
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [Fomin et al,
          <year>2018</year>
          ]
          <string-name>
            <surname>Fomin</surname>
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pavlova</surname>
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Osochkin</surname>
            <given-names>A.</given-names>
          </string-name>
          (
          <year>2018</year>
          )
          <article-title>Eksperimenty text-minig po klassifikacii tekstov v ramkah zadach personalizacii obrazovatel'noj sredy// Informatizaciya</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>[Grekhov</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <year>2012</year>
          ]
          <string-name>
            <surname>Grekhov</surname>
            <given-names>A.</given-names>
          </string-name>
          (
          <year>2012</year>
          )
          <article-title>Kvantitativnyy metod: poisk latentnoy informatsii. Vestnik Nizhegorodskogo universiteta im</article-title>
          . Lobachevskogo. [
          <string-name>
            <surname>Grekhov</surname>
            <given-names>A.V.</given-names>
          </string-name>
          <article-title>Quantitative method: searching for latent information</article-title>
          . Vestnik of Lobachevsky State University of Nizhni Novgorod]
          <volume>1</volume>
          (
          <issue>3</issue>
          ),
          <fpage>94</fpage>
          -
          <lpage>100</lpage>
          . (In Rus.)
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [Harish et al,
          <year>2012</year>
          ]
          <string-name>
            <surname>Harish</surname>
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manjunath</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guru</surname>
            <given-names>D. S.</given-names>
          </string-name>
          (
          <year>2012</year>
          )
          <article-title>Text Document Classification: An Approach Based on Indexing</article-title>
          .
          <source>International Journal of Data Mining Knowledge Management Process</source>
          ,
          <volume>1</volume>
          ,
          <fpage>43</fpage>
          -
          <lpage>66</lpage>
          . DOI:
          <volume>10</volume>
          .5121/ijdkp.
          <year>2012</year>
          .2104
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <given-names>[Jadhao</given-names>
            <surname>Agrawal</surname>
          </string-name>
          ,
          <year>2016</year>
          ]
          <string-name>
            <surname>Jadhao</surname>
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Agrawal</surname>
            <given-names>A.</given-names>
          </string-name>
          (
          <year>2016</year>
          )
          <article-title>Text Categorization using Jaccard Coefficient for Text Messages</article-title>
          .
          <source>International Journal of Science and Research (IJSR)</source>
          ,
          <volume>5</volume>
          ,
          <fpage>2046</fpage>
          <string-name>
            <surname>-</surname>
          </string-name>
          <fpage>2050</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [Johnson, 2020]
          <string-name>
            <given-names>Johnson</given-names>
            <surname>Kh</surname>
          </string-name>
          . (
          <year>2020</year>
          )
          <article-title>AI researchers create testing tool to find bugs in NLP from Amazon, Google, and</article-title>
          <string-name>
            <surname>Microsoft. VB TRANSFORM</surname>
          </string-name>
          URL:https://venturebeat.com/
          <year>2020</year>
          /07/09/ai-researchers
          <article-title>-create-testing-tool-tofind-bugs-in-nlp-from-amazon-google-and-microsoft/</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <surname>[Kang</surname>
            <given-names>Y.</given-names>
          </string-name>
          et al,
          <year>2020</year>
          ]
          <string-name>
            <surname>Kang</surname>
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Cai</given-names>
            <surname>Zh</surname>
          </string-name>
          .,
          <string-name>
            <surname>Tan</surname>
            <given-names>Ch-W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huang</surname>
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            <given-names>H.</given-names>
          </string-name>
          (
          <year>2020</year>
          )
          <article-title>Natural language processing (NLP) in management research: A literature review</article-title>
          .
          <source>Journal of Management AnalyticsMay</source>
          ,
          <volume>7</volume>
          (
          <issue>12</issue>
          ),
          <fpage>1</fpage>
          -
          <lpage>34</lpage>
          pp.
          <source>DOI: 10.1080/23270012</source>
          .
          <year>2020</year>
          .1756939
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <source>[Kashcheyeva</source>
          , 2013]
          <string-name>
            <surname>Kashcheyeva</surname>
            <given-names>A.</given-names>
          </string-name>
          (
          <year>2013</year>
          )
          <article-title>Kvantitativnyye i kachestvennyye metody issledovaniya v prikladnoy lingvistike. Sotsial'no-ekonomicheskiye yavleniya i protsessy = Kascheyeva A.V. Quantitative and qualitative methods of research in applied linguistics</article-title>
          .
          <source>Socio-economic phenomena and processes]</source>
          ,
          <volume>3</volume>
          (
          <issue>49</issue>
          ),
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          . (In Rus.)
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [Khalezova et al,
          <year>2020</year>
          ]
          <string-name>
            <given-names>Khalezova N.</given-names>
            ,
            <surname>Piotrowska</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            ,
            <surname>Terbusheva</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            ,
            <surname>Piotrovskaya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            ,
            <surname>Neznanov</surname>
          </string-name>
          ,
          <string-name>
            <surname>N.</surname>
          </string-name>
          (
          <year>2020</year>
          )
          <article-title>Cross-sectional Study of Clinical and Psycholinguistic Characteristics of Mental Disorders in HIV Infection</article-title>
          . R.
          <article-title>Piotrowski's Readings in Language Engineering and Applied Linguistics (PRLEAL-</article-title>
          <year>2019</year>
          ).
          <source>Proceedings of the III International Conference on Language Engineering and Applied Linguistics. CEUR-WS</source>
          ,
          <volume>2552</volume>
          ,
          <fpage>161</fpage>
          -
          <lpage>178</lpage>
          URL:http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2552</volume>
          /Paper14.pdf
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <source>[Kolesnikova</source>
          , 2016]
          <string-name>
            <surname>Kolesnikova O.</surname>
          </string-name>
          (
          <year>2016</year>
          )
          <article-title>Survey of Word Co-occurrence Measures for Collocation Detection</article-title>
          . Comp. y Sist.
          <source>[online]</source>
          .
          <year>2016</year>
          ,
          <volume>20</volume>
          (
          <issue>3</issue>
          ),
          <fpage>327</fpage>
          -
          <lpage>344</lpage>
          . ISSN 1405-
          <fpage>5546</fpage>
          . https://arxiv.org/abs/
          <year>1809</year>
          .04052
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [Maheshan et al,
          <year>2018</year>
          ]
          <string-name>
            <surname>Maheshan</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Harish</surname>
            <given-names>B. S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Revanasiddappa</surname>
            <given-names>M. B.</given-names>
          </string-name>
          (
          <year>2018</year>
          )
          <article-title>IndexingBased Classification: An Approach Toward Classifying Text Documents Information Systems</article-title>
          .
          <source>Design and Intelligent Applications</source>
          ,
          <volume>1</volume>
          ,
          <fpage>894</fpage>
          -
          <lpage>902</lpage>
          . DOI:
          <volume>10</volume>
          .1007/
          <fpage>978</fpage>
          -981-10- 7512-488
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <source>[Marcus</source>
          , 1967]
          <string-name>
            <surname>Marcus</surname>
            <given-names>S.</given-names>
          </string-name>
          (
          <year>1967</year>
          )
          <article-title>Algebraic Linguistics; Analytical Models</article-title>
          . Academic Press, New York,
          <year>1967</year>
          , XIV +,
          <volume>254</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <string-name>
            <given-names>[Martin</given-names>
            <surname>Jurafsky</surname>
          </string-name>
          ,
          <year>2017</year>
          ]
          <string-name>
            <given-names>Martin</given-names>
            <surname>D. Jurafsky D.</surname>
          </string-name>
          (
          <year>2019</year>
          )
          <article-title>Speech</article-title>
          and
          <string-name>
            <given-names>Language</given-names>
            <surname>Processing</surname>
          </string-name>
          .
          <article-title>An introduction to natural language processing, computational linguistics, and speech recognition</article-title>
          .
          <source>Third Edition draft. 621</source>
          . URL: https://web.stanford.edu/ jurafsky/slp3/ed3book.pdf
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          <string-name>
            <surname>[McCann</surname>
          </string-name>
          et al,
          <year>2017</year>
          ] McCann
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Bradbury</surname>
          </string-name>
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Xiong</surname>
          </string-name>
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Socher</surname>
          </string-name>
          <string-name>
            <surname>R.</surname>
          </string-name>
          (
          <year>2017</year>
          )
          <article-title>Learned in translation: Contextualized word vectors</article-title>
          .
          <source>Advances in Neural Information Processing Systems</source>
          ,
          <volume>6294</volume>
          -
          <fpage>6305</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [Mohit et al,
          <year>2018</year>
          ]
          <string-name>
            <given-names>Mohit I.</given-names>
            ,
            <surname>Wieting</surname>
          </string-name>
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Gimpel</surname>
          </string-name>
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Zettlemoyer</surname>
          </string-name>
          <string-name>
            <surname>L.</surname>
          </string-name>
          (
          <year>2018</year>
          )
          <article-title>Adversarial example generation with syntactically controlled paraphrase networks</article-title>
          .
          <source>Proceedings of NAACLHLT</source>
          ,
          <year>1875</year>
          -
          <fpage>1885</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          <source>[Moschitt</source>
          , 2004]
          <string-name>
            <surname>Moschitt</surname>
            <given-names>A.</given-names>
          </string-name>
          (
          <year>2004</year>
          )
          <article-title>Complex Linguistic Features for Text Classification: a comprehensive study</article-title>
          .
          <source>Lecture Notes in Computer Science. 2б European Conference on IR Research</source>
          , Sunderland, UK,
          <fpage>181</fpage>
          -
          <lpage>196</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [Moskvina et al,
          <year>2016</year>
          ]
          <string-name>
            <surname>Moskvina</surname>
            <given-names>A. D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Orlova</surname>
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Panicheva</surname>
            <given-names>P. V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mitrofanova</surname>
            <given-names>O. A.</given-names>
          </string-name>
          (
          <year>2016</year>
          )
          <article-title>Development of a parser kernel for the Russian language based on NLTK libraries//Computer linguistics and computational ontologies</article-title>
          .
          <source>Works of the XIX International Joint Scientific Conference “Internet and Modern Society” (IMS-2016)</source>
          . - St. Petersburg. ITMO University. Page.
          <volume>44</volume>
          -
          <fpage>45</fpage>
          . http://openbooks.ifmo.ru/ru/file/4103/4103.pdf
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          <string-name>
            <given-names>[Moulton</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <year>2018</year>
          ]
          <string-name>
            <surname>Moulton R. Jiang</surname>
            <given-names>Y.</given-names>
          </string-name>
          (
          <year>2018</year>
          )
          <article-title>Maximally Consistent Sampling and the Jaccard Index of Probability Distributions</article-title>
          .
          <source>International Conference on Data Mining, Workshop on High Dimensional Data Mining</source>
          <year>2018</year>
          ,
          <fpage>347</fpage>
          -
          <lpage>356</lpage>
          . URL: https://arxiv.org/abs/
          <year>1809</year>
          .04052
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [Osochkin et al,
          <year>2020</year>
          <article-title>] Osochkin A</article-title>
          .,
          <string-name>
            <surname>Piotrowska</surname>
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fomin</surname>
            <given-names>V.</given-names>
          </string-name>
          (
          <year>2020</year>
          )
          <article-title>Comparative Research of Index Frequency - Morphological Methods of Automatic Text Summarisation</article-title>
          .
          <source>NESinMIS2020. Proceedings of the XV International Conference “New Educational Strategies in Modern Information Space”</source>
          ,
          <string-name>
            <surname>Saint-Petersburg</surname>
          </string-name>
          , Russia, March
          <volume>25</volume>
          ,
          <year>2020</year>
          . CEURWS, Vol-
          <volume>2401</volume>
          ,
          <fpage>73</fpage>
          -
          <lpage>86</lpage>
          . URL: http://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2630</volume>
          /paper8.pdfURL: http://ceurws.org/Vol-
          <volume>2630</volume>
          /paper8.pdf
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [Osochkin et al,
          <year>2021</year>
          <article-title>] Osochkin A</article-title>
          .,
          <string-name>
            <surname>Piotrowska</surname>
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fomin</surname>
            <given-names>V</given-names>
          </string-name>
          .
          <article-title>Automatic Identification of Authors' Stylistics and Gender on the Basis of the Corpus of Russian Fiction Using Extended Set-theoretic Model with Collocation Extraction /</article-title>
          / Glottometrics 50,
          <string-name>
            <surname>RAMVerlag</surname>
          </string-name>
          ,
          <year>2021</year>
          . Pp.
          <volume>76</volume>
          -
          <fpage>89</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          <string-name>
            <surname>[Piotrowska</surname>
            <given-names>X.</given-names>
          </string-name>
          ,
          <year>2005</year>
          ]
          <string-name>
            <surname>Piotrowska</surname>
            <given-names>X.</given-names>
          </string-name>
          , (
          <year>2005</year>
          )
          <article-title>Computer-assisted language learning. The quantitative-linguistic basis of CALL methods</article-title>
          . // Quantitative Linguistik / Quantitative Linguistics,
          <year>2005</year>
          :
          <fpage>897</fpage>
          -
          <lpage>908</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          <string-name>
            <surname>[Piotrowska</surname>
            <given-names>X.</given-names>
          </string-name>
          ,
          <year>2014</year>
          ]
          <string-name>
            <surname>Piotrowska</surname>
            <given-names>X.</given-names>
          </string-name>
          , (
          <year>2014</year>
          )
          <article-title>A Survey of Text mining</article-title>
          . Izvestia: Herzen University Journal of Humanities Sciences.
          <volume>168</volume>
          ,
          <fpage>128</fpage>
          -
          <lpage>134</lpage>
          . (In Rus.)
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [Ribeiro et al.,
          <year>2020</year>
          ]
          <string-name>
            <surname>Ribeiro</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tongshuang</surname>
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guestrin</surname>
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Singh</surname>
            <given-names>S.</given-names>
          </string-name>
          (
          <year>2020</year>
          )
          <article-title>Beyond Accuracy: Behavioral Testing of NLP Models with CheckList¿</article-title>
          ,
          <source>Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics</source>
          ,
          <fpage>4902</fpage>
          -
          <lpage>4912</lpage>
          URL: https://www.aclweb.org/anthology/2020.acl-main.
          <fpage>442</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [Roul et al.,
          <year>2017</year>
          ]
          <string-name>
            <surname>Roul</surname>
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sahoo</surname>
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kushagr</surname>
            <given-names>A.</given-names>
          </string-name>
          (
          <year>2017</year>
          )
          <article-title>Modified TF-IDF Term Weighting Strategies for Text Categorization</article-title>
          .
          <source>Proceedings of 14th IEEE India Council International Conference (INDICON)</source>
          ,
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [Salton et al,
          <year>1994</year>
          ]
          <string-name>
            <given-names>Salton G.</given-names>
            ,
            <surname>Allan</surname>
          </string-name>
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Buckley</surname>
          </string-name>
          <string-name>
            <surname>C.</surname>
          </string-name>
          (
          <year>1994</year>
          )
          <article-title>Automatic structuring and retrieval of large text files</article-title>
          .
          <source>Communications of the ACM</source>
          ,
          <volume>37</volume>
          (
          <issue>2</issue>
          ),
          <fpage>97</fpage>
          -
          <lpage>108</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          <string-name>
            <given-names>[Wang</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <year>2019</year>
          ]
          <string-name>
            <surname>Wang</surname>
            <given-names>Y. Zhu L.</given-names>
          </string-name>
          (
          <year>2019</year>
          )
          <article-title>Research on improved text classification method based on combined weighted model</article-title>
          .
          <source>National Natural Science Foundation of China</source>
          ,
          <volume>7</volume>
          (
          <issue>11</issue>
          ),
          <fpage>783</fpage>
          -
          <lpage>796</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [Yang et al,
          <year>2020</year>
          ]
          <string-name>
            <given-names>Yang</given-names>
            <surname>Zh</surname>
          </string-name>
          .,
          <string-name>
            <surname>Dai</surname>
            <given-names>Zi.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            <given-names>Y.</given-names>
          </string-name>
          , Carbonell J.,
          <string-name>
            <surname>Salakhutdinov</surname>
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Quoc</surname>
            <given-names>Q.</given-names>
          </string-name>
          (
          <year>2020</year>
          )
          <article-title>XLNet: Generalized Autoregressive Pretraining for Language Understanding</article-title>
          .
          <source>Proceedings of Advances in Neural Information Processing Systems 32 (NIPS</source>
          <year>2019</year>
          )
          <article-title>URL</article-title>
          : https://arxiv.org/abs/
          <year>1906</year>
          .08237
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>