Graph-theoretic models with ordered hierarchical structure and their use in analysis of poetic texts’ syntax

The article examines graph-theoretic models with ordered hierarchical structures and methods of their comparative analysis. A comparison of the models is carried out by the distance definition, which is based on the well known Wagner-Fischer string comparison algorithm. Here, a graph-theoretic model is converted into a string, where each node is assigned a link to the parent element, the nesting level, and type of connection with the node (this distance satisfies all metric properties). To determine the degree of similarity between different types of syntactic relations on the basis of the expert assessments of philologists the matrix C sized 43 х 43 with values between 0 and 1 was built. Testing of these algorithms was performed on the models of syntactic structure of complex sentences taken from the works of P. A. Vyazemskiy and I. A. Brodskiy (118 texts). Noticeable dependence between metric values and authorship of the sentences was revealed. This dependence is expressed more strongly in the analysis of large sentences with non-trivial structure.