We compare the results (PRA-ODA) with the PRA algorithm executed on the NELL KB, NELL KB augmented with surface relations (<cite>PRA-SVO</cite>) (<cite>Gardner et al., 2013</cite>) and vector space random walk PRA (PRA-VS) (Gardner et al., 2014) . The run times, i.e, the time taken to perform an entire experiment for <cite>PRA-SVO</cite> and PRA-VS includes the time taken to augment NELL KB with SVO edges. The PRA-VS runtime also includes the time taken for generating embeddings to perform the vector space random walk. As can be seen from Table 2 and Table 3 , our scheme, PRA-ODA, provides performance equivalent to PRA-VS with faster running time (speed up of 1.8).