<!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>REINA at WebCLEF 2008</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Carlos G. Figuerola, Jose L. Alonso Berrocal, Angel F. Zazo Rodr guez, Montserrat Mateos REINA Research Group, University of Salamanca</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>The task for this year is very similar to last year. However, this time we incorporate last year's experience, in particular, we explored the possibility of improving the selection of snippets, eliminating those that do not make sense, as well as those containing duplicate information. Also, it is intended to explore the real impact of the use of several languages in obtaining relevant fragments.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>This year, the WebCLEF track is similar to the 2007 edition, that is: retrieving text snippets or
fragments of web pages which bring up information about a topic; additionally, snippets must be
in a language from a set of accepted ones. As in 2007, we have a set of topics, each with a title and
a short description, as well as several documents or known sources about the topic. Additionally,
for each topic, we have one or several searches in Google, with the rst 1000 documents retrieved.</p>
      <p>The system used is basically the same as last year, for each topic we considered all documents
retrieved after queries to Google as the collection of documents with which to work. These
documents are to be fragmented into pieces, each of whom will be treated as a separate document.</p>
      <p>For the queries, we use the description that we have for each topic. This query can be enriched
with more terms from the known sources. So, the task can be approached like a classic problem
of retrieval, and apply, consequently, conventional techniques.
Organizers of task provide us the translation to plain text of documents retrieved by Google.
We have valued equal all the searches in Google for same topic. UTF-8 worked ne in almost
all cases, something important as there was documents in several languages and with di erent
alphabets (including Cyrillic, for example). That freed us of the many problems experienced in
previous editions with the detection of the coding system of each document. So, for each document
translated to plain text, we have to segment it in fragments, to obtain the terms of each fragment
and to calculate its weights.</p>
      <p>
        To segment documents and to obtain fragments or short text passages can be applied diverse
