IP Library › Granted Patent US 12,561,629
Granted Patent B2
US 12,561,629 · App. 17/649,183 · Granted Feb 24, 2026

Identifying regulatory data corresponding to executable rules

Inventors: Thanh Lam Hoang (Maynooth, IE); Marco Luca Sbodio (Castaheany, IE); Vanessa Lopez Garcia (Dublin, IE); Natalia Mulligan (Dublin, IE); Yufang Hou (Dublin, IE); Gabriele Picco (Dublin, IE); Inge Lise Vejsbjerg (Dublin, IE); Joao H Bettencourt-Silva (Dublin, IE)
Assignee: International Business Machines Corporation
G06Q10/06315G06F40/295G06F40/40G06V30/416
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,561,629
App. No.
17/649,183
Granted
Feb 24, 2026
Kind
B2
Abstract

Various embodiments are provided for correlating regulatory data in a computing environment by a processor. A rule may be associated with one or more textual paragraphs extracted from a policy document that describes at least a portion of the rule.

Claims (63)

1 . A method, comprising:

extracting, using natural language processing associated with a neural network, a first set of entities from one or more textual paragraphs associated with a natural language policy document;

converting one or more executable rules, associated with a rule document, into a second set of entities, wherein

each of the one or more executable rules is understandable and executable by a specific computer system;

assigning, each entity of the second set of entities, a ranked score corresponding to a level of importance of each entity of the second set of entities;

extracting, based on the first set of entities, one or more logical structures from the one or more textual paragraphs, wherein

each of the one or more logical structures represents fragments of a respective textual paragraph of the one or more textual paragraphs;

extracting, based on the second set of entities, one or more rule logical structures from the one or more executable rules, wherein

each of the one or more rule logical structures represents at least one of: a mathematical operator, a logical operator, a variable, or a constant;

comparing the one or more logical structures corresponding to the one or more textual paragraphs with the one or more rule logical structures corresponding to the one or more executable rules; and

identifying, for each executable rule of the one or more executable rules, using the natural language processing, a textual paragraph of the one or more textual paragraphs, based on the assigning of the ranked score and the comparing of the one or more logical structures with the one or more rule logical structures, wherein

the textual paragraph corresponds to a highest matching score, among the one or more textual paragraphs, that correlates to an executable rule of the one or more executable rules.

2 . The method of claim 1 , further comprising mapping, using a forward-backward translation operation, the one or more executable rules to the one or more textual paragraphs.

3 . The method of claim 1 , wherein the identifying of the textual paragraph of the one or more textual paragraphs further comprises:

assigning a set of matching scores between the one or more textual paragraphs and the one or more executable rules, wherein

each matching score of the set of matching scores corresponds to a respective textual paragraph of the one or more textual paragraphs and a respective rule of the one or more executable rules,

the set of matching scores includes the highest matching score, and

the set of matching scores indicates a degree of corresponding relevance between the one or more textual paragraphs and the one or more executable rules.

4 . The method of claim 1 , further comprising assigning a confidence score to the textual paragraph of the one or more textual paragraphs, wherein

the confidence score of the textual paragraph of the one or more textual paragraphs indicates a degree of confidence that the textual paragraph of the one or more textual paragraphs matches to the executable rule of the one or more executable rules.

5 . A system, comprising:

one or more processors with executable instructions that when executed cause the system to:

extract, using natural language processing associated with a neural network, a first set of entities from one or more textual paragraphs associated with a natural language policy document;

convert one or more executable rules, associated with a rule document, into a second set of entities, wherein

each of the one or more executable rules is understandable and executable by a specific computer system;

assign, each entity of the second set of entities, a ranked score corresponding to a level of importance of each entity of the second set of entities;

extract, based on the first set of entities, one or more logical structures from the one or more textual paragraphs, wherein

each of the one or more logical structures represents fragments of a respective textual paragraph of the one or more textual paragraphs;

extract, based on the second set of entities, one or more rule logical structures from the one or more executable rules, wherein

each of the one or more rule logical structures represents at least one of: a mathematical operator, a logical operator, a variable, or a constant;

compare the one or more logical structures corresponding to the one or more textual paragraphs with the one or more rule logical structures corresponding to the one or more executable rules; and

