IP Library Granted Patent US 12,242,813
Granted Patent B2
US 12,242,813 · App. 18/409,965 · Granted Mar 4, 2025

Computer implemented method for the automated analysis or use of data

Inventors: William Tunstall-Pedoe (Cambridgeshire, GB); Finlay Curran (Cambridgeshire, GB); Harry Roscoe (Cambridgeshire, GB); Robert Heywood (Cambridgeshire, GB)
Assignee: UNLIKELY ARTIFICIAL INTELLIGENCE LIMTED
G06F40/35G06F16/243G06F16/322G06F16/3329G06F16/951G06F40/123G06F40/126G06F40/20G06F40/205G06F40/211G06F40/226G06F40/242G06F40/279G06F40/30G06F40/45G06F40/47G06F40/58G06N3/0442G06N3/0455G06N3/0499G06N3/08G06N5/02G06Q10/1053G06Q30/0255G06Q30/0257G06Q30/0631G10L15/16G10L15/1815G10L15/22G10L15/26G10L25/63G16H10/60H04L51/02G06N3/091G10L2015/088
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,242,813
App. No.
18/409,965
Granted
Mar 4, 2025
Kind
B2
Abstract

There is provided a computer implemented method for the automated analysis or use of data, comprising the steps of: (a) storing in a non-transitory computer-readable medium a structured, machine-readable representation of data that conforms to a machine-readable language; in which the structured, machine-readable representation of data includes a plurality of tenets defining rules, the plurality of tenets including at least one constraint tenet, the at least one constraint tenet preventing a bad action; wherein the plurality of tenets comprise different sets of tenets; (b) using the different sets of tenets in different contexts, e.g. for different types of chatbots, or for different end-users.

Claims (32)

1. A computer implemented method for the automated analysis or use of data, comprising the steps of:

(a) storing in a non-transitory computer-readable medium a structured, machine-readable representation of data that conforms to a machine-readable language; in which the structured, machine-readable representation of data includes a plurality of tenets defining rules, the plurality of tenets including at least one constraint tenet, the at least one constraint tenet preventing a bad action; wherein the plurality of tenets comprise different sets of tenets;

(b) using the different sets of tenets in different contexts, e.g. for different types of chatbots, or for different end-users.

2. The method of claim 1 , including using the different sets of tenets for different types of chatbots.

3. The method of claim 2 , the method enabling more extensive and faster scaling of the chatbots' capabilities.

4. The method of claim 2 , wherein a question is received by a chatbot of the chatbots, wherein semantic nodes include representations of user speech input to a human/machine interface and include representations of the human/machine interface itself.

5. The method of claim 1 , including using the different sets of tenets for different end-users.

6. The method of claim 1 , including checking that actions conform to the tenets prior to doing the actions.

7. The method of claim 1 , including using the tenets to help select or generate an action.

8. The method of claim 1 , including responding differently to different personalities.

9. The method of claim 1 , including responding differently to different language styles.

10. The method of claim 1 , including providing a useful vertical application where the useful vertical application requires data which is heterogeneous and extremely broad in scope, the data comprising at least one data store containing a machine-readable representation of the data that encodes meaning.

11. The method of claim 1 , including generating a reasoned, natural language explanation that a potential action does comply or does not comply with the at least one constraint tenet.

12. The method of claim 1 in which the structured, machine-readable representation of data that conforms to the machine-readable language comprises semantic nodes and passages; and in which a semantic node represents an entity and is itself represented by an identifier; and a passage is either (i) a semantic node or (ii) a combination of semantic nodes; and where machine-readable meaning comes from choice of semantic nodes and a way they are combined and ordered as passages.

13. The method of claim 1 , including not changing the tenets.

14. The method of claim 13 in which not changing the tenets comprises the tenets including a tenet prohibiting actions which might result in changes to the tenets.

15. The method of claim 1 , including independently checking each potential action against the tenets and discarding a potential action if the independent check finds that the potential action is incompatible with the tenets.

16. The method of claim 15 in which a potential action includes changing a state of a device linked to a computer system via a network.

17. The method of claim 15 in which a potential action includes initiating a spoken interaction with a human being.

18. The method of claim 1 , including learning from one or more of: (i) communication with at least one user and (ii) one external sensor connected to a computer system via a network.

19. The method of claim 1 in which the tenets are at least partially represented by combinations of identifiers and where at least some of the identifiers represent concepts corresponding to real-world things.

