Recognizing and Splitting Conditional Sentences for Automation of Business Processes Management

• URL: http://arxiv.org/abs/2104.00660v1
• Date: Thu, 1 Apr 2021 17:53:16 GMT
• Title: Recognizing and Splitting Conditional Sentences for Automation of Business Processes Management
• Authors: Ngoc Phuoc An Vo, Irene Manotas, Octavian Popescu, Algimantas Cerniauskas, Vadim Sheinin
• Abstract summary: We present our system that resolves an end-to-end problem consisting of 1) recognizing conditional sentences from technical documents, 2) finding boundaries to extract conditional and resultant clauses, and 3) categorizing resultant clause as Action or Consequence. Our best model achieved very promising results of 83.82, 87.84, and 85.75 for extracting Condition, Action, and Consequence clauses.
• Score: 2.289790204910258
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Business Process Management (BPM) is the discipline which is responsible for management of discovering, analyzing, redesigning, monitoring, and controlling business processes. One of the most crucial tasks of BPM is discovering and modelling business processes from text documents. In this paper, we present our system that resolves an end-to-end problem consisting of 1) recognizing conditional sentences from technical documents, 2) finding boundaries to extract conditional and resultant clauses from each conditional sentence, and 3) categorizing resultant clause as Action or Consequence which later helps to generate new steps in our business process model automatically. We created a new dataset and three models solve this problem. Our best model achieved very promising results of 83.82, 87.84, and 85.75 for Precision, Recall, and F1, respectively, for extracting Condition, Action, and Consequence clauses using Exact Match metric.

Related papers

• The WHY in Business Processes: Unification of Causal Process Models [2.0811729303868005]
  Causal reasoning is essential for business process interventions and improvement.<n>We propose a novel method to unify multiple causal process variants into a consistent model.
  arXiv  Detail & Related papers  (2025-05-28T21:12:30Z)
• Business as Rulesual: A Benchmark and Framework for Business Rule Flow Modeling with LLMs [11.320505704072186]
  We introduce a novel annotated Chinese dataset, BPRF, which contains 50 business process documents with 326 explicitly labeled business rules across multiple domains.<n>We propose ExIde, a framework for automatic business rule extraction and dependency relationship identification using large language models (LLMs)<n>Our results demonstrate the effectiveness of ExIde in extracting structured business rules and analyzing their interdependencies for current SOTA LLMs.
  arXiv  Detail & Related papers  (2025-05-24T06:13:35Z)
• Self-Steering Language Models [113.96916935955842]
  DisCIPL is a method for "self-steering" language models. DisCIPL uses a Planner model to generate a task-specific inference program. Our work opens up a design space of highly-parallelized Monte Carlo inference strategies.
  arXiv  Detail & Related papers  (2025-04-09T17:54:22Z)
• SOPBench: Evaluating Language Agents at Following Standard Operating Procedures and Constraints [59.645885492637845]
  SOPBench is an evaluation pipeline that transforms each service-specific SOP code program into a directed graph of executable functions.<n>Our approach transforms each service-specific SOP code program into a directed graph of executable functions and requires agents to call these functions based on natural language SOP descriptions.<n>We evaluate 18 leading models, and results show the task is challenging even for top-tier models.
  arXiv  Detail & Related papers  (2025-03-11T17:53:02Z)
• Federated Conformance Checking [0.1433758865948252]
  Conformance checking is a crucial aspect of process mining, where the main objective is to compare the execution of a process. We propose a privacy-aware federated conformance-checking approach that allows for evaluating the correctness of overall cross-organizational process models.
  arXiv  Detail & Related papers  (2025-01-23T11:30:13Z)
• Discovery and Simulation of Data-Aware Business Processes [0.28675177318965045]
  This paper introduces a data-aware BPS modeling approach and a method to discover data-aware BPS models from event logs. The resulting BPS models more closely replicate the process execution control flow relative to data-unaware BPS models.
  arXiv  Detail & Related papers  (2024-08-24T20:13:00Z)