techniques. Basically, ones are based on the size in bytes, or words; and others are oriented in
the separation in phrases or paragraphs [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. The former techniques produce, of course, pieces
more homogenous in size, but often devoid of sense, as the partition point is blind. The other
techniques tend to produce fragments of very di erent size. In addition, its application not always
is simple; in many cases the conversion to plain text of a web document loses the separations
between paragraphs, nondi erence between soft and hard line feeds, or blurs structural elements,
like the tables [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>
        A simplist approach, like the election of a orthographic character, as the period (.) like reference
to fragment the text [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], tends to produce passages too short and, therefore, little useful for the
objectives of this task. In our case, we adopted a mixed approach. After several tests, we decided
that the suitable size for each fragment was around the 1500 bytes, but as we wanted fragments
that had informative sense, our fragmenter looks for the period closest the 1500 bytes, and part
by that point.
      </p>
      <p>Some other transformations were carried out: conversion to small letters, removing accents,
removing stopwords, (with a long list of stop words for all the accepted languages), application of
a simple s-stemmer.</p>
      <p>
        Each fragment thus obtained and transformed was considered an independent document.
Terms were extracted and they were weighed according to scheme ATU (slope=0.2) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], applying
to the good well-known vectorial model.
3
      </p>
    </sec>
    <sec id="sec-2">
      <title>Formation of queries</title>
      <p>From the document collection formed with snippets, we must select those that are more usefull for
each topic. The key is in composing suitable queries that can produce this selection. As sources
of information to compose those queries, we have topics with a short title and a brief description.
Additionally, we also have, for each topic, a few documents denominated known sources, in full
text.</p>
      <p>So we can use topics (title and description) like nucleus of each query, and enrich this one with
terms coming from the known sources. The known sources are complete documents, which can
contain many terms.
4</p>
    </sec>
    <sec id="sec-3">
      <title>What's new for this year</title>
      <p>Last year we worked on the formation of the queries. The basic dilemma was whether the core
of each topic (title and description) could be enriched by the terms of the known sources, and to
what extent the use of these terms adds useful information to the query.</p>
      <p>
        Results showed little di erence in using terms of known sources or not. It's better to use
these terms, ma non tropo. However, runs of last year showed more things. Web pages are not
conventional documents; in addition to hyperlinks and hypermedia elements, they have a structure
that is not always sequentially. Many web pages are viewed by the user as a set of visual blocks
that have di erent functions and containing di erent types of information [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. From the standpoint
of obtaining this information, some blocks are more useful than others. The conventional tools of
conversion to plain text are not able to reproduce this visual structure, the result is that many
of the fragments that we get are meaningless. Others contain information not relevant to our
purposes: navigational aids, copyright notices, advertising, etc..
      </p>
      <p>
        Unfortunately, this visual structure can not be obtained from the elements of HTML and this
a di cult area to address, although there are some jobs that are trying to solve these problems
[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>We tried a very naive approach, ltering and dropping snippets based on a simple heuristics:
fragments with too many blank lines, with very short lines, with a few words in relation to the
size of the fragment, and so on. So, from 639 215 snippets obtained from documents , our lter
deleted 165 442 (=25.88 %). This would suggest that we work with a database with a lot of noise,
a deepening in the way of extracting fragments could possibly signi cantly improve results.</p>
      <p>In similar way, last year we observed a lot of duplicated snippets. Information is replicated
across the web, and so we have fragments of di erent pages that have the same information.
However, as visual presentation is not always the same, the results of the conversion to plain
text produces di erent strings. We used the Dice Coe cient as measure to compare snippets and
discover duplicates and almost duplicates. In this case, we applied detection of duplicates on the
retrieved snippets for each topic. So, if we consider snippets with Dice similarity greater than 0.7,
we found that 11.08 % are duplicates ones.</p>
      <p>On the other hand, one may wonder whether the retrieval of fragments in di erent languages
provide more relevant information, and to what extent. All topics allow at least fragments into
English as a useful response and, additionally, in other languages. It is expected that these
fragments in other languages are derived from queries which include terms in those other languages.
We made a run using queries in English only, which should allow us to compare results and assess
whether the extent to which the use of other languages aid in retrieval.
5</p>
    </sec>
    <sec id="sec-4">
      <title>Conclusions</title>
      <p>We have described our approach to WebCLEF task, similar to last year, but incorporating the
experience of the last edition. On this occasion, although on the same basis, we have focused
on the e ect of ltering meaningless fragments, detect duplicates, as well as in estimating the
importance of documents in languages other than English. At the time of writing these notes does
not yet have the results of experiments.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Kang</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Choi</surname>
          </string-name>
          .
          <article-title>A preliminary report for an information extraction system based on visual block segmentation</article-title>
          .
          <source>Technical Report TR-IS-2007-1</source>
          , Hanyang University, Intelligent Systems Laboratory,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Andrei</given-names>
            <surname>Mikheev</surname>
          </string-name>
          .
          <article-title>Tagging sentence boundaries</article-title>
          .
          <source>In Proceedings of the First Meeting of the North American Chapter of the Computational Linguistics (NAACL2000)</source>
          ,
          <fpage>page</fpage>
          <lpage>264271</lpage>
          . Morgan Kaufmann,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Amit</given-names>
            <surname>Singhal</surname>
          </string-name>
          , Chris Buckley, and
          <string-name>
            <given-names>Mandar</given-names>
            <surname>Mitra</surname>
          </string-name>
          .
          <article-title>Pivoted document length normalization</article-title>
          .
          <source>In Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, August</source>
          <volume>18</volume>
          {
          <fpage>22</fpage>
          ,
          <year>1996</year>
          ,
          <article-title>Zurich, Switzerland (Special Issue of the SIGIR Forum)</article-title>
          , pages
          <fpage>21</fpage>
          {
          <fpage>29</fpage>
          . ACM,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Yudong</given-names>
            <surname>Yang and HongJiang Zhang</surname>
          </string-name>
          .
          <article-title>Html page analysis based on visual cues</article-title>
          .
          <source>In ICDAR</source>
          , pages
          <volume>859</volume>
          {
          <fpage>864</fpage>
          . IEEE Computer Society,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Shipeng</given-names>
            <surname>Yu</surname>
          </string-name>
          , Deng Cai,
          <string-name>
            <surname>Ji-Rong Wen</surname>
          </string-name>
          , and
          <string-name>
            <surname>Wei-Ying Ma</surname>
          </string-name>
          .
          <article-title>Improving pseudo-relevance feedback in web information retrieval using web page segmentation</article-title>
          .
          <source>In Proceedings of the Twelfth International World Wide Web Conference, WWW2003</source>
          , Budapest, Hungary,
          <fpage>20</fpage>
          -
          <lpage>24</lpage>
          May
          <year>2003</year>
          , pages
          <fpage>11</fpage>
          {
          <fpage>18</fpage>
          . ACM,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Angel</surname>
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Zazo</surname>
          </string-name>
          , Carlos G. Figuerola, Jose Luis Alonso Berrocal, and
          <article-title>Emilio Rodr guez. Reformulation of queries using similarity thesauri</article-title>
          .
          <source>Information Processing &amp; Management</source>
          ,
          <volume>41</volume>
          (
          <issue>5</issue>
          ):
          <volume>1163</volume>
          {
          <fpage>1173</fpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>