20. The method of claim 1 in which the non-transitory computer-readable medium comprises a long-term non-transitory computer-readable medium; and in which a computer system comprises a short-term memory; the long-term non-transitory computer-readable medium including a tenet-store containing machine-readable tenets representing rules to guide the computer system and in which the computer system receives events and utilises the events, the contents of the long-term non-transitory computer-readable medium, the contents of the short-term memory and the tenets to do actions that conform with the tenets.

21. The method of claim 20 in which the events include communication from at least one user and where the actions include communication to at least one user.

22. The method of claim 20 in which the computer system learns, and stores what it has learned to the long-term non-transitory computer-readable medium.

23. The method of claim 1 in which the method is carried out by a computer system comprising a component which generates candidate actions; a component that decides whether to execute the candidate actions with reference to the tenets and a component which executes actions.

24. The method of claim 1 in which the method is carried out by a computer system which actively excludes knowledge on itself from being used in determining actions.

25. The method of claim 1 in which the method is carried out by a computer system such that potential actions are autonomously generated by the computer system.

26. The method of claim 1 in which potential actions are autonomously generated by a computer system according to one or more of the following: as outputs from processing inputs, such as audio or text; as a process that operates substantially continuously; as outputs without any external trigger event to initiate processing or user instruction or action to initiate processing.

27. The method of claim 25 in which the potential actions are automatically executed if they optimize or otherwise positively affect achievement or realization of the tenets.

28. The method of claim 1 in which reasoning with reference to the machine-readable representation produces further, new machine-readable representations.

29. The method of claim 1 in which generating responses to queries comprises three operations, namely matching with machine-readable representations, such as passages, in a store, fetching and execution of computation units and fetching reasoning passages.

30. The method of claim 1 in which a question is represented in a memory as a machine representation, and the representation of the question, the machine representations previously stored in the non-transitory memory computer-readable medium, computation units and reasoning passages are all represented in substantially the same machine readable language.

