IP Library Granted Patent US 12,533,586
Granted Patent B2
US 12,533,586 · App. 17/472,508 · Granted Jan 27, 2026

Server-based mechanics help determination from aggregated user data

Inventors: Adil Ahmed Sherwani (Oakland, CA); Mischa G. Stephens (San Francisco, CA); Xiaohan Zhang (Albany, CA); Jay Robert Franck (San Francisco, CA); Nitin Y. Mohan (San Francisco, CA); Oscar Michael Sanchez (South San Francisco, CA); Derek Andrew Parker (South San Francisco, CA)
Assignee: Sony Interactive Entertainment Inc.
A63F13/5375A63F13/35A63F13/67A63F13/86
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,533,586
App. No.
17/472,508
Granted
Jan 27, 2026
Kind
B2
Abstract

Techniques for improving a user video game experience are described. In an example, a computer system receives event data from a plurality of user devices. Each event data includes an identifier of an activity in a video game and data indicating completion of the activity. The identifier can be predefined in program code of the video game. The identifier and completion data can be received based on an execution of the program code. The event data is processed to determine a video game mechanic suggestion to help a player complete the activity.

Claims (65)

1. A method implemented on a platform configured to provide at least one uniform video-game service across multiple video games, the method including:

receiving, by the platform, an activity identifier of an activity completed by a first video game player in a video game and a mechanic identifier of a first mechanic used in the video game during the activity, wherein the first mechanic includes at least one of: a set of tools, a set of capabilities, or a set of skills available in the video game, and wherein the activity identifier and the mechanic identifier are predefined in program code of the video game according to a uniform data model defined for a plurality of video games, and are received based on an execution of the program code of the video game;

storing, by the platform, the activity identifier and the mechanic identifier in a data store;

determining, by a help service provided by the platform for the plurality of video games, based on activity identifiers and mechanic identifiers stored in the data store for a plurality of video game players, that the plurality of video game players used the first mechanic in the activity;

generating, by the help service provided by the platform, information about the first mechanic to complete the activity; and

presenting, by the help service provided by the platform, the information in a window to a second video game player of the video game that has not completed the activity.

2. The method of claim 1 , further including:

determining that the first mechanic is available to the second video game player, wherein the information is presented based on the first mechanic being available.

3. The method of claim 1 , wherein the information includes at least one of: a text description, a link to a graphical animation, a link to a video file, or a link to an audio file, and wherein the window is presented over at least a portion of video game content of the video game.

4. The method of claim 3 , wherein the window further includes a link to a video about using the first mechanic to complete the activity.

5. The method of claim 3 , wherein the window further includes a map that corresponds to a zone within the video game content, wherein the zone shows an estimated position of where the activity was completed by the plurality of video game players and a current position of a virtual player within the video game content, and wherein the virtual player corresponds to the second video game player.

6. The method of claim 1 , wherein determining that the first mechanic was used by the plurality of video game players includes:

generating a score for the first mechanic based on a frequency of the mechanic identifier being used successfully during the activity from data stored for the plurality of video game players in the data store.

7. The method of claim 6 , further including:

receiving, after presenting the information and before receipt of a second activity identifier, the activity identifier, the mechanic identifier, and an outcome of completing the activity by the second video game player;

determining that the outcome is a successful completion; and

updating the score based on the successful completion.

8. The method of claim 6 , further including:

ranking, based on the score, the first mechanic relative to one or more other mechanics available to complete the activity; and

selecting the first mechanic for presentation to the second video game player based on the ranking.

9. The method of claim 1 , wherein the first mechanic is used in the video game during the activity to at least one of: (i) assist the first video game player improving at least one of the set of tools, the set of capabilities, or the set of skills, or (ii) assist the first video game player playing against another video game player or interacting with a video game object, and wherein the video game is associated with a video game developer, and the method further includes:

prior to presenting the information about the first mechanic, receiving a confirmation of the video game developer that the information is valid.

10. The method of claim 1 , wherein determining that the first mechanic was used by the plurality of video game players includes:

accessing, from the data store, data for the plurality of video game players, wherein the data includes the activity identifier, the mechanic identifier, and a successful completion or a failed completion for each of the plurality of video game players; and

determining, from the data, that a use of the first mechanic to complete the activity has a successful completion rate higher than a predefined threshold,

wherein the information indicates the use of the first mechanic to complete the activity.

11. The method of claim 1 , wherein determining that the first mechanic was used by the plurality of video game players includes:

