<!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>ENSM-SE at INEX 2012: Basic Experiments</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Philippe Beaune</string-name>
          <email>beaune@emse.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Michel Beigbeder</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mihaela Juganaru-Mathieu</string-name>
          <email>mathieu@emse.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Ecole Nationale Superieure des Mines de Saint-Etienne Institut Henri Fayol 158 cours Fauriel</institution>
          ,
          <addr-line>F 42023 SAINT ETIENNE CEDEX 2</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
      </contrib-group>
      <fpage>2</fpage>
      <lpage>5</lpage>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1 Introduction</title>
      <p>
        Our objective in the INEX 2012 campaign was to integrate the semantic tags
and the linked data in our proximity retrieval model. This model was sucessfully
used in previous INEX campaigns and obtained good results, particularly in
2007 with the second place in the Ad Hoc Track Focused Task [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], and in 2010
with the rst place in the Ad Hoc Track Relevant in Context Task [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]
      </p>
      <p>Though we had several discom tures with the collection because i) there
were several versions of the collection, the last one available at the end of June,
one week before the initial run submission deadline, ii) the di erent versions
were di cult to follow because they were not clearly identi ed, iii) not every
documents were well formed according to the XML format, iv) the provided
DTD gives little information on the actual structure and its semantics, v) the
documents contains many semantic annotations but the underlying ideas used
to generate them are not documented making them di cult to apprehend. We
present in section 2 how we processed the documents to alleviate the problems
with the DTD.</p>
      <p>Thus we only have been able to do some basic experiments presented in
section 3. In section 4 we present our work in progress.</p>
    </sec>
    <sec id="sec-2">
      <title>Collection preparation</title>
      <p>The collection comes with 3 164 040 documents, of which 4 749 are not well
formed according to the XML format. We deleted these documents in our
experiments as they only represent 0,15% of the collection.</p>
      <p>Structure was extremely di cult to apprehend with the provided DTD
(wikipedia-lod-xml.dtd) because almost every elements can contain any other one.
Here is a small extract of this DTD:
10 &lt;!ELEMENT wikipedia ( heading | list | paragraph | table | hr | list |
preblock )* &gt;
11
12 &lt;!ELEMENT heading ANY &gt;
13 &lt;!ATTLIST heading level CDATA #IMPLIED &gt;
14
15 &lt;!ELEMENT list ( listitem+ ) &gt;</p>
      <p>Some XML elements (such as wikipedia and list) are well de ned because
they could only contain a small number of meaningful elements. But 46 of the
70 XML tags de ned in this DTD can contain any content, such as heading,
listitem and paragraph.</p>
      <p>With this DTD the following extract can be a part of a valid document:
[...]
&lt;heading&gt;
&lt;listitem&gt;
&lt;paragraph&gt;</p>
      <p>&lt;heading&gt;
[...]
where the structure has no sense using the usual meaning of the words heading,
paragraph and so on.</p>
      <p>So we decided to build a new collection where each document validates the
very simple following DTD:
&lt;!ELEMENT article ( title, CDATA ) &gt;
&lt;!ELEMENT title CDATA&gt;</p>
      <p>Some elements were deleted, for example yagoproperties and
dbpediaproperties. For the other elements we only kept their textual content. We also
ignored all the attributes except the attribute @name, whose value was kept as
text. This operation was done with xsltproc and processing the whole collection
lasted more than 17 hours.</p>
      <p>
        We also tried to use TreeTagger[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] but it was too slow to process the whole
collection because each document needed around one second to be processed.
      </p>
      <p>Finally, the collection and its very simple structure was indexed with zettair1
with the light stemmer on, lasting 40 minutes.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Runs</title>
      <p>Three runs were allowed for participants in INEX 2012. Two of our runs were
