We note that a trivial baseline would be to initialize edges based on whether s ij > λ and then compute the transitive closure in each component.
it might be possible to decompose entailment graphs into small components and solve each component separately.