To exploit such redundancy for more confident extraction, this paper first combines the evidence from different instances by combing their underlying components.
given the matched m instances Y={y 1 , y 2 , …, y m } for an entity pair (e1, e2), we first decompose each instance as y j = y j 1 + ::: + y j k + ² y j = y j 1 + ::: + y j k + ² , then the entity-pair level decomposition y = y 1 + ::: ::: + y k + ² is obtained by summarizing semantic components of different instances: Finally, the likelihood of an entity pair expressing ith relation type is scored as: is a score used to encourage extractions with more matching instances.