Reducing computational effort for plagiarism detection with approximate string matching

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Currently, a large number of documents are created as digital material and distributed world-wide. Digital materials are easy to publish and copy at a remarkably low cost. As a result, many documents are copied illegally, and this practice is spreading, making plagiarism a significant social issue. Therefore, the need to develop systems that detect plagiarism is very high. We have developed a new plagiarism detection method that compares documents by using approximate string matching to detect plagiarism. We have also developed a technique that reduces the computational time of the comparison method. In this paper, we demonstrate our proposed method’s usefulness through experiments and through the measuring indexes of precision and recall.

Cite

CITATION STYLE

APA

Nakatoh, T., & Minami, T. (2018). Reducing computational effort for plagiarism detection with approximate string matching. In Advances in Intelligent Systems and Computing (Vol. 700, pp. 429–435). Springer Verlag. https://doi.org/10.1007/978-3-319-72550-5_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free