Ontological graph structure analysis for dictionary

The paper describes the algorithm and structure of the program for construction of large ontologies, for example, Russian dictionary. The concepts of specificity of oriented graphs with a large number of loops, vertices and edges are introduced. The vertex hierarchy, word basin, basin shell and basin volume are determined. The statistical properties of ontological graph are investigated.