Extended Boolean model¶

An information-retrieval model that relaxes exact Boolean matching by incorporating partial matching and term weights.

Version: v3 · 2026-09-19 · History
Domain-specific #: 1813
Domain group: Applied Sciences & Engineering
Origin domain: Computer Science & Software Engineering
Subdomains: Information Retrieval, Graded Boolean Retrieval → Computer Science & Software Engineering
Aliases: Extended Boolean retrieval model, P-norm model

Core Idea¶

Extended Boolean model is an information-retrieval model that relaxes exact Boolean matching by incorporating partial matching and term weights.

The extended Boolean model preserves an AND/OR query tree while replacing exact binary satisfaction with graded term weights and p-norm aggregation. Documents receive similarity scores and can be ranked; the p parameter controls how strictly each connective approximates classical Boolean logic.

Its operative boundary is not supplied by the name alone. Preserve this identity: An information-retrieval model that relaxes exact Boolean matching by incorporating partial matching and term weights. Validity boundary: Retrieval scores must combine Boolean query structure with graded term weighting under the extended model; pure vector-space ranking or exact Boolean matching is different.

How would you explain it like I'm…

Partial-Credit Book Search

You ask a librarian for books about dogs AND parks. A strict librarian only hands you books with both. A kinder librarian gives every book a score, putting books with lots of dogs and parks first and books with only some near the end. The Extended Boolean model is that kinder librarian.

AND/OR with Partial Credit

Search systems can use words like AND and OR to describe what you want. Plain Boolean search is all-or-nothing: a document either matches exactly or it's thrown out. The Extended Boolean model keeps the AND and OR structure but gives each word a weight showing how important it is in each document. It then combines those weights into a score, so documents can be ranked from best match to worst. A setting called p decides how strict the AND and OR act.

Weighted, Ranked Boolean Retrieval

The Extended Boolean model is an information-retrieval method that softens exact Boolean matching. Your query stays a tree of AND and OR operations, but instead of each term being simply present or absent, each term in a document has a graded weight. The model combines those weights with a formula called a p-norm to give a similarity score, so results can be ranked. The parameter p tunes how closely AND and OR behave like strict logic. It differs from pure vector-space ranking, which ignores the AND/OR structure, and from exact Boolean matching, which gives no partial credit.

The Extended Boolean model relaxes exact Boolean retrieval by adding partial matching and term weights. A query remains an AND/OR tree, but documents no longer either satisfy or fail each clause: each term carries a graded weight, and connectives aggregate these weights through p-norm formulas. The result is a real-valued similarity score per document, enabling ranked output. The parameter p tunes strictness, controlling how closely each connective approximates classical Boolean AND or OR. The model sits between two neighbors: exact Boolean matching, which gives binary results, and pure vector-space ranking, which drops the query's logical structure. What makes it this model is the combination of Boolean query structure with graded weighting.

Scope of Application¶

The abstraction recurs literally within text retrieval systems that need Boolean query structure together with partial matching and ranked results. The following habitats preserve the same recognition machinery; they are not invitations to extend the name metaphorically.

Soft conjunction. documents missing one term can receive penalized nonzero scores.
Soft disjunction. multiple matched terms increase score without exact set union only.
Weighted queries. term importance influences branch aggregation.
Ranked Boolean interfaces. users retain explicit connectives but receive an ordering.
Parameter studies. p tunes strictness against recall and ranking quality.

Clarity¶

Specify term-weight normalization, the exact AND and OR formulas, p values, treatment of nested operators, and score direction. 'Boolean plus ranking' is too broad; different fuzzy and probabilistic models yield different compensation and semantics.

A practical identification audit begins with the typed roles rather than the title: establish the document representation, verify the weighted query terms, then test the remaining conditions and exclusions.

Manages Complexity¶

The model interpolates between interpretable query logic and graded retrieval. One expression can express structural requirements while avoiding the brittle all-or-nothing boundary of classical Boolean matching.

The compression remains accountable because each simplification has a named failure condition. Disagreement can be localized to a missing role, an invalid assumption, an ambiguous measurement, or a neighboring abstraction instead of being hidden inside an unanalyzed label.

Abstract Reasoning¶

R1. Represent documents and query terms on a compatible normalized weight scale. R2. Parse the query into an explicit Boolean tree. R3. Evaluate leaves and combine them with the declared p-norm AND/OR formulas. R4. Propagate scores through nesting and rank documents. R5. Validate p and weighting choices against relevance judgments and Boolean boundary cases.

Knowledge Transfer¶

The model transfers literally to weighted document retrieval with p-norm Boolean composition. Compositionality and similarity measure are parents; general fuzzy rules or hybrid filters are not this model without its formulas.

The transfer boundary is explicit: DOMAIN-SPECIFIC PASS / PRIME FAIL: The model applies across weighted queries and document collections where strict Boolean result sets are too coarse. Literal recognition retains the specialist vocabulary and validity conditions of information retrieval; outside that setting only broader parent operations transfer.

Relationships to Other Abstractions¶

Current abstraction Extended Boolean model Domain-specific

Parents (2) — outgoing typed relations

Extended Boolean model is a kind of Compositionality Prime

Compositionality (prime:compositionality).
Extended Boolean model presupposes Similarity Measure Prime

Similarity Measure (prime:similarity_measure).

Hierarchy paths (3) — routes to 3 parentless roots

Extended Boolean model → is a kind of Compositionality

Show alternative paths (2)

Neighborhood in Abstraction Space¶

Extended Boolean model sits in a sparse region of the domain-specific corpus (69^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Codes, Matrices & Combinatorial Problems (33 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25