[Context:] Causal relations (e.g., If A, then B) are prevalent in functional requirements. For various applications of AI4RE, e.g., the automatic derivation of suitable test cases from requirements, automatically extracting such causal statements are a basic necessity. [Problem:] We lack an approach that is able to extract causal relations from natural language requirements in fine-grained form. Specifically, existing approaches do not consider the combinatorics between causes and effects. They also do not allow to split causes and effects into more granular text fragments (e.g., variable and condition), making the extracted relations unsuitable for automatic test case derivation. [Objective & Contributions:] We address this research gap and make the following contributions: First, we present the Causality Treebank, which is the first corpus of fully labeled binary parse trees representing the composition of 1,571 causal requirements. Second, we propose a fine-grained causality extractor based on Recursive Neural Tensor Networks. Our approach is capable of recovering the composition of causal statements written in natural language and achieves a F1 score of 74 % in the evaluation on the Causality Treebank. Third, we disclose our open data sets as well as our code to foster the discourse on the automatic extraction of causality in the RE community.
翻译:原因关系(例如,如果A,那么B)在功能要求中很普遍。对于AI4RE的各种应用,例如,从要求中自动得出适当的测试案例,自动从要求中得出这种因果关系说明是基本的必要。[问题:]我们缺乏一种能够从自然语言要求中以细细度形式从自然语言要求中得出因果关系的方法。具体地说,现有方法不考虑因果关系的原因和影响。它们也不允许将因果关系分割成更多的颗粒文本碎片(例如,变数和条件),使提取的关系不适于自动测试案例的产生。[目标与贡献:]我们解决这一研究差距,作出以下贡献:首先,我们介绍Causality Treebank,这是第一个有充分标签的二进制粗树丛,代表了1 571个因果关系要求的构成。第二,我们建议根据Recurive Neural Tensors Networks, 提出一个精细的因果关系提取器。我们的方法是用自然语言来恢复因果关系的构成,我们用Arequenal deal dealalalalalalal exal dealalalal asalalalalalal dealalal asalalalalalal as as asal as as as as as as 和我们在自然语言中可以恢复了我们为直写成为直立式的“Babal deal deal deal deal deal 。1 sabal deal 。我们立的顺序的顺序的顺序,我们立式的顺序第1 和制制成的顺序,我们用的顺序,我们用的顺序,我们用的顺序的顺序的排名第1,我们用的顺序的顺序的顺序的顺序的顺序和树的顺序的顺序的顺序的顺序的顺序的分分分分数的分。