TY - GEN
T1 - Requirements Dependency Graph Modeling on Software Requirements Specification Using Text Analysis
AU - Priyadi, Yudi
AU - Djunaidy, Arif
AU - Siahaan, Daniel
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/8
Y1 - 2019/8
N2 - Understanding interdependency among requirements is one of the success factors in software development. Information on requirements interdependency explicitly and implicitly resided various design artifacts or diagrams. A software requirements specification document is the artifact delivered in the early phase of development. It drives its following development processes. It also contains information on interdependencies among the requirements, such as similar, part-of, and elaborate. This study proposes an approach to model the requirement dependency graph for a software requirements specification document. There is an extraction process for Text Preprocessing, which includes of Tokenization, Stopword Removal, and Stemming. Besides, there is a process of measuring semantic similarity through WS4J (WordNet Similarity for Java). The results of the extraction process, combined with Greedy Algorithms as the optimum value solution approach. Besides, a method for calculating similarity was used through the practices of Wu Palmer and Levenshtein. At the end of this process, Reliability is performed using the Gwet's AC1 formula.
AB - Understanding interdependency among requirements is one of the success factors in software development. Information on requirements interdependency explicitly and implicitly resided various design artifacts or diagrams. A software requirements specification document is the artifact delivered in the early phase of development. It drives its following development processes. It also contains information on interdependencies among the requirements, such as similar, part-of, and elaborate. This study proposes an approach to model the requirement dependency graph for a software requirements specification document. There is an extraction process for Text Preprocessing, which includes of Tokenization, Stopword Removal, and Stemming. Besides, there is a process of measuring semantic similarity through WS4J (WordNet Similarity for Java). The results of the extraction process, combined with Greedy Algorithms as the optimum value solution approach. Besides, a method for calculating similarity was used through the practices of Wu Palmer and Levenshtein. At the end of this process, Reliability is performed using the Gwet's AC1 formula.
KW - dependency type
KW - reliability
KW - requirements dependency graph
KW - similarity
KW - software requirements specifications
KW - text preprocessing
UR - http://www.scopus.com/inward/record.url?scp=85074412789&partnerID=8YFLogxK
U2 - 10.1109/ICORIS.2019.8874920
DO - 10.1109/ICORIS.2019.8874920
M3 - Conference contribution
AN - SCOPUS:85074412789
T3 - 2019 1st International Conference on Cybernetics and Intelligent System, ICORIS 2019
SP - 221
EP - 226
BT - 2019 1st International Conference on Cybernetics and Intelligent System, ICORIS 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 1st International Conference on Cybernetics and Intelligent System, ICORIS 2019
Y2 - 22 August 2019 through 23 August 2019
ER -