Algorithm 1 Span association pairing algorithm.

Input: An input sentence $X=\left\{X_1,X_2,X_3,\cdots ,X_n\right\}$

Output: The candidate pair P

1: for i in $MAXDOCUMENTLENGTH$ do

2:   for j in $[i-w,i+w+1]$ do

3:      if j in $MAXDOCUMENTLENGTH$ then

4:         $Pai{r}_{i,j}\leftarrow 〈X_i,X_j〉$

5:      $lo{c}_{i,j}\leftarrow U_{i,j}$

6:      $Y_{i,j}^{pair}\leftarrow 〈E_i,C_i〉$

7:$P\leftarrow \left(Pair\cup Y^{pair}\cup loc\right)$

8:Return P