COMPARATIVE ANALYSIS OF THE EVALUATION OF THE CONVERGENCE OF DATA STRUCTURES USING MATHEMATICAL SETS AND THE LEVENSHTEIN ALGORITHM

Abstract

This paper describes a comparison of two methods for evaluating the convergence of different data sets: mathematical sets and the Levenshtein algorithm. The first part of the paper describes a general methodology for evaluating the convergence of data structures, including the steps of analyzing, cleaning, and constructing data sets. In the second part of the paper, a comparative analysis of the two methods is performed using several data sets as examples. The results of the comparative analysis of the presented methods are given and a number of recommendations are given for choosing the most effective method for evaluating the convergence of data structures depending on specific requirements and conditions.