Refining Automatically Extracted Knowledge Bases Using Crowdsourcing

Algorithm 3

Question selection: SinglePath.

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 the optimal vertex of the longest path

else

select an optimal vertex according to

end if

Crowdsourcing   and color ;

Remove the colored vertices;

 end while

 return colored