accessing, from the data store, data for the plurality of video game players, wherein the data includes the activity identifier, the mechanic identifier, and a successful completion or a failed completion for each of the plurality of video game players; and

determining, from the data, that a use of the first mechanic to complete the activity has a failed completion rate higher than a predefined threshold,

wherein the information indicates avoidance of the use of the first mechanic to complete the activity.

12. The method of claim 1 , wherein determining that the first mechanic was used by the plurality of video game players includes:

accessing, from the data store, data for the plurality of video game players, wherein the data includes the activity identifier, the mechanic identifier, and a successful completion or a failed completion for each of the plurality of video game players; and

determining, from the data, that a use of the first mechanic to complete the activity when a condition is presented in the activity has a successful completion rate higher than a predefined threshold,

wherein the information indicates the use of the first mechanic to complete the activity when the condition is present.

13. The method of claim 1 , further including:

ranking the first mechanic for the second video game player relative to one or more other mechanics available to complete the activity based on at least one of: an availability of the first mechanic from an account of the second video game player, a spoiler included in the first mechanic about the activity or the video game, an availability of the first mechanic from an application store, or a history of use of the first mechanic by the second video game player.

14. The method of claim 1 , wherein generating the information includes:

determining a history of use of the first mechanic by the second video game player; and

personalizing the information for the second video game player based on the history.

15. The method of claim 1 , wherein generating the information includes:

determining an availability of the first mechanic from an in-game store, an application store, or a platform store; and

personalizing the information for the second video game player based on the availability.

16. A computer system including:

one or more processors; and

one or more memories storing computer-readable instructions that, upon execution by the one or more processors, configure the computer system to:

receive, by a platform configured to provide at least one uniform video-game service across multiple video games, an activity identifier of an activity completed by a first video game player in a video game and a mechanic identifier of a first mechanic used in the video game during the activity, wherein the first mechanic includes at least one of: a set of tools, a set of capabilities, or a set of skills available in the video game, and wherein the activity identifier and the mechanic identifier are predefined in program code of the video game according to a uniform data model defined for a plurality of video games, and are received based on an execution of the program code of the video game;

store, by the platform, the activity identifier and the mechanic identifier in a data store;

determine, by a help service provided by the platform for the plurality of video games, based on activity identifiers and mechanic identifiers stored in the data store for a plurality of video game players, that the plurality of video game players used the first mechanic in the activity;

generate, by the help service, information about the first mechanic to complete the activity; and

present, by the help service, the information in a window to a second video game player of the video game that has not completed the activity.

17. The computer system of claim 16 , wherein the execution of the computer-readable instructions further configure the computer system to:

access, from the data store, data for the plurality of video game players, wherein the data includes the activity identifier, the mechanic identifier, and a difficulty setting for playing the video game; and

associate the information about the first mechanic with the difficulty setting.

18. One or more non-transitory computer-readable storage media storing instructions that, upon execution on a computer system, cause the computer system to perform operations including:

receiving, by a platform configured to provide at least one uniform video-game service across multiple video games, an activity identifier of an activity completed by a first video game player in a video game and a mechanic identifier of a first mechanic used in the video game during the activity, wherein the first mechanic includes at least one of: a set of tools, a set of capabilities, or a set of skills available in the video game, and wherein the activity identifier and the mechanic identifier are predefined in program code of the video game according to a uniform data model defined for a plurality of video games, and are received based on an execution of the program code of the video game;

storing, by the platform, the activity identifier and the mechanic identifier in a data store;

determining, by a help service provided by the platform for the plurality of video games, based on activity identifiers and mechanic identifiers stored in the data store for a plurality of video game players, that the plurality of video game players used the first mechanic in the activity;

generating, by the help service provided by the platform, information about the first mechanic to complete the activity; and

presenting, by the help service provided by the platform, the information in a window to a second video game player of the video game that has not completed the activity.

19. The one or more non-transitory computer-readable storage media of claim 18 , wherein the activity is a task from a plurality of tasks that form a second activity, wherein the operations further include:

presenting an initial window in a first state to the second video game player, the initial window identifying the second activity and presented over video game content of the video game;

presenting the window in an expanded state upon a selection of the second activity, the window in the expanded state identifying the tasks of the second activity; and

updating the window in the expanded state to present the information about the first mechanic upon a selection of the activity from the tasks.

