Refining Automatically Extracted Knowledge Bases Using Crowdsourcing

Algorithm 4

Question selection: Multi-Path.

Input:

Output: All vertices in are colored as Green or Red

  while there exist uncolored vertices in   do

Compute disjoint paths in using maximal matching;

if there exist paths with length > 1  then

select an optimal vertex of each path with lengh > 1;

else

select optimal vertices according to ;

end if

Crowdsourcing   in parallel and color ;

Remove the colored vertices;

 end while

 return colored