CoChat

A hybrid plagiarism detection framework using lexical and semantic similarity with lightweight sentence transformers

Open access
Birwadkar, Rahul · 2025 · Journal of Computer and Forensic Sciences

The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.

Abstract

Plagiarism detection has become increasingly challenging due to the widespread availability of paraphrasing tools and generative artificial intelligence systems. Traditional plagiarism detection techniques based on lexical similarity, such as TF-IDF and n-gram matching, often fail to identify semantically similar but lexically modified text. This paper presents a hybrid plagiarism detection framework that combines lexical similarity measures with semantic similarity derived from sentence transformer models. The proposed approach integrates TF-IDF-based cosine similarity with lightweight sentence embeddings generated using MiniLM and SBERT models. To enhance semantic detection performance, a MiniLM-based sentence transformer is fine-tuned on the PAN 2011 plagiarism detection corpus. Experimental evaluation demonstrates that the hybrid similarity approach significantly improves detection accuracy compared to purely lexical methods, particularly for paraphrased plagiarism cases. The framework is further validated using threshold-based analysis and real-world Web content retrieved through automated scraping. The proposed system provides an efficient and scalable solution for plagiarism detection, balancing computational efficiency with semantic understanding, and is suitable for academic and real-world forensic applications.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.5937/jcfs4-64419

Cites

8 of 8 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 8

  1. K. T. Kalleberg, "Plagiarism detection using machine learning techniques, " Interna- tional Journal of Computer Applications, vol. 119, no. 13, pp. 1-6, 2015.
  2. T. Mikolov, K. Chen, G. Corrado, and J. Dean, "Efficient estimation of word representa- tions in vector space, " in Proceedings of the International Conference on Learning Rep- resentations (ICLR), 2013.
  3. W. Wang, F. Wei, L. Dong, H. Bao, N. Yang, and M. Zhou, "MiniLM: Deep self-atten- tion distillation for task-agnostic compression of pre-trained transformers, " in Advances in Neural Information Processing Systems (NeurIPS), 2020.
  4. I. Sutskever, O. Vinyals, and Q. V. Le, "Sequence to sequence learning with neural networks, " in Advances in Neural Information Processing Systems (NeurIPS), 2014, pp. 3104-3112.
  5. D. Bahdanau, K. Cho, and Y. Bengio, "Neural machine translation by jointly learning to align and translate, " in Proceedings of the International Conference on Learning Rep- resentations (ICLR), 2015.
  6. C. Raffel et al., "Exploring the limits of transfer learning with a unified text-to-text transformer, " Journal of Machine Learning Research, vol. 21, no. 140, pp. 1-67, 2020.
  7. C. Quirk, C. Brockett, and W. Dolan, "Monolingual machine translation for para- phrase generation, " in Proceedings of EMNLP, 2004, pp. 142-149.
  8. R. V. Birwadkar, "Plagiarism Detection and Paraphrasing based on Generative Artifi- cial Intelligence, " Master's thesis, Dept. of Information and Technology, SRH Hochschule Heidelberg, Heidelberg, Germany, 2025.

Cited by

Still being checked.

Metadata

Authors
Birwadkar, R.
Affiliations
SRH University of Applied Sciences Heidelberg (DE)
Corresponding author
Birwadkar, Rahul
Venue
Journal of Computer and Forensic Sciences
Published
2025
Volume
4
Issue
2
Pages
3-16
ISSN
  • 2956-0799 (ISSN-L)
  • 2956-087X
OpenAlex
W7161280532
Cited by
0
References
8
FWCI
0.00
Type
journal article
Language
en
Open access
Locations
Journal of Computer and Forensic Sciences (publishedVersion, cc-by)
Topics
  • Social Sciences › Education › Academic integrity and plagiarism
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Information Systems › Software Engineering Research
Keywords
plagiarism detection, word similarity, semantic similarity, sentence embeddings, MiniLM, Sentence-BERT, generative AI, forensic text analysis

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.