Skip to Main Content
Building an Intelligent Web: Theory and Practice
book

Building an Intelligent Web: Theory and Practice

by Pawan Lingras, Rajendra Akerkar
March 2010
Intermediate to advanced content levelIntermediate to advanced
326 pages
12h 25m
English
Jones & Bartlett Learning
Content preview from Building an Intelligent Web: Theory and Practice
“4137X˙CH02˙Akerkar” 2007/9/20 10:12 page 47 #29
2.3 Retrieval Models 47
DNF consists of a disjunction of conjunctive Boolean expressions. For example, the expression
“(K0 or (not K3 and K5))” is in DNF, because it corresponds to two expressions “K0” and
“(not K3 and K5)”; both the expressions are conjunctive because they are connected only by
an and operation. The advantage of accepting queries in a DNF is that the processing can be
very efficient. If any one of the conjunctive expressions is true, the entire DNF will be true.
This fact can be used to short-circuit the expression evaluation. We can stop matching the
expression with
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Reinventing the Organization for GenAI and LLMs

Reinventing the Organization for GenAI and LLMs

Ethan Mollick

Publisher Resources

ISBN: 9780763741372