Algorithm 5 AHP algorithm

Initialize the $m\times n$ matrix $Mat$ through semantic similarity computation. Set different thresholds $T_{sem}$, $T_{ins},T_{str}$ for three different strategies. For $T$ = {$T_{sem}$, $T_{ins},T_{str}$}:   For $i,j$. $i\in [0,m-1],j\in [0,n-1]$:     If $Mat[i][j]<T$:      $Mat[i][j]=0$.     else      $Mat[i][j]$ retains the original value. For $i$. $i\in [0,m-1]$:  For $j$. $j\in [0,n-1]$:      find the largest $Mat[i][j]$ in each row. After finding the matrix $Mat$, we can get all mapping rules based on concept pairs between ontology $O_1,O_2$.