Compatibility Checking of Compound Business Rules Expressed in Natural Language Against Domain Specification

Abstract

The following paper is the next step of research on automatic processing of business rules expressed in natural language. Such rules are used to describe a selected universe of discourse - its properties and constraints. They are usually written with a text editor as a set of free-form sentences. The purpose of the paper is to propose a method for verifying the compatibility of business rules with a domain specification in the form of a UML class diagram. Such verification is performed at the syntax level. While our previous research has focused on processing only simple sentences, this paper presents a method for analyzing compound sentences. The usefulness of our ideas has been experimentally demonstrated.