z-logo
open-access-imgOpen Access
Algorithm for Automatic Detection of Ambiguities from Software Requirements
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.i1141.0789s19
Subject(s) - computer science , software requirements specification , software requirements , software , software engineering , natural language , software system , software development , syntax , software construction , programming language , verification and validation , artificial intelligence , engineering , operations management
Software Systems are built by the Software engineers and must ensure that software requirement document (SRS) should be specific. Natural Language is the main representation of Software requirement specification document, because it is the most flexible and easiest way for clients or customers to express their software requirements [2]. However being stated in natural language, software requirement specification document may lead to ambiguities [28]. The main goal of presented work to automatically detection of the different types of ambiguities like Lexical, Syntactic, Syntax and Pragmatic. Then an algorithm is proposed to early detection the different types of ambiguities from software requirement document. Part of Speech (POS) technique and regular expression is used to detect each type of ambiguities. An algorithm presented in this paper have two main goals (1) Automatic detection of different types of ambiguities. (2) Count the total number of each types of ambiguities found and evaluate the percentage of ambiguous and non- ambiguous statements detected from software requirement document. The suggested algorithm can absolutely support the analyst in identifying different kinds of ambiguities in Software requirements specification (SRS) document.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here