IJSR - International Journal of Scientific Research

Neelesh Channawar; Dr. S. B. Kishor

Volume : VIII, Issue : II, February - 2019

Emerge Towards Levenshtein's Distance Algorithm for estimation of Textual Similarities

Neelesh Channawar, Dr. S. B. Kishor

Abstract :

In modern days Plagiarism is a severe offence continuously happening in research and Academic field. Plagiarism is nothing but a method of approving other thoughts and research and ideas without proper appreciation. In plagiarism one can mention and steal other hard work as its own idea and research which is a serious misdeed. The problem of plagiarism is increasing day by day because of the powerful search engines which are available and having all the resources and information regarding any concept. To avoid and detect plagiarism in text matching lot of detecting tools and algorithms are present in market. Levenshtein distance algorithm is a very famous and efficient algorithm among all the plagiarism detection technique. In this paper we will show the working function and ability to detect plagiarism in similar textual strings. Levenshtein distance is a very simple measure which can be an effective string approximation tool. Here we will provide a comprehensive overview about Levenshtein distance algorithm which is an efficient algorithm for detecting plagiarism. The tentative idea will illustrate that Levenshtein algorithm is useful in complex plagiarism detection.