Searching textual and model-based process descriptions based on a unified data format
- 1.1k Downloads
Documenting business processes using process models is common practice in many organizations. However, not all process information is best captured in process models. Hence, many organizations complement these models with textual descriptions that specify additional details. The problem with this supplementary use of textual descriptions is that existing techniques for automatically searching process repositories are limited to process models. They are not capable of taking the information from textual descriptions into account and, therefore, provide incomplete search results. In this paper, we address this problem and propose a technique that is capable of searching textual as well as model-based process descriptions. It automatically extracts activity-related and behavioral information from both descriptions types and stores it in a unified data format. An evaluation with a large Austrian bank demonstrates that the additional consideration of textual descriptions allows us to identify more relevant processes from a repository.
KeywordsIntegrated Process Search Unified Data Format Textual Process Descriptions
The problem of this supplementary use of textual descriptions in process repositories is that automatic analysis techniques designed for process models, such as weakness identification , service identification , or compliance queries , might provide incomplete results. Suppose a company aims to increase the share of digital communication; then, it can query its process repository to find all processes that still include paper-based communication. The query results, however, will be limited to the process models that indicate the use of paper-based communication already in their activity text labels. Process models that describe the process at a higher level of abstraction, but link to textual descriptions revealing that this process is indeed associated with paper-based communication, will be ignored. To the best of our knowledge, there is currently no technique available that provides the possibility to search textual and model-based process descriptions in an integrated fashion. One explanation for the absence of such a technique might be the challenges that are associated with it. Among others, it requires the definition of an integrated data format that is able to represent both textual and model-based process descriptions.
Against this background, we use this paper to follow up on our earlier work  and to propose a technique that can search both text and model-based process descriptions. It combines natural language analysis techniques in a novel way and transforms textual as well as model-based process descriptions into a unified data format. By integrating technology from the semantic web domain, we facilitate the possibility of performing comprehensive search operations on this data format. To define this technique, we follow the Design Science Research Methodology [23, 46] as specified by . It consists of six core activities: (1) problem identification and motivation, (2) definition of the objectives of the design artifact, (3) design and development of the design artifact, (4) demonstration of the problem-solving efficacy of the design artifact, (5) measurement of how well the design artifact supports the solution to the problem, and (6) communication of the design artifact to researchers and other relevant audiences.
By implementing these steps, the paper is organized as follows. Section 2 introduces the problem of searching textual and model-based process descriptions and discusses related work. Section 3 then introduces our proposed technique on a conceptual level. Section 4 presents the results of an evaluation with a large Austrian bank. Section 5 concludes the paper and provides an outlook on future research.
This section introduces the background of our research. First, we illustrate the problem of searching textual and model-based process descriptions. Then, we reflect on related techniques that are currently available.
2.1 Motivating example
In order to illustrate the importance of textual descriptions in the context of a process search, let us take a look at the implications of only taking process models into account. To this end, consider the example shown in Fig. 1. It shows a simple process model created using the Business Process Modeling and Notation (BPMN) and a small complementary text from a bank. The process model is part of a process model repository; the complementary text is stored on a separate file server. We can see that the business process is triggered by the request to open a new bank account. Subsequently, the credit history of the customer is evaluated. The outcome of this evaluation can be either positive or negative. In case of a negative credit evaluation, the customer is rejected. If the credit history evaluated as positive, a new bank account is opened. Finally, the request is closed. In addition to the BPMN process model, there is complementary text. It further specifies the details of the activity “Opening of new bank account for customer”. Among others, it describes that the opening of a bank account is associated with a mail-based information exchange with the customer.
Assume this process model is part of the process repository of an organization. If this organization was interested in all business processes that involve an interaction with a customer, automated search techniques would have no difficulties to identify the depicted process. That is the case because the customer is explicitly mentioned in the activity labels, e.g., in “Customer credit history evaluation”. However, suppose the organization aims at improving its operations by replacing all mail-based correspondence with an electronic alternative. In this case, an automated search on the process model would not identify any potential for improvement. That is because the activities of the process model do not contain any words that might be associated with the activities of mailing or sending. Only the description attached to the activity “Opening of new bank account” explicitly refers to sending a form per mail.
This example illustrates the advantage of performing search operations that cover textual as well model-based process descriptions. As a respective technique is currently missing, it is our goal to define such a technique in this paper.
2.2 Related work
The work from this paper relates to three major streams of research: techniques for process model search, techniques for semantic process model analysis, and techniques for the analysis of process behavior in textual resources.
Techniques for process model search can be divided into two main groups. The first group consists of techniques focusing on structure. They compare query and process model with respect to behavioral properties, for instance, whether two activities occur in a particular order. Among others, such structural querying techniques have been defined based on temporal logical , the weak ordering formalism , and indexing [25, 54]. The limitation of these structural techniques is that they typically assume that semantically identical activities have identical or similar labels. The second group of search techniques focuses on the content from text labels and tries to overcome this problem. Among others, they employ NLP techniques to identify similar models based on their activity labels. Notable examples for such techniques have been defined by Awad et al.  and Qiao et al. , where the authors use dictionaries and language modeling to retrieve semantically similar models.
Techniques that analyze process behavior in textual resources aim to recognize and extract behavioral relations between activities by employing natural language analysis tools. Most existing techniques perform this task for the purpose of generating a model-based description from the analyzed text. There are techniques that generate BPMN process models from textual process descriptions , group stories , use cases , and heterogeneous textual sources . The main challenge that these techniques must overcome is the ambiguity of natural language. Words and sentences can have various meanings and, therefore, may allow for several interpretations of the process behavior. A recent technique by Van der Aa et al.  tries to address this ambiguity in a comprehensive way by deriving a so-called behavioral space from a text. This behavioral space captures all possible process interpretations of a text in a structured manner.
Despite the considerable number of techniques for process model search and analysis, a conceptual solution for an integrated search technique is still missing. To develop such a technique, we need to define a data format that allows us to store the information extracted from both process description types in a unified way. Based on such a format, we can then perform search operations covering model-based as well as textual process descriptions.
3 Conceptual approach
In this section, we introduce our approach for comprehensive process search by integrating textual and model-based process descriptions. Section 3.1 gives an overview of the architecture of our approach. Section 3.2 describes the unified format we use to integrate textual and model-based content. Sections 3.3 and 3.4 show how we parse and transform textual and model-based descriptions into the unified format. Finally, Sect. 3.5 illustrates how we use the unified data format for integrated process search.
To enable comprehensive process search, activity-related and behavioral information from both textual and model-based process descriptions must be stored in a unified way. Hence, two parsing components first extract the relevant information from the two input sources and then store it in the unified data store. Once the data store has been populated with all available process descriptions, it can be used for process search. To this end, a user interface provides the possibility to specify queries in a user-friendly manner. Figure 2 illustrates our architecture graphically.
In the subsequent sections, we describe this architecture in detail. Because of the predominant role of the unified data store, we begin with the specification of the unified format.
3.2 A unified format for integrating textual and model-based process descriptions
Activity records Figure 3 shows that activity records may consist of one or more verbs. Each verb relates to three optional entities: a subject, an object, and an adverbial. Together with verbs, these entities describe the four semantic components of an activity record. We define activity records in this decomposed manner because this format is compatible with activities that are described in process models as well as in textual process descriptions. Even though textual and model-based process descriptions vary considerably in the way they convey such semantics, the activities that they describe consist of the same semantic components.
Process models such as BPMN models consist of graphical representations of modeling constructs such as activities, events, and gateways . Because activities are modeled using separate construct, individual activity records can be straightforwardly identified from a model. However, as pointed out by , the essential semantics of process activities are defined by their natural language labels. What is important is that these labels do not necessarily represent proper sentences . As examples, consider the activity labels “Opening of bank account for customer” or “Customer credit history evaluation” from the BPMN model in Fig. 1. A study conducted by  revealed that, even though activity labels often do not represent grammatically correct sentences, they refer to three semantic components: an action, a business object on which the action is performed, and an optional additional information fragment that provides further details. As an example, consider the activity label “Opening of new bank account for customer.” Although this label does not contain a verb, the noun “opening” implies the execution of the action “to open.” Hence, “opening” would be classified as an action. Respectively, “new bank account” represents the business object, and “for customer” the additional information fragment. In the unified data format, we capture actions using a verb, the business object as the associated object, and the adverbial captures additional information fragments. Lastly, we store the actor, i.e., the resource, that performs the activity using the subject relation. In most process model notations, the actor is specified outside of the activity label. For example, in BPMN, pool and lane constructs are used to specify which actors perform which activities.
Unlike process models, textual process descriptions do not have an explicit notion of activities. Rather, activity records must be identified as part of the natural language sentences in a textual description. The descriptions of activity records occur as part of these paragraphs. For instance, the sentence “Hence, the clerk collects the required documents and send the form to the customer per mail” describes two actions performed by a clerk: collecting documents and sending a form. Nevertheless, in such sentences we can again identify the different components of an activity record. Consider the sentence “The clerk opens a new bank account for the customer.” A grammatical analysis would reveal that this sentence contains the predicate “opens”, the object “bank account,” the subject “clerk,” and the adverbial “for the customer.” This example illustrates that the predicate corresponds to the action, the object to the business object, and the adverbial to the additional information fragment. Finally, a subject refers to the role executing the activity.
Activity interrelations The order in which process activities are executed represents a major element of a process-oriented perspective. To allow for comprehensive process search, it is important that the ordering relations between activities can be taken into account. As an example, consider a situation in which we want to retrieve all processes where a document must be manually signed before a purchase order can be send. In this case, it does not suffice to retrieve the processes in which “sign document” and “send purchase order” co-occur. It is also important that the former activity happens before the latter.
As depicted in Fig. 3, we capture two different activity interrelations: followed by and directly followed by. The former corresponds to the weak order relation \(\succ \) . Given two activity records x and y, a weak order relation \(x \succ y\) indicates that during the execution of a process instance, xcan occur before y. The directly followed by relations correspond to the so-called alpha relations > . For this relation type, \(x > y\) denotes that an activity record x can occur directly before y. These two relation types can be used for different querying purposes. Furthermore, by storing these basic relations, it is also possible to store and query more complex interrelations.
To illustrate this, we consider the different behavioral relations that can be derived from the weak order relation: strict order, interleaving order, and exclusiveness. These relations are also referred to as behavioral profile relations . The strict order relation \(x \rightsquigarrow y\) is used to express that activity x cannot be executed after the execution of activity y. The interleaving order relation \(x\ ||\ y\) states that x and y can be executed in an arbitrary order. Finally, the exclusiveness relation \(x + y\) denotes that either activity x or activity y can be executed in a single process instance. These three relations can be derived by determining the existence of \(x \succ y\) and \(y \succ x\) for two given activity records. For example, the strict order \(x \rightsquigarrow y\) follows from \(x \succ y\) and \(y \nsucc x\). An interleaving order \(x ||\ y\) follows from \(x \succ y\) and \(y \succ x\), whereas exclusiveness results from \(x \nsucc y\) and \(y \nsucc x\) . In a similar manner, it is possible to derive specific relations from the directly follows relation >.
Implementation Practically, we implement this unified data format by building on the Resource Description Framework (RDF), an XML-based specification developed by the World Wide Web Consortium (W3C)1. RDF describes data in the form of triples that consist of two entities and a relation between them. As an example, consider the relation relates to between an object and a verb in our unified data format. A possible RDF triple for this relation would be “customer,” “relates to,” “reject”2. Similarly, all other relations from the unified data format can be represented as RDF triples. The advantage of storing data in the RDF format is that it can be easily and effectively accessed and queried . Hence, it greatly contributes to our goal of providing a technique for integrated search.
In the subsequent sections, we describe how textual process descriptions as well as process models can be automatically transformed into this unified data format.
3.3 Parsing textual process descriptions
Extraction of sentences from textual descriptions: Natural language descriptions are typically stored as PDF or Word files. The automated processing of these file formats is supported by several freely available tools such as Apache PDFBox3 or Apache POI4 and, hence, does not represent an obstacle. The challenge for extracting sentences from these documents is rather caused by recognizing where an individual sentence starts and where it ends, since a period is not only used at the end of a sentence but also in the context of abbreviations (e.g., “M.Sc.”) . We use the Stanford Parser , a highly accurate tool for natural language analysis, to automatically transform a text into a list of individual sentences.
- 2.Linguistic analysis of sentences: In the context of the linguistic analysis, we identify the grammatical entities such as subject, object, predicate, and adverbial for each sentence . We also determine the relations between these entities, e.g., which verb relates to which object . To illustrate the required steps and the associated challenges, consider the sentence “Hence, the clerk collects the required documents and sends the form to the customer per mail” from Fig. 1. It contains one subject (“clerk”), two predicates (“collects” and “sends”), two objects (“documents” and “form”), and two adverbials (“to the customer” and “per mail”). Furthermore, it is important to note the relations between these entities. The predicate “collects” relates to the object “documents,” and the predicate “sends” relates to the object “form.” To automatically determine these grammatical entities and their relations, we again make use of the Stanford Parser. Besides the recognition of sentence borders and the identification of parts of speech, the Stanford Parser is also capable of producing word dependencies . As an example, consider the following two object-related dependencies that the Stanford Parser generates for the considered example sentence:
Normalization of sentence components: The words in sentences often do not occur in their base forms, i.e., verbs are not only used as infinitives and nouns are not always provided as singular nouns . This becomes a problem when entities are compared in the context of a search operation . For instance, “send,” “sends,” and “sent” all refer to the same verb. However, an automated string comparison would indicate that these words differ from each other. To deal with such cases, we use the lexical database WordNet  to convert all words into their base form, i.e., predicates into infinitive verbs and subject as well as objects into singular nouns. As a result, the predicate “sends” is transformed into “send.”
- 4.Transformation of sentence components into RDF: Once the entities have successfully been extracted and transformed into their base forms, the information is stored as RDF . To demonstrate this step, again consider the sentence “Hence, the clerk collects the required documents and sends the form to the customer per mail” from Fig. 1. For each predicate of the sentence, we create a verb - activity record RDF triple in order to capture the relation between the predicates and the sentence. The sentence is then represented by an activity record. Suppose this activity record has the identification number 2, then the respective RDF triples look as follows:
(“collect”, “part of”, “ActivityRecord2”)
(“send”, “part of”, “ActivityRecord2”)
(“clerk”, “relates to”, “collect”)
(“clerk”, “relates to”, “send”)
(“document”, “relates”, “collect”)
(“form”, “relates”, “send”)
(“to customer”, “relates to”, “send”)
(“per mail”, “relates to”, “send”)
Pair-wise relation identification: The extraction of activity interrelations from textual descriptions requires tailored natural language processing techniques . For this purpose, we can build on existing text-to-process model generation approaches, such as [16, 18, 47]. These approaches employ heuristic-based techniques that recognize typical patterns used to express activity interrelations. Such patterns can be used to identify sequences, choices, and parallel executions. For instance, using such patterns it is possible to identify that the sentence “Once the response from the customer is received, the clerk enters the data from the form into the system” describes two subsequent process steps, i.e., “receive response” followed by “enter data.” For brevity, we here omit further technical details of the relation extraction approach. The interested reader may consult the work by Friedrich et al.  for a detailed description of a state-of-the-art parsing technique.
Propagation of relations: The previous step yields interrelation between pairs of activity records that are described consecutively in the text. However, to allow users to also search for indirect relations, we have to propagate the followed by relations extracted in the previous step. For example, if we extract that \(x \rightsquigarrow y \) and \(y \rightsquigarrow z\), then we can combine these interrelations into \(x \rightsquigarrow z\). We can perform this propagation due to the transitive properties of the strict order and interleaving order relations. After propagation, we have obtained a complete view on the interrelations specified in a textual description.
- 3.Transformation of behavioral relations into RDF: Once the activity interrelations have been extracted, they can be stored in RDF. As described in Sect. 3.2, we store behavioral relations using two basic followed by and directly followed by relations. Therefore, we transform the derivable relations, such as the strict order relation, using this basic format. Given a relation ActivityRecord1\(||\ \)ActivityRecord2, we need to store two relations in RDF:
(“ActivityRecord1”, “followed by”, “ActivityRecord2”)
(“ActivityRecord2”, “followed by”, “ActivityRecord1”)
3.4 Parsing model-based process descriptions
Extraction of activity labels from process models: As opposed to textual process descriptions, which are typically available as PDF or Word files, process models in industry are created using several notations and different modeling tools . As a result, process models are available in various file formats such as JSON, AML, EMPL. To deal with this variety, we build on the import functionality of the process platform proposed by . This platform can import a wide range of different process model formats and store them in a suitable way. Once the process models were imported, the activity labels are extracted as a simple string with a single line of Java code.
Linguistic analysis of activity labels: Taking the extracted activity label strings as input, the linguistic analysis of activity labels aims at properly deriving the activity components such as action, business object, and additional information fragment . As discussed in Sect. 3.2, the challenge is to automatically detect the varying grammatical structures, even if the activity label does not contain a proper verb. As an example, consider the activity “Customer credit history evaluation” from 1. For this label, it is necessary to automatically recognize that “evaluation” represents the action and “customer credit history” the business object. Even more challenging are ambiguous cases, in which more than a single interpretation of the label exists. As an ambiguous example, consider the activity label “Plan Data Transfer.” This activity could instruct to “plan” a “data transfer” as well as to “transfer” a set of “plan data.” To resolve such ambiguous cases and to properly derive the components from activity labels, we employ the label analysis technique introduced by . This technique uses knowledge about possible linguistic structures and an analysis of the model context to decompose any activity label into its components. It takes an activity label as input and, respectively, returns the comprised action(s), business object(s), and additional information fragment(s).
Normalization of activity label components: Similar to proper natural language sentences, activities often contain inflected words, i.e., verbs occurring in the third person form or nouns used in the plural form. What is more, actions may even represent nouns (e.g., “evaluation” in “Customer credit history evaluation”). As pointed out for sentences, this has notable implications if two components are compared in the context of a search operation. Hence, we apply the lexical database WordNet  also in activity labels to convert all actions into infinitive verbs and all nouns into singular nouns. As a result, the action of the activity label “Customer credit history evaluation” is transformed into “evaluate.”
- 4.Transformation of activity label components into RDF: The storage of the extracted and normalized components as RDF works analogously to the storage of the sentence entities. We demonstrate this step using the activity “Opening of new bank account for customer.” As a result of applying the previous steps, we identified the action “open,” the object “bank account,” and the addition “for customer.” Suppose the resulting activity record has the identification number 3, then the RDF triples look as follows:
(“open”, “part of”, “ActivityRecord3”)
(“bank account”, “relates to”, “open”)
(“for customer”, “relates to”, “open”)
Pair-wise relation identification: To extract behavioral relations from process models, we employ existing techniques. The directly follows relation > can be directly extracted from the process model. This relation includes any activity pair that is directly connected, possibly through a gateway, with each other. In order to extract the weak order relation \(\succ \), we use the method described in .
- 2.Transformation of behavioral relations into RDF: Once the directly follows and weak order relations have been extracted from the process, we can directly enter them into the database. The resulting relations have the same format as the relations that are extracted from textual process descriptions. For example, the following example shows the insertion of two activity records, which defines that ActivityRecord1 can be directly followed by ActivityRecord2. Because we do not insert the inverse relation, it becomes evident that these two activity records cannot directly follow each other in reverse order.
(“ActivityRecord1”, “directly followed by”, “ActivityRecord2”)
(“ActivityRecord1”, “followed by”, “ActivityRecord2”)
3.5 Querying the unified data store
The example from Listing 1 shows that a SPARQL query has the basic structure of an SQL query, i.e., it follows the select-from-where pattern. Before the actual query, however, it is required to define where the data model definition can be found (line 1). As SPARQL was designed for the semantic web, this is done via a Unified Resource Identifier (URI). In this example, we use the URI http://www.processsearch.com/Property/ for illustration purposes. After the definition of this prefix, the actual query starts. Line 2 specifies that we are interested in all process names of process models that fulfill the requirements stated as RDF triples in the block below. Using the variable ?verb, we define that there must be a Verb according to our data model that carries the label “send” (lines 5 and 6). Moreover, we use the variable ?object to define that ?verb must be related to an Object that carries the label “form” (lines 8-10). Finally, we define that we are only interested in process models that contain an activity record that relates to an entity Verb as specified in ?verb.
This exemplary query illustrates that an RDF-based unified data store can be easily queried for information we are interested in. To provide the users of our technique with an intuitive possibility to search, we implemented a graphical interface in which users can specify the verbs, objects, subjects, and adverbials of the process descriptions they would like to search for. The input from the graphical user interface is then automatically inserted into a SPARQL query as provided above. As a result, the user can perform any search based on these four entities and does not have to deal with any technical details.
In this section, we demonstrate the applicability of our integrated search technique. To this end, we implemented it as a Java prototype and applied it to the process repository of a large Austrian bank. Our goal is to demonstrate the added value that is associated with searching textual descriptions on top of process models. Section 4.1 discusses the setup of our evaluation experiment. Section 4.2 introduces the data, i.e., the process model collection we use. Section 4.3 explains the prototypical implementation of our technique. Section 4.4 presents the results. Section 4.5 assesses the quality of the results. Section 4.6 discusses implications and limitations of our technique.
Search for media disruptions: Media disruptions occur when the information-carrying medium is changed, for example, when a clerk enters the data from a letter into an information system. Media disruptions should be avoided when possible because they are a major source of errors. These errors, among others, follow from proneness to (manual) conversion mistakes. Hence, our evaluation partner had a considerable interest in identifying media disruptions in their process landscape. To design a suitable query, we built on the insights from . In a study on weakness patterns, they found that media disruptions are indicated by the actions “print” and “scan” as well as the activity “Enter data.”
Search for manual activities: Manual activities are inevitable in most business processes. However, as automation is often associated with saving costs, the identification of automation candidates represents a key task in business process improvement . Thus, our evaluation partner was also interested in identifying which automation potential their process repository exhibits. In their study,  also identified patterns for manual activities. They found that manual activities are indicated by the actions “document,” “record,” and “calculate” as well by combinations of the actions “verify” and “archive” with the business objects “document” and “information.”
Check of customer signature: To prevent fraud, it is of paramount importance to verify the signature of the customer. While this essentially represents a standard procedure in the daily business of a bank, it is also important that this procedure is consistently reflected in the process documentation. To check for instances where the customer signature is checked (or not checked), we make use of the behavioral relations. We search for a sequence of activity records where the first activity record refers to the subject “customer” and the verb “sign,” and the second activity record refers to the verb “check” and the object “signature.” By comparing the results of this search against the results of simple search for a combination of the subject “customer” and the verb “sign,” we can conclude about the number of cases that do not highlight need for checking the customer signature.
Characteristics of process repository
No. of process models: 1667
No. of activities (minimum)
No. of activities (maximum)
No. of activities (median)
No. of activities (average)
No. of activities (standard deviation)
No. of textual process descriptions: 119
No. of words (minimum)
No. of words (maximum)
No. of words (median)
No. of words (average)
No. of words (standard deviation)
We implemented the approach defined in Sect. 3 as a Java prototype. To be able to deal with German process models and process descriptions, we integrated the German package of the Stanford Parser , the German component of the label analysis technique from , and a German implementation of WordNet called GermaNet . In addition to these techniques, we use the Apache PDFBox to process PDF files and the import functionality from  to process different process model formats. Finally, to store the extracted RDF triples, we use the Apache Jena component TDB5, which is a database optimized for RDF storage and querying. For running the experiments, we deployed the techniques on a MacBook Air with a 1.4 GHz Intel Core i5 processor and 8GB RAM, running on Mac OS 10.10.2 and Java Virtual Machine 1.8.
Precision of results for the three search scenarios
PM & TD
V=“enter” & O=“data”
V=“verify” / “archive” & O=“document”
V=“verify” / “archive” & O=“information”
S=“customer” & V=“sign”
S=“customer” V=“sign” > V=”check” & O=“signature”
4.5 Assessment of result quality
In the previous section, we showed that the consideration of textual process descriptions results in a higher number of identified processes. While this highlights the advantage of searching textual and model-based process descriptions using our technique, it does not provide a full picture of the quality of our search results. Traditionally, the quality of search techniques in information retrieval is assessed using the metrics precision, recall, and F-measure . In our context, precision is the number of relevant and retrieved processes divided by the total number of retrieved processes. Recall is the number of relevant and retrieved processes divided by the total number of relevant processes. The F-measure is the harmonic mean between the two.
A central challenge when using precision and recall is how to define the notion of relevance. It is important to recognize that relevance should be assessed relative to an information need, not to a query . This means that, for instance, we should not assess whether a query for the verb “scan” indeed returns processes that contain “scan,” but rather whether the process indeed contains a media disruption where scanning is used to transform a physical into a digital document. In terms of the precision of our approach, issues in this respect can occur in the form of false positives caused by, among others, polysemous words, i.e., words with several meanings. The verb “scan,” for instance, can refer to the activity of systematically examining something (i.e., reading a document) or the activity of producing a digital copy of a document. Results related to the former meaning are not relevant to our query, whereas results related to the latter meaning are. Table 2 shows the precision for the three search scenarios.
The precision values from Table 2 show that the precision is generally very high. However, we encountered false positive cases for the query terms “print,” “scan,” “document,” “record,” and “sign.” Most of them related to instances of polysemy. As an example, consider the activity “Scan the database for relevant customers,” which clearly does not relate to a meaning of “scan” that can be associated with a media disruption. More detailed textual process description also contains instances of the query terms that do not relate to an actual activity. As an example, consider the sentence “When a message box stating ‘Printing not possible’ appears, ignore it and simply continue.” For such cases, our technique would mark the process as relevant although it does not actually contain an activity related to “printing.”
Analyzing the precision results in more detail provides three specific insights. First, precision is mainly affected by queries of potentially polysemous verbs (note, for instance, that “calculate” can hardly have a wrong meaning when queried). Second, precision slightly decreases when including the textual process descriptions in the search. This can be explained by the increasing level of detail and the likelihood of encountering a query term that does not relate to an actual activity. Third, queries combining verbs and objects often have a perfect precision. This is caused by the disambiguating function of the object. It is simply less likely that the same verb has two completely different meanings for the same object (e.g., a “document”). This means that false positives can be effectively reduced by formulating more specific queries, such as queries that include objects.
Given the size of the process repository and the included textual process descriptions, it is infeasible to manually assess the relevance of all processes in the collection to our search scenarios. Therefore, given the lack of an exact number of relevant results, we cannot provide a full quantification of the recall of our approach for the considered search scenario. However, based on the number of returned results and the precision values, we can clearly observe that the recall of the queries that include textual descriptions, i.e., PM & TD, is considerably higher than the queries that exclude these from considerations. For example, for the media disruptions use case, PM & TD returns 151 processes, whereas just PM returns 83 processes. From the assessment of the precision of these results, we learned that these, respectively, include 147 and 81 relevant processes. Therefore, even though we cannot compute the exact recall value, we know that the recall of PM & TD is 1.81 times (i.e., 147 divided by 81) greater than the recall for PM. Similar patterns can be observed for the recall of the other two search scenarios.
All in all, these insights highlight the value of including textual process descriptions in the search.
The evaluation of our technique with three business-relevant search scenarios and a process repository from the large Austrian bank illustrated that the accuracy of our search results is considerably higher when textual process descriptions are taken into account. Hence, this evaluation did not only demonstrate the applicability of our technique but also its practical relevance.
The practical relevance of our technique is further demonstrated by the way it was perceived by our evaluation partner. The business analysts from the bank considered the results obtained by our technique so useful for their analyses that they decided to integrate our technique with their ARIS platform. To achieve this, they set up a script that updates the database associated with our technique on a daily basis. In this way, search operations can be conducted in a considerably more efficient way than before.
Against this background, our work has the following implications. From a research perspective, this work provides the means for storing textual and model-based process information in a unified way. It also provides the techniques to extract the required information from the two process description types. Among others, these contributions can enable existing search and analysis techniques to additionally consider textual process descriptions. From a practice perspective, our techniques enable organizations to conduct more comprehensive search operations. The value of automated search and analysis techniques is increased because integrated techniques enable the identification of relevant processes that are not retrieved by techniques limited to model-based descriptions.
While the results presented in this paper are promising, they also have to be discussed in the light of some limitations. First, we would like to stress that the investigated process repository is not statistically representative. For instance, process repositories from other companies may consist of more or also fewer textual descriptions than the one we investigated. However, what we would like to point out is that the technique presented in this paper does not rely on any specifics we encountered in the repository of our evaluation partner as, for instance, the EPC notation. Instead, we provide a generic technique that enables organizations to search textual and model-based descriptions in an integrated way. While the individual value that is associated with the possibility may differ, we are convinced that it always represents an advantage to be able to take textual process descriptions into account. Second, it should be noted that our technique cannot guarantee that all relevant information is identified. On the one hand, the user has to define proper key words. On the other hand, our technique can only search the information that is documented explicitly in one of the addressed description types and actually available to the search engine. This means that the presented technique can only identify all relevant pieces of information if the respective documents are linked to the database. Collecting and linking relevant documents, therefore, is a necessary preparation step. Third, the current data format uses the adverbial component to capture all information that is provided on top of the verb, subject, and object. There might be use cases where a more fine-granular consideration is conducive. Since this, however, would result in a more complex data structure, we decided to stick to the more manageable solution presented in this paper. Fourth, our technique is currently implemented in German and English only. While the employed natural language processing tools are available for many languages (see, e.g., ), the adaptation is associated with a certain implementation effort. However, in the light of the usefulness of our approach, we are convinced that this effort can be well justified if other languages need to be covered.
In this paper, we introduced a comprehensive search technique that allows the user to find information in textual as well as in model-based process descriptions. The technique builds on the transformation of textual and model-based process descriptions into a unified data format that integrates the activity-related and behavioral information from both sources. We implemented the technique as a Java prototype that stores the extracted data in an RDF database and provides the user with a graphical interface to specify queries. An evaluation with a large Bank from Austria showed that our solution can be successfully applied in industry and that the additional consideration of textual process descriptions indeed increases the number of identified processes.
From a research perspective, the provided technique provides the foundations for integrating textual and model-based information. To the best of our knowledge, we are the first to define in integrated data format that allows to combine the textual information these two artifact types. Hence, our technique can inform existing process search techniques and may help to increase their scope. From a practical perspective, our technique helps organization to perform more comprehensive search operations. As demonstrated in the evaluation, textual sources may contain equally relevant information about processes as process models.
In future work, we plan to extend our approach with respect to the data perspective. This is particularly challenging for textual process descriptions since data-related aspects are often described in a rather implicit manner. Another valuable extension we have in mind is incorporating semantic technology. In this way, users can also find processes and activities that contain words that are synonymous to the search terms. Besides these extensions of our search technique, we plan to investigate whether the unified data format can also help to solve other research problems as, for instance, the checking of consistency between textual and model-based process descriptions.
Note that we use a simplified syntax for RDF triples in order to provide readable and understandable illustrations.
Note that because a single textual description can be referred to by several process models, the identification of one relevant textual document may yield multiple relevant process models. This explains why the increase in the number of retrieved processes might be even higher than the total number of textual process descriptions.
- 1.Awad, A., Decker, G., Weske, M.: Efficient compliance checking using BPMN-Q and temporal logic. In: Dumas, M., Reichert, M., Shan, M.C. (eds.) Business Process Management. BPM 2008. Lecture Notes in Computer Science, vol 5240. Springer, Berlin, Heidelberg (2008)Google Scholar
- 2.Awad, A., Polyvyanyy, A., Weske, M.: Semantic querying of business process models. In: Enterprise Distributed Object Computing Conference, 2008. EDOC’08. 12th International IEEE, pp. 85–94. IEEE (2008)Google Scholar
- 3.Baeza-Yates, R.A., Ribeiro-Neto, B.: Modern Information Retrieval. ACM Press/Addison-Wesley, Boston (1999)Google Scholar
- 4.Baier, T., Mendling, J.: Bridging abstraction layers in process mining by automated matching of events and activities. In: Daniel, F., Wang, J., Weber, B. (eds.) Business Process Management. Lecture Notes in Computer Science, vol 8094. Springer, Berlin, Heidelberg (2013)Google Scholar
- 5.Becker, J., Bergener, P., Räckers, M., Weiß, B., Winkelmann, A.: Pattern-based semi-automatic analysis of weaknesses in semantic business process models in the banking sector. ECIS 2010 Proceedings 156 (2010)Google Scholar
- 6.Becker, J., Delfmann, P., Herwig, S., Lis, L., Stein, A.: Formalizing linguistic conventions for conceptual models. In: Conceptual Modeling—ER 2009, pp. 70–83. LNCS, Springer, Berlin, Heidelberg (2009)Google Scholar
- 7.Breuker, D., Pfeiffer, D., Becker, J.: Reducing the variations in intra- and interorganizational business process modeling - an empirical evaluation. In: Proceedings of the International Tagung Wirtschaftsinformatik (2009)Google Scholar
- 10.World Wide Web Consortium: RDF 1.1 Concepts and Abstract Syntax. https://www.w3.org/TR/rdf11-concepts/
- 12.De Marneffe, M.C., MacCartney, B., Manning, C.D., et al.: Generating typed dependency parses from phrase structure parses. In: Proceedings of LREC. vol. 6, pp. 449–454. Genoa Italy (2006)Google Scholar
- 13.De Marneffe, M.C., Manning, C.D.: The Stanford typed dependencies representation. In: Coling 2008: Proceedings of the workshop on Cross-Framework and Cross-Domain Parser Evaluation. pp. 1–8. Association for Computational Linguistics (2008)Google Scholar
- 15.Eid-Sabbagh, R.H., Kunze, M., Meyer, A., Weske, M.: A platform for research on process model collections. In: Mendling, J., Weidlich, M. (eds.) Business Process Model and Notation. Lecture Notes in Business Information Processing, vol. 125, pp. 8–22. Springer, Berlin, Heidelberg (2012)Google Scholar
- 16.Friedrich, F., Mendling, J., Puhlmann, F.: Process Model Generation from Natural Language Text. In: Proceedings of the 23rd International Conference on Advanced Information Systems Engineering, LNCS, vol. 6741, pp. 482–496. Springer (2011)Google Scholar
- 17.Friedrich, F.: Automated Generation of Business Process Models from Natural Language Input. Master’s thesis, Humboldt Universität zu, Berlin (2010)Google Scholar
- 18.Ghose, A.K., Koliadis, G., Chueng, A.: Process discovery from model and text artefacts. In: Proceedings of the IEEE Congress on Services. pp. 167–174. IEEE Computer Society (2007)Google Scholar
- 19.Gonçalves, J., Santoro, F.M., Baiao, F.A.: Business process mining from group stories. In: Computer Supported Cooperative Work in Design, 2009. CSCWD 2009. 13th International Conference on. pp. 161–166. IEEE (2009)Google Scholar
- 20.Grefenstette, G.: Tokenization. In: van Halteren, H., (eds.) Syntactic Wordclass Tagging. Text, Speech and Language Technology, vol 9. Springer, Dordrecht (1999)Google Scholar
- 21.Gruhn, V., Laue, R.: Detecting common errors in event-driven process chains by label analysis. Enterp. Model. Inf. Syst. Archit. 6(1), 3–15 (2011)Google Scholar
- 22.Hamp, B., Feldweg, H.: Germanet—a lexical-semantic net for German. In: Proceedings of ACL Workshop Automatic Information Extraction and Building of Lexical Semantic Resources for NLP Applications, pp. 9–15 (1997)Google Scholar
- 24.Indulska, M., Green P., Recker, J., Rosemann, M.: Business process modeling: perceived benefits. In: Laender, A.H.F., Castano, S., Dayal, U., Casati, F., de Oliveira, J.P.M. (eds.) Conceptual Modeling - ER 2009. ER 2009. Lecture Notes in Computer Science, vol 5829. Springer, Berlin, Heidelberg (2009)Google Scholar
- 25.Jin, T., Wang, J., Wu, N., La Rosa, M., ter Hofstede, A.H.M.: Efficient and accurate retrieval of business process models through indexing. In: Meersman, R., Dillon, T., Herrero, P. (eds.) On the Move to Meaningful Internet Systems: OTM 2010. OTM 2010. Lecture Notes in Computer Science, vol 6426. Springer, Berlin, Heidelberg (2010)Google Scholar
- 26.Kunze, M., Weidlich, M., Weske, M.: Behavioral similarity - a proper metric. In: Rinderle-Ma, S., Toumani, F., Wolf, K., (eds.) Business Process Management. BPM 2011. Lecture Notes in Computer Science, vol 6896. Springer, Berlin, Heidelberg (2011)Google Scholar
- 27.Koschmider, A., Blanchard, E.: User assistance for business process model decomposition. In: Proceedings of the 1st IEEE International Conference on Research Challenges in Information Science. pp. 445–454 (2007)Google Scholar
- 28.Kunze, M., Weidlich, M., Weske, M.: Behavioral similarity—a proper metric. In: Business Process Management, pp. 166–181. Springer (2011)Google Scholar
- 30.Leopold, H., van der Aa, H., Pittke, F., Raffel, M., Mendling, J., Reijers, H.A.: Integrating textual and model-based process descriptions for comprehensive process search. In: BPMDS 2016, EMMSAD 2016: Enterprise, Business-Process and Information Systems Modeling. pp. 51–65. Springer International Publishing (2016)Google Scholar
- 32.Leopold, H., Mendling, J.: Automatic derivation of service candidates from business process model repositories. In: Abramowicz, W., Kriksciuniene, D., Sakalauskas, V. (eds.) Business Information Systems. BIS 2012. Lecture Notes in Business Information Processing, vol 117. Springer, Berlin, Heidelberg (2012)Google Scholar
- 35.Loberger, G.J., Welsh, K., Shoup, K.: Webster’s New World English Grammar Handbook. Wiley, Hoboken (2001)Google Scholar
- 36.Malinova, M., Leopold, H., Mendling, J.: An empirical investigation on the design of process architectures. Wirtschaftsinformatik Proceedings 75 (2013)Google Scholar
- 37.McDonald, R., Nivre, J., Quirmbach-Brundage, Y, Goldberg, Y., Das, D., Ganchev, K., Hall, K., Petrov, S., Zhang, H., Tackstrom, O., Bedini, C., Bertomeu Castelló, N., Lee, J.: Universal Dependency Annotation for Multilingual Parsing. In: Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics, vol 2. Association for Computational Linguistics, Sofia, Bulgaria, pp 92–97Google Scholar
- 39.Mendling, J., Leopold, H., Pittke, F.: 25 challenges of semantic process modeling. Int. J. Inf. Syst. Softw. Eng. Big Co. (IJISEBC) 1(1), 78–94 (2015)Google Scholar
- 41.Mladenic, D.: Learning word normalization using word suffix and context from unlabeled data. In: Proceedings of the Nineteenth International Conference on Machine Learning. pp. 427–434. Morgan Kaufmann Publishers Inc. (2002)Google Scholar
- 45.Qiao, M., Akkiraju, R., Rembert, A.J.: Towards efficient business process clustering and retrieval: combining language modeling and structure matching. In: Rinderle-Ma, S., Toumani, F., Wolf, K. (eds.) Business Process Management. BPM 2011. Lecture Notes in Computer Science, vol 6896. Springer, Berlin, Heidelberg (2011)Google Scholar
- 46.Simon, H.A.: The Sciences of the Artificial, 3rd edn. MIT Press, Cambridge (1996)Google Scholar
- 47.Sinha, A., Paradkar, A.: Use cases to process specifications in business process modeling notation. In: Proceedings of the IEEE International Conference on Web Services. pp. 473–480. IEEE (2010)Google Scholar
- 48.van der Aa, H., Leopold, H., Mannhardt, F., Reijers, H.A.: On the fragmentation of process information: challenges, solutions, and outlook. In: BPMDS’15 Working Conference (2015)Google Scholar
- 49.van der Aa, H., Leopold, H., Reijers, H.A.: Dealing with behavioral ambiguity in textual process descriptions. In: International Conference on Business Process Management. pp. 271–288. Springer (2016)Google Scholar
- 52.vom Brocke, J., Mendling, J.: Frameworks for business process management: a taxonomy for business process management cases. In: vom Brocke, J., Mendling, J. (eds.) Business Process Management Cases. Management for Professionals. Springer, Cham (2018)Google Scholar
Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.