Experiments with Automatic Query Formulation in the Extended Boolean Model

* Final gross prices may vary according to local VAT.

Get Access


This paper concentrates on experiments with automatic creation of queries from natural language topics, suitable for use in the Extended Boolean information retrieval system. Because of the lack and/or inadequacy of the available methods, we propose a new method, based on pairing terms into a binary tree structure. The results of this method are compared with the results achieved by our implementation of the known method proposed by Salton and also with the results obtained with manually created queries. All experiments were performed on the same collection that was used in the CLEF 2007 campaign.

This work was supported by the Grant Agency of Academy of Sciences of the Czech Republic, project No. 1QS101470516, and by the Ministry of Education of the Czech Republic, project No. MŠMT LC536.