Detection of Gene Interactions Based on Syntactic Relations

Algorithm 3

Direction rule-learning algorithm.

1> Alignment of a positive rule set

   (1.1) Collect 〈lexical word A, relation B, direction C〉 in the paths from all Agents to their Targets.

   (1.2) For any lexical word A, and relation B, if both of 〈A, B, RIGHT〉 and 〈A, B, LEFT〉 exist in

      the positive rule set, we remove both rules, and add a modified rule 〈A, B, ANY〉.

2> Alignment of a negative rule set

   (2.1) Collect 〈lexical word A, relation B, direction C〉 in the paths from all Targets to their Agents.

   (2.2) For any lexical word A, and relation B, if both of 〈A, B, RIGHT〉 and 〈A, B, LEFT〉 exist in

      the negative rule set, we remove both rules, and add a modified rule 〈A, B, ANY〉.

3> Construction of Final direction rules

   For every rule 〈A, B, C〉 in the positive rule set, for any lexical word A, relation B, and direction C.

    (3.1) If 〈A, B, C〉 also exists in the negative rule set, we obtain a direction rule 〈A, B, ANY〉.

    (3.2) Otherwise, if 〈A, B, OPPOSITE C〉 exists in the negative rule set, we obtain a direction rule

       〈A, B, C〉.

    (3.3) Otherwise, we obtain a direction rule 〈A, B, C〉.