A Grammar-Based Semantic Similarity Algorithm for Natural Language Sentences

Algorithm 3

Grammarmatrix.

INPUT: 𝐿𝑇_{𝐴_𝑖}, 𝐿𝑇_{𝐵_𝑖} /* sets of sub-relations of sentences A, B, where 𝑖∈𝜂 */

OUTPUT: 𝐵𝑎𝑙𝐺𝑟𝑎𝑉_𝑖  /* elements of the Grammar Vector of sentences A, B in linking type i */

(1)   COL ← MAX(𝐿𝑇_{𝐴_𝑖}, 𝐿𝑇_{𝐵_𝑖})

(2)   ROW ← MIN(𝐿𝑇_{𝐴_𝑖}, 𝐿𝑇_{𝐵_𝑖})

(3)  FOR ALL   𝑐_𝑥∈  COL  DO

(4)  FOR ALL   𝑟_𝑦∈  ROW  DO

(5)   𝐺𝑟𝑎𝑉_𝑖[𝑥]← MAX(𝐺𝑟𝑎𝑉_𝑖[x], Wu_Palmer(𝑐_𝑥⋅𝑤, 𝑟_𝑦⋅𝑤))

(6)  END FOR

(7)  END FOR

(8)  FOR  0  TO  |𝑅𝑂𝑊|

(9)   𝐵𝑎𝑙𝐺𝑟𝑎𝑉_𝑖← 𝐵𝑎𝑙𝐺𝑟𝑎𝑉_𝑖 + 𝐺𝑟𝑎𝑉_𝑖[𝑥]

(10)  END FOR

(11)   𝐵𝑎𝑙𝐺𝑟𝑎𝑉_𝑖← Pow(|𝑅𝑂𝑊|)

(12)  RETURN   𝐵𝑎𝑙𝐺𝑟𝑎𝑉_𝑖