Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
41 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
41 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Recognizing and Splitting Conditional Sentences for Automation of Business Processes Management (2104.00660v1)

Published 1 Apr 2021 in cs.CL

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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Ngoc Phuoc An Vo (4 papers)
  2. Irene Manotas (4 papers)
  3. Octavian Popescu (2 papers)
  4. Algimantas Cerniauskas (1 paper)
  5. Vadim Sheinin (7 papers)
Citations (3)