US 12,087,282 B2
Cross-class ontology integration for language modeling
Walter Bender, Washington, DC (US); Martin Abente Lahaye, Mariscal Estigarribia (PY); and Christopher Liu, Washington, DC (US)
Assigned to SORCERO, INC., Washington, DC (US)
Filed by Sorcero, Inc., Washington, DC (US)
Filed on Oct. 18, 2023, as Appl. No. 18/489,212.
Application 18/489,212 is a division of application No. 17/210,315, filed on Mar. 23, 2021, granted, now 11,854,531.
Claims priority of provisional application 62/993,122, filed on Mar. 23, 2020.
Prior Publication US 2024/0127797 A1, Apr. 18, 2024
Int. Cl. G06F 17/00 (2019.01); G06F 9/451 (2018.01); G06F 9/54 (2006.01); G06F 16/22 (2019.01); G06F 16/248 (2019.01); G06F 16/31 (2019.01); G06F 16/33 (2019.01); G06F 16/332 (2019.01); G06F 16/34 (2019.01); G06F 16/36 (2019.01); G06F 16/9032 (2019.01); G06F 40/20 (2020.01); G06F 40/289 (2020.01); G06F 40/30 (2020.01); G06F 40/40 (2020.01); G06N 3/04 (2023.01); G06N 20/00 (2019.01); G10L 15/06 (2013.01); G10L 15/16 (2006.01); G10L 15/197 (2013.01); G16H 10/60 (2018.01); G16H 40/20 (2018.01); G16H 70/20 (2018.01)
CPC G10L 15/063 (2013.01) [G06F 9/451 (2018.02); G06F 9/547 (2013.01); G06F 16/2237 (2019.01); G06F 16/248 (2019.01); G06F 16/328 (2019.01); G06F 16/3323 (2019.01); G06F 16/3329 (2019.01); G06F 16/3338 (2019.01); G06F 16/3344 (2019.01); G06F 16/3347 (2019.01); G06F 16/345 (2019.01); G06F 16/367 (2019.01); G06F 16/90332 (2019.01); G06F 40/20 (2020.01); G06F 40/289 (2020.01); G06F 40/30 (2020.01); G06F 40/40 (2020.01); G06N 3/04 (2013.01); G06N 20/00 (2019.01); G10L 15/16 (2013.01); G10L 15/197 (2013.01); G16H 10/60 (2018.01); G16H 40/20 (2018.01); G16H 70/20 (2018.01)] 17 Claims
OG exemplary drawing
 
1. A tangible, non-transitory, machine-readable medium storing instructions that, when executed by one or more processors, effectuate operations comprising:
obtaining, with a computer system, a set of graphs comprising:
a first ontology graph associated with a first domain category value, the first ontology graph comprising a first vertex and a second vertex; and
a second ontology graph associated with a second domain category value, the second ontology graph comprising a third vertex, wherein the second vertex is connected to the third vertex via a first graph edge;
obtaining, with the computer system, an update associating a first n-gram with the second vertex, wherein the first vertex is mapped to the first n-gram, and wherein the first domain category value is associated with the update;
determining a first relationship type between the first vertex and the second vertex based on the update;
selecting, with the computer system, the second ontology graph from amongst a plurality of ontology graphs based on the first domain category value and the second domain category value;
determining, with the computer system, whether the first graph edge is associated with a second relationship type that satisfies a relationship criterion based on the first relationship type;
determining, with the computer system, an association between the first n-gram indicated by the first vertex and a second n-gram associated with the third vertex; and
updating, with the computer system, the set of graphs, the updating comprising storing the association between the first n-gram and the second n-gram in memory.