US2016085760A1PendingUtilityA1

Method for in-loop human validation of disambiguated features

49
Assignee: QBASE LLCPriority: Dec 2, 2013Filed: Dec 7, 2015Published: Mar 24, 2016
Est. expiryDec 2, 2033(~7.4 yrs left)· nominal 20-yr term from priority
G06F 40/284G06F 16/21G06F 3/0482G06F 16/248G06F 16/245G06F 16/24578G06F 40/30G06F 17/3053G06F 17/30554G06F 40/143
49
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

Methods for providing in-loop validation of disambiguated features are disclosed. The disclosed methods may include disambiguating features in unstructured text that may use co-occurring features derived from both the source document and a large document corpus. The disambiguating systems may include multiple modules, including a linking on-the-fly module for linking the derived features from the source document to the co-occurring features of an existing knowledge base. The system for disambiguating features may allow identifying unique entities from a knowledge base that includes entities with a unique set of co-occurring features, which in turn may allow for increased precision in knowledge discovery and search results, employing advanced analytical methods over a massive corpus, employing a combination of entities, co-occurring entities, topic IDs, and other derived features. The disclosed method may use validation to provide input to the system for disambiguating features.

Claims

exact text as granted — not AI-modified
What is claimed is: 
     
         1 . A method comprising:
 receiving, by a first computer, a first search query result from a search conductor, wherein the first search query result is based on a search query and comprises a record matching a field of the search query;   sending, by the first computer, the first search query result to a second computer such that the second computer is able to disambiguate the first search query result via a determination of a relatedness among an individual record feature and a topic identification associated with each record in the first search query result, wherein the second computer comprises a main memory storing an in-memory database, wherein the second computer is configured to link disambiguation data, in real-time, as the disambiguation data is requested by the first computer from the second computer;   receiving, by the first computer, a second search query result from the second computer, wherein the second search query result has been disambiguated via the second computer;   sending, by the first computer, the second search query result to a third computer such that the third computer is able to receive an input on the second search query result;   generating, by the first computer, a new feature occurrence record in a knowledge base database, wherein the new feature occurrence record includes the input, wherein the in-memory database comprises the knowledge base database; and   placing, by the first computer, a request that the new feature occurrence record be stored in the knowledge base database such that the second computer is able to adjust a parameter of a disambiguation algorithm based on the input, wherein the disambiguation algorithm involves linking via the second computer.   
     
     
         2 . The method of  claim 1 , wherein the second computer is configured to assign a confidence score to the new feature occurrence record based on the input. 
     
     
         3 . The method of  claim 1 , wherein the second computer is configured to adjust a weight associated with the individual record feature in the first search query result based on the input. 
     
     
         4 . The method of  claim 1 , wherein the third computer is configured to provide a user interface comprising a first element, wherein the first element enables a first user selection of a set of disambiguation algorithms. 
     
     
         5 . The method of  claim 4 , wherein the user interface comprises a second element, wherein the second element enables a second user selection of a threshold of acceptance for at least one of the individual record feature or the topic identification in the first search query result. 
     
     
         6 . The method of  claim 1 , wherein the search query is constructed via a markup language. 
     
     
         7 . The method of  claim 1 , wherein the search query is constructed via a binary format. 
     
     
         8 . The method of  claim 1 , further comprising:
 validating, by the first computer, the input before the placing.   
     
     
         9 . The method of  claim 1 , further comprising:
 processing, by the first computer, the search query via a process, wherein the process comprises at least one of an address standardization technique, a proximity boundary technique, or a nickname interpretation technique.   
     
     
         10 . The method of  claim 1 , wherein the first computer and the second computer define a computing system, wherein the third computer is external to the computing system. 
     
     
         11 . A system comprising:
 a first computer configured to:
 receive a first search query result from a search conductor, wherein the first search query result is based on a search query and comprises a record matching a field of the search query; 
 send the first search query result to a second computer such that the second computer is able to disambiguate the first search query result via a determination of a relatedness among an individual record feature and a topic identification associated with each record in the first search query result, wherein the second computer comprises a main memory storing an in-memory database, wherein the second computer is configured to link disambiguation data, in real-time, as the disambiguation data is requested by the first computer from the second computer; 
 receive a second search query result from the second computer, wherein the second search query result has been disambiguated via the second computer; 
 send the second search query result to a third computer such that the third computer is able to receive an input on the second search query result; 
 generate a new feature occurrence record in a knowledge base database, wherein the new feature occurrence record includes the input, wherein the in-memory database comprises the knowledge base database; 
 place a request that the new feature occurrence record be stored in the knowledge base database such that the second computer is able to adjust a parameter of a disambiguation algorithm based on the input, wherein the disambiguation algorithm involves linking via the second computer. 
   
     
     
         12 . The system of  claim 11 , wherein the second computer is configured to assign a confidence score to the new feature occurrence record based on the input. 
     
     
         13 . The system of  claim 11 , wherein the second computer is configured to adjust a weight associated with the individual record feature in the first search query result based on the input. 
     
     
         14 . The system of  claim 11 , wherein the third computer is configured to provide a user interface comprising a first element, wherein the first element enables a first user selection of a set of disambiguation algorithms. 
     
     
         15 . The system of  claim 14 , wherein the user interface comprises a second element, wherein the second element enables a second user selection of a threshold of acceptance for at least one of the individual record feature or the topic identification in the first search query result. 
     
     
         16 . The system of  claim 11 , wherein the search query is constructed via a markup language. 
     
     
         17 . The system of  claim 11 , wherein the search query is constructed via a binary format. 
     
     
         18 . The system of  claim 11 , wherein the first computer is configured to validate the input before placing the request. 
     
     
         19 . The system of  claim 11 , wherein the first computer is configured to process the search query via a process, wherein the process comprises at least one of an address standardization technique, a proximity boundary technique, or a nickname interpretation technique. 
     
     
         20 . The system of  claim 11 , wherein the first computer and the second computer define a computing entity, wherein the third computer is external to the computing entity.

Cited by (0)

No later patents cite this yet.

References (0)

No backward citations on record.