File(s) not publicly available
Comparison of overlap detection techniques
conference contribution
posted on 2002-01-01, 00:00 authored by K Monostori, R Finkel, Arkady ZaslavskyArkady Zaslavsky, G Hodász, M PatakiEasy access to the World Wide Web has raised concerns about copyright issues and plagiarism. It is easy to copy someone else's work and submit it as someone's own. This problem has been targeted by many systems, which use very similar approaches. These approaches are compared in this paper and suggestions are made when different strategies are more applicable than others. Some alternative approaches are proposed that perform better than previously presented methods. These previous methods share two common stages: chunking of documents and selection of representative chunks. We study both stages and also propose alternatives that are better in terms of accuracy and space requirement. The applications of these methods are not limited to plagiarism detection but may target other copy-detection problems. We also propose a third stage to be applied in the comparison that uses suffix trees and suffix vectors to identify the overlapping chunks. © 2002 Springer-Verlag Berlin Heidelberg.
History
Volume
2329 LNCSIssue
PART 1Pagination
51 - 60Publisher DOI
Link to full text
ISSN
0302-9743eISSN
1611-3349ISBN-13
9783540435914ISBN-10
3540435913Publication classification
E1.1 Full written paper - refereedTitle of proceedings
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC