<!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>Heterogeneous Queries for Synoptic and Phrasal Search</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Faculty of Informatics, Masaryk University</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2014</year>
      </pub-date>
      <fpage>1017</fpage>
      <lpage>1020</lpage>
      <abstract>
        <p>This paper describes an architecture of the source retrieval system used at PAN 2014 lab on uncovering plagiarism, authorship, and social software misuse. The system is based on the systems used in past years at PAN 13 [6] and PAN 12 [5]. The majority of features were adapted with some improvements described in this paper. The source retrieval subsystem forms an integral part of a modern system for plagiarism discovery.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>Systems which compute similarities between documents can significantly help with
plagiarism detection. They automate the tedious work such as locating possible sources of
plagiarism and finding similar text passages. If the suspicious passages are highlighted
by the system, the supervisor only checks whether a passage is a plagiarism case or not.
The state of the art anti-plagiarism systems evaluate document similarities in order to
select suspicious passages of a source document. This evaluation is refered in PAN as
the document alignment. Documents are algorithmically aligned to a corpus of known
documents. However, if the corpus does not contain the original document the
similarity between the original and the suspicious document can not be detected. Therefore a
potential source documents should be retrieved from all documents prior to text
alignment calculations. The corpus of all documents is usually very large, for example the
entire web, and a search engine is utilized as a retrieval tool. It is ideally utilized
automatically in the same manner as plagiarizing users would do manually. The global view
of the system for unoriginal text detection is depicted in figure 1.</p>
      <p>With the usage of a given search engine, the problem of source retrieval is then
reduced to the problem of combining proper queries and passing them to the search
engine. Selecting and downloading search engine results also influence total performance
of the source retrieval system. The queries pose the most expensive piece of operation,
whereas the downloads are quite cheap. In the real-world scenario, we are often
limited by a number of queries executed in a given time period or by a total number of
queries per document. During the operation the system should maximize the recall and
precision of retrieved results and also minimize the total number of executed queries as
much as possible.</p>
      <p>
        The following sections describe the key parts of the system for source retrieval used
