The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
YAP3: improved detection of similarities in computer program and other texts
Open accessAbstract
In spite of years of effort, plagiarism in student assignment submissions still causes considerable difficulties for course designers; if students' work is not their own, how can anyone be certain they have learnt anything? YAP is a system for detecting suspected plagiarism in computer programs and other texts submitted by students. The paper reviews YAP3, the third version of YAP, focusing on its novel underlying algorithm - Running-Karp-Rabin Greedy-String-Tiling (or RKS-GST), whose development arose from the observation with YAP and other systems that students shuffle independent code segments. YAP3 is able to detect transposed subsequences, and is less perturbed by spurious additional statements. The paper concludes with a discussion of recent extension of YAP to English texts, further illustrating the flexibility of the YAP approach.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison
Sankoff, D., & Kruskal, J. B. (1983) · Medical Entomology and Zoology · Cited by 1,915
Efficient randomized pattern-matching algorithms
Karp, R. M., & Rabin, M. O. (1987) · IBM Journal of Research and Development · doi:10.1147/rd.312.0249 · Cited by 1,269
Handbook of algorithms and data structures
Gonnet, G. H. (1984) · CERN Document Server (European Organization for Nuclear Research) · Cited by 436
Faidhi, J. A. W., & Robinson, S. K. (1987) · Computers & Education · doi:10.1016/0360-1315(87)90042-x · Cited by 198
A technique for isolating differences between files
Heckel, P. (1978) · Communications of the ACM · doi:10.1145/359460.359467 · Cited by 124
A tool that detects plagiarism in Pascal programs
Grier, S. (1981) · ACM Technical Symposium on Computer Science Education (SIGCSE) · doi:10.1145/800037.800954 · Cited by 116
Identification of Program Similarity in Large Populations
Whale, G. (1990) · The Computer Journal · doi:10.1093/comjnl/33.2.140 · Cited by 103
Detection of similarities in student programs
Wise, M. J. (1992) · ACM Technical Symposium on Computer Science Education (SIGCSE) · doi:10.1145/134510.134564 · Cited by 88
Self-citationPlagiarism a la Mode: A Comparison of Automated Systems for Detecting Suspected Plagiarism
Verco, K. L. (1996) · The Computer Journal · doi:10.1093/comjnl/39.9.741 · Cited by 36
Wise, M. J. (1995) · PubMed · Cited by 33
Self-citation
Cited by
Methods for identifying versioned and plagiarized documents
Hoad, T. C., & Zobel, J. (2003) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.10170 · Cited by 330
A comparison of code similarity analysers
Ragkhitwetsagul, C., Krinke, J., & Clark, D. (2018) · Empirical Software Engineering · doi:10.1007/s10664-017-9564-7 · Cited by 122
“Tools that rely on tokens include Sherlock (Joy and Luck 1999), BOSS (Joy et al. 2005), Sim (Gitchell and Tran 1999), YAP3 (Wise 1996), JPlag (Prechelt et al. 2002), CCFinder (Kamiya et al. 2002), CP-Miner (Li et al. 2006), MOSS (Schleimer et al. 2003), Burrows et al. (2007), and the Source Code Similarity Detector Sy…”
MethodSource-code Similarity Detection and Detection Tools Used in Academia: A Systematic Review
Novak, M., Joy, M., & Kermek, D. (2019) · ACM Transactions on Computing Education · doi:10.1145/3313290 · Cited by 117
Plagiarism detection using the Levenshtein distance and Smith-Waterman algorithm
Su, Z., Ahn, B.-R., Eom, K.-Y., Kang, M.-K., Kim, J.-P., & Kim, M.-K. (2008) · 2008 3rd International Conference on Innovative Computing Information and Control · doi:10.1109/icicic.2008.422 · Cited by 107
The toolbox for local and global plagiarism detection
Butakov, S., & Scherbinin, V. (2009) · Computers & Education · doi:10.1016/j.compedu.2008.12.001 · Cited by 79
Plagiarism in Programming Assessments: A Systematic Review
Albluwi, I. (2020) · ACM Transactions on Computing Education · doi:10.1145/3371156 · Cited by 63
Automatic Source Code Plagiarism Detection
Kustanto, C., & Liem, I. (2009) · 2009 10th ACIS International Conference on Software Engineering, Artificial Intelligences, Networking and Parallel/Distributed Computing · doi:10.1109/snpd.2009.62 · Cited by 58
Plagiarism Detection: A Tool Survey and Comparison
Martins, V. T., Fonte, D., Henriques, P. R., & da Cruz, D. (2014) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik · doi:10.4230/oasics.slate.2014.143 · Cited by 53
Desktop Tools for Offline Plagiarism Detection in Computer Programs
MOZGOVOY, M. (2006) · Informatics in Education · doi:10.15388/infedu.2006.08 · Cited by 46
Plagiarism: Taxonomy, Tools and Detection Techniques
Chowdhury, H. A., & Bhattacharyya, D. K. (2018) · arXiv · doi:10.48550/arxiv.1801.06323 · Cited by 41
Evaluation of Cheating Detection Methods in Academic Writings
Patel, A., Bakhtiyari, K., & Taghavi, M. (2011) · Library Hi Tech · doi:10.1108/07378831111189732 · Cited by 36
“…Surakka & Rahikainen 2006; Belkhouche, Nix & Hassell 2004; Cosma & Joy 2006; Culwin, MacLeod & Lancaster 2001; Niezgoda & Way 2006; Parker & Hamblen 1989; Prechelt, Malpohl & Philippsen 2000; Tahaghoghi & Tahaghoghi 2006; Vamplew & Dermoudy 2005; Verco & Wise 1996; Wiedemeier 2002; Wise 1996).”
BackgroundMossad: defeating software plagiarism detection
Devore-McDonald, B., & Berger, E. D. (2020) · Proceedings of the ACM on Programming Languages · doi:10.1145/3428206 · Cited by 35
TMOSS: Using Intermediate Assignment Work to Understand Excessive Collaboration in Large Classes
Yan, L., McKeown, N., Sahami, M., & Piech, C. (2018) · Proceedings of the 49th ACM Technical Symposium on Computer Science Education · doi:10.1145/3159450.3159490 · Cited by 30
“Many software similarity systems have been developed over the past two decades to detect for software plagiarism [7, 18, 20, 23, 24].”
BackgroundAuthor Identification of Software Source Code with Program Dependence Graphs
Chen, R., Hong, L., Chunyan Lü, C., & Deng, W. (2010) · 2010 IEEE 34th Annual Computer Software and Applications Conference Workshops · doi:10.1109/compsacw.2010.56 · Cited by 13
Detecting Pervasive Source Code Plagiarism through Dynamic Program Behaviours
Cheers, H., Lin, Y., & Smith, S. P. (2020) · Proceedings of the Twenty-Second Australasian Computing Education Conference · doi:10.1145/3373165.3373168 · Cited by 13
“For instance, from a review of recent publications evaluating or presenting SCPDTs: • 3 provided the data set which it was evaluated on [17, 19, 25]; although these data sets were not assignments.”
BackgroundAuDeNTES: Automatic Detection of teNtative plagiarism according to a rEference Solution
Mariani, L., & Micucci, D. (2012) · ACM Transactions on Computing Education · doi:10.1145/2133797.2133799 · Cited by 12
Metadata
- Authors
- Wise, M. J.
- Venue
- Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education
- Publisher
- ACM
- Published
- 1996-03
- Pages
- 130-134
- OpenAlex
- W2073265902
- Cited by
- 294
- References
- 10
- FWCI
- 4.27
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.