Show simple item record

dc.contributor.authorZazo Rodríguez, Ángel Francisco es_ES
dc.contributor.authorFiguerola, Carlos G.es_ES
dc.contributor.authorAlonso Berrocal, José Luis es_ES
dc.date.accessioned2009-01-26es_ES
dc.date.accessioned2009-10-14T12:04:32Z
dc.date.available2009-10-14T12:04:32Z
dc.date.issued2007es_ES
dc.identifier.citationZazo Rodríguez, A.F., García Figuerola, L.C., Alonso Berrocal, J.L. (2007). REINA at CLEF 2007 Robust Task. En Nardi, A., Peters, C. (Eds.), "Working Notes for the CLEF 2007 Workshop, 19-21 September, Budapest, Hungary". [CD-ROM]es_ES
dc.identifier.urihttp://hdl.handle.net/10366/55732es_ES
dc.descriptionDescribe el trabajo que el Grupo de Investigación REINA de la Universidad de Salamanca presentó en CLEF 2007 sobre sistemas de recuperación de información monolingüe (Inglés, Francés y Portugués) y bilingüe (Inglés al Francés). Muestra los resultados obtenidos en las evaluaciones aplicando técnicas de expansión local.es_ES
dc.description.abstractThis paper describes our work at CLEF 2007 Robust Task. We have participated in the monolingual (English, French and Portuguese) and the bilingual (English to French) subtask. At CLEF 2006 our research group obtained very good results applying local query expansion using windows of terms in the robust task. This year we have used the same expansion technique, but taking into account some criteria of robustness: MAP, GMAP, MMR, GS@10, P@10, number of failed topics, number of topics bellow 0.1 MAP, and number of topics with P@10=0. In bilingual retrieval experiments threemachine translation programs were used to translate topics. For the target language, translations were merged before performing a monolingual retrieval. We also applied the same local expansion technique. This year the results were disappointing. We think out that the reason is the difficulty to select the best measurement for robustness. Perhaps the problem is that all measurements are average results over all topics, but thehard topics are inherently hard and must be analyze separately. This year all our runs also ends up in good ranking, both base runs and expanded ones. We think that the reason is that we used a good information retrieval system, and the expansion technique is robust because it does not deteriorate significantly the retrieval performance.es_ES
dc.format.mimetypeapplication/pdfes_ES
dc.language.isoenges_ES
dc.relation.requiresAdobe Acrobates_ES
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Unported
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/3.0/
dc.subjectExpansión de consultaes_ES
dc.subjectPlazo Windowses_ES
dc.subjectTesauros de Asociaciónes_ES
dc.subjectCLIRes_ES
dc.subjectTraducción automáticaes_ES
dc.subjectRobust retrievales_ES
dc.subjectQuery expansiones_ES
dc.subjectTerm Windowses_ES
dc.subjectAssociation thesauries_ES
dc.subjectCross-Language Information Retrievales_ES
dc.subjectMachine translationes_ES
dc.subjectAlmacenamiento y recuperación de la informaciónes_ES
dc.titleREINA at CLEF 2007 Robust Taskes_ES
dc.typeinfo:eu-repo/semantics/articlees_ES


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Unported
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 Unported