Sciweavers

148 search results - page 6 / 30
» Query Evaluation via Tree-Decompositions
Sort
View
CIKM
2001
Springer
13 years 12 months ago
Effective Arabic-English Cross-Language Information Retrieval via Machine-Readable Dictionaries and Machine Translation
In Cross-Language Information Retrieval (CLIR), queries in one language retrieve relevant documents in other languages. Machine-Readable Dictionary (MRD) and Machine Translation (...
Mohammed Aljlayl, Ophir Frieder
EACL
2006
ACL Anthology
13 years 8 months ago
A Figure of Merit for the Evaluation of Web-Corpus Randomness
In this paper, we present an automated, quantitative, knowledge-poor method to evaluate the randomness of a collection of documents (corpus), with respect to a number of biased pa...
Massimiliano Ciaramita, Marco Baroni
SIGIR
2000
ACM
13 years 11 months ago
Interactive Internet search: keyword, directory and query reformulation mechanisms compared
This article compares search effectiveness when using query-based Internet search (via the Google search engine), directory-based search (via Yahoo) and phrasebased query reformul...
Peter Bruza, Robert McArthur, Simon Dennis
SIGIR
2009
ACM
14 years 1 months ago
An improved markov random field model for supporting verbose queries
Recent work in supervised learning of term-based retrieval models has shown significantly improved accuracy can often be achieved via better model estimation [2, 10, 11, 17]. In ...
Matthew Lease
TSC
2010
182views more  TSC 2010»
13 years 2 months ago
A Query Rewriting Approach for Web Service Composition
Data-Providing (DP) services allow query-like access to organizations' data via web services. The invocation of a DP service results in the execution of a query over data sour...
Mahmoud Barhamgi, Djamal Benslimane, Brahim Medjah...