AI Glossary / Graphs and symbolic AI / Intermediate
Web search
Definition
Web search is the application of information retrieval to material available on the World Wide Web. A search system interprets a user's query, identifies potentially useful material within its accessible collection, and orders results to help satisfy the user's information need. Searching the Web does not mean checking every web page live whenever a query is submitted.
What it means
The user has a need, such as finding an official product manual or understanding a technical concept. The query is an imperfect expression of that need. A search engine works with the content it has discovered and can access, using representations that make retrieval practical.
The distinction between the Web and an engine's collection matters. Some useful material may be undiscovered, unindexed, recently changed, or inaccessible. A missing result therefore does not prove that the information does not exist. Likewise, a prominent result reflects a retrieval and ranking decision, not an independent guarantee that every statement on the page is true.
How it works
A crawler can discover pages from starting addresses and links, fetching material for processing. An indexing stage builds structures that support efficient lookup. Query processing then finds candidates and ranking places promising results near the top. Continuous collection maintenance helps reflect changes, although freshness can vary.
Retrieval may use words, learned representations, or combinations of methods. The precise design differs across systems. A generated answer can add another stage: retrieved passages become context for a language model. That answer still needs evaluation against the sources. Returning relevant documents and correctly summarizing what they support are separate tasks.
Three practical examples
- A business analyst can locate an original annual report, then inspect the report rather than relying only on a result snippet.
- A student can search for a concept using both its everyday description and its technical name, comparing which materials become discoverable.
- An AI assistant can retrieve official documentation before answering a question whose details may have changed since model training.
Think of it this way
Think of asking a librarian to find useful items in a continually changing collection. The catalog helps locate candidates, and the ordering helps decide what to inspect first. The analogy is limited because the public Web has many independent publishers, incomplete coverage, duplicated material, and much less centralized quality control than a managed library.
Worked example
Consider an original miniature search evaluation with six pages. Reviewers decide that pages A, C, and F answer the query's intended question. Pages B, D, and E do not. These judgments define relevance for this exercise; they are not inferred from the ranking itself.
The search engine's index contains A through E but has not collected F. Its first three results are B, A, and C. Two of those three are relevant, giving precision at three of 2/3. Relative to all three relevant pages in the six-page evaluation collection, recall at three is also 2/3.
Now improve ranking so the first three results are A, C, and D. The precision and recall values remain 2/3, although useful information appears earlier. This shows why a single cutoff measure may miss a meaningful ordering improvement.
Next, collect and index F, then return A, C, and F as the first three results. Both measures become 1 for this deliberately small collection. Better ranking alone could not have returned the previously absent F; the coverage problem had to be addressed too.
In a real open-Web setting, the full set of relevant pages is rarely known. This toy recall calculation is possible because the evaluation universe and judgments are explicitly defined. It should not be presented as measured recall over the entire Web.
Illustrative case study
Fictional case: a training provider tests an assistant on questions about its public course pages. Some failures come from an outdated page ranking above the current one; others occur because a new page is missing from the collected material.
The team records these as different failure types. It updates collection coverage for missing pages, improves selection for outdated results, and checks whether the assistant's summaries preserve dates and qualifications. The case illustrates a diagnostic workflow, without claiming a particular improvement percentage or describing a real deployment.
Common misconceptions and mistakes
Do not confuse crawling with ranking, or ranking with factual verification. Do not assume a snippet contains all the qualifications in the underlying document. A page can match query words closely while answering a different question.
More results are not automatically better results. Repeated copies may create the appearance of independent corroboration when they share one origin. Conversely, using unfamiliar terminology can hide relevant material from a poorly expressed query. Inspect source identity and reformulate the search when the information need remains unresolved.
Business use
Web search supports research, supplier discovery, technical troubleshooting, and evidence gathering. Its value depends on whether the returned material helps complete a task.
For an AI-enabled research workflow, evaluate discovery, source selection, and answer support separately. Include questions requiring specific versions or dates. Record inaccessible and missing sources rather than silently treating them as negative evidence. Use a small judged test collection to compare changes, then examine representative real tasks. A retrieval score is useful feedback, but it should connect to the reader's actual need.
People also ask
Does web search inspect the whole Web for each query?
No. Search commonly relies on previously collected and indexed material, with system-specific freshness mechanisms.
Is the highest-ranked page necessarily correct?
No. Ranking estimates usefulness; factual reliability still requires source assessment.
Is a generated search answer the same as a retrieved page?
No. It is an additional output that may summarize or combine sources and can introduce its own errors.
Check your understanding
Why could reranking A through E never retrieve page F in the example?
Answer: F was absent from the indexed collection. Improving the ordering of available candidates cannot by itself repair missing coverage.
Related terms
- Information retrieval
- Inverted index
- Ranking
- Precision
- Recall
- Retrieval-augmented generation
- Web crawler
- Query
- Source provenance
Learn next
Create six fictional page descriptions and label three relevant to one precise question. Try two rankings with the same precision at three but different positions for the relevant pages. Explain which ranking you would prefer and what the cutoff metric fails to reveal.
More in Graphs and symbolic AI
- Type signature - A type signature specifies the types of inputs and outputs associated with a function or operation.
- UCB1 - UCB1 is a multi-armed bandit algorithm that selects an action using its average observed reward plus an exploration bonus.
- UCT - UCT is a method for guiding Monte Carlo tree search by applying upper-confidence-bound ideas at decision nodes.
- Łukasiewicz logic - Łukasiewicz logic is a family of many-valued logics associated with Jan Łukasiewicz.
- Unary constraint - A unary constraint is a rule that restricts the allowed values of one variable in a constraint satisfaction problem.
- Unbounded cost search - Unbounded-cost search seeks a valid solution without requiring its cost to fall below a specified threshold or within a specified factor of the best...
Sources
Primary sources: Jurafsky and Martin, Speech and Language Processing, chapter 11: https://web.stanford.edu/~jurafsky/slp3/11.pdf ; Manning, Raghavan, and Schutze, Introduction to Information Retrieval, crawling section: https://nlp.stanford.edu/IR-book/html/htmledition/crawling-1.html . The six-page evaluation and case study are original.
Previous: Web scraping Next: Webometrics