The Community for Technology Leaders
Innovative Computing ,Information and Control, International Conference on (2008)
Dalian, Liaoning China
June 18, 2008 to June 20, 2008
ISBN: 978-0-7695-3161-8
pp: 569
Plagiarism in texts is issues of increasing concern to the academic community. Now most common text plagiarism occurs by making a variety of minor alterations that include the insertion, deletion, or substitution of words. Such simple changes, however, require excessive string comparisons. In this paper, we present a hybrid plagiarism detection method. We investigate the use of a diagonal line, which is derived from Levenshtein distance, and simplified SmithWaterman algorithm that is a classical tool in the identification and quantification of local similarities in biological sequences, with a view to the application in the plagiarism detection. Our approach avoids globally involved string comparisons and considers psychological factors, which can yield significant speed-up by experiment results. Based on the results, we indicate the practicality of such improvement using Levenshtein distance and Smith-Waterman algorithm and to illustrate the efficiency gains. In the future, it would be interesting to explore appropriate heuristics in the area of text comparison
Jin-Pyung Kim, Moon-Kyun Kim, Zhan Su, Min-Koo Kang, Byung-Ryul Ahn, Ki-Yol Eom, "Plagiarism Detection Using the Levenshtein Distance and Smith-Waterman Algorithm", Innovative Computing ,Information and Control, International Conference on, vol. 00, no. , pp. 569, 2008, doi:10.1109/ICICIC.2008.422
96 ms
(Ver 3.3 (11022016))