Refining training sets and parsers for large and dynamic text environments
AssigneeOntocord, LLC
InventorHiep Huu Nguyen
Life of this patent
Estimating the term…
Loading patent…
AssigneeOntocord, LLC
InventorHiep Huu Nguyen
Estimating the term…
Briefly stated, the invention is directed to retrieving a semantically matched knowledge structure. A question and answer pair is received, wherein the answer is received from a query of a search engine. A question is constraint-matched with the answer based on maximizing a plurality of constraints, wherein at least one of the plurality of the constraints is a similarity score between question and answer, wherein the constraint matching generates a matched sequence. For one or more answer sequences, a subsequence is found that are not parsed as answer slots. Query results are obtained from another search engine based on a combination of the answer or question, and the non-answer subsequence. And a KB based is refined on the query results and the constraint matching and based on a neural network training, for a further subsequent semantic matching, wherein the KB includes a dense semantic vector indication of concepts.
A method for generalizing a parser for discourse assistance, comprising:
A device for generalizing a semantically matched knowledge structure, comprising:
A method for generalizing a semantically matched knowledge structure, comprising:
Dependencies are inferred from the claim text.