REFINEMENT OF THE MARKOV ALPHABET TO REPRESENT SYNONYMS AND HOMONYMS DENOTING OBJECTS OF BIG DATA OF SOCIO-ECONOMIC SYSTEMS. Part 1

Abstract

The analysis of foreign criticism of incomplete provisions of the theory of Markov algorithms is carried out. Two incomplete positions of the theory identified during the practical implementation of programming languages are considered. The first is related to the incompleteness of data samples and, as a consequence, propositions that need to be subjected to a truth check. The second is with the inability to operate with synonyms and homonyms in the Markov alphabet A. The possibility of developing incomplete provisions of the theory of algorithms is considered, and scientific and technical ways of such are determined. It is noted that the theoretical justification of the Markov alphabet A has not been completed and requires further development. It is proposed to strengthen the theory of Markov algorithms by categorical reasoning. To investigate the Aristotelian category in the Markov alphabet A for the constructive definition of Aristotelian synonyms and homonyms. In the first part of the article, the main task of clarifying the Markov alphabet A for the constructive definition of synonyms and homonyms is solved. An ordered and expanded Markov alphabet A-+ is determined, an N-scheme for this alphabet is synthesized, and a variant of the N-scheme is additionally given under conditions of information uncertainty. The N-scheme for the Markov system is substantiated and implemented. The conclusion is made about the alphabet of control commands K used in the N-scheme, where it is proposed to understand the alphabet K more broadly, for example, as a pointer to a set of methods and algorithms for detection and classification in conditions of information uncertainty, or as a pointer to a structure containing separate standardized methods, or as a composition of methods from several standards.