The control procedure

The procedure controls the number of extracting nodes EN and the subgraph SG size. In order for it to be used to build a sub-graph for a given stimulus, the text must contain a stimulus S and at least dAn direct associations with the stimulus. The dAn = 2 is chosen as a starting value for the extracting algorithm, which means that if the text has dAn < 2, the text is omitted. If the text has dAn > 2, the text is used for sub-graph extraction. First, the stimulus and the dAn = 2 primary associations are passed as extracting nodes to the network extracting algorithm NEA. Then, the number of nodes in the returned sub-graph is counted. In the next step, the dAn is incremented by 1 and the new set of extracting nodes is passed to the NEA. The returned sub-graph size is evaluated, i.e. the number of nodes of the sub-graph based on dAn + 1 is multiplied by the sub-graph size control parameter Ss, which tells us which fraction of the base sub-graph, i.e. the sub-graph created for a start value of dAn = 2, must exist in the sub-graph created for dAn + 1. For example, Ss = 0.5 means that at least half of the nodes from the base sub-graph must remain in the sub-graph created after the incrementing of the dAn. If the newly created sub-graph does not match the condition set by Ss, the procedure stops and the sub-graph created in the previous step becomes the final for a particular text. If the newly created sub-graph matches the condition set by Ss, the dAn is incremented by 1, and a new sub-graph is created.