For a single pair (s i , x), we utilize the function f int () in Equation 4 to build the fine-grained representations for both s i and x, obtaining For (S e , x), we compose all the {i i } and all the {x i } along with i, via a weighted max-pooling: This weighted max-pooling ensures that the sentences with higher probabilities of being evidence have a higher chance to present their features.
then the (S e , x) pair gets a coarse-grained concatenated representation: [e, x].