Graph of TAPAZ-2 Semantic Classifier
The article discusses the algorithm for finding the entrance to an arbitrary subject domain based on the TAPAZ-2 Semantic Classifier and the graph thus obtained. The formulas for the exact number of vertices in the graph are derived depending on the number of elements in the Paradigm of Actions and the restrictions imposed while constructing the graph. Various ways are proposed to reduce the number of vertices in order to adapt the power of graph combinatorics for automatic processing with modern technical means.