Abstract
The large class sizes typical for an undergraduate programming course mean that it is nearly impossible for a human marker to accurately detect plagiarism, particularly if some attempt has been made to hide the copying. While it would be desirable to be able to detect all possible code transformations we believe that there is a minimum level of acceptable performance for the application of detecting student plagiarism. It would be useful if the detector operated at a level that meant for a piece of work to fool the algorithm would require that the student spent a large amount of time on the assignment and had a good enough understanding to do the work without plagiarising.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baker, B.S.: Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance. SIAM Journal on Computing 26(5), 1343–1362 (1997)
Clark, D., Ian Munro, J.: Efficient suffix trees on secondary storage. In: Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms (1996)
Joy, M.S., Luck, M.: Plagiarism in programming assignments. IEEE Transactions on Education 42(2), 129–133 (1999)
Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. In: Proceedings of SODA 1990, pp. 319–327. SIAM, Philadelphia (1990)
Prechelt, L., Malpohl, G., Phlippsen, M.: JPlag: Finding plagiarisms among a set of programs. Technical report, Fakultat for Informatik, Universitat Karlsruhe (2000), http://page.mi.fu-berlin.de/~prechelt/Biblio/jplagTR.pdf
Schleimer, S., Wilkerson, D.S., Aiken, A.: Winnowing: local algorithms for document fingerprinting. In: Proceedings of SIGMOD 2003, pp. 76–85. ACM Press, New York (2003)
Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14, 249–260 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mozgovoy, M., Fredriksson, K., White, D., Joy, M., Sutinen, E. (2005). Fast Plagiarism Detection System. In: Consens, M., Navarro, G. (eds) String Processing and Information Retrieval. SPIRE 2005. Lecture Notes in Computer Science, vol 3772. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11575832_30
Download citation
DOI: https://doi.org/10.1007/11575832_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29740-6
Online ISBN: 978-3-540-32241-2
eBook Packages: Computer ScienceComputer Science (R0)