The context similarity problem in academic plagiarism detection: A case study on differentiating originality from collusion in a homogeneous dataset

Intraclass collusion poses a significant challenge for automated detection systems within homogeneous datasets from e-learning platforms, where legitimate contextual overlap often leads to high false-positive rates. This “context similarity problem” questions the utility of advanced semantic models. This study confronts this issue through a quantitative comparison of a state-of-the-art Sentence-BERT model against traditional lexical methods (Levenshtein, Jaccard) on a real-world dataset of 854 student answers. Our findings reveal a compelling, counter-intuitive result: lexical methods are demonstrably more effective. Levenshtein Similarity achieved a superior F1-score (0.74) and F2-score (0.75), underpinned by a strong recall of 0.76. Conversely, the semantic model was confounded by the dataset’s homogeneity, yielding a modest F1-score of 0.57 and requiring an impractically high similarity threshold of 0.98 for optimal performance. This research provides a critical contribution by empirically demonstrating the limitations of purely semantic approaches in this specific context. We conclude that well-established lexical methods are not obsolete but remain a more reliable and practical tool for the initial screening of academic collusion, suggesting a need for hybrid strategies in modern academic integrity systems.

Publication Details

Journal
Springer Link (Chiba Institute of Technology)
Published
2025-11-20
DOI
https://doi.org/10.1051/e3sconf/202566401004/pdf
Primary Topic
Academic integrity and plagiarism
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The context similarity problem in academic plagiarism detection: A case study on differentiating originality from collusion in a homogeneous dataset

Springer Link (Chiba Institute of Technology)
Academic integrity and plagiarism
article

The context similarity problem in academic plagiarism detection: A case study on differentiating originality from collusion in a homogeneous dataset

article en

Abstract

Intraclass collusion poses a significant challenge for automated detection systems within homogeneous datasets from e-learning platforms, where legitimate contextual overlap often leads to high false-positive rates. This “context similarity problem” questions the utility of advanced semantic models. This study confronts this issue through a quantitative comparison of a state-of-the-art Sentence-BERT model against traditional lexical methods (Levenshtein, Jaccard) on a real-world dataset of 854 student answers. Our findings reveal a compelling, counter-intuitive result: lexical methods are demonstrably more effective. Levenshtein Similarity achieved a superior F1-score (0.74) and F2-score (0.75), underpinned by a strong recall of 0.76. Conversely, the semantic model was confounded by the dataset’s homogeneity, yielding a modest F1-score of 0.57 and requiring an impractically high similarity threshold of 0.98 for optimal performance. This research provides a critical contribution by empirically demonstrating the limitations of purely semantic approaches in this specific context. We conclude that well-established lexical methods are not obsolete but remain a more reliable and practical tool for the initial screening of academic collusion, suggesting a need for hybrid strategies in modern academic integrity systems.

Springer Link (Chiba Institute of Technology)
Quality Education
Openalex Percentile: Top 35%
Academic integrity and plagiarism
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.