17940494. HYBRID DATABASE INTERFACE WITH INTENT EXPANSION simplified abstract (INTERNATIONAL BUSINESS MACHINES CORPORATION)

From WikiPatents
Jump to navigation Jump to search

HYBRID DATABASE INTERFACE WITH INTENT EXPANSION

Organization Name

INTERNATIONAL BUSINESS MACHINES CORPORATION

Inventor(s)

Karina Elayne Kervin of Sacramento CA (US)

Manish Kesanwani of Bengaluru (IN)

Satyajeet Raje of White Plains NY (US)

Nergal Issaie of San Jose CA (US)

HYBRID DATABASE INTERFACE WITH INTENT EXPANSION - A simplified explanation of the abstract

This abstract first appeared for US patent application 17940494 titled 'HYBRID DATABASE INTERFACE WITH INTENT EXPANSION

Simplified Explanation

The embodiment described in the abstract involves generating search results based on a user's intention and input string through text-based and ontology-based queries.

  • Intent string generated from user input
  • Search string created with text from input and intent strings
  • Text-based and ontology-based queries executed on a graph database
  • Combined set of search results generated
  • Final relevance scores calculated by adjusting preliminary scores
  • Query response includes ranked search results based on final relevance scores

Potential Applications

This technology could be applied in search engines, recommendation systems, and information retrieval systems.

Problems Solved

This technology helps improve the accuracy and relevance of search results by considering both text-based and ontology-based queries.

Benefits

The benefits of this technology include more precise search results, enhanced user experience, and better understanding of user intentions.

Potential Commercial Applications

Optimizing Search Results for Enhanced User Experience


Original Abstract Submitted

An embodiment includes generating an intent string representative of a user's intention based on an input string from the user. The embodiment generates a search string that includes text from the input string and text from the intent string, and then executes a text-based query and an ontology-based query against a graph database using the search string. The embodiment generates a combined set of search results from search results of the text-based query and search results of the ontology-based query. The embodiment generates final relevance scores for the combined set of search results by adjusting at least a portion of preliminary relevance scores of the combined set of search results. The embodiment generates a query response that includes the combined set of search results ranked according to the final relevance scores.