identify, for each executable rule of the one or more executable rules, using the natural language processing, a textual paragraph of the one or more textual paragraphs, based on the assignment of the ranked score and the comparison of the one or more logical structures with the one or more rule logical structures, wherein

the textual paragraph corresponds to a highest matching score, among the one or more textual paragraphs, that correlates to an executable rule of the one or more executable rules.

6 . The system of claim 5 , wherein the executable instructions when executed further cause the system to map, using a forward-backward translation operation, the one or more executable rules to the one or more textual paragraphs.

7 . The system of claim 5 , wherein the identification of the textual paragraph of the one or more textual paragraphs further comprises:

assign a set of matching scores between the one or more textual paragraphs and the one or more executable rules, wherein

each matching score of the set of matching scores corresponds to a respective textual paragraph of the one or more textual paragraphs and a respective rule of the one or more executable rules,

the set of matching scores includes the highest matching score, and

the set of matching scores indicates a degree of corresponding relevance between the one or more textual paragraphs and the one or more executable rules.

8 . The system of claim 5 , wherein the executable instructions when executed further cause the system to assign a confidence score to the textual paragraph of the one or more textual paragraphs, wherein

the confidence score of the textual paragraph of the one or more textual paragraphs indicates a degree of confidence that the textual paragraph of the one or more textual paragraphs matches to the executable rule of the one or more executable rules.

9 . A computer program product, comprising:

one or more computer readable storage media; and

program instructions collectively stored on the one or more computer readable storage media to perform operations comprising:

extracting, using natural language processing associated with a neural network, a first set of entities from one or more textual paragraphs associated with a natural language policy document;

converting one or more executable rules, associated with a rule document, into a second set of entities, wherein

each of the one or more executable rules is understandable and executable by a specific computer system;

assigning, each entity of the second set of entities, a ranked score corresponding to a level of importance of each entity of the second set of entities;

extracting, based on the first set of entities, one or more logical structures from the one or more textual paragraphs, wherein

each of the one or more logical structures represents fragments of a respective textual paragraph of the one or more textual paragraphs;

extracting, based on the second set of entities, one or more rule logical structures from the one or more executable rules, wherein

each of the one or more rule logical structures represents at least one of: a mathematical operator, a logical operator, a variable, or a constant;

comparing the one or more logical structures corresponding to the one or more textual paragraphs with the one or more rule logical structures corresponding to the one or more executable rules; and

identifying, for each executable rule of the one or more executable rules, using the natural language processing, a textual paragraph of the one or more textual paragraphs, based on the assigning of the ranked score and the comparing of the one or more logical structures with the one or more rule logical structures, wherein

the textual paragraph corresponds to a highest matching score, among the one or more textual paragraphs, that correlates to an executable rule of the one or more executable rules.

10 . The computer program product of claim 9 , wherein the program instructions stored on the one or more computer readable storage media perform the operations further comprising: mapping, using a forward-backward translation operation, the one or more executable rules to the one or more textual paragraphs.

11 . The computer program product of claim 9 , wherein the identifying of the textual paragraph of the one or more textual paragraphs further comprises:

assigning a set of matching scores between the one or more textual paragraphs and the one or more executable rules, wherein

each matching score of the set of matching scores corresponds to a respective textual paragraph of the one or more textual paragraphs and a respective rule of the one or more executable rules,

the set of matching scores includes the highest matching score, and

the set of matching scores indicates a degree of corresponding relevance between the one or more textual paragraphs and the one or more executable rules.

12 . The computer program product of claim 9 , wherein the program instructions stored on the one or more computer readable storage media perform the operations further comprising assigning a confidence score to the textual paragraph of the one or more textual paragraphs, wherein

