Fast plagiarism detection by sentence hashing

Authors:
Dariusz Ceglarek;Konstanty Haniewicz
Affiliations:
Poznan School of Banking, Poland;Poznan University of Economics, Poland
Venue:
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Year:
2012

Citing 5
Cited 1

Selected combinatorial research problems.

Selected combinatorial research problems.
Efficient plagiarism detection for large code repositories

Software—Practice & Experience
Automatic plagiarism detection among term papers

Proceedings of the 3rd International Universal Communication Symposium
Semantically Enhanced Intellectual Property Protection System - SEIPro2S

ICCCI '09 Proceedings of the 1st International Conference on Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems
Quality of semantic compression in classification

ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume PartI

Robust plagiary detection using semantic compression augmented SHAPD

ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work presents a Sentence Hashing Algorithm for Plagiarism Detection - SHAPD. To present a user with the best results the algorithm makes use of special trait of the written texts - their natural sentence fragmentation, later employing a set of special techniques for text representation. Results obtained demonstrate that the algorithm delivers solution faster than the alternatives. Its algorithmic complexity is logarithmic, thus its performance is better than most algorithms using dynamic programming used to find the longest common subsequence.