Abstract

In the article the basic procedures for finding of connective elements and resolving conflicts of references is analyzed. On the basis of this, a generalized algorithm is proposed that combines advantages of existing procedures for search for connective elements between phrases. The advantages of the selected procedures and their sequence are described, the formal description of input data and the results of the algorithm are presented. To optimize the procedure for scanning the text, the algorithm is performed as an iterative reduction of the candidates for communication elements. This is achieved through the confirmation of non-conflict links and the gradual resolution of conflicts.