<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Rule Based Plagiarism Detection using Information Retrieval</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Aniruddha Ghosh</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pinaki Bhaskar</string-name>
          <email>pinaki.bhaskar@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Santanu Pal</string-name>
          <email>santanu.pal.ju@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>SivajiBandyopadhyay</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science and Engineering, Jadavpur University</institution>
          ,
          <addr-line>Kolkata - 700032</addr-line>
          ,
          <country country="IN">India</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper reports about the development of a Plagiarism detection system as a part of the Plagiarism detection task in PAN 2011. The external plagiarism detection problem has been solved with the help of Nutch, an open source Information Retrieval (IR) system. The system contains three phases knowledge preparation, candidate retrieval and plagiarism detection. From the source documents, knowledge base has been prepared for developing the Nutch index and the queries have been formed from the suspicious documents for submission to the Nutch IR system. The retrieved candidate source sentences are assigned similarity scores by Nutch. Dissimilarity score is assigned for each candidate sentence and the suspicious sentence. Each candidate source sentence is ranked based on these two scores. The top ranked candidate sentence is selected for each suspicious sentence.</p>
      </abstract>
      <kwd-group>
        <kwd>Plagiarism Detection</kwd>
        <kwd>Information Retrieval System</kwd>
        <kwd>Similarity Score</kwd>
        <kwd>Dissimilarity Score</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>
        Plagiarism may be defined as the wrongful misuse and close replication of thoughts,
