Transitivity and FRG constraints limit the recall we are able to reach, and the graph does not decompose very well into components.
in future work we would like to apply our algorithms over graphs where predicate ambiguity is modeled and so transitivity constraints can be properly applied.