Semantic Search System Using Ontology-Based Boolean String Construction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current search technologies are inadequate for users who lack keyboarding skills, face language barriers, or need to search for information in specialized fields, as they rely on text entry and keyword matching, leading to irrelevant results and difficulty in discovering new information.
Innovation Solution
A semantic search system that constructs Boolean search strings based on user input, allowing users to select categories and ontologies, which generates targeted search queries without requiring users to know specific keywords, and operates without the need for semantic tags on web sites, providing disambiguation and improved relevance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If keyword-based search is used, then search speed is fast, but search relevance deteriorates for users with limited vocabulary or language barriers
Solution Approach 1:
The patent introduces an intermediary layer between the user's simple search input and the search engine's keyword processing. This intermediary automatically generates and expands search terms using ontologies and semantic relationships, translating user intent into effective keyword queries without requiring users to possess vocabulary expertise
Solution Approach 2:
The system performs preliminary actions by pre-processing and pre-expanding search terms before the actual search execution. It uses pre-built ontologies and semantic networks to generate potential search terms in advance, so when a user inputs a simple query, the system has already prepared multiple expanded term variations to improve search relevance
2Measurement precision
If semantic tags are required on web sites, then search accuracy improves, but device complexity and implementation difficulty increase
Solution Approach 1:
Instead of requiring web sites to implement semantic tags (bottom-up approach), the patent inverts the approach by having the search system bring semantic understanding to the query side (top-down approach). The system uses ontologies and semantic relationships to interpret and expand user queries, rather than relying on semantic annotations of web content
Solution Approach 2:
The system makes the search query itself self-sufficient by automatically enriching it with semantic context. Rather than requiring external semantic tags on web pages, the query expansion mechanism self-generates multiple term variations and semantic relationships, making the search process self-service and independent of web site modifications
3Measurement precision
If users must enter specific keywords, then search precision is high, but ease of operation deteriorates for novice users
Solution Approach 1:
The patent introduces an intermediary that automatically translates simple user inputs into precise keyword searches. This intermediary layer handles the complexity of term expansion and semantic relationship mapping, shielding users from the need to know specific keywords while maintaining high search precision through automated query refinement
Data Source
AI summary
A system for information retrieval accessing any number of search engines over a distributed network or local network is presented. The system includes one or more pre-built ontologies or lexicons, representing areas of knowledge. The system includes a settings panel where searchers can preset default languages, default ontologies, and target search engines. The system includes an application that receives a variety of searcher input from a user interface such as a spinning wheel, or from a scrolling list. Through such selections, the application subsequently builds a Boolean search engine string of terms. The Boolean search string is then passed to the target search engine for retrieving semantically accurate search results. The Boolean search string provides a tight range on the search parameters and thereby delivers higher quality results that are more precise.


