Articles
| Open Access |
DOI: Understanding The Levenshtein Distance Equation For Beginners
Abdurakhmanova Umida Rustamovna , Lecturer Of The Department Of Information Technologies, Tashkent State University Of Uzbek Language And Literature Named After Alisher Navoi, An Independent Seeker Of TATU, UzbekistanAbstract
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.
Keywords
Levenshtein distance equation, algorithm, string matching, spelling checking, symbol
References
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.
Article Statistics
Copyright License
Copyright (c) 2021 The American Journal of Engineering and Technology
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors retain the copyright of their manuscripts, and all Open Access articles are disseminated under the terms of the Creative Commons Attribution License 4.0 (CC-BY), which licenses unrestricted use, distribution, and reproduction in any medium, provided that the original work is appropriately cited. The use of general descriptive names, trade names, trademarks, and so forth in this publication, even if not specifically identified, does not imply that these names are not protected by the relevant laws and regulations.