Mireya Tovar Vidal

BUAP: A Recursive Approach to the Data-Centric Track of INEX 2011

A recursive approach for keyword search on XML data for the Ad-Hoc Search Task of INEX 2011 is presented in this paper. The aim of this approach was to detect the concrete part (in the representation tree) of the XML document containing the expected answer. For this purpose, we initially obtain a tree structure, which represents an XML document, tagged by levels. A typical search engine based on posting lists is used in order to determine those documents that match in some degree with the terms appearing in the given query(topic). Thereafter, in a recursively process, we navigate into the tree structure until we find the best match for the topic. The obtained results are shown and compared with the best overall submission score obtained in the competition.

Comparing four Methods to Select Keywords that Use n-Grams to Generate Summaries

In this paper an algorithm to generate document extracts is proposed. This extract is composed of the most significative sentences of the current document. These sentences are chosen by considering their similitude with a so-denominated virtual paragraph (VP). The VP is formed by the key words that are obtained by the four methods that use n-grams, employed in this research. The experiments are performed over 100 documents of the DUC-2000 collection.