We have implemented the state of the art query expansion techniques combined with a
new family of ranking functions which can take into account some semantic structure
in the query.
You can downloaded the code from the next links:
This code has been implemented by José Ramón Pérez Agüera and Hugo Zaragoza
This implementation is only for research and experimental projects. If you are looking for a robust BM25 implementation for Lucene, we recommend you the project leaded by Joaquin Perez-Iglesias, which had been the reference for our Lucene-BM25 implementation.
If you are interested in this work, you can find a scientific description of our approach in:
- Jose R. Perez-Aguera, Hugo Zaragoza, Lourdes Araujo. Exploiting morphological query structure using Genetic Optimization. NLDB 2008 13th International Conference on Applications of Natural Language to Information Systems. Proceedings will be published in Lecture Notes in Computer Science (LNCS) Springer Verlag. [PDF]
- Jose R. Perez-Aguera Hugo Zaragoza. UCM-Y!R at CLEF 2008 Robust and WSD tasks. CLEF 2008 Workshop, 17-19 September, Aarhus, Denmark. (Aceptado como Selecter Paper en Lecture Notes in Computer Science. Springer) Disponible en http://www.clef-campaign.org/2008/working_notes/aguera-paperCLEF2008.pdf.
You can also visit LuceneQE wiki (documentation,FAQ,discussion,...) to obtain more information about this project.
You will need the following libraries to use our implementation:
Query Expansion
Clauses based Query Representation
How to use our code
Volver
2008-10-11