Multi-Stage Search Query Segmentation for Linked Content Discovery
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current search engines are limited in their ability to efficiently and accurately identify content items of interest to users, as they often rely on a single search query and may miss relevant content items that are linked or part of the same domain as initial search results.
Innovation Solution
The system performs multiple related searches by dividing the search query into portions, allowing for sequential searches based on previous results, where the second search can include content items not initially identified, such as those linked to or part of the same domain as the first search results, using a graphical user interface with separate text boxes for each query portion.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a single search query is used to identify content items, then the search process is simple and fast, but relevant content items that are linked or part of the same domain as initial search results may be missed
Solution Approach 1:
The patent segments the search process into multiple sequential searches. The first search identifies initial content items based on the search query, and subsequent searches identify additional content items by analyzing links and domain relationships from the first search results. This segmentation allows the system to comprehensively identify relevant content items while maintaining a manageable search process through structured multi-stage execution.
2Reliability
If multiple related searches are performed sequentially based on previous results, then the identification of relevant content items is enhanced, but the time and computational resources required increase
Solution Approach 1:
The patent applies preliminary action by performing the first search to identify initial content items and their relationships (links, domains) before conducting subsequent searches. This preliminary identification of content item relationships enables the second and subsequent searches to be targeted and efficient, reducing the overall time required compared to performing comprehensive searches without this preparatory step.
Solution Approach 2:
The patent implements feedback by using the results from the first search to inform and guide the second search. The second search query and scope are determined based on the content items identified in the first search, creating a feedback loop that refines the search process. This feedback mechanism ensures that subsequent searches focus on relevant areas, optimizing the balance between comprehensiveness and efficiency.
Data Source
AI summary
A first search is performed in response to a received search query. The first search is based at least in part on a first portion of the search query. In the first search, a first set of content items are searched over to identify a first set of search results. Each result in the first set of search results identifies at least one content item of the first set of content items. A second set of content items for performing a second search is determined based at least in part on one or more of the results in the first set of search results. The second set of content items includes content items not included in the first set of search results. A second search is performed, searching over the second set of content items to identify a second set of search results. The second search is based at least in part on a second portion of the search query. Each result in the second set of search results identifies at least one content item of the second set of content items.