CA3235967A1 - Application of natural language processing to facilitate responses to regulatory questions - Google Patents

Application of natural language processing to facilitate responses to regulatory questions Download PDF

Info

Publication number
CA3235967A1
CA3235967A1 CA3235967A CA3235967A CA3235967A1 CA 3235967 A1 CA3235967 A1 CA 3235967A1 CA 3235967 A CA3235967 A CA 3235967A CA 3235967 A CA3235967 A CA 3235967A CA 3235967 A1 CA3235967 A1 CA 3235967A1
Authority
CA
Canada
Prior art keywords
questions
regulatory
processors
question
processing
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CA3235967A
Other languages
English (en)
French (fr)
Inventor
Saleh ALKHALIFA
Daniel VAGLE
Furkan OZYURT
Elif Seyma BAYRAK
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Amgen Inc
Original Assignee
Amgen Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Amgen Inc filed Critical Amgen Inc
Publication of CA3235967A1 publication Critical patent/CA3235967A1/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/02—Neural networks
    • G06N3/04—Architecture, e.g. interconnection topology
    • G06N3/044—Recurrent networks, e.g. Hopfield networks
    • G06N3/0442—Recurrent networks, e.g. Hopfield networks characterised by memory or gating, e.g. long short-term memory [LSTM] or gated recurrent units [GRU]
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00—Handling natural language data
    • G06F40/20—Natural language analysis
    • G06F40/279—Recognition of textual entities
    • G06F40/284—Lexical analysis, e.g. tokenisation or collocates
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00—Handling natural language data
    • G06F40/20—Natural language analysis
    • G06F40/205—Parsing
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00—Handling natural language data
    • G06F40/20—Natural language analysis
    • G06F40/205—Parsing
    • G06F40/211—Syntactic parsing, e.g. based on context-free grammar [CFG] or unification grammars
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00—Handling natural language data
    • G06F40/30—Semantic analysis
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00—Handling natural language data
    • G06F40/30—Semantic analysis
    • G06F40/35—Discourse or dialogue representation
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/02—Neural networks
    • G06N3/04—Architecture, e.g. interconnection topology
    • G06N3/045—Combinations of networks
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/02—Neural networks
    • G06N3/08—Learning methods
    • G06N3/09—Supervised learning
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/02—Neural networks
    • G06N3/04—Architecture, e.g. interconnection topology
    • G06N3/048—Activation functions
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/02—Neural networks
    • G06N3/08—Learning methods
    • G06N3/092—Reinforcement learning

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Health & Medical Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Computational Linguistics (AREA)
  • General Health & Medical Sciences (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Biomedical Technology (AREA)
  • Biophysics (AREA)
  • Data Mining & Analysis (AREA)
  • Evolutionary Computation (AREA)
  • Molecular Biology (AREA)
  • Computing Systems (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Electrically Operated Instructional Devices (AREA)
CA3235967A 2021-10-21 2022-10-18 Application of natural language processing to facilitate responses to regulatory questions Pending CA3235967A1 (en)

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
US202163270448P 2021-10-21 2021-10-21
US63/270,448 2021-10-21
US202263389569P 2022-07-15 2022-07-15
US63/389,569 2022-07-15
PCT/US2022/046974 WO2023069401A1 (en) 2021-10-21 2022-10-18 Application of natural language processing to facilitate responses to regulatory questions

Publications (1)

Publication Number Publication Date
CA3235967A1 true CA3235967A1 (en) 2023-04-27

Family

ID=84360106

Family Applications (1)

Application Number Title Priority Date Filing Date
CA3235967A Pending CA3235967A1 (en) 2021-10-21 2022-10-18 Application of natural language processing to facilitate responses to regulatory questions

Country Status (7)

Country Link
US (1) US20240419908A1 (enExample)
EP (1) EP4420040A1 (enExample)
JP (1) JP2024539670A (enExample)
AU (1) AU2022373323A1 (enExample)
CA (1) CA3235967A1 (enExample)
MX (1) MX2024004791A (enExample)
WO (1) WO2023069401A1 (enExample)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117194632A (zh) * 2023-09-11 2023-12-08 平安银行股份有限公司 从文档中抽取结构化知识的方法、装置、设备及介质

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US12456015B1 (en) * 2023-03-31 2025-10-28 Amazon Technologies, Inc. Natural language question generation
CN119293203A (zh) * 2023-07-07 2025-01-10 马上消费金融股份有限公司 问题挖掘方法、装置、电子设备及存储介质
CN118051598A (zh) * 2024-03-04 2024-05-17 北京百度网讯科技有限公司 药品知识问答方法、装置、电子设备及存储介质
JP7798275B1 (ja) * 2025-02-26 2026-01-14 株式会社ラーニングプロセス 資料作成のための支援装置、プログラム、記録媒体、及び方法

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11914954B2 (en) * 2019-12-08 2024-02-27 Virginia Tech Intellectual Properties, Inc. Methods and systems for generating declarative statements given documents with questions and answers

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117194632A (zh) * 2023-09-11 2023-12-08 平安银行股份有限公司 从文档中抽取结构化知识的方法、装置、设备及介质

Also Published As

Publication number Publication date
AU2022373323A1 (en) 2024-05-02
WO2023069401A1 (en) 2023-04-27
US20240419908A1 (en) 2024-12-19
JP2024539670A (ja) 2024-10-29
MX2024004791A (es) 2024-05-09
EP4420040A1 (en) 2024-08-28

Similar Documents

Publication Publication Date Title
US20240419908A1 (en) Application of natural language processing to facilitate responses to regulatory questions
AU2021201071B2 (en) Method and system for automated text anonymisation
JP2025023185A (ja) クロスドキュメントインテリジェントオーサリングおよび処理アシスタント
CA2853627C (en) Automatic creation of clinical study reports
US8676800B2 (en) Method and system for generating text
Pirnau et al. Content analysis using specific natural language processing methods for big data
Ashfaq et al. Natural language ambiguity resolution by intelligent semantic annotation of software requirements
Akundi et al. Text-to-model transformation: natural language-based model generation framework
Houssein et al. Semantic protocol and resource description framework query language: a comprehensive review
Sharma et al. The semantics of covid-19 web data: ontology learning and population
Kríž et al. Data extraction using NLP techniques and its transformation to linked data
Regino et al. From natural language texts to rdf triples: A novel approach to generating e-commerce knowledge graphs
GB2616369A (en) Sentiment detection using medical clues
Kettler et al. A template-based markup tool for semantic web content
CN120072356A (zh) 自动问答方法及药物推荐方法
Bulloch et al. Using computer packages in qualitative research: Exemplars, developments and challenges
Geierhos et al. Chapter III Guesswork? Resolving Vagueness in User-Generated Software Requirements
Lecardonnel et al. GenQA: A Method for Generating and Validating Question/Answer Pairs from Journalistic Data Material
Marc Assessing Metadata Quality and Terminology Coverage of a Federally Sponsored Health Data Repository
Park et al. CDISC Transformer: a metadata-based transformation tool for clinical trial and research data into CDISC standards
Bilal et al. An NLP approach for generating high-level requirements for e-health systems
Iqbal et al. LLM-Driven Summarization and Distinguish Analysis of Multiple Entities in RDF Graphs
Gonçalves et al. Structured data acquisition with ontology-based web forms.
Cherednichenko et al. USE OF ARTIFICIAL INTELLIGENCE FOR BUSINESS DECISION-MAKING.
El-Kass Integrating semantic web and unstructured information processing environments: a visual rule-based approach

Legal Events

Date Code Title Description
MFA Maintenance fee for application paid

Free format text: FEE DESCRIPTION TEXT: MF (APPLICATION, 2ND ANNIV.) - STANDARD

Year of fee payment: 2

U00 Fee paid

Free format text: ST27 STATUS EVENT CODE: A-1-1-U10-U00-U101 (AS PROVIDED BY THE NATIONAL OFFICE); EVENT TEXT: MAINTENANCE REQUEST RECEIVED

Effective date: 20240930

U11 Full renewal or maintenance fee paid

Free format text: ST27 STATUS EVENT CODE: A-1-1-U10-U11-U102 (AS PROVIDED BY THE NATIONAL OFFICE); EVENT TEXT: MAINTENANCE FEE PAYMENT PAID IN FULL

Effective date: 20240930

MFA Maintenance fee for application paid

Free format text: FEE DESCRIPTION TEXT: MF (APPLICATION, 3RD ANNIV.) - STANDARD

Year of fee payment: 3

U00 Fee paid

Free format text: ST27 STATUS EVENT CODE: A-1-1-U10-U00-U101 (AS PROVIDED BY THE NATIONAL OFFICE); EVENT TEXT: MAINTENANCE REQUEST RECEIVED

Effective date: 20250925

U11 Full renewal or maintenance fee paid

Free format text: ST27 STATUS EVENT CODE: A-1-1-U10-U11-U102 (AS PROVIDED BY THE NATIONAL OFFICE); EVENT TEXT: MAINTENANCE FEE PAYMENT PAID IN FULL

Effective date: 20250925