The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Nov. 14, 2023

Filed:

Aug. 12, 2020
Applicant:

Oracle International Corporation, Redwood Shores, CA (US);

Inventors:

Alberto Parravicini, Lesmo, IT;

Jinha Kim, Belmont, CA (US);

Sungpack Hong, Palo Alto, CA (US);

Matthias Brantner, Sunnyvale, CA (US);

Hassan Chafi, San Mateo, CA (US);

Assignee:

Oracle International Corporation, Redwood Shores, CA (US);

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 16/2452 (2019.01); G06F 16/22 (2019.01); G06F 16/248 (2019.01); G06F 16/28 (2019.01); G06N 5/025 (2023.01); G06N 5/048 (2023.01);
U.S. Cl.
CPC ...
G06F 16/24522 (2019.01); G06F 16/2246 (2019.01); G06F 16/248 (2019.01); G06F 16/288 (2019.01); G06N 5/025 (2013.01); G06N 5/048 (2013.01);
Abstract

Techniques described herein allow for accurate translation of natural language (NL) queries to declarative language. A syntactic dependency parsing tree is generated for an NL query, which is used to map tokens in the query to logical data model concepts. Relationship-type mappings are completed based on relationship constraints. Final mappings are identified for any relationship tokens that are associated with multiple candidate mappings by identifying which candidate mappings have the lowest cost metrics. An NL query-specific query graph is generated based on the mapping data for the NL query and the logical data model. The query graph represents an NL query-specific version of the logical data model where grammatical dependencies between NL query words are translated to the query graph. A query graph is annotated with information, from the mapping data, that is not represented paths in the query graph. The query graph is used generate a computer-executable translation of the NL query.


Find Patent Forward Citations

Loading…