IP Library › Granted Patent US 12,204,861
Granted Patent B2
US 12,204,861 · App. 18/170,468 · Granted Jan 21, 2025

Automatic compliance tools

Inventors: Dorian J. Cougias (Oakland, CA); Vicki McEwen (Oakland, CA); Steven Piliero (Oakland, CA); Lucian Hontau (Oakland, CA); Zike Huang (Oakland, CA); Sean Kohler (Oakland, CA)
Assignee: Unified Compliance Framework (Network Frontiers)
G06F40/295G06F40/242G06F40/30G06Q30/018
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,204,861
App. No.
18/170,468
Granted
Jan 21, 2025
Kind
B2
Abstract

A facility for representing a mandate occurring in an authority document with a control is described. For each of one or more controls in a set of existing controls, the facility determines a similarity score measuring the similarity of the mandate and the control; where the similarity score exceeds a similarity threshold, the facility links the mandate to the control. Where the mandate is not linked to any control in the set of controls, the facility adds a control to the set of controls that is based on the mandate, and links the mandate to the added control.

Claims (56)

1. A method comprising:

accessing at least one source authority document comprising mandates;

determining a group of controls, each control in the group of controls representing one or more of the mandates of the at least one source authority document, based, at least in part, on a similarity rating between individual controls and individual mandates, and

wherein the similarity rating between a particular control and a particular mandate is determined by:

identifying a control verb in the particular control and a control noun in the particular control,

identifying a mandate verb in the particular mandate and a mandate noun in the particular mandate,

determining a first minimum quantity of edges in accordance with a first shortest path identified between the control verb and the mandate verb in a semantic graph,

determining a second minimum quantity of edges in accordance with a second shortest path identified between the control noun and the mandate noun in the semantic graph, and

computing the similarity rating based on a combination of the first minimum quantity of edges with the second minimum quantity of edges; and

generating a substitute authority document containing one copy of each control of the determined group of controls.

2. The method of claim 1 , wherein the mandate noun is the object of the mandate verb, semantically.

3. The method of claim 1 , wherein the semantic graph represents relationships between terms including at least one of a word or phrase.

4. The method of claim 3 , wherein the semantic graph includes nodes corresponding to the terms, and wherein a node is connected to another node via an edge that identifies a nature of relationship between the terms corresponding to the connected nodes.

5. The method of claim 1 , wherein the similarity rating is inversely related to at least one of the first minimum quantity of edges or second minimum quantity of edges.

6. The method of claim 5 , wherein the similarity rating is inversely related to a weighted combination of the first minimum quantity of edges and second minimum quantity of edges.

7. The method of claim 6 , wherein in the weighted combination, a weight associated with the first minimum quantity of edges is greater than a weight associated with the second minimum quantity of edges.

8. The method of claim 1 , wherein determining the group of controls comprises constructing at least one of the controls, in the group of controls, based on one or more of the mandates of the at least one source authority document.

9. A computer-readable medium excluding transitory signals, per se, the computer-readable medium storing instructions that, when executed by a computing system, cause the computing system to perform a method, the method comprising:

accessing at least one source authority document comprising mandates;

determining a group of controls, each control in the group of controls representing one or more of the mandates of the at least one source authority document, based, at least in part, on a similarity rating between individual controls and individual mandates, and

wherein the similarity rating between a particular control and a particular mandate is determined by:

identifying a control verb in the particular control and a control noun in the particular control,

identifying a mandate verb in the particular mandate and a mandate noun in the particular mandate,

determining a first distance in accordance with a first shortest path identified between the control verb and the mandate verb in a semantic graph,

determining a second distance in accordance with a second shortest path identified between the control noun and the mandate noun in the semantic graph, and

computing the similarity rating based on the first distance between the control verb and the mandate verb and the second distance between the control noun and the mandate noun; and

generating a substitute authority document containing one copy of each control of at least a subset of the determined group of controls.

10. The computer-readable medium of claim 9 , wherein the method further comprises:

accessing a set of contextual authority documents; and

determining controls representing the mandates from the contextual authority documents;

wherein at least two controls in the group of controls are controls from the contextual authority documents.

11. The computer-readable medium of claim 9 , wherein the semantic graph includes nodes corresponding to terms, and wherein a node is connected to another node via an edge that identifies a nature of relationship between the terms corresponding to the connected nodes.

12. The computer-readable medium of claim 9 , wherein the similarity rating is inversely related to at least one of the first distance or second distance.

13. The computer-readable medium of claim 12 , wherein the similarity rating is inversely related to a weighted combination of the first distance and second distance.

14. The computer-readable medium of claim 9 ,

wherein at least one control in the group of controls represents multiple of the mandates; and

wherein each of the multiple mandates represented by a corresponding control is represented by that control based on a determination that each of those multiple mandates can be satisfied by an action that satisfies the control.

15. The computer-readable medium of claim 9 , wherein

wherein at least a particular control, in the group of controls, represents multiple of the mandates; and

wherein that particular control represents each particular mandate, of the multiple mandates, based on a determination that a similarity rating between the particular control and the particular mandate is above a threshold.

16. A computing system comprising:

one or more processors; and

one or more memories storing instructions that, when executed by the one or more processors, cause the computing system to perform a process comprising:

accessing at least one source authority document comprising mandates;

determining a group of controls, each control in the group of controls representing one or more of the mandates of the at least one source authority document, based, at least in part, on a similarity rating between individual controls and individual mandates, and

wherein the similarity rating between a particular control and a particular mandate is determined by:

identifying a control verb in the particular control and a control noun in the particular control,

identifying a mandate verb in the particular mandate and a mandate noun in the particular mandate,

determining a first distance in accordance with a first shortest path identified between the control verb and the mandate verb in a semantic graph,

determining a second distance in accordance with a second shortest path identified between the control noun and the mandate noun in the semantic graph, and

computing the similarity rating based on the first distance between the control verb and the mandate verb and the second distance between the control noun and the mandate noun; and

generating a substitute authority document containing one copy of each control of at least a subset of the determined group of controls.

17. The computing system of claim 16 , wherein the mandate noun is the object of the mandate verb, semantically.

18. The computing system of claim 16 , wherein the semantic graph represents relationships between terms including at least one of a words or phrase.

19. The computing system of claim 16 , wherein the first distance is determined based on a minimum number of edges between two nodes representing the control verb and the mandate verb.

20. The computing system of claim 16 , wherein the process further comprises linking each control, in the group of controls, to the mandates that control represents.

Continuity (3)
Continuation 16932609 · Jul 17, 2020
Division 16459429 · Jul 1, 2019
Related Publication 20230214596A1 · Jul 6, 2023
References Cited (207)
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 5819265A · Ravin et al. · 1998 [cited by applicant]
US 5832480A · Byrd, Jr. et al. · 1998 [cited by applicant]
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 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 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 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 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 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 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 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, Amgad, et al. “A survey of shortest-path algorithms.” arXiv preprint arXiv:1705.02044 (2017). (Year: 2017). [cited by examiner]
“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]
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]
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/Jan. 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]
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]
Badarudeen et al., “Assessing Readability of Patient Education Materials: Current Role in Orthopaedics,” [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]