Entity

Time filter

Source Type

Poznan, Poland

Ceglarek D.,Poznan School of Banking
Studies in Computational Intelligence | Year: 2014

This paper describes a new algorithm identifying common phrase sequences. The SHAPD2 algorithm was designed to achieve the goal of a single-pass corpus to corpus comparison. It is a highly efficient solution that finds application with considerable amount of data and excels over other approaches. One of its possible applications is the detection of potential plagiarisms by comparing not a document against a corpus, but corpus to corpus. This makes the SHAPD2 algorithm a valuable alternative to the available solutions. © Springer International Publishing Switzerland 2014. Source


Ceglarek D.,Poznan School of Banking
2013 The International Conference on Technological Advances in Electrical, Electronics and Computer Engineering, TAEECE 2013 | Year: 2013

This work presents results of the ongoing research in the area of natural language processing focusing on plagiarism detection, applying semantic networks and semantic compression. The results demonstrate that the semantic compression is a valuable addition to the existing methods used in plagiary detection. The application of the semantic compression boosts the efficiency of Sentence Hashing Algorithm for Plagiarism Detection 2 (SHAPD2) and w - shingling algorithm. Experiments were performed on Clough & Stephenson corpus as well as on an available PAN-PC plagiarism corpus used to evaluate plagiarism detection methods, so the results can be compared with other research teams. © 2013 IEEE. Source


Ceglarek D.,Poznan School of Banking | Haniewicz K.,Poznan University of Economics
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2012

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. © 2012 Springer-Verlag Berlin Heidelberg. Source


Ceglarek D.,Poznan School of Banking | Haniewicz K.,Poznan University of Economics | Rutkowski W.,CIBER ISCIII
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2012

This work presents results of the ongoing novel research in the area of semantic networks, plagiarism detection and general natural language processing. Results presented here demonstrate that the semantic compression is a valuable addition to the existing methods used in plagiary detection. The application of the semantic compression boosts the efficiency of Sentence Hashing Algorithm for Plagiarism Detection (SHAPD) and authors' implementation of the w-shingling algorithm. There were also test with use of the traditional Vector Space Model method that demonstrated that this technique is not well suited for plagiary detection contrary to general beliefs. All the experiments were performed on a generally available corpus built so that such analysis can be comparable to efforts of other research teams. © 2012 Springer-Verlag. Source


Ceglarek D.,Poznan School of Banking
Advances in Intelligent Systems and Computing | Year: 2013

This paper presents the structure and the functionality of the Semantically Enhanced Intellectual Property Protection System. The system uses an extensive set of semantic net algorithms for the Polish and English language that which allows it to detect similarities between compared documents on a level far beyond simple text matching. SEIPro2S benefits result both from using a local document repository and from Web based resources. The SeiPro2S system uses a mechanism of semantic compression developed to generalize concepts during a comparison of documents. The main focus of this work is to give the reader an overview of architecture, applied mechanisms and some actual results. © Springer International Publishing Switzerland 2013. Source

Discover hidden collaborations