No-Fail Search System Using Dynamic Field Ranking
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current search systems require users to manually adjust keywords and re-run searches to achieve relevant results, especially when searching across multiple content types, leading to inefficiencies and irrelevant results due to either too narrow or too broad keyword sets.
Innovation Solution
A method and system that automatically broaden the search by removing the lowest ranked search field when no results are found across content types, repeating the process until each content type has a threshold of results or all fields are removed, using a graphical user interface to organize and rank search fields based on content types.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If the user provides a narrow set of keywords to ensure relevance, then the quality of search results is improved, but the quantity of search results decreases
Solution Approach 1:
The patent segments the search fields into multiple independent components that can be individually removed. Instead of treating the keyword set as a single unit, the system divides it into separate search fields (e.g., product name, manufacturer, jurisdiction) and systematically removes the lowest-ranked ones to broaden the search while maintaining control over the broadening process.
Solution Approach 2:
The patent implements a dynamic search field removal process where the system automatically adjusts the set of search fields based on search performance. The system ranks search fields by productivity and dynamically removes the lowest-ranked field when a content type has zero results, creating an adaptive search strategy that responds to actual search outcomes.
2Quantity of substance
If the user provides a broad set of keywords to increase the quantity of results, then the quantity of search results is improved, but the quality of search results deteriorates
Solution Approach 1:
The system dynamically adjusts the breadth of the search by removing search fields only when necessary (when a content type has zero results). This dynamic approach prevents unnecessary broadening that would reduce result quality, while still enabling broadening when needed to achieve the desired quantity of results.
Solution Approach 2:
The patent changes the parameters of the search by systematically removing search fields in a controlled manner. Instead of arbitrarily broadening the search, the system changes the search parameters by removing the lowest-ranked search field based on productivity metrics, ensuring that broadening occurs in a structured and optimized way.
3Measurement precision
If the user manually adjusts keywords and re-runs searches to achieve satisfactory results, then the quality of search results is improved, but the time required for searching increases
Solution Approach 1:
The patent implements a self-service search system that automatically performs keyword adjustment and search broadening without user intervention. The system ranks search fields by productivity, automatically removes the lowest-ranked field when needed, and re-runs searches autonomously until satisfactory results are achieved across all content types, freeing the user from manual adjustment tasks.
Solution Approach 2:
The system uses feedback from search results to guide subsequent search adjustments. By organizing results according to content types and checking whether each content type has sufficient results, the system receives feedback on search performance and uses this feedback to determine which search field to remove next, creating a closed-loop search optimization process.
4Measurement precision
If the system searches across multiple content types with a narrow keyword set, then the precision of matching specific content types is improved, but the ability to return results from all content types deteriorates
Solution Approach 1:
The patent segments the search results by content type (e.g., regulations, case law, verdicts, settlements) and independently evaluates the performance of the search for each content type. This segmentation allows the system to identify which specific content types are failing to return results and target the broadening process toward those specific areas.
Solution Approach 2:
The system dynamically adapts the search strategy for different content types by tracking the productivity of search fields across content types. When a specific content type has zero results, the system adjusts the search fields specifically for that content type by removing the lowest-ranked field, enabling adaptive optimization for each content type's unique characteristics.
Data Source
AI summary
The method of no fail searching may include receiving a set of keywords from an input set of search fields within a GUI, retrieving a set of search results based on the set of keywords from the input set of search fields, organizing the set of search results according to a set of content types, ranking each search field according to the set of content types, removing the lowest ranked search field from the set of keywords to create a broadened set of search fields when at least one content type has zero results, repeating the retrieving, organizing, ranking, and removing steps until either each content type contains a threshold amount of search results or all search fields have been removed, wherein the broadened set of search fields is used as the input set of search fields in subsequent retrieving steps.