20. The one or more non-transitory computer-readable storage media of claim 18 , wherein the activity is a task from a plurality of tasks that form a second activity, wherein the operations further include:

receiving a first event indicating that the first mechanic is used by the first video game player during the activity and a second event indicating an impact of using the first mechanic on a game play in the activity, wherein the information is generated further based on the first event and the second event.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 10, 2021
From: SHERWANI, ADIL AHMED; STEPHENS, MISCHA G.; ZHANG, XIAOHAN; FRANCK, JAY ROBERT; MOHAN, NITIN Y.; SANCHEZ, OSCAR MICHAEL; PARKER, DEREK ANDREW
To: SONY INTERACTIVE ENTERTAINMENT INC.
Reel/Frame 057455/0085 →
Continuity (2)
Continuation 16687389 · Nov 18, 2019
Related Publication 20210402301A1 · Dec 30, 2021
References Cited (198)
US 6352479B1 · Sparks, II · 2002 [cited by applicant]
US 8126933B2 · Nishiyama · 2012 [cited by applicant]
US 8260728B1 · Walsh et al. · 2012 [cited by applicant]
US 8515253B2 · Cottrell · 2013 [cited by applicant]
US 8690656B2 · Yamada et al. · 2014 [cited by applicant]
US 9358466B2 · Kruglick · 2016 [cited by applicant]
US 9364743B2 · Miura et al. · 2016 [cited by applicant]
US 9421467B2 · Miyamoto · 2016 [cited by applicant]
US 9457264B1 · Chyou et al. · 2016 [cited by applicant]
US 9533215B1 · Wakeford et al. · 2017 [cited by applicant]
US 9630097B2 · Paradise et al. · 2017 [cited by applicant]
US 9662565B1 · Riordan · 2017 [cited by applicant]
US 9666029B1 · Yu et al. · 2017 [cited by applicant]
US 9669295B1 · Harrington et al. · 2017 [cited by applicant]
US 9782678B2 · Long et al. · 2017 [cited by applicant]
US 9962605B1 · Wei et al. · 2018 [cited by applicant]
US 9981189B1 · Wakeford et al. · 2018 [cited by applicant]
US 10223449B2 · Smith et al. · 2019 [cited by applicant]
US 10232269B1 · Harrington et al. · 2019 [cited by applicant]
US 10279264B1 · Aghdaie et al. · 2019 [cited by applicant]
US 10286323B2 · Aghdane et al. · 2019 [cited by applicant]
US 10335690B2 · Schleicher · 2019 [cited by applicant]
US 10387782B2 · Kon · 2019 [cited by applicant]
US 10427055B2 · Watari et al. · 2019 [cited by applicant]
US 10456680B2 · Miron et al. · 2019 [cited by applicant]
US 10780357B2 · Ryan et al. · 2020 [cited by applicant]
US 10857464B2 · Sulakhe · 2020 [cited by applicant]
US 11071910B1 · Landers et al. · 2021 [cited by applicant]
US 11117057B2 · Hiatt et al. · 2021 [cited by applicant]
US 11123639B2 · Sherwani et al. · 2021 [cited by applicant]
US 11130061B2 · Sherwani et al. · 2021 [cited by applicant]
US 11338210B2 · Benedetto et al. · 2022 [cited by applicant]
US 11504618B2 · Sherwani et al. · 2022 [cited by applicant]
US 11534694B2 · Hiatt et al. · 2022 [cited by applicant]
US 11673051B2 · Sherwani et al. · 2023 [cited by applicant]
US 11992762B2 · Sherwani et al. · 2024 [cited by applicant]
US 20010016510A1 · Ishikawa et al. · 2001 [cited by applicant]
US 20020039952A1 · Clem · 2002 [cited by applicant]
US 20030216177A1 · Aonuma et al. · 2003 [cited by applicant]
US 20050009610A1 · Miyamoto et al. · 2005 [cited by applicant]
US 20050246638A1 · Whitten · 2005 [cited by applicant]
US 20060046234A1 · Sperry · 2006 [cited by applicant]
US 20060258462A1 · Cheng et al. · 2006 [cited by applicant]
US 20070294089A1 · Garbow et al. · 2007 [cited by applicant]
US 20080096663A1 · Lieberman · 2008 [cited by examiner]
US 20080268960A1 · Farrier et al. · 2008 [cited by applicant]
US 20090209337A1 · Vrignaud et al. · 2009 [cited by applicant]
US 20100041475A1 · Zalewski · 2010 [cited by examiner]
US 20100121808A1 · Kuhn · 2010 [cited by applicant]
US 20110246621A1 · May, Jr. et al. · 2011 [cited by applicant]
US 20110269540A1 · Gillo et al. · 2011 [cited by applicant]
US 20110281648A1 · Weising · 2011 [cited by applicant]
US 20110306395A1 · Ivory et al. · 2011 [cited by applicant]
US 20120021840A1 · Johnson et al. · 2012 [cited by applicant]
US 20120202594A1 · Bistis et al. · 2012 [cited by applicant]
US 20130005452A1 · Chatani · 2013 [cited by applicant]
US 20130005471A1 · Chung et al. · 2013 [cited by applicant]
US 20130006403A1 · Moore et al. · 2013 [cited by applicant]
US 20130059634A1 · Behmaram-Mosavat et al. · 2013 [cited by applicant]
US 20130079134A1 · Walker et al. · 2013 [cited by applicant]
US 20130249947A1 · Reitan · 2013 [cited by applicant]
US 20130260894A1 · Graf et al. · 2013 [cited by applicant]
US 20140038701A1 · Allen et al. · 2014 [cited by applicant]
US 20140080556A1 · Knutsson · 2014 [cited by applicant]
US 20140080558A1 · Knutsson · 2014 [cited by applicant]
US 20140080559A1 · Knutsson et al. · 2014 [cited by applicant]
US 20140080560A1 · Knutsson · 2014 [cited by applicant]
US 20140080561A1 · Knutsson · 2014 [cited by applicant]
US 20140080600A1 · Knutsson et al. · 2014 [cited by applicant]
US 20140080601A1 · Knutsson · 2014 [cited by applicant]
US 20140081438A1 · Knutsson · 2014 [cited by applicant]
US 20140106876A1 · Knutsson et al. · 2014 [cited by applicant]
US 20140106877A1 · Knutsson et al. · 2014 [cited by applicant]
US 20140106878A1 · Knutsson · 2014 [cited by applicant]
US 20140113704A1 · Knutsson · 2014 [cited by applicant]
US 20140128159A1 · Knutsson · 2014 [cited by applicant]
US 20140135102A1 · Knutsson · 2014 [cited by applicant]
US 20140135104A1 · Knutsson · 2014 [cited by applicant]
US 20140135120A1 · Knutsson et al. · 2014 [cited by applicant]
US 20140162780A1 · Suzuki · 2014 [cited by applicant]
US 20140256420A1 · Justice et al. · 2014 [cited by applicant]
US 20140258469A1 · Maharajh et al. · 2014 [cited by applicant]
US 20140278686A1 · Mullings et al. · 2014 [cited by applicant]
US 20140349750A1 · Thompson et al. · 2014 [cited by applicant]
US 20140370979A1 · Zahn · 2014 [cited by examiner]
US 20150153906A1 · Liao et al. · 2015 [cited by applicant]
US 20150157929A1 · Hall et al. · 2015 [cited by applicant]
US 20150157938A1 · Domansky et al. · 2015 [cited by applicant]
US 20150231502A1 · Allen et al. · 2015 [cited by applicant]
US 20150382061A1 · Maisenbacher et al. · 2015 [cited by applicant]
US 20160016077A1 · Yokota et al. · 2016 [cited by applicant]
US 20160158652A1 · Wright et al. · 2016 [cited by applicant]
US 20160255409A1 · Feldstein et al. · 2016 [cited by applicant]
US 20160266740A1 · Glasgow · 2016 [cited by applicant]
US 20160279521A1 · Knutsson et al. · 2016 [cited by applicant]
US 20160287992A1 · Knutsson et al. · 2016 [cited by applicant]
US 20160303475A1 · Norden · 2016 [cited by applicant]
US 20160310843A1 · Webb · 2016 [cited by applicant]
US 20160317927A1 · Miyamoto · 2016 [cited by applicant]
US 20160367896A1 · Lee et al. · 2016 [cited by applicant]
US 20170007920A1 · Knutsson · 2017 [cited by applicant]
US 20170064014A1 · Nomura · 2017 [cited by applicant]
US 20170087460A1 · Perry · 2017 [cited by applicant]
US 20170087475A1 · Perry · 2017 [cited by applicant]
US 20170173471A1 · Knutsson et al. · 2017 [cited by applicant]
US 20170259177A1 · Aghdaie et al. · 2017 [cited by applicant]
US 20170266568A1 · Lucas et al. · 2017 [cited by applicant]
US 20170270128A1 · Smith et al. · 2017 [cited by applicant]
US 20170282063A1 · Krishnamurthy · 2017 [cited by applicant]
US 20170282077A1 · De La Cruz · 2017 [cited by applicant]
US 20170282079A1 · De La Cruz · 2017 [cited by applicant]
US 20170328724A1 · Lobo et al. · 2017 [cited by applicant]
US 20170351922A1 · Campbell · 2017 [cited by applicant]
US 20170357853A1 · Castanon et al. · 2017 [cited by applicant]
US 20180001194A1 · Sherwani et al. · 2018 [cited by applicant]
US 20180001206A1 · Osman et al. · 2018 [cited by applicant]
US 20180104592A1 · Knutsson et al. · 2018 [cited by applicant]
US 20180111041A1 · Bress et al. · 2018 [cited by applicant]
US 20180161673A1 · Pasternack et al. · 2018 [cited by applicant]
US 20180207522A1 · Roman et al. · 2018 [cited by applicant]
US 20180221761A1 · Knutsson et al. · 2018 [cited by applicant]
US 20180239959A1 · Bui et al. · 2018 [cited by applicant]
US 20180243654A1 · Wakeford et al. · 2018 [cited by applicant]
US 20180365935A1 · Howell et al. · 2018 [cited by applicant]
US 20190209924A1 · Harrington et al. · 2019 [cited by applicant]
US 20190217203A1 · Ryan et al. · 2019 [cited by applicant]
US 20190232168A1 · Benedetto et al. · 2019 [cited by applicant]
US 20190232169A1 · Benedetto et al. · 2019 [cited by applicant]
US 20190262707A1 · Campbell · 2019 [cited by applicant]
US 20190336859A1 · Panesar et al. · 2019 [cited by applicant]
US 20190388785A1 · Kumar et al. · 2019 [cited by applicant]
US 20200030702A1 · Benedetto · 2020 [cited by applicant]
US 20200061465A1 · Benedetto et al. · 2020 [cited by applicant]
US 20200122031A1 · Sherwani et al. · 2020 [cited by applicant]
US 20200139239A1 · Lee et al. · 2020 [cited by applicant]
US 20200139245A1 · Jarzebinski · 2020 [cited by applicant]
US 20200289932A1 · Benedetto et al. · 2020 [cited by applicant]
US 20210038998A1 · Tallarico et al. · 2021 [cited by applicant]
US 20210086089A1 · Pardeshi et al. · 2021 [cited by applicant]
US 20210146239A1 · Hiatt et al. · 2021 [cited by applicant]
US 20210146241A1 · Bleasdale-Shepherd et al. · 2021 [cited by applicant]
US 20210146244A1 · Sherwani et al. · 2021 [cited by applicant]
US 20210146261A1 · Hiatt et al. · 2021 [cited by applicant]
US 20210151034A1 · Hasan et al. · 2021 [cited by applicant]
US 20210213353A1 · Berg et al. · 2021 [cited by applicant]
US 20210362063A1 · Hiatt et al. · 2021 [cited by applicant]
US 20210370183A1 · Dorn et al. · 2021 [cited by applicant]
US 20220019744A1 · Yu et al. · 2022 [cited by applicant]
US 20220096937A1 · Dorn et al. · 2022 [cited by applicant]
US 20220358917A1 · Chaland et al. · 2022 [cited by applicant]
US 20230041552A1 · Sherwani et al. · 2023 [cited by applicant]
US 20230078380A1 · Zaghetto et al. · 2023 [cited by applicant]
US 20240082734A1 · Benedetto et al. · 2024 [cited by applicant]
US 20240412036A1 · Krishnan et al. · 2024 [cited by applicant]
CN 1848124A · 2006 [cited by applicant]
CN 102834151A · 2012 [cited by applicant]
CN 105050672A · 2015 [cited by applicant]
CN 105246567A · 2016 [cited by applicant]
CN 107158702A · 2017 [cited by applicant]
CN 107661628A · 2018 [cited by applicant]
CN 110180180A · 2019 [cited by applicant]
EP 3028751A2 · 2016 [cited by applicant]
EP 3513850A2 · 2019 [cited by applicant]
JP 2002191868A · 2002 [cited by applicant]
JP 2003325973A · 2003 [cited by applicant]
JP 2005027996A · 2005 [cited by applicant]
JP 2008295776A · 2008 [cited by applicant]
JP 2009011568A · 2009 [cited by applicant]
JP 2009201809A · 2009 [cited by applicant]
JP 2010063840A · 2010 [cited by applicant]
JP 2011218102A · 2011 [cited by applicant]
JP 2013528432A · 2013 [cited by applicant]
JP 2014228725A · 2014 [cited by applicant]
JP 2015097803A · 2015 [cited by applicant]
JP 2017164552A · 2017 [cited by applicant]
JP 2019524212A · 2019 [cited by applicant]
KR 20180075931A · 2018 [cited by applicant]
WO WO2014100770A2 · 2014 [cited by applicant]
WO WO2021156848A1 · 2021 [cited by applicant]
PCT/US2020/059427 , “International Search Report and Written Opinion”, Feb. 3, 2021, 13 pages. [cited by applicant]
PCT/US2020/059427 , “International Preliminary Report on Patentability”, Jun. 2, 2022, 9 pages. [cited by applicant]
askagamedev.tumblr.com [online], “Dynamic resolution Scaling has become a common,” Nov. 24, 2020. retrieved on Jun. 14, 2023, retrieved from URL <https://askagamedev.tumblr.com/posl/635692229684510720/dynamic-resolution… [cited by applicant]
Cheng et al. “TallFormer: Temporal Action Localization with a Long-memory Transformer,” CoRR, Submitted on Jul. 26, 2022, arXiv:2204.01680v2, 22 pages. [cited by applicant]
Chittaro et al., “VU-Flow: A Visualization Tool for Analyzing Navigation in Virtual Environments,” IEEE Transactions on Visualization and Computer Graphics, Nov. 2006, 12(6):1475-1485. [cited by applicant]
Clark et al., “Electra: Pre-training Text Encoders as Discriminators Rather Than Generators,” Paper, ICLR 2020, Mar. 2020, 18 pages. [cited by applicant]
definecpu.com [online], “What Is Dynamic Resolution Scaling? Real-time Rendering will Prioritize the FPS,” Aug. 22, 2022, retrieved on Jun. 14, 2023, retrieved from URL<https://definecpu.com/dynamic-resolution-scaling/>… [cited by applicant]
Drachen et al., “Analyzing Spatial User Behavior in Computer Games Using Geographic Information Systems,” Poster Proceedings of the 13th International Mindtrek Conference, Tampere, Finland, Sep. 2009, pp. 182-189. [cited by applicant]
Dutoit, “High Quality Text to Speech Synthesis: An Overview,” Faculte Polyechnique de Mons, TCTS lab, 1997, 21 pages. [cited by applicant]
eurogamer.net [online], “Radeon Boost analyzed: is AMD's new dynamic resolution technology a game-changer?” Dec. 19, 2019, retrieved on Jun. 14, 2023, retrieved from URL<https://www.eurogamer.net/digitalfoundry-2019adeo… [cited by applicant]
Gagne et al., “A Deeper Look at the Use of Telemetry for Analysis of Player Behavior in RTS Games,” Big Data Analytics in the Social and Ubiquitous Context: 5th International Workshop on Modeling Social Media, Oct. 5, 2… [cited by applicant]
Hochreiter et al., “Long Short-term memory,” Neural Computation, 1997, 9(8):1735-1780. [cited by applicant]
Hoobler et al., “Visualizing Competitive Behaviors in Multi-User Virtual Environments,” IEEE Visualization, Oct. 10-15, 2004, pp. 163-170. [cited by applicant]
Nadkami et al., “Natural Language Processing: an introduction,” J. Am. Med. Assoc., 2011, 18:544-551. [cited by applicant]
Radford et al., “Improving Language Understanding by Generative Pre-training,” Open AI, Jun. 2018, 12 pages. [cited by applicant]
Sasirekha et al., “Text to Speech: A simple Tutorial,” Int. J. of Sort Computing and Eng. (IJSCE), Mar. 2012, 2(1):275-278. [cited by applicant]
Vaswani et al., “Attention Is All You Need,” CoRR, Submitted on Dec. 6, 2017, arXiv:1706.03762, 15 pages. [cited by applicant]
Zhuang et al., “A Comprehensive Survey on Transfer Learning,” CoRR, Submitted on Jun. 23, 2020, arXiv:1911.02685v3, 31 pages. [cited by applicant]
EP20816348.5 , “Office Action”, Oct. 18, 2024, 5 pages. [cited by applicant]