Research article · May 2013
Research articlePublished 2013
Effective efficient boolean retrieval
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
The conventional Boolean retrieval system does not provide ranked retrieval output because it cannot compute similarity coefficients between queries and documents. Extended Boolean retrieval (EBR) models were proposed nearly three decades ago, but have had little practical impact, despite their significant advantages compared to either ranked keyword or pure Boolean retrieval. The Boolean retrieval model contrasts with ranked retrieval models such as the vector space model in which users largely use free text queries , that is, just typing one or more words rather than using a precise language with operators for building up query expressions, and the system decides which documents best satisfy the query. Despite decades of academic research on the advantages of ranked retrieval, systems implementing the Boolean retrieval model were the main or only search option provided by large commercial information providers for three decades until the early 1990s (approximately the date of arrival of the World Wide Web). However, these systems did not have just the basic Boolean operations (AND, OR, and NOT) which we have presented so far. A strict Boolean expression over terms with an unordered results set is too limited for many of the information needs that people have, and these systems implemented extended Boolean retrieval models by incorporating additional operators such as term proximity operators. A proximity operator is a way of specifying that two terms in a query must occur close to each other in a document, where closeness may be measured by limiting the allowed number of intervening words or by reference to a structural unit such as a sentence or paragraph
Subjects
Computer Science & ITAsk about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
Similar by topic
Research article · Apr 2013
AN EFFICIENT INFORMATION RETRIEVAL FROM DOMAIN EXPERT USING ACTIVE LEARNING WITH GENERALIZED QUERIES
Research article · 14 Sep 2020
Indexing for Structured and Unstructured Data for Efficient Information Retrieval
Research article · 2018
Efficient Retrieval of Pin Numbers from Recharge Cards by OCR Mechanism for Mobile Recharge
Research article · 11 Jul 2015
A Combined Approach Using IoT and Cloud for the Efficient Data Retrieval in Medical Technology
More from this journal
The newest in International Journal of Computer Science and Mobile Applications.
Article · 16 Dec 2024
Ai-Driven Wound Healing Analysis and Progression Tracking in Mobile Applications:A Scalable Approach for Healthcare Accessibility
Article · 2 Dec 2024
Bounded Number Theory: A Study on the Negation of Infinite Numbers in Parts or Completely
Article · 13 Nov 2024
Diversity of Thought Elicits Stronger Reasoning Capabilities in Multi-Agent Debate Frameworks
Conferences in this field
Upcoming conferences in this field.
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalInternational Journal of Computer Science and Mobile Applications
- SubjectComputer Science & IT
- BylineArticles whose byline prints “J Naveen Kumar”
- BylineArticles whose byline prints “Dr. M. Janga Reddy”