• The Foundations of Computational Management: A Systematic Approach to Task Automation for the Integration of Artificial Intelligence into Existing Workflows [55.2480439325792]
  This article introduces Computational Management, a systematic approach to task automation. The article offers three easy step-by-step procedures to begin the process of implementing AI within a workflow.
  arXiv  Detail & Related papers  (2024-02-07T01:45:14Z)
• The WHY in Business Processes: Discovery of Causal Execution Dependencies [2.0811729303868005]
  Unraveling causal relationships among the execution of process activities is a crucial element in predicting the consequences of process interventions. This work offers a systematic approach to the unveiling of the causal business process by leveraging an existing causal discovery algorithm over activity timing. Our methodology searches for such discrepancies between the two models in the context of three causal patterns, and derives a new view in which these inconsistencies are annotated over the mined process model.
  arXiv  Detail & Related papers  (2023-10-23T14:23:15Z)
• Large Language Models can accomplish Business Process Management Tasks [0.0]
  We show how Large Language Models (LLMs) can accomplish text-related Business Process Management tasks. LLMs can accomplish process models from textual descriptions, mining declarative process models from textual descriptions, and assessing the suitability of process tasks from textual descriptions for robotic process automation.
  arXiv  Detail & Related papers  (2023-07-19T11:54:46Z)
• Relational Action Bases: Formalization, Effective Safety Verification, and Invariants (Extended Version) [67.99023219822564]
  We introduce the general framework of relational action bases (RABs) RABs generalize existing models by lifting both restrictions. We demonstrate the effectiveness of this approach on a benchmark of data-aware business processes.
  arXiv  Detail & Related papers  (2022-08-12T17:03:50Z)
• ASP-Based Declarative Process Mining [4.060731229044571]
  We put forward Answer Set Programming (ASP) as a solution approach for three classical problems in Declarative Process Mining. We tackle them in their data-aware variant, i.e., by considering events that carry a payload (set of attribute-value pairs) The contributions of the work include an ASP encoding schema for the three problems, their solution, and experiments showing the feasibility of the approach.
  arXiv  Detail & Related papers  (2022-05-04T10:11:54Z)
• CINS: Comprehensive Instruction for Few-shot Learning in Task-oriented Dialog Systems [56.302581679816775]
  This paper proposes Comprehensive Instruction (CINS) that exploits PLMs with task-specific instructions. We design a schema (definition, constraint, prompt) of instructions and their customized realizations for three important downstream tasks in ToD. Experiments are conducted on these ToD tasks in realistic few-shot learning scenarios with small validation data.
  arXiv  Detail & Related papers  (2021-09-10T03:23:06Z)
• Efficient Retrieval Augmented Generation from Unstructured Knowledge for Task-Oriented Dialog [46.93744191416991]
  This paper summarizes our work on the first track of the ninth Dialog System Technology Challenge (DSTC 9) The goal of the task is to generate responses to user turns in a task-oriented dialog that require knowledge from unstructured documents.
  arXiv  Detail & Related papers  (2021-02-09T04:50:35Z)
• When Can Models Learn From Explanations? A Formal Framework for Understanding the Roles of Explanation Data [84.87772675171412]
  We study the circumstances under which explanations of individual data points can improve modeling performance. We make use of three existing datasets with explanations: e-SNLI, TACRED, SemEval.
  arXiv  Detail & Related papers  (2021-02-03T18:57:08Z)
• Partial Order Resolution of Event Logs for Process Conformance Checking [10.58705988536919]
  A key assumption of existing conformance checking techniques is that all events are associated with timestamps that allow to infer a total order of events per process instance. We present several estimators for this task, incorporating different notions of behavioral abstraction. Our experiments with real-world and synthetic data reveal that our approach improves accuracy over the state-of-the-art considerably.
  arXiv  Detail & Related papers  (2020-07-05T18:43:57Z)
• A Simple Language Model for Task-Oriented Dialogue [61.84084939472287]
  SimpleTOD is a simple approach to task-oriented dialogue that uses a single, causal language model trained on all sub-tasks recast as a single sequence prediction problem. This allows SimpleTOD to fully leverage transfer learning from pre-trained, open domain, causal language models such as GPT-2.
  arXiv  Detail & Related papers  (2020-05-02T11:09:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.