Browsing Information Retrieval System Results

Given that the topics referred to named entities such as persons, locations or organisations, it was decided not to process the topic in any way and to query the retrieval engine

On regular days, this facility (less than 8 km long) corresponds to between a quarter and a third of the total time spent in congestion on the highway network of about 80

Having determined a set of attributes computable on the basis of the query itself and (depending on the informa- tion available) the retrieval results and possibly knowledge about

We considered two approaches to define query types: one is based on query clustering ac- cording to the query performance (their difficulty), while the other approach uses various

Selecting paths based on top-k shortest path ranking is a good strategy in general, but shortest paths may have several redundant resources (entities and properties).. There- fore,

This article presents an automated construc- tion of a logical information context from a terminological resource, available in xml ; we apply this to the resource FranceTerme and

The pair (Total-oriented type, Union of elementary results) leads to a wrong result as soon as the query involves an aggregate function (i.e., query Q2).. The definition of the

and efficiently updatable data structure to respond to top-k queries on indefi- nitely growing, Internet-scale databases and present here ongoing research that addresses