<!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>Optimized Fuzzy Text Alignment for Plagiarism Detection Notebook for PAN at CLEF 2012</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Fernando Sánchez-Vega</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Manuel Montes-y-Gómez</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Luis Villaseñor-Pineda</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Laboratorio de Tecnologías del Lenguaje Instituto Nacional de Astrofísica</institution>
          ,
          <addr-line>Óptica y Electrónica (INAOE)</addr-line>
          ,
          <country country="MX">México</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper describes a method for plagiarism detection based on a fuzzy alignment between a given pair of documents. The proposed method assigns a weight to each word of the suspicious document according to the straightness of its alignment to the source document; this weight is used as a kind of plagiarism probability measure for each word of the suspicious document. The paper also presents a strategy to optimize the alignment of the two documents based on the evaluation of all possible matches in a limited context. Evaluation results on the test set of the PAN corpus show that the method is relatively fast and that it could detect 35% of the plagiarized words with accuracy greater than 50%.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Copying another author’s text and claiming it s authorship is called plagiarism ]1].
Current research on automatic plagiarism detection has mainly focused on two tasks:
candidate document retrieval and detailed comparison. While the first task consists in
retrieving –from the Web– a set of candidate source documents for a given
suspicious document, the second task considers the identification of all plagiarized
passages from the suspicious document and their corresponding passages from the
source document.</p>
      <p>In this paper we describe a method for the detailed comparison task carried out at
the PAN 2012 competition. The proposed method is supported on the premise that a
strong alignment between two –different– documents is an indicator of plagiarism,
whereas the lack of a strong alignment on them points to a plagiarism free situation.
The following section briefly describes the main parts of the proposed method.</p>
    </sec>
    <sec id="sec-2">
      <title>Our plagiarism detection method</title>
      <p>The alignment of the documents is carried out by a method that matches the words
from the suspicious and source documents; the straighter the alignment, the greater
the probability that plagiarism has occurred. The method has two main modules. The
first module assigns a weight to each word from the suspicious document that
indicates its probability to belong to a plagiarized section from the source document.
This weight is computed by a fuzzy alignment strategy optimized by the use of
multiple exploratory particles. The second module determines the plagiarized sections of
the documents by applying some threshold functions on the weights computed by the
first module. Sections 2.1 and 2.2 describe in detail these two modules.</p>
      <sec id="sec-2-1">
        <title>2.1 Fuzzy document alignment</title>
        <p>The fuzzy alignment strategy matches the words from the suspicious and source
documents without considering any word order restriction. It assigns a weight to each
word from the suspicious document as indicated by the following formula:
where indicates the probability that word has been plagiarized from the
source document, is the hypothetical position1 that should have in the
source document to be part of a copy-&amp;-paste sequence, and is the real
position of in the source document.</p>
        <p>The “plagiarism probability” of each word, , is equivalent to the inverse of
the distance between the current position of the word in the source document and its
expected position caused by a copy-&amp;-paste action. Intuitively, measures the
degree of change needed in the suspicious document to produce an exact copy of the
source document. A special case is when does not occur in the source document;
it is assumed that , and therefore .</p>
        <p>The position is computed using the last word evaluated before (i.e.,
). Basically, is the next position after if and only if
as it is showed in the following formula.</p>
        <p>

</p>
        <p>On the other hand, the position has multiple possible values when
occurs several times in the suspicious document. In order to select one value from all
possible values for , the most straightforward strategy is to choose the
that maximizes the value of . The problem with this kind of solution
is that it provides a local maximum, which often is far from the global maximum. To
tackle this problem we considered an optimization strategy based on the use of
multiple exploratory particles.
1 Positions are expressed in number of words from the beginning of the documents.
Optimization based on multiple exploratory particles
To get the best alignment of the two given documents it is necessary to select the
values that maximize all values for the whole suspicious document.
Unfortunately, the achievement of this goal is extremely expensive, and, therefore,
we use an optimization strategy that considers the best choice of after
examining all options for the k next words using multiple particles to perform the
exploration. This strategy allows determining the best value in the context
,…, as indicated by the following formula.</p>
        <p>The optimization strategy requires multiple exploratory particles to handle the
cases when a word in the search context has more than one possible value.
In these cases, there is a bifurcation in the possible path of alignments to follow, and
several particles are needed to explore all different paths. That is, during the
exploration: each particle add the value of the path that it follows after exploring the
next k words; the particle getting the largest result is selected and the particles that
did not follow the same first bifurcation are removed; then, the process continues
determining the alignment of the following suspicious word .</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2 Determining of plagiarized sections</title>
        <p>This module applies some heuristic functions on the values in order to
determine the plagiarized sections from the suspicious document. It first smoothes the
values computing the average over 40 words around ; the new values are
represented by . Then, it evaluates each word and defines it as a plagiarized
word if it satisfied the following three conditions:</p>
        <p>I. All the words in i have
II. At least N words in i have
III. At most M words in i have
where i indicates a window of 21 words centered at , and ,  , and  are
thresholds satisfying  &gt; &gt; .</p>
        <p>Finally, all sequences of consecutive plagiarized words with length greater than
100 characters are determined as the plagiarized sections.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Experiments</title>
      <p>For the experiments, we tuned the parameters using a set of 20 pairs of documents
that contain examples of paraphrased plagiarism; the resulting values were: α = 0.01,
β = 0.15, γ = 0.05, N = 4, M = 7. Table 1 shows the results of the proposed method
on the training and test collections. Details on these collections can be found at
http://pan.webis.de/.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Conclusions</title>
      <p>This paper described the method developed by the Laboratory of Language
Technologies from INAOE for the document detail comparison task at PAN 2012. The
proposed method is based on a fuzzy alignment of a pair of documents. It mainly
computes a plagiarism probability for each word of the suspicious document which,
intuitively, indicates the degree of change needed in this document to produce an
exact copy of the given source document. One important contribution of this work is
the use of a search strategy guided by several exploratory particles that allow us to
get semi-optimal alignments between the documents.</p>
      <p>An initial analysis of the experimental results showed that our method was good in
locating plagiarized sections in the suspicious documents but was not effective in
determining the exact fragments from the source documents that were plagiarized. In
addition, these results also showed that our method, although based on an expensive
optimized search process, was faster that other approaches in completing the
detection task.</p>
      <p>Acknowledgements: This work was done under partial support of CONACYT
(project grants 134186, 106013 and scholarship 258345/224483).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <given-names>Martin</given-names>
            <surname>Potthast</surname>
          </string-name>
          , Andreas Eiselt, Alberto Barrón-Cedeño,
          <string-name>
            <given-names>Benno</given-names>
            <surname>Stein</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Paolo</given-names>
            <surname>Rosso</surname>
          </string-name>
          .
          <source>Overview of the 3rd International Competition on Plagiarism Detection.</source>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <source>Working Notes of the Workshop on Uncovering Plagiarism</source>
          , Authorship, and Social Software Misuse,
          <string-name>
            <surname>PAN</surname>
          </string-name>
          <year>2011</year>
          . Amsterdam, Netherlands,
          <year>September 2011</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>