Levenshtein Distance is a way to ascribe a numeric distance between two sequences (often characters in a string or word) by counting the minimum number of insertion, deletion and substitution operations required to transform one sequence to the other. The following article looks into the general definition, explanation and application of the theory.
Goday berdieva G.X. Nationality: problem and solutions.// Monograph. Publishing house" surkhon-edition " Termez-2019 y. 300 p.
Goday berdieva G.X. The basis of the National Goya.// Brochure. Publishing house" surkhon-edition " Termez-2016 y. 80 p.
Goday berdieva G.X formation and evolution of classical ideologies.// Brochure. Publishing house" Tafakkur " Tashkent-2016 44 p.
Godayberdieva G.X traditional education and youth.// Brochure. Publishing house" surkhon-edition " Termez-2016 y. 60p.