This directory contains all data needed for performing the experiment described in Section 5.1 of the paper:
Global learning of Typed Entailment Rules, ACL 2011, Jonathan Berant, Ido Dagan and Jacob Goldberger.

In the paper we discuss two types of graphs - "two-type graphs" and "single-type graphs". For simplicity, we converted all "single-type graphs" into "two-type graphs" in this data set (which are simple directed graphs). This is done by the procedure described in Section 4.2. The price is that the number of nodes is doubled and every edge is represented twice. These duplicates can be easily discarded in post-processing.

The directory contains the following sub-directories:
----------------------------------------------------

local-scores: contains one file for each of the 10 typed graphs. Each file contains for all pairs of nodes u,v in the graph the score S_{uv}.
	each file is tab delimited with the following columns:
		from_node_description - description is in format <predicate::type_1::type_2>
		to_node_description - description is in format <predicate::type_1::type_2>
		local_score - real score
	
constraints: contains 2 files describing constraints on all 10 graphs (and also many more graphs not in this data set):
	entailingConstraint.txt: contains positive constraints. Tab-delimited file with the columns:
		from_node_description - description is in format <predicate::type_1::type_2>
		to_node_description - description is in format <predicate::type_1::type_2>
	nonEntailingConstraints.txt - contains negative constraints. Same formant as entailingConstraint.txt.
	
gold-standard: contains one file for each of the 10 typed graphs. Each line describes an edge in the gold-standard graph. File is tab-delimited with the following columns:
	from_node_description - description is in format <predicate::type_1::type_2>
	to_node_description - description is in format <predicate::type_1::type_2>
