IP Library Granted Patent US 12,541,539
Granted Patent B2
US 12,541,539 · App. 18/678,908 · Granted Feb 3, 2026

Methods and systems for a compliance framework database schema

Inventor: Dorian J. Cougias (Oakland, CA)
Assignee: Unified Compliance Framework (Network Frontiers)
G06F16/316G06F16/211G06F16/2282G06F16/27G06F40/197
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,541,539
App. No.
18/678,908
Granted
Feb 3, 2026
Kind
B2
Abstract

Generating a compliance framework. The compliance framework facilitates an organization's compliance with multiple authority documents by providing efficient methodologies and refinements to existing technologies, such as providing hierarchical fidelity to the original authority document; separating auditable citations from their context (e.g., prepositions and or informational citations); asset focused citations; SNED and Live values, among others.

Claims (45)

1 . A memory storing a data structure accessible by one or more processors of a data processing system that performs database operations based, at least in part, on the data structure, the data structure comprising:

a record for a citation among multiple citations within multiple authority documents, each record comprising:

an editorial status of the record, wherein the editorial status is calculated, by the one or more processors, based on a comparison between a first checksum value of fields in a current release of the record and a second checksum value of fields in a previous release of the record, to indicate a status selected from a set including a same status, a new status, an edited status, and a deprecated status, and wherein:

if the first checksum value equals the second checksum value, the status is selected to be the same status,

if the second checksum value does not exist, the status is selected to be the new status,

if the first checksum value does not match the second checksum value, the status is selected to be the edited status, and

if a predefined digit of the first checksum value differs from a predefined digit of the second checksum value in a predefined manner, the status is selected to be the deprecated status; and

an indication of a control connected to the citation based on calculation using the one or more processors.

2 . The memory of claim 1 , wherein the predefined digit of the first checksum is the first digit of the first checksum and the predefined digit of the second checksum is the first digit of the second checksum.

3 . The memory of claim 1 , wherein if the status is selected to be the deprecated status, the record includes a deprecated-by field with a value identifying a surviving record.

4 . The memory of claim 1 , wherein the record further comprises information identifying the record in a hierarchy in accordance with the multiple of citations.

5 . The memory of claim 4 , wherein the information includes a parent record identifier and a sort value.

6 . The memory of claim 5 , wherein the parent record identifier indicates the citation's position in the hierarchy relative to at least an ancestor citation in the hierarchy.

7 . The memory of claim 5 , wherein the sort value indicates the citation's position in the hierarchy relative to a set of siblings in the hierarchy.

8 . The memory of claim 1 , wherein the control connected to the citation is generated based on a noun-verb pair for the citation.

9 . One or more instances of non-transitory computer-readable media collectively storing a data structure accessible by one or more processors of a computing system that performs database operations based, at least in part, on the data structure, the data structure comprising:

a record for a citation among multiple citations within multiple authority documents, each record comprising:

an editorial status of the record, wherein the editorial status is calculated, by the one or more processors, based on a comparison between a first checksum value of fields in a current release of the record and a second checksum value of fields in a previous release of the record, to indicate a status selected from a set including a same status, a new status, an edited status, and a deprecated status, and wherein:

if the first checksum value equals the second checksum value, the status is selected to be the same status,

if the second checksum value does not exist, the status is selected to be the new status,

if the first checksum value does not match the second checksum value, the status is selected to be the edited status, and

if a predefined digit of the first checksum value differs from a predefined digit of the second checksum value in a predefined manner, the status is selected to be the deprecated status; and

an indication of a control connected to the citation based on calculation using the one or more processors.

10 . The one or more instances of non-transitory computer-readable media of claim 9 , wherein the predefined digit of the first checksum is the first digit of the first checksum and the predefined digit of the second checksum is the first digit of the second checksum.

11 . The one or more instances of non-transitory computer-readable media of claim 9 , wherein if the status is selected to be the deprecated status, the record includes a deprecated-by field with a value identifying a surviving record.

12 . The one or more instances of non-transitory computer-readable media of claim 9 , wherein the record further comprises information identifying the record in a hierarchy in accordance with the multiple of citations.

13 . The one or more instances of non-transitory computer-readable media of claim 12 , wherein the information includes a parent record identifier and a sort value.

14 . The one or more instances of non-transitory computer-readable media of claim 13 , wherein the parent record identifier indicates the citation's position in the hierarchy relative to at least an ancestor citation in the hierarchy.

