Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE (www.oxfordhandbooks.com). © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 20 November 2018

Abstract and Keywords

Plagiarism refers to the act of copying from a written or published source, fully or partially, without attribution to that source. The need to avoid it is written into the regulations for the presentation of academic work at all universities, as well as at many colleges and schools. Subject to doctrines such as fair use, nobody can copy all or part of the work that is so protected without first obtaining permission to do so from the copyright holder. This does not necessarily have to be paid for, but it must be obtained. Detection is an investigation of a set of texts for the presence of apparent plagiarism. Automated detection provides the material for the assembly of a case. To locate any sequence when comparing documents, all systems need some sort of indexing methodology. This article, which discusses plagiarism and how it is detected, focuses on the use of computers in automated and electronic detection, and also considers digital fingerprints and matching with words, along with practical detection.

Keywords: plagiarism, detection, automatic detection, electronic detection, computers, digital fingerprints, matching with words, practical detection, indexing

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.