ideas, or expressions from the original work of someone in the same language of from
another language. From 18th century, plagiarism has been considered as academic
dishonesty [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. For decades, researchers have explored different techniques to detect
plagiarism. Plagiarism can occur in different forms – full plagiarism, substantial
plagiarism, minimalistic plagiarism, source citation etc. It has become a challenging
task in the area of Natural Language Processing. In our approach, we have considered
all the forms of plagiarism except minimalistic plagiarism at the sentence level.
      </p>
      <p>
        Due to absence of controlled evaluation environment to compare results of the
algorithms, plagiarism detection is still a challenging task [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Researchers have
organized various conferences (similar to PAN) to overcome the plagiarism problem.
Fingerprint retrieval method [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], candidate retrieval [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and passage retrieval [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] are
the most prominent attempts on plagiarism detection. The system described in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]
works with a natural language parser to find swapped words and phrases to detect
intentional plagiarism while n-gram co-occurrence statistic is used to detect verbatim
copy. The Longest Common Subsequence technique has been used in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] to handle
text modification. Researchers have used cosine similarity score and n-gram vector
space model at different levels, i.e., word [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] and character [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] levels. In the present
work, plagiarism has been treated as an IR problem. An open source search engine,
Nutch, has been used to retrieve the plagiarized parts from the suspicious documents.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2 System Framework</title>
      <p>The Information Retrieval (Nutch1) based Plagiarism Detection system framework is
shown in the figure 1. The system is defined in three phases: Knowledge Preparation,
Candidate Retrieval, i.e., identification of suspicious sentence and the probable set of
source sentence pairs and finally plagiarism detection of each identified suspicious
sentence.</p>
    </sec>
    <sec id="sec-3">
      <title>3 Knowledge Preparation</title>
      <p>Each source document is parsed to identify and extract all the sentences in the
document. Now Knowledge files are generated for each source sentence. The file
names of knowledge files are created in such a manner that the source sentence in the
original source document can be tracked.</p>
      <p>The knowledge of each sentence in the knowledge file is stored in the form of
stems, synonyms, hyponyms, hypernyms and synsets of each word (after removal of
the stop words) that are extracted from WordNet 3.02. Duplicate words are removed
to get the set of identical sense unique words. These words are used to identify the
plagiarized words, the words that are similar in sense to the original words. The
original words in the sentence are added to this set of words. Thus, each knowledge
file for a sentence consists of a set of words. After all the knowledge files are built,
these are indexed using Lucene3.
1http://nutch.apache.org/
2http://wordnet.princeton.edu/
3http://lucene.apache.org/
Each suspicious document is parsed to identify and extract all the sentences in the
suspicious documents. Each Suspicious sentence is considered from the parsed
suspicious document to generate the query. First all the stop words are removed from
the sentence and then the remaining words are being stemmed using WordNet 3.0
stemmer to get the root form of each word.</p>
      <p>After generating the query from the suspicious sentences, the query is fired to
Nutch to retrieve the probable set of source sentences corresponding to each
suspicious sentence. As source documents are split into sentences into files and each
file contains only one sentence, Nutch performs a sentence-sentence mapping for a
proximal match between the query and indexed source files. A set of probable
candidate source sentences is identified by Nutch in ranked order for each suspicious
sentence. Nutch provides the similarity score between a suspicious sentence and the
corresponding candidate source sentence.</p>
    </sec>
    <sec id="sec-4">
      <title>5 Plagiarism Detection</title>
      <p>
        An algorithm for dissimilarity measurement, proposed in [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], has been used to
calculate the dissimilarity score between the suspicious sentence and its
corresponding retrieved candidate sentences. For identical sentences that have most
number of identical n-grams, the dissimilarity score is 0. Using this measure we have
calculated the dissimilarity scores of each source sentence corresponding to the
suspicious sentences.
      </p>
      <p>
        The dissimilarity score are subtracted from the similarity score for each candidate
source sentence and a final fine-grained score has been generated. All the retrieved
candidate source sentences for each suspicious sentence are ranked according to this
fine-grained score. The top ranked candidate source sentence is identified as the
source sentence for the plagiarized sentence in the suspicious document.
The plagiarism detection system was evaluated using the evaluation framework
described in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. The evaluation scores are shown in Table 1.
      </p>
    </sec>
    <sec id="sec-5">
      <title>6 Evaluation</title>
      <p>The present task is our first attempt in plagiarism detection. We have tested the
plagiarism at the sentence level but phrase level experimentation is still left for
investigate. In future, an algorithm has to be developed to test the relevance of the
candidate source sentences retrieved by Nutch and choose the most relevant
plagiarized part. The knowledge files for the source documents will also have to be
updated.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgment References</title>
      <p>The work has been carried out with support from Department of Information
Technology (DIT), Govt. of India funded Project Development of “Cross Lingual
Information Access (CLIA)” System Phase II.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>1. Wikipedia article on Plagiarism: http://en.wikipedia.org/wiki/Plagiarism</mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Potthast</surname>
            <given-names>M.</given-names>
          </string-name>
          et al.:
          <article-title>An Evaluation Framework for Plagiarism Detection</article-title>
          .
          <source>In Proceedings of the COLING</source>
          <year>2010</year>
          , Beijing, China,
          <year>August 2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Yurii</given-names>
            <surname>Palkovskii</surname>
          </string-name>
          , Alexei Belov and
          <string-name>
            <given-names>Irina</given-names>
            <surname>Muzika</surname>
          </string-name>
          .:
          <article-title>Exploring Fingerprinting as External Plagiarism Detection Method: Lab Report for PAN at CLEF 2010</article-title>
          . In Braschler et al.[
          <volume>2</volume>
          ].
          <source>ISBN 978-88-904810-0-0.</source>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Viviane</surname>
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Moreira</surname>
          </string-name>
          , Rafael C.
          <article-title>Pereira and Galante Renata.: UFRGS@PAN2010: Detecting External Plagiarism: Lab Report for Pan at CLEF 2010</article-title>
          . In Braschler et al.[
          <volume>2</volume>
          ].
          <source>ISBN 978-88- 904810-0-0.</source>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>Clara</given-names>
            <surname>Vania</surname>
          </string-name>
          and
          <string-name>
            <given-names>Mirna</given-names>
            <surname>Adriani</surname>
          </string-name>
          .:
          <article-title>External Plagiarism Detection Using Passage Similarities: Lab Report for PAN at CLEF 2010</article-title>
          . In Braschler et al.[
          <volume>2</volume>
          ].
          <source>ISBN 978-88-904810-0-0.</source>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>M.</given-names>
            <surname>Mozgovoy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Kakkonen</surname>
          </string-name>
          and
          <string-name>
            <surname>E. Sutinen.</surname>
          </string-name>
          :
          <article-title>Using Natural Language Parsers in Plagiarism Detection</article-title>
          .
          <source>In Proceeding of SLaTE'07 Workshop</source>
          , Pennsylvania, USA,
          <year>October 2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Chen</surname>
          </string-name>
          , Chien-Ying,
          <article-title>Jen-Yuan Yeh and Hao-Ren Ke.: Plagiarism Detection using ROUGE and WordNet</article-title>
          .
          <source>Journal of Computing</source>
          ,
          <volume>2</volume>
          (
          <issue>3</issue>
          ), pages
          <fpage>34</fpage>
          -
          <lpage>44</lpage>
          ,
          <year>March 2010</year>
          . https://sites.google.com/site/journalofcomputing/.
          <source>ISSN 2151-9617.</source>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>Cristian</given-names>
            <surname>Grozea</surname>
          </string-name>
          and
          <string-name>
            <given-names>Marius</given-names>
            <surname>Popescu</surname>
          </string-name>
          .:
          <article-title>Encoplot - Performance in the Second International Plagiarism Detection Challenge: Lab Report for PAN at CLEF 2010</article-title>
          . In Braschler et al.[
          <volume>2</volume>
          ].
          <source>ISBN 978-88-904810-0-0.</source>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Basile</surname>
          </string-name>
          et al.:
          <article-title>A Plagiarism Detection Procedure in Three Steps: Selection, Matches and “Squares”</article-title>
          .
          <source>In Proceedings of the SEPLN 2009 Workshop on Uncovering Plagiarism, Authorship and Social Software Misuse (PAN</source>
          <year>2009</year>
          ), Donostia-San Sebastian, Spain.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Vlado</surname>
            <given-names>Keselj</given-names>
          </string-name>
          , Fuchun Peng, Nick Cercone and Calvin Thomas.:
          <article-title>"N-gram-based Author Profiles for Authorship Attribution"</article-title>
          .
          <source>In Proceedings of the PACLING'03</source>
          ,
          <string-name>
            <surname>Dalhousie</surname>
            <given-names>University</given-names>
          </string-name>
          , Halifax, Nova Scotia, Canada, pp.
          <fpage>255</fpage>
          -
          <lpage>264</lpage>
          ,
          <year>August 2003</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>