produced with zettair, the rst one, Emse-085, used a language model with a
Dirichlet smoothing. The second one, Emse-086, used the well known BM25
model with k1 = 1:2, k3 = +1 and b = 0:75. Both these runs were produced
within 30 seconds for the 140 queries.</p>
      <p>
        The third run, Emse-087 used our proximity model developed for the
previous INEX campaigns [
        <xref ref-type="bibr" rid="ref4">4, 5</xref>
        ], and its execution needed 2 minutes and 45 seconds.
      </p>
      <p>For the present we do not have the assessments so no evaluation was
performed.
1 http://www.seg.rmit.edu.au/zettair/</p>
    </sec>
    <sec id="sec-4">
      <title>Perspectives</title>
      <sec id="sec-4-1">
        <title>Proximity model</title>
        <p>Our proximity model works with the following type of structured documents:
document (part)+
part text
part (part)+
part title (part)+
For plain text our model computes a score based on a fuzzy neighbouring
parameterized function. For a document composed of a concatenation of parts, the
score is the sum of the part scores. For a document/part with a title, title words
are considered as close to any word of the part content.
4.2</p>
      </sec>
      <sec id="sec-4-2">
        <title>First choice</title>
        <p>The provided DTD doesn't permit us to easily construct a collection ful lling
the above description.The title of the documents was easy to extract, but as
the part titles and the parts themselves are not nested, extracting these titles
to insert them in their corresponding part is not possible in XSLT [6]. So we
considered the XML documents as:
document title text
and we applied our model in this simpli ed case.
4.3</p>
      </sec>
      <sec id="sec-4-3">
        <title>Future works</title>
        <p>We detected that the tag heading could be the title of parts, but the parts
themselves are not explicit and clearly delimited. We will construct a new
collection ful lling our document model using a high level programming language
using the library libxml and build the nesting based on the assumption that
the attribute @level of the tag heading indicates the actual nesting.</p>
        <p>We will also consider the tags yagoproperties and dbpediaproperties as
parts of the newer documents. This work is in progress.
5. Beigbeder, M.: Focused retrieval with proximity scoring. In Shin, S.Y., Ossowski,</p>
        <p>S., Schumacher, M., Palakal, M.J., Hung, C.C., eds.: SAC, ACM (2010) 1755{1759
6. M ller, A., Olesen, M.O., Schwartzbach, M.I.: Static validation of xsl
transformations. ACM Trans. Program. Lang. Syst. 29(4) (August 2007)</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Fuhr</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kamps</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lalmas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Malik</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Trotman</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Overview of the inex 2007 ad hoc track</article-title>
          . In Fuhr, N.,
          <string-name>
            <surname>Kamps</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lalmas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Trotman</surname>
          </string-name>
          , A., eds.
          <source>: INEX</source>
          . Volume
          <volume>4862</volume>
          of Lecture Notes in Computer Science., Springer (
          <year>2007</year>
          )
          <volume>1</volume>
          {
          <fpage>23</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Arvola</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Geva</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kamps</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schenkel</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Trotman</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vainio</surname>
          </string-name>
          , J.:
          <article-title>Overview of the inex 2010 ad hoc track</article-title>
          . In Geva, S.,
          <string-name>
            <surname>Kamps</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schenkel</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Trotman</surname>
          </string-name>
          , A., eds.
          <source>: INEX</source>
          . Volume
          <volume>6932</volume>
          of Lecture Notes in Computer Science., Springer (
          <year>2010</year>
          )
          <volume>1</volume>
          {
          <fpage>32</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Schmid</surname>
          </string-name>
          , H.:
          <article-title>Probabilistic Part-of-Speech Tagging Using Decision Trees</article-title>
          .
          <source>In: International Conference on New Methods in Language Processing</source>
          . (
          <year>September 1994</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Beigbeder</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Imafouo</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mercier</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>ENSM-SE at INEX 2009 : Scoring with proximity and semantic tag information</article-title>
          .
          <volume>6203</volume>
          (
          <year>2009</year>
          )
          <volume>49</volume>
          {
          <fpage>58</fpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>