Content deleted Content added
Sunthestar (talk | contribs) |
Sunthestar (talk | contribs) No edit summary |
||
Line 51:
==== Candidate Promotion ====
CPL ranks the candidates according to their assessment scores and promotes at most 100 instances and 5 patterns for each predicate. Instances and patterns are are only promoted if they co-occur with at least two promoted patterns or instances, respectively.
== Meta-Bootstrap Learner ==
Meta-Bootstrap Learner (MBL) was also proposed by the authors of CPL in<ref name=cpl2010 />. Meta-Bootstrap learner couples the training of multiple extraction techniques with a multi-view constraint, which requires the extractors to agree. It makes addition of coupling constraints on top of existing extraction algorithms, while treating them as black boxes, feasible. MBL assumes that the errors made by different extraction techniques are independent. Following is a quick summary of MBL.
Subordinate algorithms used with MBL do not promote any instance on their own, they report th evidence about each candidate to MBL and MBL is responsible for promoting instances.
== Applications ==
| |||