Priority Claims (3)
GB 2013207 · Aug 24, 2020 · national
GB 2014876 · Sep 21, 2020 · national
GB 2020164 · Dec 18, 2020 · national
Continuity (4)
Continuation 18469128 · Sep 18, 2023
Continuation 18088574 · Dec 25, 2022
Continuation 18001368
Related Publication 20240143938A1 · May 2, 2024
References Cited (347)
US 4974191A · Amirghodsi et al. · 1990 [cited by applicant]
US 5386556A · Hedin et al. · 1995 [cited by applicant]
US 6085186A · Christianson et al. · 2000 [cited by applicant]
US 6246977B1 · Messerly et al. · 2001 [cited by applicant]
US 7085708B2 · Manson · 2006 [cited by applicant]
US 7231633B2 · Grassens · 2007 [cited by applicant]
US 7418443B2 · Yoshimura et al. · 2008 [cited by applicant]
US 7636697B1 · Dobson et al. · 2009 [cited by applicant]
US 7725307B2 · Bennett · 2010 [cited by applicant]
US 8352474B2 · Pickens et al. · 2013 [cited by applicant]
US 8620872B1 · Killalea · 2013 [cited by applicant]
US 8818862B2 · Sweeney · 2014 [cited by applicant]
US 8838659B2 · Tunstall-Pedoe · 2014 [cited by applicant]
US 8924928B1 · Belovich · 2014 [cited by applicant]
US 9286910B1 · Li et al. · 2016 [cited by applicant]
US 9355358B1 · Kramer · 2016 [cited by applicant]
US 9368105B1 · Freed et al. · 2016 [cited by applicant]
US 9436681B1 · Tunstall-Pedoe et al. · 2016 [cited by applicant]
US 9489418B2 · Brodsky et al. · 2016 [cited by applicant]
US 9646260B1 · Tunstall-Pedoe et al. · 2017 [cited by applicant]
US 9659052B1 · Glennon et al. · 2017 [cited by applicant]
US 9697255B2 · Schöning · 2017 [cited by applicant]
US 9734242B2 · Millington · 2017 [cited by applicant]
US 9762637B2 · Bullotta et al. · 2017 [cited by applicant]
US 9876673B2 · Margalit et al. · 2018 [cited by applicant]
US 9928015B2 · Eda et al. · 2018 [cited by applicant]
US 10068174B2 · Aili et al. · 2018 [cited by applicant]
US 10192546B1 · Piersol et al. · 2019 [cited by applicant]
US 10303798B2 · Stubley · 2019 [cited by examiner]
US 10326863B2 · Muthyala et al. · 2019 [cited by applicant]
US 10380708B1 · Wong et al. · 2019 [cited by applicant]
US 10387575B1 · Shen et al. · 2019 [cited by applicant]
US 10410107B2 · Romero · 2019 [cited by applicant]
US 10460729B1 · Sun et al. · 2019 [cited by applicant]
US 10515125B1 · Lavergne · 2019 [cited by applicant]
US 10535003B2 · Parker et al. · 2020 [cited by applicant]
US 10552543B2 · Hirzel et al. · 2020 [cited by applicant]
US 10565509B2 · London · 2020 [cited by applicant]
US 10581765B2 · Koukoumidis et al. · 2020 [cited by applicant]
US 10679001B2 · Rogynskyy et al. · 2020 [cited by applicant]
US 10747801B2 · Accardo et al. · 2020 [cited by applicant]
US 10748546B2 · Kim et al. · 2020 [cited by applicant]
US 10755177B1 · Dabney · 2020 [cited by examiner]
US 10783159B2 · Boston et al. · 2020 [cited by applicant]
US 10866989B1 · Chandler et al. · 2020 [cited by applicant]
US 10872083B2 · Lin et al. · 2020 [cited by applicant]
US 10885285B2 · Och et al. · 2021 [cited by applicant]
US 10902210B2 · Arvela et al. · 2021 [cited by applicant]
US 11023468B2 · Weyerhaeuser et al. · 2021 [cited by applicant]
US 11043208B1 · Michelin et al. · 2021 [cited by applicant]
US 11043222B1 · Eagan et al. · 2021 [cited by applicant]
US 11055027B1 · Lee · 2021 [cited by applicant]
US 11055305B1 · Petricek et al. · 2021 [cited by applicant]
US 11069353B1 · Gao et al. · 2021 [cited by applicant]
US 11080304B2 · Jain et al. · 2021 [cited by applicant]
US 11087759B2 · Lemay et al. · 2021 [cited by applicant]
US 11132504B1 · Mont-Reynaud et al. · 2021 [cited by applicant]
US 11200075B2 · Jung et al. · 2021 [cited by applicant]
US 11281863B2 · Keskar et al. · 2022 [cited by applicant]
US 11301811B2 · Marom et al. · 2022 [cited by applicant]
US 11301814B2 · Radzewsky et al. · 2022 [cited by applicant]
US 11302310B1 · Gandhe et al. · 2022 [cited by applicant]
US 11410128B2 · Radzewsky et al. · 2022 [cited by applicant]
US 11423885B2 · Sharifi et al. · 2022 [cited by applicant]
US 11442992B1 · Moon et al. · 2022 [cited by applicant]
US 11487520B2 · Creel et al. · 2022 [cited by applicant]
US 11501255B2 · Mann et al. · 2022 [cited by applicant]
US 11657094B2 · Moon et al. · 2023 [cited by applicant]
US 11657233B2 · Keskar et al. · 2023 [cited by applicant]
US 11748577B1 · Aberle · 2023 [cited by applicant]
US 11763096B2 · Tunstall-Pedoe et al. · 2023 [cited by applicant]
US 11769017B1 · Gray et al. · 2023 [cited by applicant]
US 11829725B2 · Tunstall-Pedoe et al. · 2023 [cited by applicant]
US 11840258B2 · Shalev-Shwartz et al. · 2023 [cited by applicant]
US 20020087313A1 · Lee et al. · 2002 [cited by applicant]
US 20020173971A1 · Stirpe et al. · 2002 [cited by applicant]
US 20030130976A1 · Au · 2003 [cited by applicant]
US 20040054626A1 · Fuentes · 2004 [cited by applicant]
US 20040078756A1 · Napper et al. · 2004 [cited by applicant]
US 20040117189A1 · Bennett · 2004 [cited by applicant]
US 20040174976A1 · Elliott · 2004 [cited by applicant]
US 20050197825A1 · Hagerman et al. · 2005 [cited by applicant]
US 20050261889A1 · Iwakura · 2005 [cited by applicant]
US 20070043708A1 · Tunstall-Pedoe · 2007 [cited by applicant]
US 20070055656A1 · Tunstall-Pedoe · 2007 [cited by applicant]
US 20070094224A1 · Au · 2007 [cited by applicant]
US 20070136222A1 · Horvitz · 2007 [cited by applicant]
US 20070197882A1 · Smith et al. · 2007 [cited by applicant]
US 20080033987A1 · Carter · 2008 [cited by applicant]
US 20080046250A1 · Agapi et al. · 2008 [cited by applicant]
US 20080065974A1 · Campbell · 2008 [cited by applicant]
US 20080097748A1 · Haley et al. · 2008 [cited by applicant]
US 20080319735A1 · Kambhatla et al. · 2008 [cited by applicant]
US 20090024590A1 · Sturge et al. · 2009 [cited by applicant]
US 20090106612A1 · Pandey et al. · 2009 [cited by applicant]
US 20090192968A1 · Tunstall-Pedoe · 2009 [cited by applicant]
US 20100054154A1 · Lambert et al. · 2010 [cited by applicant]
US 20100088686A1 · Langworthy et al. · 2010 [cited by applicant]
US 20100121839A1 · Meyer et al. · 2010 [cited by applicant]
US 20100174692A1 · Meyer et al. · 2010 [cited by applicant]
US 20100205167A1 · Tunstall-Pedoe et al. · 2010 [cited by applicant]
US 20100228724A1 · Petri et al. · 2010 [cited by applicant]
US 20100235162A1 · Faddoul et al. · 2010 [cited by applicant]
US 20100306054A1 · Drake et al. · 2010 [cited by applicant]
US 20110093500A1 · Meyer et al. · 2011 [cited by applicant]
US 20110238408A1 · Larcheveque et al. · 2011 [cited by applicant]
US 20110301941A1 · De · 2011 [cited by applicant]
US 20110307435A1 · Overell et al. · 2011 [cited by applicant]
US 20110320187A1 · Motik et al. · 2011 [cited by applicant]
US 20120069131A1 · Abelow · 2012 [cited by applicant]
US 20120259621A1 · Anisimovich et al. · 2012 [cited by applicant]
US 20120259891A1 · Edoja · 2012 [cited by applicant]
US 20130013580A1 · Geller et al. · 2013 [cited by applicant]
US 20130042000A1 · Machida · 2013 [cited by applicant]
US 20130125102A1 · Kimura · 2013 [cited by applicant]
US 20130145288A1 · Zadeh et al. · 2013 [cited by applicant]
US 20130246322A1 · De Sousa Webber · 2013 [cited by applicant]
US 20130254182A1 · Tunstall-Pedoe · 2013 [cited by applicant]
US 20130332147A1 · Corfield · 2013 [cited by applicant]
US 20140032219A1 · Lerner et al. · 2014 [cited by applicant]
US 20140046891A1 · Banas · 2014 [cited by examiner]
US 20140108313A1 · Heidasch · 2014 [cited by applicant]
US 20140143533A1 · Ganong et al. · 2014 [cited by applicant]
US 20140150117A1 · Yamahara · 2014 [cited by applicant]
US 20140156614A1 · Krappe · 2014 [cited by applicant]
US 20140258261A1 · Singh et al. · 2014 [cited by applicant]
US 20140351281A1 · Tunstall-Pedoe · 2014 [cited by applicant]
US 20140359554A1 · Ritter et al. · 2014 [cited by applicant]
US 20140372119A1 · Parada et al. · 2014 [cited by applicant]
US 20150019462A1 · De et al. · 2015 [cited by applicant]
US 20150052138A1 · Sutton et al. · 2015 [cited by applicant]
US 20150066475A1 · Azzam et al. · 2015 [cited by applicant]
US 20150142704A1 · London · 2015 [cited by applicant]
US 20150205942A1 · Yang et al. · 2015 [cited by applicant]
US 20150220515A1 · Anisimovich et al. · 2015 [cited by applicant]
US 20150261744A1 · Suenbuel et al. · 2015 [cited by applicant]
US 20150271229A1 · Bullotta et al. · 2015 [cited by applicant]
US 20150347274A1 · Taylor et al. · 2015 [cited by applicant]
US 20160098387A1 · Bruno et al. · 2016 [cited by applicant]
US 20160171050A1 · Das · 2016 [cited by applicant]
US 20160179934A1 · Stubley et al. · 2016 [cited by applicant]
US 20160191513A1 · Tomlinson et al. · 2016 [cited by applicant]
US 20160196162A1 · Raman et al. · 2016 [cited by applicant]
US 20160203327A1 · Akkiraju et al. · 2016 [cited by applicant]
US 20160224541A1 · Yakovlev et al. · 2016 [cited by applicant]
US 20160246777A1 · Moldoveanu · 2016 [cited by applicant]
US 20160294755A1 · Prabhu · 2016 [cited by applicant]
US 20160357731A1 · Zorzin · 2016 [cited by applicant]
US 20170060831A1 · Smythe et al. · 2017 [cited by applicant]
US 20170061248A1 · Ryan et al. · 2017 [cited by applicant]
US 20170085595A1 · Ng et al. · 2017 [cited by applicant]
US 20170124220A1 · Krueger et al. · 2017 [cited by applicant]
US 20170125013A1 · Yan · 2017 [cited by applicant]
US 20170132019A1 · Karashchuk et al. · 2017 [cited by applicant]
US 20170140007A1 · Agarwal et al. · 2017 [cited by applicant]
US 20170148430A1 · Lee · 2017 [cited by applicant]
US 20170161279A1 · Franceschini et al. · 2017 [cited by applicant]
US 20170220929A1 · Rozen et al. · 2017 [cited by applicant]
US 20170235783A1 · Chen et al. · 2017 [cited by applicant]
US 20170242886A1 · Jolley et al. · 2017 [cited by applicant]
US 20170242899A1 · Jolley et al. · 2017 [cited by applicant]
US 20170243107A1 · Jolley et al. · 2017 [cited by applicant]
US 20170289305A1 · Liensberger et al. · 2017 [cited by applicant]
US 20170300831A1 · Gelfenbeyn et al. · 2017 [cited by applicant]
US 20170345420A1 · Barnett · 2017 [cited by applicant]
US 20170371861A1 · Barborak et al. · 2017 [cited by applicant]
US 20180011838A1 · Beller et al. · 2018 [cited by applicant]
US 20180011843A1 · Lee et al. · 2018 [cited by applicant]
US 20180032930A1 · Kolb et al. · 2018 [cited by applicant]
US 20180060823A1 · Garimella et al. · 2018 [cited by applicant]
US 20180068031A1 · Hewavitharana et al. · 2018 [cited by applicant]
US 20180075084A1 · Hunicken et al. · 2018 [cited by applicant]
US 20180075359A1 · Brennan et al. · 2018 [cited by applicant]
US 20180089281A1 · Li et al. · 2018 [cited by applicant]
US 20180137155A1 · Majumdar · 2018 [cited by applicant]
US 20180150739A1 · Wu · 2018 [cited by applicant]
US 20180154899A1 · Tiwari et al. · 2018 [cited by applicant]
US 20180157720A1 · Bhave et al. · 2018 [cited by applicant]
US 20180157960A1 · Holmes et al. · 2018 [cited by applicant]
US 20180189385A1 · Sun et al. · 2018 [cited by applicant]
US 20180196873A1 · Yerebakan et al. · 2018 [cited by applicant]
US 20180217981A1 · Rakshit · 2018 [cited by applicant]
US 20180276718A1 · Thomas et al. · 2018 [cited by applicant]
US 20180288104A1 · Padilla et al. · 2018 [cited by applicant]
US 20180330589A1 · Horling · 2018 [cited by applicant]
US 20180336183A1 · Lee et al. · 2018 [cited by applicant]
US 20180336356A1 · Papaxenopoulos et al. · 2018 [cited by applicant]
US 20180349158A1 · Swersky et al. · 2018 [cited by applicant]
US 20180366118A1 · Lovitt et al. · 2018 [cited by applicant]
US 20180376003A1 · Shinseki · 2018 [cited by applicant]
US 20190018839A1 · Ge et al. · 2019 [cited by applicant]
US 20190034792A1 · Kataria et al. · 2019 [cited by applicant]
US 20190087417A1 · Wang et al. · 2019 [cited by applicant]
US 20190095428A1 · Asano et al. · 2019 [cited by applicant]
US 20190114593A1 · Champaneria · 2019 [cited by applicant]
US 20190115008A1 · Jiang et al. · 2019 [cited by applicant]
US 20190138606A1 · Tu et al. · 2019 [cited by applicant]
US 20190156818A1 · Piersol et al. · 2019 [cited by applicant]
US 20190206400A1 · Cui et al. · 2019 [cited by applicant]
US 20190208024A1 · Jablonski · 2019 [cited by applicant]
US 20190236085A1 · Galitsky · 2019 [cited by applicant]
US 20190236464A1 · Feinson et al. · 2019 [cited by applicant]
US 20190258461A1 · Li et al. · 2019 [cited by applicant]
US 20190266250A1 · Toplyn · 2019 [cited by applicant]
US 20190294672A1 · Matskevich et al. · 2019 [cited by applicant]
US 20190295440A1 · Hadad · 2019 [cited by applicant]
US 20190295547A1 · Gandhi et al. · 2019 [cited by applicant]
US 20190303442A1 · Peitz et al. · 2019 [cited by applicant]
US 20190325068A1 · Lai et al. · 2019 [cited by applicant]
US 20190340291A1 · Raman et al. · 2019 [cited by applicant]
US 20190342339A1 · Nanda et al. · 2019 [cited by applicant]
US 20200004831A1 · Burceanu et al. · 2020 [cited by applicant]
US 20200013393A1 · Huang et al. · 2020 [cited by applicant]
US 20200065377A1 · Hirzel et al. · 2020 [cited by applicant]
US 20200065769A1 · Gupta et al. · 2020 [cited by applicant]
US 20200073983A1 · Sen et al. · 2020 [cited by applicant]
US 20200081882A1 · Cheriton · 2020 [cited by applicant]
US 20200104288A1 · Tao et al. · 2020 [cited by applicant]
US 20200134067A1 · Villard et al. · 2020 [cited by applicant]
US 20200134263A1 · Oh et al. · 2020 [cited by applicant]
US 20200151773A1 · Peppel · 2020 [cited by applicant]
US 20200184158A1 · Kuczmarski et al. · 2020 [cited by applicant]
US 20200184963A1 · Joseph et al. · 2020 [cited by applicant]
US 20200184966A1 · Yavagal · 2020 [cited by applicant]
US 20200193264A1 · Zavesky et al. · 2020 [cited by applicant]
US 20200219495A1 · Alkan et al. · 2020 [cited by applicant]
US 20200233927A1 · Berger et al. · 2020 [cited by applicant]
US 20200242142A1 · Connell et al. · 2020 [cited by applicant]
US 20200257988A1 · Creel et al. · 2020 [cited by applicant]
US 20200264900A1 · Cheriton · 2020 [cited by applicant]
US 20200267160A1 · Lees et al. · 2020 [cited by applicant]
US 20200272485A1 · Karashchuk et al. · 2020 [cited by applicant]
US 20200272915A1 · Tata et al. · 2020 [cited by applicant]
US 20200285968A1 · Tse et al. · 2020 [cited by applicant]
US 20200302564A1 · Varga et al. · 2020 [cited by applicant]
US 20200311146A1 · Guo et al. · 2020 [cited by applicant]
US 20200320082A1 · Schwing et al. · 2020 [cited by applicant]
US 20200320130A1 · Korpman et al. · 2020 [cited by applicant]
US 20200334580A1 · Sheopuri et al. · 2020 [cited by applicant]
US 20200372218A1 · Ukrainets et al. · 2020 [cited by applicant]
US 20200380889A1 · Fitzpatrick et al. · 2020 [cited by applicant]
US 20200387677A1 · Kim et al. · 2020 [cited by applicant]
US 20200394190A1 · Chaudhuri et al. · 2020 [cited by applicant]
US 20200395005A1 · Zheng et al. · 2020 [cited by applicant]
US 20200401766A1 · Brinig et al. · 2020 [cited by applicant]
US 20210011673A1 · Masai · 2021 [cited by applicant]
US 20210027770A1 · Olabiyi et al. · 2021 [cited by applicant]
US 20210042824A1 · Tarler et al. · 2021 [cited by applicant]
US 20210056113A1 · Mac An Tsaoir et al. · 2021 [cited by applicant]
US 20210056950A1 · Niehaus et al. · 2021 [cited by applicant]
US 20210056970A1 · Jain et al. · 2021 [cited by applicant]
US 20210065126A1 · Bykov et al. · 2021 [cited by applicant]
US 20210065685A1 · Hwang · 2021 [cited by applicant]
US 20210065693A1 · Sharifi et al. · 2021 [cited by applicant]
US 20210081814A1 · Sidorkin et al. · 2021 [cited by applicant]
US 20210089703A1 · Misawa et al. · 2021 [cited by applicant]
US 20210104100A1 · Whitney et al. · 2021 [cited by applicant]
US 20210104220A1 · Mennicken et al. · 2021 [cited by applicant]
US 20210117553A1 · Shpurov et al. · 2021 [cited by applicant]
US 20210120206A1 · Liu et al. · 2021 [cited by applicant]
US 20210134268A1 · Huang et al. · 2021 [cited by applicant]
US 20210144107A1 · Liang et al. · 2021 [cited by applicant]
US 20210150138A1 · Lanphear et al. · 2021 [cited by applicant]
US 20210173718A1 · Patel et al. · 2021 [cited by applicant]
US 20210174794A1 · Mont-Reynaud · 2021 [cited by applicant]
US 20210191988A1 · Galitsky · 2021 [cited by applicant]
US 20210192321A1 · Zhang · 2021 [cited by applicant]
US 20210192412A1 · Krishnaswamy · 2021 [cited by applicant]
US 20210193121A1 · Li · 2021 [cited by applicant]
US 20210201110A1 · Qin · 2021 [cited by applicant]
US 20210209070A1 · Latorre et al. · 2021 [cited by applicant]
US 20210224486A1 · Stabler et al. · 2021 [cited by applicant]
US 20210241381A1 · Neumann · 2021 [cited by applicant]
US 20210256049A1 · Byron et al. · 2021 [cited by applicant]
US 20210256375A1 · Menick et al. · 2021 [cited by applicant]
US 20210279621A1 · Lin et al. · 2021 [cited by applicant]
US 20210294977A1 · Soryal et al. · 2021 [cited by applicant]
US 20210303562A1 · Ludwig et al. · 2021 [cited by applicant]
US 20210319344A1 · Tang et al. · 2021 [cited by applicant]
US 20210342785A1 · Mann et al. · 2021 [cited by applicant]
US 20210350915A1 · Letinic · 2021 [cited by applicant]
US 20210365773A1 · Subramanian et al. · 2021 [cited by applicant]
US 20210367961A1 · Kuppa et al. · 2021 [cited by applicant]
US 20210375272A1 · Madwed et al. · 2021 [cited by applicant]
US 20210390553A1 · Brinig et al. · 2021 [cited by applicant]
US 20210406840A1 · Deluca et al. · 2021 [cited by applicant]
US 20210409283A1 · Smith et al. · 2021 [cited by applicant]
US 20220035881A1 · Levy et al. · 2022 [cited by applicant]
US 20220036153A1 · O'Malia et al. · 2022 [cited by applicant]
US 20220043702A1 · Haines · 2022 [cited by applicant]
US 20220050840A1 · Parravicini et al. · 2022 [cited by applicant]
US 20220060565A1 · Cherry et al. · 2022 [cited by applicant]
US 20220067283A1 · Bellegarda et al. · 2022 [cited by applicant]
US 20220067520A1 · Dalli et al. · 2022 [cited by applicant]
US 20220067540A1 · Ferrucci et al. · 2022 [cited by applicant]
US 20220075944A1 · Du et al. · 2022 [cited by applicant]
US 20220114361A1 · Kale et al. · 2022 [cited by applicant]
US 20220115008A1 · Pust et al. · 2022 [cited by applicant]
US 20220132179A1 · Bennett-James et al. · 2022 [cited by applicant]
US 20220138849A1 · Henson et al. · 2022 [cited by applicant]
US 20220148741A1 · Griffor et al. · 2022 [cited by applicant]
US 20220180060A1 · Jain et al. · 2022 [cited by applicant]
US 20220237368A1 · Tran · 2022 [cited by applicant]
US 20220261817A1 · Ferrucci et al. · 2022 [cited by applicant]
US 20220270597A1 · Qiu et al. · 2022 [cited by applicant]
US 20220292092A1 · Brown et al. · 2022 [cited by applicant]
US 20220326880A1 · Cook · 2022 [cited by applicant]
US 20220328039A1 · Avijeet · 2022 [cited by applicant]
US 20220342932A1 · Monk et al. · 2022 [cited by applicant]
US 20220382995A1 · Lee et al. · 2022 [cited by applicant]
US 20220398827A1 · Lewis · 2022 [cited by applicant]
US 20220405852A1 · Fohr et al. · 2022 [cited by applicant]
US 20230020886A1 · Mahapatra et al. · 2023 [cited by applicant]
US 20230074406A1 · Baeuml et al. · 2023 [cited by applicant]
US 20230083512A1 · Newman et al. · 2023 [cited by applicant]
US 20230206002A1 · Tunstall-Pedoe et al. · 2023 [cited by applicant]
US 20230311335A1 · Hausman et al. · 2023 [cited by applicant]
US 20230315983A1 · Seth et al. · 2023 [cited by applicant]
US 20230316006A1 · Tunstall-Pedoe et al. · 2023 [cited by applicant]
AU 2003266850B2 · 2007 [cited by applicant]
CA 3095725A1 · 2019 [cited by applicant]
WO 2019148108A1 · 2019 [cited by applicant]
WO 2021089129A1 · 2021 [cited by applicant]
WO 2023278135A2 · 2023 [cited by applicant]
“CYC Knowledge Base,” [online] en.wikipedia.org/wiki/cyc; published in 2019. [cited by applicant]
“CYC Technology Overview,” [online] www.cyc.com, published in 2019. [cited by applicant]
Zhang, Jiajun , et al., “Deep Neural Networks in Machine Translation: An Overview,” IEEE Intell. Syst. 30.5, 16-25 (2015). [cited by applicant]
Amorim et al. , Proceedings of the 10th ACM SIGPLAN Intl. Conf. on Software Language Engineering, “Deep priority conflicts in the wild: a pilot study,” pp. 55-66 (2017). [cited by applicant]
Chakraborty , et al., “Introduction to neural network based approaches for question answering over knowledge graphs,” arXiv preprint arXiv: 1907.09361, pp. 1-34 (2019). [cited by applicant]
Chung , et al., “Parallel natural language processing on a semantic network array processor,” IEEE Transactions on Knowledge and Data Engineering 7.3, pp. 391-405 (1995). [cited by applicant]
Fedus , et al., “Switch transformers: scaling to trillion parameter models with simple and efficient sparsity,” https://arxiv.org/abs/2101.03961v1; published in Jan. 2021. [cited by applicant]
Grimm, S. , “Knowledge representation and ontologies,” Scientific data mining and knowledge discovery: principles and foundations, Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 111-137 (2009). [cited by applicant]
He, Di , et al., “Decoding with value networks for neural machine translation,” Advances in Neural information processing systems 30 (2017). [cited by applicant]
Kmail, Aseel , et al., “An automatic online recruitment system based on exploiting multiple semantic resources and concept-relatedness measures,” 2015 IEEE 27th Intl. Conf. on Tools with Artificial Intelligence (ICTAI),… [cited by applicant]
Korney , “Knowledge Graphs in End-User Products: From Cyc to AI Assistants,” published Feb. 25, 2020. [cited by applicant]
Leach et al. , “RFC 4122: A universally unique identifier (UUID) URN namespace” pp. 1-32 (2005. [cited by applicant]
Mabbu , “A Semantic Knowledge engine Using Automated Knowledge Extraction from World Wide Web,” Wichita State University, pp. 1-51 (2015). [cited by applicant]
Mochalova, Anastasia , “Search for Answers in Ontological-Semantic Graph”, pp. 174-180; Retrieved from the Internet: URL: https://www.fruct.org/publications/ain1-abstract/files/Moc.pdf [retrieved on Dec. 10, 2021, Jan. … [cited by applicant]
Segaert, Katrien , et al., “Shared syntax in language production and language comprehension—an fMRI stydy,” Cerebral Cortex 22.7, 1662-1670 (2012). [cited by applicant]
Sharma , et al., “Simulation-based approach to efficient commonsense reasoning in very large knowledge bases,” Proc. of the AAAI Conf. on Artificial Intelligence, vol. 33, No. 1 (2019). [cited by applicant]
Shi, Chen , et al., “Knowledge-based semantic embedding for machine translation,” Proc. of the 54th Annual Mtg of the Assoc. for Computational Linguistics, vol. 1: Long Papers; (2016). [cited by applicant]
Slonneger et al. , title={Formal syntax and semantics of programming languages}, vol. 340, pp. 2-19 (1995). [cited by applicant]
Song, Linfeng , et al., “Semantic neural machine translation using AMR,” Transactions of the Assoc. for Computational Linguistics 7, 19-31 (2019). [cited by applicant]
Sowa, John F., “Conceptual graphs for representing conceptual structures,” Conceptual Structures in Practice, pp. 119-154 (2016). [cited by applicant]
Tunstall-Pedoe, W. , “True knowledge: Open-domain question answering using structured knowledge and inference,” AI Magazine, pp. 80-92 (2010). [cited by applicant]
Weiss , et al., “Sequence-to-Sequence Models Can Directly Translate Foreign Speech,” (arXiv:1703.08581v2[cs.CL] Jun. 12, 2017). [cited by applicant]
Yang , et al., “Towards Making the Most of BERT in Neural Machine Translation,” arXiv:1908.05672 [cs. CL], pp. 1-10 (2019). [cited by applicant]