<!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>Using key phrases as new queries in building relevance judgments automatically</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mireille Makary</string-name>
          <email>m.makary@wlv.ac.uk</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Michael Oakes</string-name>
          <email>Michael.oakes@wlv.ac.uk</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Fadi Yamout</string-name>
          <email>fadi.yamout@liu.edu.lb</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Computer Science Department, Lebanese International University</institution>
          ,
          <country country="LB">Lebanon</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Research Group in Computational Linguistics, University of Wolverhampton</institution>
          ,
          <country country="UK">UK</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>We describe a new technique for building a relevance judgment list (qrels) for TREC test collections with no human intervention. For each TREC topic, a set of new queries is automatically generated from key phrases extracted from the top k documents retrieved from 12 different Terrier weighting models when the initial TREC topic is submitted. We assign a score to each key phrase based on its similarity to the original TREC topic. The key phrases with the highest scores become the new queries for a second search, this time using the Terrier BM25 weighting model. The union of the documents retrieved forms the automatically-build set of qrels.</p>
      </abstract>
      <kwd-group>
        <kwd>Evaluation</kwd>
        <kwd>automatic qrels</kwd>
        <kwd>key phrases</kwd>
        <kwd>relevance judgments</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        We propose a new technique based on Efron’s [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] work which used query aspects
to automatically build a set of qrels. The qrels did not involve any human intervention
but the query aspects created for each TREC topic were mostly created manually. To
explain what an aspect is, consider TREC topic 402 that has “behavioral genetics” as
its title. The same information need might be represented by different aspects such as
“behavioral disorders” or “genetics addictions”. Each manually derived aspect was
considered as a query and the union of the top 100 documents retrieved for each topic
was considered to be the set of “pseudo-qrels” or “aspect qrels”. We generate these
new query aspects automatically from key phrases extracted from documents and use
them to generate a relevance judgment list.
      </p>
      <p>
        Following Efron, we use the TREC-8 and TREC-7 test collections. We start
initially by submitting each TREC topic to 12 weighting models found in Terrier (BM25,
DFR_BM25, LGD, In_expC2, In_expB2, IFB2, TFIDF, LemurTF_IDF, PL2, BB2,
DLH13 and DLH) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] as surrogates for different information retrieval systems. The
top K (K=10) documents retrieved by all 12 weighting models are collected in a set
(S) because they have a high probability of being relevant to the topic. Next, we
extract 25 keyphrases using KEA [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] from each document in (S) where each key phrase
consists of 3-5 terms for TREC-8 and 2-3 terms for TREC-7. Values were determined
empirically. We assign a score to each keyphrase depending on its similarity to the
initial topic. We then select the key phrases with the highest scores for each topic (s
&gt;=0.4 for TREC-8 and s&gt;=0.33 for TREC-7) and put them in a set Q. The key phrases
in Q are submitted as queries to the BM25 weighting model and since we are using
another query for the same topic, this leads to new relevant documents that were not
retrieved in the initial topic submission. We combine the union of the documents
retrieved by the key phrases in Q. These documents are considered to be the newly
generated qrels for the initial topic. To compare with Efron, we used a subset of the
TREC systems, the “automatic” runs. In TREC-8 there were 116 automatic runs and
in TREC-7 there were 86. We computed the MAP values using the original qrels for
the test collection and then the MAP values using the newly generated qrels. We
ranked the systems and computed the correlation with the TREC rankings. As shown
in table 1, for TREC-7 the newly generated qrels provide a better correlation than
those generated from Efron’s aspects, while for TREC-8 they are similar. This is
acceptable considering that there is no human intervention in our method.
      </p>
      <p>Efron’s aspects qrels Keyphrases generated qrels
Test Collection Kendall’s tau Spearman Kendall’s tau Spearman</p>
      <p>TREC-7 0.867 0.974 0.914 0.986</p>
      <p>TREC-8 0.77 0.92 0.762 0.912</p>
      <p>Table 1: Kendall’s tau for TREC-7 and TREC-8 automatic runs for different techniques
3</p>
      <p>Conclusion</p>
      <p>In this paper, we automatically generated aset of qrels based on keyphrases
extracted from documents retrieved from 12 Terrier models for a particular topic and we
used them as new queries instead of formulating new ones manually. The union of
the documents obtained after this process was proven to be better than the aspect qrels
generated by Efron. Future work can include testing this method on non-English and
non-TREC test collections to evaluate its performance for any test collection.
4</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Efron</surname>
            <given-names>M.:</given-names>
          </string-name>
          <article-title>Using multiple query aspects to build test collections without human relevance judgements</article-title>
          ,
          <source>ECIR 2009</source>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Witten</surname>
            <given-names>I.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Paynter</surname>
            <given-names>G.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Frank</surname>
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gutwin</surname>
            <given-names>C.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Nevill-Manning</surname>
            <given-names>C.G.</given-names>
          </string-name>
          (
          <year>2000</year>
          )
          <article-title>"KEA: Practical automatic keyphrase extraction</article-title>
          .
          <source>" Working Paper 00/5</source>
          , Department of Computer Science, the University of Waikato.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Ounis</surname>
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Amati</surname>
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Plachouras</surname>
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>He</surname>
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Macdonald</surname>
            <given-names>C.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Johnson D. Terrier</surname>
          </string-name>
          <article-title>Information Retrieval Platform</article-title>
          .
          <source>In Proceedings of the 27th European Conference on Information Retrieval (ECIR 05).</source>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>