US 12,260,306 B2
Textual explanations for abstract syntax trees with scored nodes
Kenyu Kobayashi, Lausanne (CH); Arno Schneuwly, Effretikon (CH); Renata Khasanova, Zurich (CH); Matteo Casserini, Zurich (CH); and Felix Schmidt, Baden-Dattwil (CH)
Assigned to Oracle International Corporation, Redwood Shores, CA (US)
Filed by Oracle International Corporation, Redwood Shores, CA (US)
Filed on Aug. 19, 2022, as Appl. No. 17/891,350.
Prior Publication US 2024/0061997 A1, Feb. 22, 2024
Int. Cl. G06F 8/41 (2018.01); G06N 20/00 (2019.01)
CPC G06N 20/00 (2019.01) 18 Claims
OG exemplary drawing
 
1. A method comprising:
selecting, based on a respective relevance score for each non-leaf node in a parse tree of a semantically valid logic statement, a relevant subset of non-leaf nodes;
grouping non-leaf nodes in the parse tree into a plurality of groups that represent respective portions of the semantically valid logic statement;
generating, from the parse tree, one or more disconnected trees by:
replacing each group of a relevant subset of the plurality of groups that contain at least one non-leaf node in the relevant subset of non-leaf nodes with a group node, and
retaining only the group nodes; and
generating, based on the one or more disconnected trees, an explanation of why the semantically valid logic statement is anomalous;
wherein the method is performed by one or more computers.