Entailment rules over unary templates using the BInc algorithm

This dataset is the result of applying Szpektor and Dagan’s learning algorithm (Szpektor and Dagan, 2008) over the Reuters corpus.
The dataset contains two tables, one for describing the unary templates and one for describing the rules between templates.

  • Download the dataset (compressed sql dump file)
  • The format of the template table is [template_id | template_description], where each unary template is assigned a unique ID. The description of templates is following the string representation of Lin and Pantel (2001).
  • The format of the rule table is [entailed_template_id | entailing_template_id | score] and provides the similarity score for pairs of templates. Note that the first column represents the entailed template.
  • References:
    • Idan Szpektor and Ido Dagan. Learning Entailment Rules for Unary Templates. Proceedings of COLING 2008.
    • Dekang Lin and Patrick Pantel. Dirt – Discovery of Inference Rules from Text. Proceedings of ACM Conference on Knowledge Discovery and Data Mining, 2001.
  • Contact: Jonathan Berant, jonatha6 @ post.tau.ac.il