Informational similarity of graphs in syntactic pattern recognition

Abstract Weighted treelike graphs can be utilized to describe syntactic pattern recognition processes in which semantics is taken into account. We show how an informational entropy can be defined on such graphs. This provides an approach to measuring their complexities and their similarity.