<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article">
 <front>
  <journal-meta>
   <journal-id journal-id-type="publisher-id">
    sm
   </journal-id>
   <journal-title-group>
    <journal-title>
     Sociology Mind
    </journal-title>
   </journal-title-group>
   <issn pub-type="epub">
    2160-083X
   </issn>
   <issn publication-format="print">
    2160-0848
   </issn>
   <publisher>
    <publisher-name>
     Scientific Research Publishing
    </publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="doi">
    10.4236/sm.2025.153011
   </article-id>
   <article-id pub-id-type="publisher-id">
    sm-144424
   </article-id>
   <article-categories>
    <subj-group subj-group-type="heading">
     <subject>
      Articles
     </subject>
    </subj-group>
    <subj-group subj-group-type="Discipline-v2">
     <subject>
      Social Sciences 
     </subject>
     <subject>
       Humanities
     </subject>
    </subj-group>
   </article-categories>
   <title-group>
    Searching for “Counter Text” as a Way to Solve the Problem
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Alexander A.
      </surname>
      <given-names>
       Kharlamov
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff1"> 
      <sup>1</sup>
     </xref> 
     <xref ref-type="aff" rid="aff2"> 
      <sup>2</sup>
     </xref> 
     <xref ref-type="aff" rid="aff3"> 
      <sup>3</sup>
     </xref> 
     <xref ref-type="aff" rid="aff4"> 
      <sup>4</sup>
     </xref>
    </contrib>
   </contrib-group> 
   <aff id="aff1">
    <addr-line>
     aLaboratory of Neuroontogenesis, Institute of Higher Nervous Activity and Neurophysiology of RAS, Moscow, Russia
    </addr-line> 
   </aff> 
   <aff id="aff2">
    <addr-line>
     aDepartment of Intellectual Informational Systems and Technologies of Moscow Institute of Physics and Technology, Moscow, Russia
    </addr-line> 
   </aff> 
   <aff id="aff3">
    <addr-line>
     aDepartment of Program Engineering of Higher School of Economics University, Moscow, Russia
    </addr-line> 
   </aff> 
   <aff id="aff4">
    <addr-line>
     aDepartment of Applied and Experimental Linguistics, Moscow State Linguistic University, Moscow, Russia
    </addr-line> 
   </aff> 
   <pub-date pub-type="epub">
    <day>
     07
    </day> 
    <month>
     07
    </month>
    <year>
     2025
    </year>
   </pub-date> 
   <volume>
    15
   </volume> 
   <issue>
    03
   </issue>
   <fpage>
    185
   </fpage>
   <lpage>
    198
   </lpage>
   <history>
    <date date-type="received">
     <day>
      3,
     </day>
     <month>
      June
     </month>
     <year>
      2025
     </year>
    </date>
    <date date-type="published">
     <day>
      27,
     </day>
     <month>
      June
     </month>
     <year>
      2025
     </year> 
    </date> 
    <date date-type="accepted">
     <day>
      27,
     </day>
     <month>
      July
     </month>
     <year>
      2025
     </year> 
    </date>
   </history>
   <permissions>
    <copyright-statement>
     © Copyright 2014 by authors and Scientific Research Publishing Inc. 
    </copyright-statement>
    <copyright-year>
     2014
    </copyright-year>
    <license>
     <license-p>
      This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/
     </license-p>
    </license>
   </permissions>
   <abstract>
    Problem solving is an example of purposeful behavior that boils down to searching for a description of a chain of situations that lead to a target situation from the current situation in internal or external sources, or to synthesize such a chain if it is not found in the annals. To do this, we need to find a (counter) text, the semantic network of which includes both the current situation and the target situation (and so that these two situations are related to each other in the semantic network of this text), and then the semantic network of this (counter) text bridges (closes the “gap” between) the two original situations—the current situation and the target one, thereby offering the solution to the original problem. Algorithmically searching for counter text comes down to the formation of semantic networks of candidate texts, which contain chains of nodes, including nodes that in the subsequent projection onto the hippocampal situation models, and then onto the anterior cortex, can be considered as those establishing the connection between the current and target situations. For using the TextAnalyst technology, we can solve the problem of constructing a homogeneous directed weighted semantic network where the desired chain can be found.
   </abstract>
   <kwd-group> 
    <kwd>
     Purposeful Behavior
    </kwd> 
    <kwd>
      Chain of Situations
    </kwd> 
    <kwd>
      Current Situation
    </kwd> 
    <kwd>
      Target Situation
    </kwd> 
    <kwd>
      Homogeneous Directed Weighted Semantic Network
    </kwd> 
    <kwd>
      TextAnalyst Technology
    </kwd>
   </kwd-group>
  </article-meta>
 </front>
 <body>
  <sec id="s1">
   <title>1. Introduction</title>
   <p>The purpose of the work is to solve the problem “Solving the problem”. Problem solving is an example of purposeful behavior that boils down to searching for a description of a chain of situations that lead to a target situation from the current situation in internal or external sources, or to synthesizing such a chain if it is not found in the annals.</p>
   <p>Searching for a description of a chain of situations to achieve the target situation from the current situation is an urgent task (see for example, “ORGANIZING AND CONDUCTING PR CAMPAIGNS IN THE FIELD OF PUBLIC RELATIONS” <xref ref-type="bibr" rid="scirp.144424-https://studfile.net/preview/9349408/">
     https://studfile.net/preview/9349408/
    </xref>).</p>
   <p>
    <xref ref-type="bibr" rid="scirp.144424-"></xref>There are currently no automatic (algorithmic) solutions to identify a chain of situations (<xref ref-type="bibr" rid="scirp.144424-9">
     Kotseruba &amp; Tsotsos, 2020
    </xref>). Existing cognitive architectures implement particular (automatic) algorithms at all language levels, from morphological analysis to semantic analysis of single sentences of a text—see (<xref ref-type="bibr" rid="scirp.144424-9">
     Kotseruba &amp; Tsotsos, 2020
    </xref> Section 11.2.5). Texts in their entirety are not automatically analyzed from the point of view of semantics now. The author has proposed an algorithm (implemented in TextAnalyst technology (<xref ref-type="bibr" rid="scirp.144424-#HYPERLINK  l R08">
     Kharlamov, 2025
    </xref>)) for the automatic construction of the semantic network of the whole text as a set of semantic networks of individual sentences of the text, where semantic repetitions are excluded from the aggregate network.</p>
   <p>In the current work, we proposed an algorithm for finding a chain of situations from the “counter text” that closes the missing part of the chain from the current situation to the target situation. The algorithm for the automatic construction of the semantic network of an individual text and the text corpus, implemented in TextAnalyst, where individual situations (the scene of the beginning of the situation, the scene of the continuation of the situation, the scene of the end of the situation) are represented by chains of sentences of the text, can be used to identify this missing link.</p>
   <p>As an example of solving the problem, let’s consider the harvest in the traditional Russian fairy tale “Turnip”. The full text of the fairy tale is given below.</p>
   <p>The Turnip’s Tale (original) Grandfather planted a turnip. A big, big turnip has grown. Grandpa went to pick a turnip: he pulled and pulled, he couldn’t pull it out! The grandfather called the grandmother: the grandmother for the grandfather, the grandfather for the turnip—they pulled and pulled, they could not pull it out! The grandmother called her granddaughter: the granddaughter for the grandmother, the grandmother for the grandfather, the grandfather for the turnip—they pulled and pulled, they could not pull it out! The granddaughter called Zhuchka: Bug for granddaughter, granddaughter for grandmother, grandmother for grandfather, grandfather for turnip—they pull and pull, they can’t pull it out! The Bug called the cat: the cat for the Bug, the Bug for the granddaughter, the granddaughter for the grandmother, the grandmother for the grandfather, the grandfather for the turnip—they pull and pull, they can’t pull it out! The cat called the mouse: the mouse for the cat, the cat for the Bug, the Bug for the granddaughter, the granddaughter for the grandmother, the grandmother for the grandfather, the grandfather for the turnip—pull, pull, pull—pull the turnip!</p>
   <p>In a fairy tale, the goal situation is achieved: “pulled the turnip” out of the current situation: “pull-pull”. As a source text, let’s take the first part of the fairy tale: “Grandfather planted a turnip. A big, big turnip has grown. Grandpa went to pick a turnip: he pulled and pulled, he couldn’t pull it out! The grandfather called the grandmother: the grandmother for the grandfather, the grandfather for the turnip—they pulled and pulled, they could not pull it out! The grandmother called her granddaughter: the granddaughter for the grandmother, the grandmother for the grandfather, the grandfather for the turnip—they pulled and pulled, they could not pull it out! The granddaughter called Zhuchka: Bug for granddaughter, granddaughter for grandmother, grandmother for grandfather, grandfather for turnip—they pull and pull, they can’t pull it out! The Beetle called the cat: the cat for the Beetle, the Bug for the granddaughter, the granddaughter for the grandmother, the grandmother for the grandfather, the grandfather for the turnip—they pull and pull, they can’t pull it out!”</p>
   <p>The counter text will be the rest of the text: “The cat called the mouse: the mouse for the cat, the cat for the Beetle, the Beetle for the granddaughter, the granddaughter for the grandmother, the grandmother for the grandfather, the grandfather for the turnip—pull, pulled the turnip!”</p>
   <p>Empirical evidence to support the findings of the study is currently lacking, as neuroscience research is currently more or less confident only in the first (or last) stages of processing specific (e.g., language—(<xref ref-type="bibr" rid="scirp.144424-4">
     Khanna, Muñoz, Kim, Kfir, Paulk, Jamali et al., 2024
    </xref>)) information in the brain. More complex stages of processing (for example, semantic (<xref ref-type="bibr" rid="scirp.144424-3">
     Jamali, Grannan, Cai, Khanna, Muñoz, Caprara et al., 2024
    </xref>)) encounter significant ambiguity in information processing in the brains of different individuals, depending on different psychological types of individuals, and different traces of information processing in the brains of different people.</p>
   <p>Let’s consider the search for a description of a chain of situations for achieving the target situation from the current situation. Let us consider in more detail the formulation of the problem when the desired solution is sought in the form of a text obtained from internal or external sources that describes the problem being solved. The statement of the problem solving using solutions already available in external sources was common already fifty years ago, when the first information retrieval systems were created (<xref ref-type="bibr" rid="scirp.144424-10">
     Leontyeva, 2006
    </xref>). Theoretically, the solution was narrowed down to searching for the so-called “counter text” (the concept “counter text” was introduced by N.N. Leontyeva (<xref ref-type="bibr" rid="scirp.144424-10">
     Leontyeva, 2006
    </xref>)).</p>
   <p>Definition. Given a current situation and a target situation, a text that contains a chain of situations that ensures the transition from the current situation to the target situation is called a counter text.</p>
   <p>It should be noted that counter text can be considered both a language text and a quasi-text of a quasi-language.</p>
   <p>Problem statement. Let us formally consider the statement of the problem of finding a counter text: we need to find a text that contains a chain of situations leading from the current situation to the target one and describing the solution to the problem. For that end, we try using a directed homogeneous semantic network of the so-called “counter” text (<xref ref-type="bibr" rid="scirp.144424-6">
     Kharlamov, 2023a
    </xref>). To do this, we need to find a (counter) text, the semantic network of which includes both the current situation and the target situation (and so that these two situations are related to each other in the semantic network of this text), and then the semantic network of this (counter) text bridges (closes the “gap” between) the two original situations—the current situation and the target one, thereby offering the solution to the original problem.</p>
   <p>This statement of the problem can be extended to the case of quasi-texts, when the current and target situations are described not in terms of the language text, but in terms of the representation of these situations in extra-linguistic (multimodal—extralinguistic) reality—in terms of the quasi-text (for example, in terms of a video sequence). Any non-linguistic (extralinguistic) quasi-text can also be considered as the initial structure for forming a semantic network (<xref ref-type="bibr" rid="scirp.144424-5">
     Kharlamov, 2017
    </xref>). And then the term “text” is replaced with the term “quasi-text” in the previous steps, while the problem-solving process proceeds analogously.</p>
   <p>Let us formally describe the process of searching for a chain to the target situation from the current one in the semantic network of the counter text. We formalize this representation in terms of homogeneous directed weighted semantic networks (<xref ref-type="bibr" rid="scirp.144424-6">
     Kharlamov, 2023a
    </xref>).</p>
  </sec><sec id="s2">
   <title>2. Purposeful Behavior as a Way to Solve a Problem</title>
   <sec id="s2_1">
    <title>2.1. Planning Purposeful Behavior</title>
    <p>The search for a chain of situations from the current situation to the target one is the result of planning purposeful behavior. Planning purposeful behavior is a procedure for choosing a path (chain of events) on the hierarchy of representations of motor actions, which is realized in the anterior (motor) cortex of the human brain, where a hierarchy of levels of dictionaries is represented that reflect varying degrees of generality of fragments of motor behavior. This chain is constructed by fitting (for example, by means of fuzzy logic (<xref ref-type="bibr" rid="scirp.144424-2">
      Borisov &amp; Kharlamov, 2023
     </xref>)) a chain of situations, from the current situation to the target one 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           I 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mn>
          1 
        </mn> 
       </msub> 
      </mrow> 
     </math> and 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           I 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mrow> 
         <mi>
           f 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           n 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> (which is selected in the hierarchy of representations of the motor—i.e. anterior-cortex), by projecting into the representation of situations on the world model presented in the lamellae of the hippocampus (<xref ref-type="bibr" rid="scirp.144424-6">
      Kharlamov, 2023a
     </xref>) from the template of the current situation to the template of the target situation 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          S 
        </mi> 
        <mn>
          1 
        </mn> 
       </msub> 
      </mrow> 
     </math> and 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          S 
        </mi> 
        <mrow> 
         <mi>
           f 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           n 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math>; and then projecting the representation of the combinatorics of objects and events (represented within the templates of situations in the hippocampal world model) into the world model of the sensory cortex, represented in the columns of the sensory cortex containing representations of the objects and events themselves (<xref ref-type="bibr" rid="scirp.144424-6">
      Kharlamov, 2023a
     </xref>) 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           S 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mn>
          1 
        </mn> 
       </msub> 
      </mrow> 
     </math> and 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           S 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mrow> 
         <mi>
           f 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           n 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math>, see <xref ref-type="fig" rid="fig1(A)">
      Figure 1(A)
     </xref>. The cap above the symbol indicates the so called trajectory in the multidimensional space modeled by the cortex column (see formula (1) in Section 2.1) in which the dictionary is formed.</p>
    <fig id="fig1" position="float">
     <label>Figure 1</label>
     <caption>
      <title>Figure 1. (A) Planning purposeful behavior. Identification of a pair of events 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <msub> 
   
          <mover accent="true"> 
    
           <mi>
            
     I
    
           </mi> 
    
           <mo>
            
     ^
    
           </mo> 
   
          </mover> 
   
          <mn>
           
    1
   
          </mn> 
  
         </msub> 
 
        </mrow>

       </math> and 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <msub> 
   
          <mover accent="true"> 
    
           <mi>
            
     I
    
           </mi> 
    
           <mo>
            
     ^
    
           </mo> 
   
          </mover> 
   
          <mrow> 
    
           <mi>
            
     f
    
           </mi>
    
           <mi>
            
     i
    
           </mi>
    
           <mi>
            
     n
    
           </mi>
   
          </mrow> 
  
         </msub> 
 
        </mrow>

       </math> represented on the world model formed in the anterior (motor) cortex, which is projected onto the templates of situations 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <msub> 
   
          <mi>
           
    S
   
          </mi> 
   
          <mn>
           
    1
   
          </mn> 
  
         </msub> 
 
        </mrow>

       </math> and 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <msub> 
   
          <mi>
           
    S
   
          </mi> 
   
          <mrow> 
    
           <mi>
            
     f
    
           </mi>
    
           <mi>
            
     i
    
           </mi>
    
           <mi>
            
     n
    
           </mi>
   
          </mrow> 
  
         </msub> 
 
        </mrow>

       </math> in the hippocampus and then onto the images of events and objects 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <msub> 
   
          <mover accent="true"> 
    
           <mi>
            
     S
    
           </mi> 
    
           <mo>
            
     ^
    
           </mo> 
   
          </mover> 
   
          <mn>
           
    1
   
          </mn> 
  
         </msub> 
 
        </mrow>

       </math> and 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <msub> 
   
          <mover accent="true"> 
    
           <mi>
            
     S
    
           </mi> 
    
           <mo>
            
     ^
    
           </mo> 
   
          </mover> 
   
          <mrow> 
    
           <mi>
            
     f
    
           </mi>
    
           <mi>
            
     i
    
           </mi>
    
           <mi>
            
     n
    
           </mi>
   
          </mrow> 
  
         </msub> 
 
        </mrow>

       </math>, represented in the columns of the sensory (posterior) cortex. (B) Implementing purposeful behavior. Search for a “counter” text containing the current and target situations 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <msub> 
   
          <mover accent="true"> 
    
           <mi>
            
     S
    
           </mi> 
    
           <mo>
            
     ^
    
           </mo> 
   
          </mover> 
   
          <mn>
           
    1
   
          </mn> 
  
         </msub> 
 
        </mrow>

       </math> and 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <msub> 
   
          <mover accent="true"> 
    
           <mi>
            
     S
    
           </mi> 
    
           <mo>
            
     ^
    
           </mo> 
   
          </mover> 
   
          <mrow> 
    
           <mi>
            
     f
    
           </mi>
    
           <mi>
            
     i
    
           </mi>
    
           <mi>
            
     n
    
           </mi>
   
          </mrow> 
  
         </msub> 
 
        </mrow>

       </math>, projection of this text onto the templates of situations 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <msub> 
   
          <mi>
           
    S
   
          </mi> 
   
          <mn>
           
    1
   
          </mn> 
  
         </msub> 
 
        </mrow>

       </math> and 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <msub> 
   
          <mi>
           
    S
   
          </mi> 
   
          <mrow> 
    
           <mi>
            
     f
    
           </mi>
    
           <mi>
            
     i
    
           </mi>
    
           <mi>
            
     n
    
           </mi>
   
          </mrow> 
  
         </msub> 
 
        </mrow>

       </math> stored in one or more lamellae of the hippocampus, and then projection of these situations into the anterior cortex, where it is assumed that, with the help of this chain of situations, the pair of initial events 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <msub> 
   
          <mover accent="true"> 
    
           <mi>
            
     I
    
           </mi> 
    
           <mo>
            
     ^
    
           </mo> 
   
          </mover> 
   
          <mn>
           
    1
   
          </mn> 
  
         </msub> 
 
        </mrow>

       </math> and 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <msub> 
   
          <mover accent="true"> 
    
           <mi>
            
     I
    
           </mi> 
    
           <mo>
            
     ^
    
           </mo> 
   
          </mover> 
   
          <mrow> 
    
           <mi>
            
     f
    
           </mi>
    
           <mi>
            
     i
    
           </mi>
    
           <mi>
            
     n
    
           </mi>
   
          </mrow> 
  
         </msub> 
 
        </mrow>

       </math> fin will be bridged.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/3800895-rId27.jpeg?20250730090640" />
    </fig>
   </sec>
   <sec id="s2_2">
    <title>2.2. Implementing Purposeful Behavior</title>
    <p>This purposeful behavior (see <xref ref-type="fig" rid="fig1(B)">
      Figure 1(B)
     </xref>) is implemented in the reverse order: searching for a counter text, followed by identifying, within the semantic network of this text, a chain of situations from the current situation to the target one 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           S 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mn>
          1 
        </mn> 
       </msub> 
      </mrow> 
     </math> and 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           S 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mrow> 
         <mi>
           f 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           n 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math>, respectively, identifying a chain of suitable templates of situations 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          S 
        </mi> 
        <mn>
          1 
        </mn> 
       </msub> 
      </mrow> 
     </math> and 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          S 
        </mi> 
        <mrow> 
         <mi>
           f 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           n 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> from the current situation to the target one in the lamellae of the hippocampus, and finally—identifying appropriate actions in the hierarchy of the anterior (motor) cortex bridge the original pair of events 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           I 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mn>
          1 
        </mn> 
       </msub> 
      </mrow> 
     </math> and 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           I 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mrow> 
         <mi>
           f 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           n 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math>, which originated all these processes.</p>
    <p>A set of pairs of word root stems (since we are considering the example of the language part of the world model), presented in the dictionaries (see <xref ref-type="fig" rid="fig2">
      Figure 2
     </xref>) of the upper (semantic) level of the hierarchy of representations in the columns of the sensory cortex, which is obtained during the processing of a particular text, that is, a semantic network (homogeneous, directed, with weighted vertices and connections (<xref ref-type="bibr" rid="scirp.144424-6">
      Kharlamov, 2023a
     </xref>)) is virtually united into a semantic network of the t-th text, 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           M 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mi>
          t 
        </mi> 
       </msub> 
      </mrow> 
     </math>. On this semantic network, the desired pair of situations is sought: 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           S 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mn>
          1 
        </mn> 
       </msub> 
      </mrow> 
     </math> and 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           S 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mrow> 
         <mi>
           f 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           n 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math>. This pair in the lamellae of the hippocampus corresponds to a pair of situations 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          S 
        </mi> 
        <mn>
          1 
        </mn> 
       </msub> 
       <mtext> 
       </mtext> 
      </mrow> 
     </math>and 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          S 
        </mi> 
        <mrow> 
         <mi>
           f 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           n 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math>, which are the beginning and end of the desired chain of situations. Next, in the anterior cortex, the names of 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           I 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mn>
          1 
        </mn> 
       </msub> 
      </mrow> 
     </math> and 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           I 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mrow> 
         <mi>
           f 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           n 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> are sought, corresponding to the beginning and target of this chain of situations.</p>
    <fig id="fig2" position="float">
     <label>Figure 2</label>
     <caption>
      <title>Figure 2. Hierarchy of dictionaries of level-forming elements of various levels of various modalities, in the case of a language hierarchy from the phonemes level to the level of pairwise compatibility of word root stems in the text—premissible compatibility (semantics).</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/3800895-rId78.jpeg?20250730090640" />
    </fig>
    <p>The code sequence corresponding to the analyzed text forms a dictionary 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            { 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              B 
            </mi> 
            <mi>
              i 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            } 
          </mo> 
         </mrow> 
        </mrow> 
        <mn>
          1 
        </mn> 
       </msub> 
      </mrow> 
     </math> of the most frequently repeated fragments of the sounding text at the first level in the cortex, that is, phonemes.</p>
    <p>At the next level of processing (let us call it morphological), a dictionary of the morphological level 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            { 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              B 
            </mi> 
            <mi>
              j 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            } 
          </mo> 
         </mrow> 
        </mrow> 
        <mn>
          2 
        </mn> 
       </msub> 
      </mrow> 
     </math> is formed that characterizes the most frequently encountered units of the text, that is, inflectional morphemes. At the next (lexical) level, dictionaries of word root stems 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            { 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              B 
            </mi> 
            <mi>
              k 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            } 
          </mo> 
         </mrow> 
        </mrow> 
        <mn>
          3 
        </mn> 
       </msub> 
      </mrow> 
     </math> are presented. The syntactic level presents a dictionary of syntaxemes, which are an inflectional structure of successive pairs of words of the text with cuts instead of word stems 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            { 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              B 
            </mi> 
            <mi>
              l 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            } 
          </mo> 
         </mrow> 
        </mrow> 
        <mn>
          4 
        </mn> 
       </msub> 
      </mrow> 
     </math>. Here, when forming syntactic sequences, at the input of the word stem level, elements of the morphological level are filtered from the input texts that connect word stems into more complex images—pairs of root stems for successive pairs of words in the text. At the output of this level, only a sequence of pairwise combined root stems of words 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            { 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              B 
            </mi> 
            <mi>
              m 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            } 
          </mo> 
         </mrow> 
        </mrow> 
        <mn>
          5 
        </mn> 
       </msub> 
      </mrow> 
     </math> remains in the so called “syntactic” sequence—a sequence of connections of filtered elements of the bottom level (see formulae (3) of section 3.1).</p>
    <p>Weighing of nodes is a separate procedure, see formula (6), which takes into account the depth of connections of individual nodes on this semantic network – see section 4.2.</p>
    <p>Thus, one can talk about multi-level structural processing of information in the columns of the cortex.</p>
    <p>Similar to the hierarchy of dictionaries of level-forming elements of language, one can consider hierarchies of level-forming elements of quasi-language, for example, in the visual modality. The top level of this hierarchy corresponds to the semantic network of the extralinguistic world model, and these two semantic networks (linguistic and extralinguistic) represent the world in the same way (at least in their core part), that is, their core parts are isomorphic (“mapped one-to-one and onto”).</p>
    <p>From these chains, a chain is selected that optimally matches the individual’s world model.</p>
   </sec>
   <sec id="s2_3">
    <title>2.3. Formation of a Counter Quasi-Text as a Result of Purposeful Behavior</title>
    <p>We have considered purposeful behavior in the context of searching for “counter text”. However, such a counter text may not necessarily be a language text: the counter text sought may also be a quasi-text in an extralinguistic representation. In this case, the order of planning and implementing purposeful behavior is completely preserved, however, quasi-texts of the corresponding modalities are used instead of texts; in the hippocampus, the processes occur in both hippocampal dominant and subdominant parts; and in both the sensory and anterior cortex, the model is presented in both the dominant and subdominant hemispheres, since in fact, with the exception of special cases, purposeful behavior is always mixed (with the participation of linguistic and extralinguistic representations in both the cortex and the hippocampus).</p>
   </sec>
  </sec><sec id="s3">
   <title>3. Text Analysis as the Formation of a Chain of Situations—A Procedure for Solving a Problem</title>
   <p>Then the solution to the original problem can be approached as a search for a chain of situations from the current situation 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mover accent="true"> 
        <mi>
          S 
        </mi> 
        <mo>
          ^ 
        </mo> 
       </mover> 
       <mn>
         1 
       </mn> 
      </msub> 
     </mrow> 
    </math> to the target situation 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mover accent="true"> 
        <mi>
          S 
        </mi> 
        <mo>
          ^ 
        </mo> 
       </mover> 
       <mrow> 
        <mi>
          f 
        </mi> 
        <mi>
          i 
        </mi> 
        <mi>
          n 
        </mi> 
       </mrow> 
      </msub> 
     </mrow> 
    </math>, which represents a solution to this original problem. Let us consider the procedure for planning purposeful behavior using the example of selecting a text describing purposeful behavior to solve the original problem of achieving the target situation from the current one. This procedure boils down to searching for a text where this chain of situations already exists. In this case, it is not important where this text is located, in the internal base or in the external one.</p>
   <sec id="s3_1">
    <title>3.1. Constructing a Semantic Network of Text</title>
    <p>The text search procedure is reduced to searching for a text that contains the desired chain. The search for such a text can be shown on the example of forming a semantic network of text in the TextAnalyst program (<xref ref-type="bibr" rid="scirp.144424-7">
      Kharlamov, 2023b
     </xref>; <xref ref-type="bibr" rid="scirp.144424-8">
      Kharlamov, 2025
     </xref>). The TextAnalyst program solves the problem of constructing a homogeneous directed weighted semantic network where the desired chain can be found. Constructing a semantic network of text involves implementing several steps:</p>
    <p>1) Removal of non-textual information form the text.</p>
    <p>2) Removal of redundant information from the text.</p>
    <p>3) Splitting the text into tokens and sentences.</p>
    <p>4) Counting the frequency of occurrence for tokens and token pairs.</p>
    <p>5) Developing a primary network.</p>
    <p>6) Calculating the semantic ranks of network nodes.</p>
    <p>Removal of non-textual information form the text. It is necessary to remove information that is not involved in the formation of the semantic network: this means removal of non-textual information, that is, pictures, diagrams; replacing numbers with words; decoding abbreviations and acronyms.</p>
    <p>Removal of redundant information from the text. Pronouns, prepositions and articles are removed from the text. Since a homogeneous semantic network is constructed based on the text, verbs are no longer in demand as all relations in the representations of text sentences are replaced by an associative type of connection (to be close to each other in the text).</p>
    <p>Splitting the text into tokens and sentences. Since it is necessary to identify individual units of text when constructing a network, it is split into tokens. To identify the degree of coherence of words included in the text, it is split into pairs of words within individual sentences.</p>
    <p>Counting the frequency of occurrence for tokens and token pairs. To further calculate the ranks of network nodes and the values of the weights of word connections in the network, the frequency of occurrence for tokens and token pairs is counted in the primary network.</p>
    <p>Forming a primary network. From the remaining (not removed during preprocessing) words of the text, a primary directed homogeneous semantic network is constructed, the nodes of which and the connections between the nodes are weighted by the calculated frequencies of occurrence.</p>
    <p>Calculating the semantic ranks of network nodes. Finally, the weight characteristics of words are replaced by semantic ranks: the weight characteristics of network nodes are recalculated. Those nodes that are connected in the network with a large number of nodes with a large weight increase their weight to the detriment of the weights of other nodes, see formula (6).</p>
   </sec>
   <sec id="s3_2">
    <title>3.2. Identifying a Chain of Situations—A Plan of Purposeful Behavior</title>
    <p>This procedure is implemented for all candidate texts. As a result, in the obtained semantic networks of texts, chains of nodes are identified from the node describing the current situation 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           S 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mn>
          1 
        </mn> 
       </msub> 
      </mrow> 
     </math> to the node describing the target situation 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           S 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mrow> 
         <mi>
           f 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           n 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math>. Of these texts, one is selected where the obtained chain is more effective than the others: shorter, having a greater weight, or selected according to some other criteria.</p>
    <p>Since both the counter text and the counter quasi-text are structures that allow solving the problem (as in this case both the text and the quasi-text are transformed into semantic networks (<xref ref-type="bibr" rid="scirp.144424-5">
      Kharlamov, 2017
     </xref>), in one case linguistic, in the other case extralinguistic, which both describe the world in which a person lives), it turns out to be insignificant in which modality the problem is solved. In the human world model, both linguistic and non-linguistic descriptions of the world are presented in the form of semantic networks. These descriptions are isomorphic: what is in one description is also in the other. Therefore, the problem posed can be solved in any of the modalities by obtaining a text (quasi-text) that forms a chain of situations from the current situation to the target one. Therefore, we can further consider the solution to the problem on the example of using the language text.</p>
    <p>A counter text of a natural language (quasi-text) can be searched for in three ways. 1) Search in the internal database of texts (quasi-texts), which are available as a result of accumulated life experience. 2) Search in the external database of texts (quasi-texts). 3) Formation of such a text (quasi-text), if there is no suitable text in either the internal or external databases.</p>
    <p>The search procedure includes (<xref ref-type="bibr" rid="scirp.144424-7">
      Kharlamov, 2023b
     </xref>) comparison of texts, classification of texts and selection of relevant texts. Formation of a counter text not available in the internal and external databases turns out to be a significantly more complex procedure, since it is associated with the generation of texts describing the solution of problems in specific subject domains. Formation of such behavior is an example of creative behavior and is beyond the scope of this work. Moreover, at the present, neither an implementation, nor even a description of this procedure exists (at least for artificial systems).</p>
    <p>As a historical anecdote, the generation of a counter-text for solving a specific problem can be illustrated by Isaac Newton’s formulation of the law of universal gravitation. The story of Newton sitting under an apple tree heavy with ripe fruits and being struck by a falling apple represents a counter-quasi-text that allowed him to bridge the gap and complete the solution to the problem of formulating his famous law.</p>
   </sec>
  </sec><sec id="s4">
   <title>4. Related Works. World Model as a Basis for the Implementation of Purposeful Behavior</title>
   <p>Algorithmically, the sensory level of searching for counter text comes down to the formation of semantic networks of candidate texts, which contain chains of nodes, including nodes that in the subsequent projection onto the hippocampal situation models, and then onto the anterior cortex, can be considered as those establishing the connection between the current and target situations.</p>
   <p>Let us consider the processes of planning and implementing purposeful behavior in more detail: how the semantic network of text is formed in the sensory cortex; what happens in the lamellae of the hippocampus when selecting situation templates; and how all this interacts with representations in the anterior cortex. After this, we need to reconsider the same processes again, but already in the context of searching for counter quasi-text.</p>
   <sec id="s4_1">
    <title>4.1. Human World Model. Sensory Level</title>
    <p>The sensory level of purposeful behavior is based on the world model presented in the sensory cortex. The world model in the sensory cortex is formed as a set of hierarchies of dictionaries of various modalities (see <xref ref-type="fig" rid="fig2">
      Figure 2
     </xref>), which at the top level of the hierarchies are combined into two semantic networks – linguistic and extralinguistic (<xref ref-type="bibr" rid="scirp.144424-7">
      Kharlamov, 2023b
     </xref>).</p>
    <p>Let us demonstrate this, as usually, on the example of linguistic behavior, which is currently formalized within the subject domain of “Linguistics” quite well (<xref ref-type="bibr" rid="scirp.144424-7">
      Kharlamov, 2023b
     </xref>). The language world model is a hierarchy of dictionaries of level-forming elements of language (see <xref ref-type="fig" rid="fig2">
      Figure 2
     </xref>) from phonemes (for sounding text) to the level of permissible pairwise compatibility of dictionary words (semantic level), which can be represented by a directed weighted semantic network.</p>
    <p>The hierarchy of level representations is formed as a result of the structural analysis of input sensory sequences 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mi>
          A 
        </mi> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math> (<xref ref-type="bibr" rid="scirp.144424-7">
      Kharlamov, 2023b
     </xref>). In this case, the input code sensory sequences are displayed (see formula (1)) in the columns of the cortex by pyramidal neurons of the 3<sup>rd</sup> layer of the cortex as neurons with temporal summation of signals in trajectories in a multidimensional space, which (trajectories) are repeatedly traversed in the presence of repeating fragments in the input text, thereby forming dictionaries (see formula (2)) of these level-forming elements in the learning process.</p>
    <p>Let 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mi>
          A 
        </mi> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math> denote the set of code sequences formed by the signal periphery of analyzers, the elements of which are the symbols that make up the codes of the input sequences 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         A 
       </mi> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            a 
          </mi> 
          <mrow> 
           <mo>
             − 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            a 
          </mi> 
          <mn>
            0 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            a 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            a 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>. Hereinafter, for simplicity, we will consider everything on the example of processing binary sequences. In the binary case, 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          a 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         ∈ 
       </mo> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mrow> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math>. As such a sequence, we can, for example, take the read over text of L. N. Tolstoy’s novel “War and Peace”, encoded with a binary code.</p>
    <p>Let 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mover accent="true"> 
         <mi>
           A 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math> denote the set of trajectories of sequences corresponding to the set of input sequences 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mi>
          A 
        </mi> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, the elements of which 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           a 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mi>
          i 
        </mi> 
       </msub> 
      </mrow> 
     </math> are points of the space 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msup> 
        <mi>
          R 
        </mi> 
        <mi>
          n 
        </mi> 
       </msup> 
      </mrow> 
     </math>, i.e. nodes of the unit hypercube 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           a 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         ∈ 
       </mo> 
       <msubsup> 
        <mi>
          G 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          n 
        </mi> 
       </msubsup> 
      </mrow> 
     </math>, where 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           a 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            a 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mo>
             − 
           </mo> 
           <mi>
             n 
           </mi> 
           <mo>
             + 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            a 
          </mi> 
          <mrow> 
           <mi>
             i 
           </mi> 
           <mo>
             − 
           </mo> 
           <mi>
             n 
           </mi> 
           <mo>
             + 
           </mo> 
           <mn>
             2 
           </mn> 
          </mrow> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            a 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> are successive fragments of length n of sequence A symbols, shifted relative to each other by one symbol (by one time unit) – coordinates of points in the multidimensional space 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msup> 
        <mi>
          R 
        </mi> 
        <mi>
          n 
        </mi> 
       </msup> 
      </mrow> 
     </math> (due to the binarity of the representation – nodes of the unit hypercube 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          G 
        </mi> 
        <mi>
          e 
        </mi> 
        <mi>
          n 
        </mi> 
       </msubsup> 
      </mrow> 
     </math>). Then:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          F 
        </mi> 
        <mi>
          n 
        </mi> 
       </msub> 
       <mo>
         : 
       </mo> 
       <mi>
         A 
       </mi> 
       <mo>
         → 
       </mo> 
       <mover accent="true"> 
        <mi>
          A 
        </mi> 
        <mo>
          ^ 
        </mo> 
       </mover> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mi>
          F 
        </mi> 
        <mi>
          n 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          A 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mover accent="true"> 
        <mi>
          A 
        </mi> 
        <mo>
          ^ 
        </mo> 
       </mover> 
       <mo>
         , 
       </mo> 
      </mrow> 
     </math> (1)</p>
    <p>where 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         A 
       </mi> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            a 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           : 
         </mo> 
         <msub> 
          <mi>
            a 
          </mi> 
          <mi>
            i 
          </mi> 
         </msub> 
         <mo>
           ∈ 
         </mo> 
         <mrow> 
          <mo>
            { 
          </mo> 
          <mrow> 
           <mn>
             0 
           </mn> 
           <mo>
             , 
           </mo> 
           <mn>
             1 
           </mn> 
          </mrow> 
          <mo>
            } 
          </mo> 
         </mrow> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, а</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mtable> 
       <mtr> 
        <mtd> 
         <mover accent="true"> 
          <mi>
            A 
          </mi> 
          <mo>
            ^ 
          </mo> 
         </mover> 
         <mo>
           = 
         </mo> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mo>
             ⋯ 
           </mo> 
           <mo>
             , 
           </mo> 
           <msub> 
            <mover accent="true"> 
             <mi>
               a 
             </mi> 
             <mo>
               ^ 
             </mo> 
            </mover> 
            <mrow> 
             <mo>
               − 
             </mo> 
             <mn>
               2 
             </mn> 
            </mrow> 
           </msub> 
           <mo>
             , 
           </mo> 
           <msub> 
            <mover accent="true"> 
             <mi>
               a 
             </mi> 
             <mo>
               ^ 
             </mo> 
            </mover> 
            <mrow> 
             <mo>
               − 
             </mo> 
             <mn>
               1 
             </mn> 
            </mrow> 
           </msub> 
           <mo>
             , 
           </mo> 
           <mo>
             ⋯ 
           </mo> 
           <mo>
             , 
           </mo> 
           <msub> 
            <mover accent="true"> 
             <mi>
               a 
             </mi> 
             <mo>
               ^ 
             </mo> 
            </mover> 
            <mi>
              i 
            </mi> 
           </msub> 
           <mo>
             , 
           </mo> 
           <mo>
             ⋯ 
           </mo> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mtd> 
       </mtr> 
       <mtr> 
        <mtd> 
         <mo>
           = 
         </mo> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mo>
             ⋯ 
           </mo> 
           <mo>
             , 
           </mo> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                a 
              </mi> 
              <mrow> 
               <mo>
                 − 
               </mo> 
               <mi>
                 n 
               </mi> 
               <mo>
                 − 
               </mo> 
               <mn>
                 1 
               </mn> 
              </mrow> 
             </msub> 
             <mo>
               , 
             </mo> 
             <msub> 
              <mi>
                a 
              </mi> 
              <mrow> 
               <mo>
                 − 
               </mo> 
               <mi>
                 n 
               </mi> 
              </mrow> 
             </msub> 
             <mo>
               , 
             </mo> 
             <mo>
               ⋯ 
             </mo> 
             <mo>
               , 
             </mo> 
             <msub> 
              <mi>
                a 
              </mi> 
              <mrow> 
               <mo>
                 − 
               </mo> 
               <mn>
                 2 
               </mn> 
              </mrow> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <mo>
             , 
           </mo> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                a 
              </mi> 
              <mrow> 
               <mo>
                 − 
               </mo> 
               <mi>
                 n 
               </mi> 
              </mrow> 
             </msub> 
             <mo>
               , 
             </mo> 
             <msub> 
              <mi>
                a 
              </mi> 
              <mrow> 
               <mo>
                 − 
               </mo> 
               <mi>
                 n 
               </mi> 
               <mo>
                 + 
               </mo> 
               <mn>
                 1 
               </mn> 
              </mrow> 
             </msub> 
             <mo>
               , 
             </mo> 
             <mo>
               ⋯ 
             </mo> 
             <mo>
               , 
             </mo> 
             <msub> 
              <mi>
                a 
              </mi> 
              <mrow> 
               <mo>
                 − 
               </mo> 
               <mn>
                 1 
               </mn> 
              </mrow> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <mo>
             , 
           </mo> 
           <mo>
             ⋯ 
           </mo> 
           <mo>
             , 
           </mo> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                a 
              </mi> 
              <mrow> 
               <mi>
                 i 
               </mi> 
               <mo>
                 − 
               </mo> 
               <mi>
                 n 
               </mi> 
               <mo>
                 + 
               </mo> 
               <mn>
                 1 
               </mn> 
              </mrow> 
             </msub> 
             <mo>
               , 
             </mo> 
             <msub> 
              <mi>
                a 
              </mi> 
              <mrow> 
               <mi>
                 i 
               </mi> 
               <mo>
                 − 
               </mo> 
               <mi>
                 n 
               </mi> 
               <mo>
                 + 
               </mo> 
               <mn>
                 2 
               </mn> 
              </mrow> 
             </msub> 
             <mo>
               , 
             </mo> 
             <mo>
               ⋯ 
             </mo> 
             <mo>
               , 
             </mo> 
             <msub> 
              <mi>
                a 
              </mi> 
              <mi>
                i 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <mo>
             , 
           </mo> 
           <mo>
             ⋯ 
           </mo> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           . 
         </mo> 
        </mtd> 
       </mtr> 
      </mtable> 
     </math></p>
    <p>The dictionary as a set of repetitions of fragments of input sensory sequences is formed from a set of sequences 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            { 
          </mo> 
          <mi>
            A 
          </mi> 
          <mo>
            } 
          </mo> 
         </mrow> 
        </mrow> 
        <mi>
          k 
        </mi> 
       </msub> 
      </mrow> 
     </math>, in each of which, using the transformation 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          H 
        </mi> 
        <mi>
          h 
        </mi> 
       </msub> 
       <mi>
         R 
       </mi> 
       <mi>
         M 
       </mi> 
       <msub> 
        <mi>
          F 
        </mi> 
        <mi>
          n 
        </mi> 
       </msub> 
      </mrow> 
     </math> (mapping sequences of class 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            { 
          </mo> 
          <mi>
            A 
          </mi> 
          <mo>
            } 
          </mo> 
         </mrow> 
        </mrow> 
        <mi>
          k 
        </mi> 
       </msub> 
      </mrow> 
     </math> into an n -dimensional space and applying a threshold transformation to them), subsequences 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          B 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
      </mrow> 
     </math> ∁ 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          A 
        </mi> 
        <mi>
          k 
        </mi> 
       </msub> 
      </mrow> 
     </math> included in it at least h times are selected. Thus, the transformation 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          H 
        </mi> 
        <mi>
          h 
        </mi> 
       </msub> 
       <mi>
         R 
       </mi> 
       <mi>
         M 
       </mi> 
       <msub> 
        <mi>
          F 
        </mi> 
        <mi>
          n 
        </mi> 
       </msub> 
      </mrow> 
     </math> when interacting with the input set 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            { 
          </mo> 
          <mi>
            A 
          </mi> 
          <mo>
            } 
          </mo> 
         </mrow> 
        </mrow> 
        <mrow> 
         <msub> 
          <mi>
            k 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> in the space of a given dimension restores the dictionary 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            { 
          </mo> 
          <mover accent="true"> 
           <mi>
             B 
           </mi> 
           <mo>
             ^ 
           </mo> 
          </mover> 
          <mo>
            } 
          </mo> 
         </mrow> 
        </mrow> 
        <mrow> 
         <msub> 
          <mi>
            k 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> of subsequences 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          B 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
      </mrow> 
     </math> included in the trajectories of the input set:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            { 
          </mo> 
          <mrow> 
           <msub> 
            <mover accent="true"> 
             <mi>
               B 
             </mi> 
             <mo>
               ^ 
             </mo> 
            </mover> 
            <mi>
              i 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            } 
          </mo> 
         </mrow> 
        </mrow> 
        <mrow> 
         <msub> 
          <mi>
            k 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          H 
        </mi> 
        <mi>
          h 
        </mi> 
       </msub> 
       <mi>
         R 
       </mi> 
       <mi>
         M 
       </mi> 
       <msub> 
        <mi>
          F 
        </mi> 
        <mi>
          n 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mrow> 
           <mrow> 
            <mo>
              { 
            </mo> 
            <mi>
              A 
            </mi> 
            <mo>
              } 
            </mo> 
           </mrow> 
          </mrow> 
          <mrow> 
           <msub> 
            <mi>
              k 
            </mi> 
            <mn>
              1 
            </mn> 
           </msub> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         . 
       </mo> 
      </mrow> 
     </math> (2)</p>
    <p>The resultant dictionary functions as a filter, identifying the connections of words of the lower level dictionary within the input code sequences (3).</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          F 
        </mi> 
        <mrow> 
         <mi>
           n 
         </mi> 
         <mo>
           , 
         </mo> 
         <mi>
           C 
         </mi> 
        </mrow> 
        <mrow> 
         <mo>
           − 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
       </msubsup> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mover accent="true"> 
          <mi>
            A 
          </mi> 
          <mo>
            ˜ 
          </mo> 
         </mover> 
         <mo>
           , 
         </mo> 
         <mrow> 
          <mo>
            { 
          </mo> 
          <mrow> 
           <msub> 
            <mover accent="true"> 
             <mi>
               B 
             </mi> 
             <mo>
               ^ 
             </mo> 
            </mover> 
            <mi>
              j 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            } 
          </mo> 
         </mrow> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mi>
         C 
       </mi> 
       <mo>
         , 
       </mo> 
      </mrow> 
     </math> (3)</p>
    <p>where 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         C 
       </mi> 
       <mo>
         = 
       </mo> 
       <msup> 
        <mrow> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mtable> 
            <mtr> 
             <mtd> 
              <mrow> 
               <msub> 
                <mover accent="true"> 
                 <mi>
                   a 
                 </mi> 
                 <mo>
                   ˜ 
                 </mo> 
                </mover> 
                <mi>
                  i 
                </mi> 
               </msub> 
               <mo>
                 | 
               </mo> 
               <msub> 
                <mover accent="true"> 
                 <mover accent="true"> 
                  <mi>
                    a 
                  </mi> 
                  <mo>
                    ˜ 
                  </mo> 
                 </mover> 
                 <mo>
                   ^ 
                 </mo> 
                </mover> 
                <mi>
                  i 
                </mi> 
               </msub> 
               <mo>
                 ≠ 
               </mo> 
               <msub> 
                <mover accent="true"> 
                 <mi>
                   b 
                 </mi> 
                 <mo>
                   ^ 
                 </mo> 
                </mover> 
                <mi>
                  j 
                </mi> 
               </msub> 
              </mrow> 
             </mtd> 
             <mtd> 
              <mrow> 
               <mn>
                 0 
               </mn> 
               <mo>
                 | 
               </mo> 
               <msub> 
                <mover accent="true"> 
                 <mover accent="true"> 
                  <mi>
                    a 
                  </mi> 
                  <mo>
                    ˜ 
                  </mo> 
                 </mover> 
                 <mo>
                   ^ 
                 </mo> 
                </mover> 
                <mi>
                  i 
                </mi> 
               </msub> 
               <mo>
                 = 
               </mo> 
               <msub> 
                <mover accent="true"> 
                 <mi>
                   b 
                 </mi> 
                 <mo>
                   ^ 
                 </mo> 
                </mover> 
                <mi>
                  j 
                </mi> 
               </msub> 
              </mrow> 
             </mtd> 
            </mtr> 
           </mtable> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
        <mtext>
          T 
        </mtext> 
       </msup> 
      </mrow> 
     </math>, here, 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           a 
         </mi> 
         <mo>
           ˜ 
         </mo> 
        </mover> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         ∈ 
       </mo> 
       <mover accent="true"> 
        <mi>
          A 
        </mi> 
        <mo>
          ^ 
        </mo> 
       </mover> 
      </mrow> 
     </math> и 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mover accent="true"> 
          <mi>
            a 
          </mi> 
          <mo>
            ˜ 
          </mo> 
         </mover> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mo>
         ∈ 
       </mo> 
       <mover accent="true"> 
        <mover accent="true"> 
         <mi>
           A 
         </mi> 
         <mo>
           ˜ 
         </mo> 
        </mover> 
        <mo>
          ^ 
        </mo> 
       </mover> 
      </mrow> 
     </math>, а 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           b 
         </mi> 
         <mo>
           ˜ 
         </mo> 
        </mover> 
        <mi>
          j 
        </mi> 
       </msub> 
       <mo>
         ∈ 
       </mo> 
       <mover accent="true"> 
        <mi>
          B 
        </mi> 
        <mo>
          ^ 
        </mo> 
       </mover> 
      </mrow> 
     </math> и 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mover accent="true"> 
          <mi>
            b 
          </mi> 
          <mo>
            ˜ 
          </mo> 
         </mover> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mi>
          j 
        </mi> 
       </msub> 
       <mo>
         ∈ 
       </mo> 
       <mover accent="true"> 
        <mover accent="true"> 
         <mi>
           B 
         </mi> 
         <mo>
           ˜ 
         </mo> 
        </mover> 
        <mo>
          ^ 
        </mo> 
       </mover> 
      </mrow> 
     </math>.</p>
    <p>The so-called “syntactic” sequences obtained as a result of filtering form the dictionary of the next level (see <xref ref-type="fig" rid="fig3">
      Figure 3
     </xref>).</p>
    <fig id="fig3" position="float">
     <label>Figure 3</label>
     <caption>
      <title>Figure 3. Standard element of a multi-level hierarchical structure.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/3800895-rId159.jpeg?20250730090642" />
    </fig>
    <p>All of this taken together can be represented as a hierarchy of dictionaries of level-forming elements of language of various levels of complexity (see <xref ref-type="fig" rid="fig2">
      Figure 2
     </xref>).</p>
   </sec>
   <sec id="s4_2">
    <title>4.2. World Model. Hippocampus Level</title>
    <p>The world model in terms of level-forming elements represented in the columns of the sensory cortex represents the modeled world virtually (see <xref ref-type="fig" rid="fig2">
      Figure 2
     </xref>): pairs of root stems of the top-level words of the language model and pairs of images of objects and events of the top-level extralinguistic model are combined into language and extralinguistic networks, which are essentially semantic: pairs of events of the extralinguistic network characterize the permissible compatibility of objects and events of the modeled world, as do pairs of root stems of the language network that describe them. These objects and events (and the root stems that describe them) are used to form models of the next stratum of representations formed and stored in the lamellae of the hippocampus as combinations of images of these objects and events (and, in the dominant hippocampus, of words that describe them). These hippocampal models are models of scene templates (sequences of scenes—beginning-continuation-end—describe complete situations).</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mover accent="true"> 
        <mi>
          F 
        </mi> 
        <mo>
          ^ 
        </mo> 
       </mover> 
       <mo>
         = 
       </mo> 
       <mo>
         ∗ 
       </mo> 
       <msub> 
        <mrow> 
         <mover accent="true"> 
          <mrow> 
           <mi>
             S 
           </mi> 
           <mi>
             f 
           </mi> 
          </mrow> 
          <mo stretchy="true">
            ^ 
          </mo> 
         </mover> 
        </mrow> 
        <mi>
          p 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mover accent="true"> 
         <mi>
           f 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mn>
          1 
        </mn> 
       </msub> 
       <mo>
         ∗ 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mo>
           ∗ 
         </mo> 
         <msub> 
          <mrow> 
           <mover accent="true"> 
            <mrow> 
             <mi>
               S 
             </mi> 
             <mi>
               f 
             </mi> 
            </mrow> 
            <mo stretchy="true">
              ^ 
            </mo> 
           </mover> 
          </mrow> 
          <mi>
            p 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mover accent="true"> 
        <mi>
          I 
        </mi> 
        <mo>
          ^ 
        </mo> 
       </mover> 
       <mo>
         ∗ 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mo>
           ∗ 
         </mo> 
         <msub> 
          <mrow> 
           <mover accent="true"> 
            <mrow> 
             <mi>
               S 
             </mi> 
             <mi>
               f 
             </mi> 
            </mrow> 
            <mo stretchy="true">
              ^ 
            </mo> 
           </mover> 
          </mrow> 
          <mi>
            p 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         , 
       </mo> 
      </mrow> 
     </math> (4)</p>
    <p>where 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mrow> 
         <mover accent="true"> 
          <mrow> 
           <mi>
             S 
           </mi> 
           <mi>
             f 
           </mi> 
          </mrow> 
          <mo stretchy="true">
            ^ 
          </mo> 
         </mover> 
        </mrow> 
        <mi>
          p 
        </mi> 
       </msub> 
      </mrow> 
     </math> can be conventionally referred to as a subframe, where 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mover accent="true"> 
       <mi>
         I 
       </mi> 
       <mo>
         ^ 
       </mo> 
      </mover> 
     </math> is the name of the frame (e.g., a word in one of the modalities). The subframe 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mover accent="true"> 
        <mrow> 
         <mi>
           S 
         </mi> 
         <mi>
           f 
         </mi> 
        </mrow> 
        <mo stretchy="true">
          ^ 
        </mo> 
       </mover> 
      </mrow> 
     </math> can be represented as a union of the frame components, where 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mrow> 
         <mrow> 
          <mo>
            [ 
          </mo> 
          <mo>
            ∗ 
          </mo> 
          <mo>
            ] 
          </mo> 
         </mrow> 
        </mrow> 
        <mi>
          i 
        </mi> 
       </msub> 
      </mrow> 
     </math> is the concatenation by sequential index i:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mtable> 
       <mtr> 
        <mtd> 
         <mover accent="true"> 
          <mrow> 
           <mi>
             S 
           </mi> 
           <mi>
             f 
           </mi> 
          </mrow> 
          <mo stretchy="true">
            ^ 
          </mo> 
         </mover> 
         <mo>
           = 
         </mo> 
         <mstyle displaystyle="true"> 
          <msub> 
           <mo>
             ∪ 
           </mo> 
           <mi>
             m 
           </mi> 
          </msub> 
          <mrow> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <msub> 
              <mover accent="true"> 
               <mi>
                 f 
               </mi> 
               <mo>
                 ^ 
               </mo> 
              </mover> 
              <mi>
                m 
              </mi> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
         </mstyle> 
         <mo>
           = 
         </mo> 
         <mstyle displaystyle="true"> 
          <msub> 
           <mo>
             ∪ 
           </mo> 
           <mi>
             m 
           </mi> 
          </msub> 
          <mrow> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <mo>
               ∗ 
             </mo> 
             <msub> 
              <mover accent="true"> 
               <mi>
                 A 
               </mi> 
               <mo>
                 ^ 
               </mo> 
              </mover> 
              <mrow> 
               <mi>
                 i 
               </mi> 
               <mi>
                 j 
               </mi> 
               <mi>
                 K 
               </mi> 
               <mi>
                 m 
               </mi> 
              </mrow> 
             </msub> 
             <msub> 
              <mstyle displaystyle="true" mathsize="140%"> 
               <mi>
                 V 
               </mi> 
              </mstyle> 
              <mrow> 
               <mi>
                 i 
               </mi> 
               <mi>
                 j 
               </mi> 
               <mi>
                 k 
               </mi> 
               <mo>
                 &lt; 
               </mo> 
               <mi>
                 K 
               </mi> 
              </mrow> 
             </msub> 
             <mtext>
                 
             </mtext> 
             <msub> 
              <mover accent="true"> 
               <mi>
                 A 
               </mi> 
               <mo>
                 ^ 
               </mo> 
              </mover> 
              <mrow> 
               <mi>
                 i 
               </mi> 
               <mi>
                 j 
               </mi> 
               <mi>
                 k 
               </mi> 
               <mi>
                 m 
               </mi> 
              </mrow> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
         </mstyle> 
        </mtd> 
       </mtr> 
       <mtr> 
        <mtd> 
         <mo>
           = 
         </mo> 
         <mstyle displaystyle="true"> 
          <msub> 
           <mo>
             ∪ 
           </mo> 
           <mi>
             m 
           </mi> 
          </msub> 
          <mrow> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mrow> 
             <mo>
               ∗ 
             </mo> 
             <msub> 
              <mover accent="true"> 
               <mi>
                 A 
               </mi> 
               <mo>
                 ^ 
               </mo> 
              </mover> 
              <mrow> 
               <mi>
                 i 
               </mi> 
               <mi>
                 j 
               </mi> 
               <mi>
                 K 
               </mi> 
               <mi>
                 m 
               </mi> 
              </mrow> 
             </msub> 
             <msub> 
              <mstyle displaystyle="true" mathsize="140%"> 
               <mi>
                 V 
               </mi> 
              </mstyle> 
              <mrow> 
               <mi>
                 i 
               </mi> 
               <mi>
                 j 
               </mi> 
               <mi>
                 k 
               </mi> 
               <mo>
                 &lt; 
               </mo> 
               <mi>
                 K 
               </mi> 
              </mrow> 
             </msub> 
             <mtext>
                 
             </mtext> 
             <msub> 
              <mover accent="true"> 
               <mi>
                 A 
               </mi> 
               <mo>
                 ^ 
               </mo> 
              </mover> 
              <mrow> 
               <mi>
                 i 
               </mi> 
               <mi>
                 j 
               </mi> 
               <mi>
                 k 
               </mi> 
               <mi>
                 m 
               </mi> 
              </mrow> 
             </msub> 
            </mrow> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
         </mstyle> 
         <mo>
           = 
         </mo> 
         <msub> 
          <mover accent="true"> 
           <mi>
             f 
           </mi> 
           <mo>
             ^ 
           </mo> 
          </mover> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mo>
           ∪ 
         </mo> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mstyle displaystyle="true"> 
            <msub> 
             <mo>
               ∪ 
             </mo> 
             <mrow> 
              <mi>
                m 
              </mi> 
              <mo>
                ≠ 
              </mo> 
              <mn>
                1 
              </mn> 
             </mrow> 
            </msub> 
            <mrow> 
             <msub> 
              <mover accent="true"> 
               <mi>
                 f 
               </mi> 
               <mo>
                 ^ 
               </mo> 
              </mover> 
              <mi>
                m 
              </mi> 
             </msub> 
            </mrow> 
           </mstyle> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           , 
         </mo> 
        </mtd> 
       </mtr> 
      </mtable> 
     </math> (5)</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           f 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mi>
          m 
        </mi> 
       </msub> 
      </mrow> 
     </math> is a frame component: 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           f 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mi>
          m 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mover accent="true"> 
         <mi>
           A 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           j 
         </mi> 
         <mi>
           K 
         </mi> 
         <mi>
           m 
         </mi> 
        </mrow> 
       </msub> 
       <mtext>
           
       </mtext> 
       <mi>
         V 
       </mi> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mover accent="true"> 
         <mi>
           A 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           j 
         </mi> 
         <mi>
           k 
         </mi> 
         <mi>
           m 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math>, where 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mover accent="true"> 
         <mi>
           A 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           j 
         </mi> 
         <mi>
           k 
         </mi> 
         <mi>
           m 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> are chains on the graph, and 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        V 
      </mi> 
     </math> represents inclusion in its place into the words of a higher level dictionary.</p>
    <p>According to biologists (<xref ref-type="bibr" rid="scirp.144424-11">
      Rolls, 1990
     </xref>), these models represent the contents of the memory of the CA<sub>3</sub> fields of the hippocampal lamellae, which are modeled by Hopfield artificial neural networks (<xref ref-type="fig" rid="fig4">
      Figure 4
     </xref>): with each lamella representing a separate situation.</p>
    <fig id="fig4" position="float">
     <label>Figure 4</label>
     <caption>
      <title>Figure 4. Architecture of the hippocampus according to Rolls (<xref ref-type="bibr" rid="scirp.144424-11">
        Rolls, 1990
       </xref>).</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/3800895-rId180.jpeg?20250730090642" />
    </fig>
    <p>The scene model stored in the associative memory of the Hopfield network of the hippocampal lamella represents a combinatorics of images of events and objects that are part of the situation (more precisely, indices of their representations in the columns of the sensory cortex (<xref ref-type="bibr" rid="scirp.144424-1">
      Bekhtereva, 1978
     </xref>)), as well as phrases of the language that describe them (where words are also represented as indices of their storage in the columns of the sensory cortex, where their images are presented in detail) (<xref ref-type="bibr" rid="scirp.144424-7">
      Kharlamov, 2023b
     </xref>).</p>
    <p>Individual fragments of the associative memory of the hippocampus, represented in individual lamellae, are a unified world model in the form of a total associative network, where individual events are dependent on other events they are connected with in this associative network, and therefore their ranks in the model are calculated iteratively—see formula (6)—taking into account these connections in the process of iterative access to storage (up to 20 cycles) (<xref ref-type="bibr" rid="scirp.144424-12">
      Vinogradova, 1975
     </xref>).</p>
    <p>The initially formed statistical representation of the text (a network of event images with their connections as the frequency of occurrence of events and connections between them) undergoes re-ranking, thus allowing move from a frequency portrait of the text to an associative network of key images of text events (networks with ranks of these events, that is, their semantic weights):</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          w 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mi>
           t 
         </mi> 
         <mo>
           + 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mstyle displaystyle="true"> 
          <msub> 
           <mo>
             ∑ 
           </mo> 
           <mi>
             j 
           </mi> 
          </msub> 
          <mrow> 
           <msub> 
            <mi>
              w 
            </mi> 
            <mi>
              j 
            </mi> 
           </msub> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mi>
              t 
            </mi> 
            <mo>
              ) 
            </mo> 
           </mrow> 
           <msub> 
            <mi>
              w 
            </mi> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mi>
               j 
             </mi> 
            </mrow> 
           </msub> 
          </mrow> 
         </mstyle> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mi>
         σ 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mover accent="true"> 
         <mi>
           E 
         </mi> 
         <mo>
           ¯ 
         </mo> 
        </mover> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         , 
       </mo> 
      </mrow> 
     </math> (6)</p>
    <p>where 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          w 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mn>
          0 
        </mn> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          z 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
      </mrow> 
     </math>; 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          w 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           j 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          z 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           j 
         </mi> 
        </mrow> 
       </msub> 
       <mo>
         / 
       </mo> 
       <msub> 
        <mi>
          z 
        </mi> 
        <mi>
          j 
        </mi> 
       </msub> 
      </mrow> 
     </math> and 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         σ 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mover accent="true"> 
         <mi>
           E 
         </mi> 
         <mo>
           ¯ 
         </mo> 
        </mover> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mo>
          / 
        </mo> 
        <mrow> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mn>
             1 
           </mn> 
           <mo>
             + 
           </mo> 
           <msup> 
            <mtext>
              e 
            </mtext> 
            <mrow> 
             <mo>
               − 
             </mo> 
             <mi>
               k 
             </mi> 
             <mover accent="true"> 
              <mi>
                E 
              </mi> 
              <mo>
                ¯ 
              </mo> 
             </mover> 
            </mrow> 
           </msup> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </mrow> 
      </mrow> 
     </math> is a function normalizing to the average energy value of all network nodes 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mover accent="true"> 
       <mi>
         E 
       </mi> 
       <mo>
         ¯ 
       </mo> 
      </mover> 
     </math>; 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          z 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
      </mrow> 
     </math> is the frequency of occurrence of the i-th word in the text, 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          z 
        </mi> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           j 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> is the frequency of co-occurrence of the i-th and j-th words in text fragments; t is the iteration number. The resulting numerical characteristic of words (their semantic weight) characterizes the degree of their significance in the text.</p>
   </sec>
   <sec id="s4_3">
    <title>4.3. World Model. Anterior Cortex Level</title>
    <p>There is also a third stratum of representation of the world model in the human brain (see <xref ref-type="fig" rid="fig1(B)">
      Figure 1(B)
     </xref>). It is represented in the anterior cortex, where this model is represented (at the lowest level in the hierarchy of representations) in the form of motor activity control, and at higher levels—in the form of fragments of generalized behavior plans of varying degrees of generalization. At the highest level of representation in this hierarchy, this stratum is represented in the form of images of ideas of behavioral activity in generalized situations. These generalized representations at lower levels unfold into increasingly detailed behavioral acts, and at the lowest level—into acts of motor control. For example, articulatory—in the case of using motor function when producing voiced speech.</p>
   </sec>
  </sec><sec id="s5">
   <title>5. Conclusion</title>
   <p>Thus, as a result of purposeful behavior involved in the problem-solving task, that is, searching for a chain of situations that bridges the current and target situations in the internal or external databases, the so-called “counter” text is searched for, the semantic network of which contains a chain from the current situation to the target one, which resolves the problem-solving task.</p>
   <p>When there is no immediately available counter text, or this text is non-existent at all at the current moment, it becomes necessary to synthesize a text that serves as a counter text for solving the problem. And then this synthesized text constitutes a discovery. In this paper, the issue of synthesizing the desired counter text is not addressed: the problem of synthesis of purposeful behavior has not yet been solved as any “texts” synthesized by GPT-like systems are texts synthesized by a chain of reference semantic points predefined externally. That is, such systems, in essence, do not differ from speech synthesis systems from text, where the source text is predefined externally.</p>
   <p>This approach can be used for specific AI applications, such as robotics or decision support systems. To do this, it is necessary to improve the TextAnalyst technology, for example, in the direction of analyzing video sequences.</p>
  </sec>
 </body><back>
  <ref-list>
   <title>References</title>
   <ref id="scirp.144424-ref1">
    <label>1</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Bekhtereva, N. P. (1978). Brain Codes of Psychic Activity [Mozgovye kody psikhicheskoy aktivnosti]. Nauka. (In Russian)
    </mixed-citation>
   </ref>
   <ref id="scirp.144424-ref2">
    <label>2</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Borisov, V.,&amp;Kharlamov, A. A. (2023). Intelligent Analysis and Scenario Modeling of Problem Situations Based on a Combination of Neural Network Technology for Text Processing, Dynamic Clustering Methods and Fuzzy Cognitive Analysis. In A. A. Kharlamov,&amp;M. Pilgun (Eds.), Integral Robot Technologies and Speech Behavior (pp. 51-87). Cambridge Scholars Publishing.
    </mixed-citation>
   </ref>
   <ref id="scirp.144424-ref3">
    <label>3</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Jamali, M., Grannan, Be., Cai, J., Khanna, A. R., Muñoz, W., Caprara, I., Paulk, A. C., Cash, S. S., Fedorenko, E.,&amp;Williams, Z. M. (2024). Semantic Encoding during Language Comprehension at Single-Cell Resolution. Nature, 631, 610-616. &gt;https://doi.org/10.1038/s41586-024-07643-2
    </mixed-citation>
   </ref>
   <ref id="scirp.144424-ref4">
    <label>4</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Khanna, A. R., Muñoz, W., Kim, Y. J., Kfir, Y., Paulk, A. C., Jamali, M., Cai, J., Mustroph, M. L., Caprara, I., Hardstone, R., Mejdell, M., Meszéna, D., Zuckerman, A., Schweitzer, J., Cash, S.,&amp;Williams, Z. M. (2024). Single-Neuronal Elements of Speech Production in Humans. Nature, 626, 603-610. &gt;https://doi.org/10.1038/s41586-023-06982-w
    </mixed-citation>
   </ref>
   <ref id="scirp.144424-ref5">
    <label>5</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kharlamov, A. A. (2017). Associative Memory as an Environment for the Formation of a Space of Knowledge. From Biology to Applications [Assotsiativnaya pamyat’ sreda dlya formirovaniya prostranstva znanij. Ot biologii k prilozheniyam]. Palmarium Academic Publishing. (In Russian)
    </mixed-citation>
   </ref>
   <ref id="scirp.144424-ref6">
    <label>6</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kharlamov, A. A. (2023a). Speech as Purposeful Behavior. Integral Robot Technologies and Speech Behavior. In A. A. Kharlamov,&amp;M. Pilgun (Eds.), Integral Robot Technologies and Speech Behavior (pp. 1-50). Cambridge Scholars Publishing.
    </mixed-citation>
   </ref>
   <ref id="scirp.144424-ref7">
    <label>7</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kharlamov, A. A. (2023b). Text and Quasi-Text Analysis: Upper Levels of Speech Information Processing. In A. A. Kharlamov,&amp;M. Pilgun (Eds.), Integral Robot Technologies and Speech Behavior (pp. 88-129). Cambridge Scholars Publishing.
    </mixed-citation>
   </ref>
   <ref id="scirp.144424-ref8">
    <label>8</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kharlamov, A. A. (2025). Text Analyst. &gt;https://analyst.ru/en/about 
    </mixed-citation>
   </ref>
   <ref id="scirp.144424-ref9">
    <label>9</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kotseruba, I.,&amp;Tsotsos, J. K. (2020). 40 Years of Cognitive Architectures: Core Cognitive Abilities and Practical Applications. Artificial Intelligence Review, 53, 17-94. &gt;https://doi.org/10.1007/s10462-018-9646-y
    </mixed-citation>
   </ref>
   <ref id="scirp.144424-ref10">
    <label>10</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Leontyeva, N. N. (2006). Automatic Text Understanding. Systems, Models, Resources [Avtomaticheskoe ponimanie tekstov. Sistemy, modeli, resursy]. Academia. (In Russian)
    </mixed-citation>
   </ref>
   <ref id="scirp.144424-ref11">
    <label>11</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Rolls, E. T. (1990). Theoretical and Neurophysiological Analysis of the Functions of the Primate Hippocampus in Memory. Cold Spring Harbor Symposia on Quantitative Biology, 55, 995-1006. &gt;https://doi.org/10.1101/SQB.1990.055.01.095
    </mixed-citation>
   </ref>
   <ref id="scirp.144424-ref12">
    <label>12</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Vinogradova, O. S. (1975). Hippocampus and Memory [Gippokamp i pamyat]. Nauka. (In Russian)
    </mixed-citation>
   </ref>
  </ref-list>
 </back>
</article>