Fuzzy term proximity with boolean queries at 2006 TREC Terabyte task - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Fuzzy term proximity with boolean queries at 2006 TREC Terabyte task

Résumé

We report here the results of fuzzy term proximity method app lied to Terabyte Task. Fuzzy proxmity main feature is based on the idea that the clos er the query terms are in a document, the more relevant this document is. With this p rinciple, we have a high precision method so we complete by these obtained with Zettair search engine default method (dirichlet). Our model is able to deal with Boolean qu eries, but contrary to the traditional extensions of the basic Boolean IR model, it does not explicitly use a proximity operator because it can not be generalized to node s. The fuzzy term proximity is controlled with an influence function. Given a query term a nd a document, the influence function associates to each position in the text a value depe ndant of the distance of the nearest occurence of this query term. To model proximity, th is function is decreasing with distance. Different forms of function can be used: triangula r, gaussian etc. For practical reasons only functions with finite support were used. The sup port of the function is limited by a constant called k. The fuzzy term proximity func tions are associated to every leaves of the query tree. Then fuzzy proximities are co mputed for every nodes with a post-order tree traversal. Given the fuzzy proximities of the sons of a node, its fuzzy proximity is computed, like in the fuzzy IR models, with a mim imum (resp. maximum) combination for conjunctives (resp. disjunctives) nodes. Finally, a fuzzy query proximity value is obtained for each position in this document at the ro ot of the query tree. The score of this document is the integration of the function obt ained at the tree root. For the experiments, we modify Lucy (version 0.5.2) to implement ou r matching function. Two query sets are used for our runs. One set is manually built wit h the title words (and sometimes some description words). Each of these words is OR 'ed with its derivatives like plurals for instance. Then the OR nodes obtained are AND'ed a t the tree root. An other automatic query sets is built with an AND of automatically ex tracted terms from the title field. These two query sets are submitted to our system with tw o values of k: 50 and 200. The two corresponding query sets with flat queries are also su bmitted to zettair search engine.
Fichier non déposé

Dates et versions

hal-00406903 , version 1 (23-07-2009)

Identifiants

  • HAL Id : hal-00406903 , version 1

Citer

Annabelle Mercier, Michel Beigbeder. Fuzzy term proximity with boolean queries at 2006 TREC Terabyte task. The Fifteenth Text REtrieval Conference Proceedings (TREC 2006), Nov 2006, Gaithersburg, Maryland, United States. 9p. ⟨hal-00406903⟩
58 Consultations
0 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More