15 . The one or more instances of non-transitory computer-readable media of claim 13 , wherein the sort value indicates the citation's position in the hierarchy relative to a set of siblings in the hierarchy.

16 . The one or more instances of non-transitory computer-readable media of claim 9 , wherein the control connected to the citation is generated based on a noun-verb pair for the citation.

17 . A system comprising memory that stores content accessible by one or more processors to perform database operations, the content comprising:

a record for a citation among multiple citations within multiple authority documents, each record comprising:

an editorial status of the record, wherein the editorial status is calculated, by the one or more processors, based on a comparison between a first checksum value of fields in a current release of the record and a second checksum value of fields in a previous release of the record, to indicate a status selected from a set including a same status, a new status, an edited status, and a deprecated status, and wherein:

if the first checksum value equals the second checksum value, the status is selected to be the same status,

if the second checksum value does not exist, the status is selected to be the new status,

if the first checksum value does not match the second checksum value, the status is selected to be the edited status, and

if a predefined digit of the first checksum value differs from a predefined digit of the second checksum value in a predefined manner, the status is selected to be the deprecated status; and

an indication of a control connected to the citation based on calculation using the one or more processors.

18 . The system of claim 17 , wherein the predefined digit of the first checksum is the first digit of the first checksum and the predefined digit of the second checksum is the first digit of the second checksum.

19 . The system of claim 17 , wherein if the status is selected to be the deprecated status, the record includes a deprecated-by field with a value identifying a surviving record.

20 . The system of claim 17 , wherein the record further comprises information identifying the record in a hierarchy in accordance with the multiple of citations.

21 . The system of claim 20 , wherein the information includes a parent record identifier and a sort value.

22 . The system of claim 21 , wherein the parent record identifier indicates the citation's position in the hierarchy relative to at least an ancestor citation in the hierarchy.

23 . The system of claim 21 , wherein the sort value indicates the citation's position in the hierarchy relative to a set of siblings in the hierarchy.

24 . The system of claim 17 , wherein the control connected to the citation is generated based on a noun-verb pair for the citation.