the confidence score of the textual paragraph of the one or more textual paragraphs indicates a degree of confidence that the textual paragraph of the one or more textual paragraphs matches to the executable rule of the one or more executable rules.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 27, 2022
From: HOANG, THANH LAM; SBODIO, MARCO LUCA; LOPEZ GARCIA, VANESSA; MULLIGAN, NATALIA; HOU, YUFANG; PICCO, GABRIELE; VEJSBJERG, INGE LISE; BETTENCOURT-SILVA, JOAO H
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 058800/0093 →
Continuity (1)
Related Publication 20230237399A1 · Jul 27, 2023
References Cited (45)
US 10672092B2 · Simpson · 2020 [cited by applicant]
US 11556938B2 · Nair et al. · 2023 [cited by applicant]
US 20090198646A1 · Krishnamurthy · 2009 [cited by examiner]
US 20180053128A1 · Costas · 2018 [cited by examiner]
US 20180137107A1 · Buccapatnam Tirumala · 2018 [cited by examiner]
US 20200111023A1 · Pondicherry Murugappan · 2020 [cited by examiner]
US 20210319173A1 · Gerber, Jr. · 2021 [cited by examiner]
US 20230214679A1 · Xu · 2023 [cited by examiner]
CN 109493265A · 2019 [cited by applicant]
CN 112800246A · 2021 [cited by applicant]
CN 113032552A · 2021 [cited by applicant]
CN 116502645A · 2023 [cited by applicant]
JP 2023109716A · 2023 [cited by applicant]
WO 2012006509A1 · 2012 [cited by applicant]
L. Elluri, S. et al., “A Bert Based Approach to Measure Web Services Policies Compliance With GDPR,” in IEEE Access, vol. 9, pp. 148004-148016 (Year: 2021). [cited by examiner]
T. Zhang, et. al., “A Text Mining based Method for Policy Recommendation,” 2021 IEEE International Conference on Services Computing (SCC), Chicago, IL, USA, 2021, pp. 233-240 (Year: 2021). [cited by examiner]
M. El Kharbili, et. al., “CoReL: Policy-Based and Model-Driven Regulatory Compliance Management,” 2011 IEEE 15th International Enterprise Distributed Object Computing Conference, Helsinki, Finland, 2011, pp. 247-256 (Ye… [cited by examiner]
Zhong et al., “Aligning Knowledge and Text Embeddings by Entity Descriptions”, Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, pp. 267-272, Lisbon, Portugal, Sep. 2015, (6 pages). [cited by applicant]
Qu et al., “Weakly-supervised Knowledge Graph Alignment with Adversarial Learning”, Montreal Institute for Learning Algorithms (MILA), arXiv:1907.03179v1, Jul. 2019, (11 pages). [cited by applicant]
Dragoni et al., “Combining NLP Approaches for Rule Extraction from Legal Documents”, 1st Workshop on MIning and REasoning with Legal texts (MIREL 2016), Dec. 2016, Sophia Antipolis, France hal-01572443 (14 pages). [cited by applicant]
Wyner et al., “On Rule Extraction from Regulations”, Frontiers in Artificial Intelligence and Applications, vol. 235: Legal Knowledge and Information Systems, pp. 113-122, DOI 10.3233/978-1-60750-981-3-113, (10 pages). [cited by applicant]
Nair et al., “Towards Automated Extraction of Business Constraints from Unstructured Regulatory Text”, Proceedings of the 27th International Conference on Computational Linguistics: System Demonstrations, pp. 157-160, S… [cited by applicant]
Spinosa et al., “NLP-based Metadata Extraction for Legal Text Consolidation”, Proceedings of the 12th International Conference on Artificial Intelligence and Law, Barcelona, Spain, Jun. 2009, DOI: 10.1145/1568234.156824… [cited by applicant]
Bonterra. “Social Solutions”, https://web.archive.org/web/20210120213531/https://www.socialsolutions.com/software/apricot-360/, Jan. 20, 2021, 9 pages. [cited by applicant]
Deloitte. Get out of your own way—Unleashing productivity, Building the Lucky Country: Business imperatives for a prosperous Australia series, Mar. 26, 2015, 8 pages, Data retrieved from https://www2.deloitte.com/au/en/… [cited by applicant]
Github. “About LexNLP”, retrieved from web https://web.archive.org/web/20210921030649/https://lexpredict-lexnlp.readthedocs.io/en/latest/about.html, Sep. 21, 2021, 2 pages. [cited by applicant]
IBIS World. “Adoption & Child Welfare Services in the US”, Industry Statistics—United States Nov. 26, 2021, 7 pages, https://web.archive.org/web/20220119190139/https://www.ibisworld.com/industry-statistics/market-size/a… [cited by applicant]
IBM. “A safer and smarter return to the workplace”, retrieved from web https://web.archive.org/web/20220123063217/https://www.IBM.com/watson/watson-works, Jan. 23, 2022, 8 pages. [cited by applicant]
IBM. “Government health and human services solutions”, retrieved from web https://web.archive.org/web/20220116114753/https://www.ibm.com/watson-health/solutions/government-healthcare, Jan. 16, 2022, 6 pages. [cited by applicant]
IBM. “IBM Watson Care Manager”, retrieved from web https://web.archive.org/web/20220125095928/https://www.ibm.com/products/watson-care-manager, Jan. 25, 2022, 8 pages. [cited by applicant]
ICF. “Publications Office of the European Union”, European Commission, Study on the costs of compliance for the financial sector. Publications Office of the European Union, Jul. 2019, 372 pages, Data retrieved from http… [cited by applicant]
Kiyavitskaya et al. “Automating the extraction of rights and obligations for regulatory compliance”, In International Conference on Conceptual Modeling, 2008, pp. 154-168. [cited by applicant]
Kobayashi et al. “Top-Down RST Parsing Utilizing Granularity Levels in Documents”, Proceedings of the AAAI Conference on Artificial Intelligence, Apr. 3, 2020, 8 pages, vol. 34 No. 05, https://ojs.aaai.org//index.php/AA… [cited by applicant]
Ludwig et al. “Learning to Extract Action Descriptions from Narrative Text,” In IEEE Transactions on Games, Mar. 2018, pp. 15-28, vol. 10, No. 1, doi: 10.1109/TCIAIG.2017.2657690. [cited by applicant]
Mani et al. “Five trends shaping the future of Medicaid”, Mckinsey & Company, Mar. 29, 2019, 10 pages, https://web.archive.org/web/20210925213222/https://www.mckinsey.com/industries/healthcare-systems-and-services/our-i… [cited by applicant]
Mohun et al., “Cracking the code: Rulemaking for humans and machines”, OECD Working Papers on Public Governance, No. 42, OECD Publishing, Paris, Oct. 12, 2020, 110 pages, https://doi.org/10.1787/3afe6ba5-en. [cited by applicant]
No Author. “Digital government”, retrieved from web https://web.archive.org/web/20211019112022/https://www.digital.govt.nz/digital-government/, Oct. 19, 2021, 2 pages. [cited by applicant]
No Author. “NHE Fact Sheet”, CMS.gov, Jan. 7, 2022, 4 pages, https://web.archive.org/web/20220107011741/https://www.cms.gov/Research-Statistics-Data-and-Systems/Statistics-Trends-and-Reports/NationalHealthExpendData/NHE… [cited by applicant]
No Author. “OpenFisca”, retrieved from web https://web.archive.org/web/20210928104915/https://openfisca.org/en/, Sep. 28, 2021, 6 pages. [cited by applicant]
No Author. “Policy Basics: The Supplemental Nutrition Assistance Program (SNAP)”, Center on Budget and policy priorities, Jun. 25, 2019, 10 pages, https://web.archive.org/web/20220120183903/https://www.cbpp.org/research… [cited by applicant]
No Author. “SentenceTransformers Documentation”, retrieved from web https://web.archive.org/web/20211202134853/https://www.sbert.net/index.html, Dec. 2, 2021, 8 pages. [cited by applicant]
No Author. “Value of a Families entitlement for best start tax credit”, Best Start best_start_tax_credit_per_child, Oct. 21, 2021, 2 pages, https://web.archive.org/web/20211021064227/http://nz.openfisca.org/variables/be… [cited by applicant]
Rainey Rebecca. “Jobless claims reach 22 million over four weeks”, Politico, Apr. 16, 2020, 6 pages, https://web.archive.org/web/20220123215900/https://www.politico.com/news/2020/04/16/coronavirus-unemployment-claims-nu… [cited by applicant]
Sapkota et al. Extracting meaningful entities from regulatory text: Towards automating regulatory compliance, In Requirements Engineering and Law (RELAW), Sep. 2012, pp. 29-32. [cited by applicant]
Venetis et al. “Recovering semantics of tables on the web”, Proceedings of the VLDB Endowment, Jun. 1, 2011, pp. 528-538, vol. 4, Issue 9, DOI:https://doi.org/10.14778/2002938.2002939. [cited by applicant]