This paper presents the experiments of Language Technologies Research Centre (LTRC) as part of their participation in CLEF2 2007 Indian language to English ad-hoc cross language document retrieval task. In this paper we discuss our Hindi and Telugu to English CLIR system and the experiments using CLEF 2007 dataset. We used a variant of TFIDF algorithm in combination with a bilingual lexicon for...

This paper presents the experiments of Language Technologies Research Centre (LTRC) as part of their participation in CLEF 2007 Indian language to English ad-hoc cross language document retrieval task. In this paper we discuss our Hindi and Telugu to English CLIR system and the experiments using CLEF 2007 dataset. We used a variant of TFIDF algorithm in combination with a bilingual lexicon for ...

In the patent domain Boolean retrieval is particularly common. But despite the importance of Boolean retrieval, there is not much work in current research assisting patent experts in formulating such queries. Currently, these approaches are mostly limited to the usage of standard dictionaries, such as WordNet, to provide synonymous expansion terms. In this paper we present a new approach to sup...

Starting from the idea that the closer the query terms in a document are to each other the more relevant the document, we propose an information retrieval method that uses the degree of fuzzy proximity of key terms in a document to compute the relevance of the document to the query. Our model handles Boolean queries but, contrary to the traditional extensions of the basic Boolean information re...

In this paper, an approach to handle time in relational query languages is outlined. The approach is based on extending Boolean and Comparison operators by allowing their operands to be sets of intervals. Proposed model provides temporal retrieval capability using an extended logic for comparison and Boolean operators. The extended logic allows these operators to accept sets of intervals and re...

OBJECTIVE The aim of this paper was to present a practical InfoRoute algorithm and applications developed by CISMeF to perform a contextual information retrieval across multiple medical websites in different health domains. METHODS The algorithm was developed to treat multiple types of queries: natural, Boolean and advanced. The algorithm also generates multiple types of queries: Boolean quer...

Ranking techniques have long been suggested as alternatives to more conventional Boolean methods for searching document collections. The cost of computing a ranking is, however, greater than the cost of performing a Boolean search, in terms of both memory space and processing time. Here we consider the resources required by the cosine method of ranking, and show that with a careful application ...

Bilingual transthr dictionaries are an important resource for query translation in cross-language text retrieval. However, term translation is not an isomorphic process, so dictionary-based systems must address the problem of ambiguity in language translation. In this paper, we claim that boolea~l conjunction (the AND operator) provides siml)le and automatic disambiguation in the target languag...

We describe in this paper a boolean Information l~.etrieval system that adds word semantics to the classic word based indexing. Two of the main tasks of our system, namely the indexing and retrieval components, are using a combined wordbased and sense-based approach. The key to our system is a methodology for building semantic representations of open text, at word and collocation level. This ne...

The participation of the University of Hildesheim focused on the monolingual German and English and the bilingual German English tasks of GeoCLEF 2006. Based on the results of GeoCLEF 2005 the weighting and expansion of geographic named entities (NE) within a Boolean retrieval approach were combined. Since the best results 2005 were achieved with Blind Relevance Feedback (BRF), in which NEs see...