Continuity (7)
Continuation 17160175 · Jan 27, 2021
Division 16432634 · Jun 5, 2019
Continuation 15794405 · Oct 26, 2017
Division 14685466 · Apr 13, 2015
Continuation 13723018 · Dec 20, 2012
Provisional Application 61722759 · Nov 5, 2012
Related Publication 20240320245A1 · Sep 26, 2024
References Cited (219)
US 4847766A · McRae et al. · 1989 [cited by applicant]
US 5715468A · Budzinski · 1998 [cited by applicant]
US 5745776A · Sheppard, II · 1998 [cited by applicant]
US 5765172A · Fox · 1998 [cited by examiner]
US 5819265A · Ravin et al. · 1998 [cited by applicant]
US 5832480A · Byrd, Jr. et al. · 1998 [cited by applicant]
US 5974574A · Lennie · 1999 [cited by examiner]
US 6289342B1 · Lawrence et al. · 2001 [cited by applicant]
US 6393389B1 · Chanod et al. · 2002 [cited by applicant]
US 6453315B1 · Weissman et al. · 2002 [cited by applicant]
US 6529917B1 · Zoltan · 2003 [cited by examiner]
US 6581074B1 · Wong · 2003 [cited by examiner]
US 6675169B1 · Bennett et al. · 2004 [cited by applicant]
US 6738780B2 · Lawrence et al. · 2004 [cited by applicant]
US 6823325B1 · Davies et al. · 2004 [cited by applicant]
US 6966030B2 · Ashford et al. · 2005 [cited by applicant]
US 6996583B2 · Wilmot · 2006 [cited by examiner]
US 7333927B2 · Lee et al. · 2008 [cited by applicant]
US 7493253B1 · Ceusters et al. · 2009 [cited by applicant]
US 7725399B2 · Nakahara et al. · 2010 [cited by applicant]
US 7822597B2 · Brun et al. · 2010 [cited by applicant]
US 7869989B1 · Harvey et al. · 2011 [cited by applicant]
US 8019590B1 · Kinder · 2011 [cited by applicant]
US 8019769B2 · Rolle · 2011 [cited by applicant]
US 8108207B1 · Harvey et al. · 2012 [cited by applicant]
US 8190423B2 · Rehberg et al. · 2012 [cited by applicant]
US 8219566B2 · Rolle · 2012 [cited by applicant]
US 8417693B2 · Lempel et al. · 2013 [cited by applicant]
US 8489630B2 · McBeath · 2013 [cited by examiner]
US 8612466B2 · Kikuchi et al. · 2013 [cited by applicant]
US 8661059B1 · Cougias · 2014 [cited by applicant]
US 9009197B2 · Cougias · 2015 [cited by applicant]
US 9020808B2 · Branton · 2015 [cited by applicant]
US 9110975B1 · Diligenti et al. · 2015 [cited by applicant]
US 9122741B1 · McAlister · 2015 [cited by examiner]
US 9123024B2 · LeVine et al. · 2015 [cited by applicant]
US 9256718B2 · Silin · 2016 [cited by applicant]
US 9449353B2 · Bercow et al. · 2016 [cited by applicant]
US 9575954B2 · Cougias et al. · 2017 [cited by applicant]
US 9715497B1 · Bhadbhade et al. · 2017 [cited by applicant]
US 9760586B1 · Cook · 2017 [cited by applicant]
US 9798753B1 · Cook · 2017 [cited by applicant]
US 9798767B1 · Cook · 2017 [cited by applicant]
US 9846694B1 · Cook · 2017 [cited by applicant]
US 9923931B1 · Wagster · 2018 [cited by applicant]
US 9967285B1 · Rossman et al. · 2018 [cited by applicant]
US 9977775B2 · Cougias et al. · 2018 [cited by applicant]
US 9996608B2 · Cougias · 2018 [cited by applicant]
US 10198491B1 · Semturs et al. · 2019 [cited by applicant]
US 10353933B2 · Cougias · 2019 [cited by applicant]
US 10387575B1 · Shen et al. · 2019 [cited by applicant]
US 10430317B2 · Richter et al. · 2019 [cited by applicant]
US 10606945B2 · Cougias et al. · 2020 [cited by applicant]
US 10769379B1 · Cougias et al. · 2020 [cited by applicant]
US 10824817B1 · Cougias et al. · 2020 [cited by applicant]
US 10896211B2 · Cougias · 2021 [cited by applicant]
US 11120227B1 · Cougias et al. · 2021 [cited by applicant]
US 11216495B2 · Cougias · 2022 [cited by applicant]
US 11514521B1 · Arumilli et al. · 2022 [cited by applicant]
US 11516016B2 · Oswalt · 2022 [cited by applicant]
US 20020065675A1 · Grainger et al. · 2002 [cited by applicant]
US 20020082717A1 · Hellberg et al. · 2002 [cited by applicant]
US 20020169771A1 · Melmon et al. · 2002 [cited by applicant]
US 20020184068A1 · Krishnan et al. · 2002 [cited by applicant]
US 20030067498A1 · Parisi · 2003 [cited by applicant]
US 20040006466A1 · Zhou et al. · 2004 [cited by applicant]
US 20040030540A1 · Ovil et al. · 2004 [cited by applicant]
US 20040059932A1 · Takeuchi et al. · 2004 [cited by applicant]
US 20040107124A1 · Sharpe et al. · 2004 [cited by applicant]
US 20050080776A1 · Colledge et al. · 2005 [cited by applicant]
US 20050080780A1 · Colledge et al. · 2005 [cited by applicant]
US 20050096914A1 · Williamson et al. · 2005 [cited by applicant]
US 20050138046A1 · Miettinen · 2005 [cited by examiner]
US 20050138056A1 · Stefik et al. · 2005 [cited by applicant]
US 20050193009A1 · Reinhardt et al. · 2005 [cited by applicant]
US 20050203924A1 · Rosenberg · 2005 [cited by applicant]
US 20050228799A1 · Farlow et al. · 2005 [cited by applicant]
US 20060047656A1 · Dehlinger et al. · 2006 [cited by applicant]
US 20060149720A1 · Dehlinger · 2006 [cited by applicant]
US 20060149800A1 · Egnor et al. · 2006 [cited by applicant]
US 20060259475A1 · Dehlinger · 2006 [cited by applicant]
US 20070011211A1 · Reeves et al. · 2007 [cited by applicant]
US 20070016583A1 · Lempel et al. · 2007 [cited by applicant]
US 20070088683A1 · Feroglia et al. · 2007 [cited by applicant]
US 20070118515A1 · Dehlinger · 2007 [cited by applicant]
US 20070192085A1 · Roulland et al. · 2007 [cited by applicant]
US 20070282592A1 · Huang et al. · 2007 [cited by applicant]
US 20070283252A1 · Stuhec · 2007 [cited by applicant]
US 20080091408A1 · Roulland et al. · 2008 [cited by applicant]
US 20080208563A1 · Sumita · 2008 [cited by applicant]
US 20080262863A1 · Stickley et al. · 2008 [cited by applicant]
US 20080287142A1 · Keighran · 2008 [cited by applicant]
US 20090024385A1 · Hirsch · 2009 [cited by applicant]
US 20090089126A1 · Odubiyi · 2009 [cited by applicant]
US 20090089195A1 · Salomon et al. · 2009 [cited by applicant]
US 20090112859A1 · Dehlinger · 2009 [cited by applicant]
US 20090119141A1 · McCalmont et al. · 2009 [cited by applicant]
US 20090187567A1 · Rolle · 2009 [cited by applicant]
US 20090265199A1 · Moerdler et al. · 2009 [cited by applicant]
US 20100114628A1 · Adler et al. · 2010 [cited by applicant]
US 20100145678A1 · Csomai et al. · 2010 [cited by applicant]
US 20100250313A1 · Crocker et al. · 2010 [cited by applicant]
US 20110112973A1 · Sanghvi · 2011 [cited by applicant]
US 20110179075A1 · Kikuchi et al. · 2011 [cited by applicant]
US 20110208769A1 · Kemp · 2011 [cited by applicant]
US 20110225129A1 · Agrawal · 2011 [cited by examiner]
US 20110225155A1 · Roulland et al. · 2011 [cited by applicant]
US 20110270603A1 · Ovil et al. · 2011 [cited by applicant]
US 20120036157A1 · Rolle · 2012 [cited by applicant]
US 20120066135A1 · Garst et al. · 2012 [cited by applicant]
US 20120072422A1 · Rollins et al. · 2012 [cited by applicant]
US 20120078801A1 · Holland et al. · 2012 [cited by applicant]
US 20120116984A1 · Hoang et al. · 2012 [cited by applicant]
US 20120197631A1 · Ramani et al. · 2012 [cited by applicant]
US 20120323937A1 · Modi · 2012 [cited by examiner]
US 20130047221A1 · Warnock et al. · 2013 [cited by applicant]
US 20130091486A1 · Gemmell et al. · 2013 [cited by applicant]
US 20130226662A1 · LeVine et al. · 2013 [cited by applicant]
US 20130297477A1 · Overman et al. · 2013 [cited by applicant]
US 20130346302A1 · Purves et al. · 2013 [cited by applicant]
US 20140032209A1 · Etzioni et al. · 2014 [cited by applicant]
US 20140046892A1 · Gopalakrishnan et al. · 2014 [cited by applicant]
US 20140052617A1 · Chawla et al. · 2014 [cited by applicant]
US 20140244524A1 · Brestoff et al. · 2014 [cited by applicant]
US 20140310249A1 · Kowalski · 2014 [cited by applicant]
US 20150012402A1 · Buck · 2015 [cited by applicant]
US 20150066478A1 · Onishi et al. · 2015 [cited by applicant]
US 20150142682A1 · Ghaisas et al. · 2015 [cited by applicant]
US 20150220621A1 · Cougias · 2015 [cited by applicant]
US 20150249651A1 · Okamoto et al. · 2015 [cited by applicant]
US 20160306789A1 · Cougias et al. · 2016 [cited by applicant]
US 20160350283A1 · Carus et al. · 2016 [cited by applicant]
US 20160371618A1 · Leidner et al. · 2016 [cited by applicant]
US 20170075877A1 · Lepeltier · 2017 [cited by applicant]
US 20170147635A1 · McAteer et al. · 2017 [cited by applicant]
US 20170178028A1 · Cardonha et al. · 2017 [cited by applicant]
US 20170220536A1 · Chiba et al. · 2017 [cited by applicant]
US 20170236129A1 · Kholkar et al. · 2017 [cited by applicant]
US 20170300472A1 · Parikh et al. · 2017 [cited by applicant]
US 20180053128A1 · Costas · 2018 [cited by applicant]
US 20180101779A1 · Canim et al. · 2018 [cited by applicant]
US 20180314754A1 · Cougias · 2018 [cited by applicant]
US 20180357097A1 · Poort et al. · 2018 [cited by applicant]
US 20180373691A1 · Alba et al. · 2018 [cited by applicant]
US 20190080018A1 · Pilkington et al. · 2019 [cited by applicant]
US 20190080334A1 · Copeland et al. · 2019 [cited by applicant]
US 20190163778A1 · Brown et al. · 2019 [cited by applicant]
US 20190188400A1 · Vandervort · 2019 [cited by applicant]
US 20190260694A1 · Londhe et al. · 2019 [cited by applicant]
US 20190286642A1 · Cougias · 2019 [cited by applicant]
US 20190286643A1 · Cougias · 2019 [cited by applicant]
US 20200050620A1 · Clark et al. · 2020 [cited by applicant]
US 20200111023A1 · Pondicherry Murugappan et al. · 2020 [cited by applicant]
US 20200176098A1 · Lucas et al. · 2020 [cited by applicant]
US 20200327285A1 · Cox et al. · 2020 [cited by applicant]
US 20200380075A1 · Boada et al. · 2020 [cited by applicant]
US 20210004535A1 · Cougias et al. · 2021 [cited by applicant]
US 20210149932A1 · Cougias · 2021 [cited by applicant]
US 20210365638A1 · Cougias et al. · 2021 [cited by applicant]
US 20220067290A1 · Cougias et al. · 2022 [cited by applicant]
US 20220159093A1 · Joshi et al. · 2022 [cited by applicant]
US 20220309416A1 · Barday · 2022 [cited by applicant]
US 20230031040A1 · Cougias et al. · 2023 [cited by applicant]
US 20230075614A1 · Cougias et al. · 2023 [cited by applicant]
EP 1975837A1 · 2008 [cited by applicant]
EP 3404891A1 · 2018 [cited by applicant]
WO WO2008121382A1 · 2008 [cited by applicant]
Madkour et al., “A Survey of Shortest-path Algorithms,” arXiv preprint arXiv:1705.02044v1, pp. 1-26, May 2017. [cited by applicant]
“AuditScripts—About Us,” <www.auditscripts.com/about-us/>, 2011. (2 Pages). [cited by applicant]
“CSA Cloud Security Alliance—History,” <cloudsecurityalliance.org/history/>, 2010, (2 Pages). [cited by applicant]
“HITRUST Common Security Framework Matures with Enhancements for 2010,” Feb. 1, 2010, 4 pages. < hitrustalliance.net/hitrust-common-security-framework-matures- enhancements-2010/>. [cited by applicant]
“ISF Information Security Forum,” <securityforum.org/about/>, first published 2007, (3 Pages). [cited by applicant]
Badarudeen et al., “Assessing Readability of Patient Education Materials: Current Role in Orthopaedics,” [cited by applicant]
Baldwin et al., “Chapter 1—Multiword Expressions,” [cited by applicant]
Cloud Security Alliance, “Security Guidance for Critical Areas of Focus in Cloud Computing V2.1 ,” Dec. 2009, 76 pages. [cited by applicant]
Devlin et al., “BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding,” Cornell University, 2018, 14 pages. [cited by applicant]
Ferrari et al., “Detecting requirements defects with NLP patterns: an industrial experience in the railway domain,” [cited by applicant]
Final Office Action for U.S. Appl. No. 16/432,634, mailed Oct. 12, 2021, 10 pages. [cited by applicant]
Final Office Action for U.S. Appl. No. 16/432,634, mailed Oct. 12, 2021, 17 pages. [cited by applicant]
Final Office Action for U.S. Appl. No. 16/432,737, Date Mailed Feb. 11, 2021, 10 pages. [cited by applicant]
Final Office Action for U.S. Appl. No. 16/459,385, mailed Apr. 23, 2021, 17 pages. [cited by applicant]
Final Office Action for U.S. Appl. No. 17/160,175, mailed May 11, 2023, 18 pages. [cited by applicant]
Final Office Action for U.S. Appl. No. 17/389,959, mailed May 18, 2022, 18 pages. [cited by applicant]
Final Office Action for U.S. Appl. No. 17/389,959, mailed May 2, 2023, 31 pages. [cited by applicant]
Gharbieh et al., “Deep Learning Models For Multiword Expression Identification,” [cited by applicant]
International Preliminary Report on Patentability for International Application No. PCT/US2016/026787, dated Oct. 24, 2017 (10 pages). [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2013/068341, dated Feb. 26, 2014, 9 pages. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2016/026787, mailed Jul. 22, 2016, 13 pages. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2021/048088, mailed Feb. 9, 2022, 13 pages. [cited by applicant]
International Search Report, mailed Nov. 8, 2022, for International Patent Application No. PCT/US2022/037624. (3 pages). [cited by applicant]
Karat et al., “Designing Natural Language and Structured Entry Methods for Privacy Policy Authoring,” Human-Computer Interaction—Interact IFIP TC13 International Conference, Rome, Italy, Sep. 12-16, 2005, pp. 671-684. (… [cited by applicant]
Karat et al., “Designing Natural Language and Structured Entry Methods for Privacy Policy Authoring,” Human-Computer Interaction—Interact IFIP TC13 International Conference, Rome, Italy, Sep. 12-16, 2005, pp. 671-684. (… [cited by applicant]
Lan et al., “ALBERT: a Lite Bert for Self-Supervised Learning of Language Representations,” arXiv preprint arXiv:1909.11942, 2019, 17 pages. [cited by applicant]
Masini, F., “Multi-Word Expressions and Morphology,” Oxford Research Encyclopedias, 2019, 30 pages. [cited by applicant]
Mikolov et al., “Distributed Representations of Words and Phrases and their Compositionality,” Advances in neural information processing systems:3111-3119, 2013. [cited by applicant]
Neumann et al., “An Analysis of Public REST Web Service APIs,” 97/1/2021, IEEE Transactions on Services Computing, vol. 14, No. 4, Jul./Aug. 2021, pp. 957-970 (Year: 2021). [cited by applicant]
Non Final Office Action for U.S. Appl. No. 13/952,212, Date Mailed Oct. 15, 2013, 7 pages. [cited by applicant]
Non Final Office Action for U.S. Appl. No. 16/432,634, Date Mailed Feb. 5, 2021, 7 pages. [cited by applicant]
Non Final Office Action for U.S. Appl. No. 16/932,609, mailed May 3, 2022, 16 pages. [cited by applicant]
Non Final Office Action for U.S. Appl. No. 17/160,175, Date Mailed Dec. 6, 2022, 33 pages. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 17/389,959, mailed Dec. 7, 2021, 33 pages. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 17/460,054, Date Mailed Nov. 15, 2021, 5 pages. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 17/460,054, dated Mar. 7, 2022, 12 pages. [cited by applicant]
Office Action for U.S. Appl. No. 16/459,385, Date Mailed Apr. 23, 2021, 17 pages. [cited by applicant]
Pennington et al., “GloVe: Global Vectors for Word Representation,” Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP): 1532-1543, 2014. [cited by applicant]
Peters et al., “Deep contextualized word representations,” arXiv preprint arXiv:1802.05365v2, 2018, 15 pages. [cited by applicant]
Proffitt, Tim, “Meeting Compliance Efforts with the Mother of All Control Lists (MOACL),” Sans Institute Information, Security Reading Room, 2010, 56 pages. [cited by applicant]
Radford et al., “Improving Language Understanding by Generative Pre-Training,” 2018 (Retrieved from s3-us-west-2.amazonaws.com on Sep. 14, 2021.). [cited by applicant]
Ramshaw et al., “Text Chunking Using Transformation-Based Learning,” Natural language processing using very large corpora, Springer, 1999, 157-176. [cited by applicant]
Ratinov et al., “Design Challenges and Misconceptions in Named Entity Recognition,” Proceedings of the Thirteenth Conference on Computational Natural Language Learning (CoNLL):147-155, 2009. [cited by applicant]
Rohanian at al., “Bridging the Gap: Attending to Discontinuity in Identification of Multiword Expressions,” Cornell University, 2019, 7 pages. [cited by applicant]
Schneider et al., “SemEval-2016 Task 10: Detecting Minimal Semantic Units and their Meanings (DiMSUM),” Proceedings of SemEval:546-559, 2016. [cited by applicant]
Škvorc et al., “MICE: Mining Idioms with Contextual Embeddings,” Aug. 14, 2020, pp. 1-23. [cited by applicant]
Suissas, “Verb Sense Classification,” Thesis to obtain the Master of Science Degree in Information Systems and Computer Engineering: 1-72, Oct. 2014. [cited by applicant]
U.S. Appl. No. 13/952,212, filed Jul. 26, 2013, Dorian J. Cougias. NOTE—Cite Granted U.S. Pat. No. 8,661,059—Already added to US citation list. [cited by applicant]
Vaswani et al., “Attention Is All You Need,” 31st Conference on Neural Information Processing Systems, 2017, 11 pages. [cited by applicant]
Wahl, “The Distributional Learning of Multi-Word Expressions: A Computational Approach,” Dissertation: 1-190, Jun. 2015. [cited by applicant]
Wikipedia, “Frequency (statistics)”, 4 pages, downloaded Mar. 11, 2020. (Year: 2020). [cited by applicant]
Wikipedia, “Word lists by frequency”, 10 pages, downloaded Mar. 11, 2020. (Year: 2020). [cited by applicant]