at PAN 2014. More information about the task and the competition can be found in the
task overview written by the lab organizers [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
Suspicious
Document
      </p>
      <p>The
Web</p>
      <p>Plagiarism discovery
Candidate Document</p>
      <p>Retrieval</p>
      <p>Candidate
Documents</p>
      <p>Detailed
Document
Comparison
Documents</p>
      <p>Indices
Additional
Sources</p>
      <p>Knowledge-based
post-processing</p>
      <p>Similar
Passages</p>
      <p>
        For obtaining the search results two search engines have been utilized: The
Chatnoir [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] search engine for queries based on extracted keywords; and the Indri [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] search
engine for combined queries and phrases. Both search engines index the ClueWeb09
corpus which served as a main external corpus for document retrieval. The software
were executed and evaluated via TIRA framework [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] on a test corpus of selected
english-written and plagiarized documents.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Building of the Queries</title>
      <p>Several types of queries were prepared.This year we combined keywords-based queries,
paragraph-based queries and headers-based queries together. Some of the prepared
queries could be discarded from the execution, no query refinement was applied
according to the results, but some of the top scored keywords could appear in the different
combination in more than one query.
2.1
From the whole suspicious document, there were extracted keywords using TF-IDF
scoring of lemmas created via Python NLTK lemmatizer and omitting english
stopwords. Firstly we created so called pilot query from top scored six terms. This query
was passed to both Chatnoir and Indri search engines with Indri setting for combine
belief operator of the query.</p>
      <p>Based on the three top-scored single-term keywords, their collocations of two more
words were extracted. Those served as phrasal search queries, which were passed to
Indri in order to lookup a contextual occurrence of the selected keywords. All other
subsequent keywords-based queries were passed to Chatnoir only and they were created
by combining collocations of top scored keywords together with the rest of the extracted
keywords up to 6 tokens long. From the rest of the keywords, if any, the remaining
six-term long queries were created. The total number of used keywords-based queries
depended on each document characteristics. From some of the documents, there were
identified fewer keywords than from others. Usually there were prepared around 10
keywords-based queries per document.
2.2</p>
      <sec id="sec-2-1">
        <title>Paragraph-based Queries</title>
        <p>From each paragraph of the suspicious document, a single paragraph-based query was
created. The longest sentence from the specific paragraph was used to build the query.
From the selected sentence six subsequent terms were selected from a random position
within the sentence. The query was created from those six terms, only the punctuation
was removed. The resulting query was passed to the Indri search engine with proximity
term number of 1 denoting the phrasal search.
2.3</p>
      </sec>
      <sec id="sec-2-2">
        <title>Headers-based Queries</title>
        <p>
          The headers-based queries were used in the form in which they appeared in the text
limited to six words in length. They were passed to Indri as a phrasal query as well. For
discovering the headers in the text the approach adopted from Suchomel et al. 2012 [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]
was used with no modifications.
2.4
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>Chunking</title>
        <p>Three types of text chunking were applied: sentence and word chunking for keywords
extraction; headers detection; and paragraph chunking. For each type of query the
corresponding chunking method was always applied on the whole document from the
beginning.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Search Control</title>
      <p>All prepared queries were processed according to their priority. Starting with the
keywords-based, then the paragraph-based and last the header-based queries. Only all
keywords-based queries – the pilot query, collocation queries and remaining
keywordscombined queries – were executed for each suspicious document. After each query all
its results were processed and positions of discovered similarities were stored. To each
subsequent (not keywords-based) query its position was also attached, if that position
collided with any of already found similarities, the query was omitted from the queue
of prepared queries.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Downloading the Results</title>
      <p>For each search engine result a snippet based on the given query can be obtained prior to
the full document download. The snippet is obtained via ChatNoir API, it is considered
as no operation and it provides rough information about the document content. It
contains a portion of the document up to 500 characters around a given textual string. We
generated the snippet for all documents from results based on specific query for each
term in that query. The all snippets from one document were concatenated together
and its tuples of two terms were compared with tuples from the suspicious document.
Concordance of the tuples of 20 % or more was the threshold for decision about the
document download.</p>
      <p>
        The downloaded results were textually aligned to the suspicious document using
feature type selection for computing similarities described in Suchomel, Kasprzak et
al. 2013 [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. If any similarity were detected, the document were reported as a potential
source of plagiarism. Thus all the reported documents contain at least some similarity
with the suspicious document.
5
      </p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions</title>
      <p>This paper described the key aspects and changes from our erstwhile systems for
candidate document retrieval used at PAN 14 lab on uncovering plagiarism. The architecture
stems from PAN 12 and PAN 13 labs and the real-world anti-plagiarism system which
is in use at Masaryk University. The results of the PAN show that this approach is one
of the best for a real-life adoption, since it achieved a decent recall with just a fraction
of used queries. Such approach is applicable for detection of suspicious texts, which
may contain plagiarism, that can then be selected for further investigation.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Gollub</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Potthast</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Beyer</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Busse</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pardo</surname>
            ,
            <given-names>F.M.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosso</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stamatatos</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Recent trends in digital text forensics and its evaluation - plagiarism detection, author identification, and author profiling</article-title>
          . In: Forner,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Müller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            ,
            <surname>Paredes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Rosso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Stein</surname>
          </string-name>
          ,
          <string-name>
            <surname>B</surname>
          </string-name>
          . (eds.)
          <source>CLEF. Lecture Notes in Computer Science</source>
          , vol.
          <volume>8138</volume>
          , pp.
          <fpage>282</fpage>
          -
          <lpage>302</lpage>
          . Springer (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Potthast</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gollub</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hagen</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tippmann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kiesel</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stamatatos</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosso</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Overview of the 5th international competition on plagiarism detection</article-title>
          .
          <source>In: CLEF 2013 Evaluation Labs and Workshop (September</source>
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Potthast</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hagen</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Graßegger</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Michel</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tippmann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Welsch</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>ChatNoir: A Search Engine for the ClueWeb09 Corpus</article-title>
          . In: Hersh,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Callan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Maarek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Sanderson</surname>
          </string-name>
          , M. (eds.) 35th
          <source>International ACM Conference on Research and Development in Information Retrieval (SIGIR 12)</source>
          . p.
          <fpage>1004</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (Aug
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Strohman</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Metzler</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Turtle</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Croft</surname>
          </string-name>
          , W.B.:
          <article-title>Indri: a language-model based search engine for complex queries</article-title>
          .
          <source>Tech. rep., in Proceedings of the International Conference on Intelligent Analysis</source>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Suchomel</surname>
          </string-name>
          , Š.,
          <string-name>
            <surname>Kasprzak</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brandejs</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Three way search engine queries with multi-feature document comparison for plagiarism detection</article-title>
          . In: Forner,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Karlgren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Womser-Hacker</surname>
          </string-name>
          ,
          <string-name>
            <surname>C</surname>
          </string-name>
          . (eds.) CLEF (Online Working Notes/Labs/Workshop). pp.
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Suchomel</surname>
          </string-name>
          , Š.,
          <string-name>
            <surname>Kasprzak</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brandejs</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Diverse queries and feature type selection for plagiarism discovery</article-title>
          .
          <source>In: CLEF 2013 Evaluation Labs and Workshop</source>
          . pp.
          <fpage>1</fpage>
          -
          <lpage>8</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>