vanyacohen commited on
Commit
0c4dd97
·
verified ·
1 Parent(s): 073e989

Update README.md

Browse files
Files changed (1) hide show
  1. README.md +4 -4
README.md CHANGED
@@ -9,7 +9,7 @@ pretty_name: CaT-Bench
9
 
10
  # Dataset Card for CaT-Bench
11
 
12
- CaT-Bench is a benchmark dataset designed to evaluate large language models' (LLMs) understanding of causal and temporal dependencies in natural language plans, specifically in cooking recipes. It consists of questions that test whether one step must necessarily occur before or after another, requiring reasoning about preconditions, effects, and the overall structure of the plan.
13
 
14
  ## Dataset Details
15
 
@@ -38,7 +38,7 @@ CaT-Bench is intended for evaluating and benchmarking the performance of languag
38
  The dataset consists of:
39
 
40
  - **Plans:** 300 unique cooking recipes.
41
- - **Questions:** 4,260 binary (yes/no) questions about step dependencies.
42
  - **Annotations:** Questions are labeled as dependent (steps are dependent) or non-dependent (steps are independent).
43
 
44
  ## Dataset Creation
@@ -51,9 +51,9 @@ The dataset was created to address the need for evaluating language models' unde
51
 
52
  #### Data Collection and Processing
53
 
54
- The dataset is based on the English Recipe Flow Graph Corpus by Yamakata et al. (2020), which contains 300 English cooking recipes annotated with substep procedure dependencies. From this corpus:
55
 
56
- - **Selection:** 57 recipes were selected for inclusion.
57
  - **Question Generation:** For each ordered pair of steps, two binary questions were created regarding the necessity of one step occurring before or after another.
58
  - **Balancing:** The dataset was balanced to have an equal number of dependent and non-dependent questions.
59
  - **Annotations:** Steps were annotated based on whether there is a directed path between them in the recipe's dependency graph.
 
9
 
10
  # Dataset Card for CaT-Bench
11
 
12
+ CaT-Bench is a benchmark dataset designed to evaluate large language models' (LLMs) understanding of causal and temporal dependencies in natural language plans, specifically in cooking recipes based on the English Recipe Flow Graph Corpus by Yamakata et al. (2020). It consists of questions that test whether one step must necessarily occur before or after another, requiring reasoning about preconditions, effects, and the overall structure of the plan.
13
 
14
  ## Dataset Details
15
 
 
38
  The dataset consists of:
39
 
40
  - **Plans:** 300 unique cooking recipes.
41
+ - **Questions:** 9,162 binary (yes/no) questions about step dependencies.
42
  - **Annotations:** Questions are labeled as dependent (steps are dependent) or non-dependent (steps are independent).
43
 
44
  ## Dataset Creation
 
51
 
52
  #### Data Collection and Processing
53
 
54
+ The dataset is based on the English Recipe Flow Graph Corpus, which contains 300 English cooking recipes annotated with substep procedure dependencies. From this corpus:
55
 
56
+ - **Selection:** 300 recipes were selected for inclusion.
57
  - **Question Generation:** For each ordered pair of steps, two binary questions were created regarding the necessity of one step occurring before or after another.
58
  - **Balancing:** The dataset was balanced to have an equal number of dependent and non-dependent questions.
59
  - **Annotations:** Steps were annotated based on whether there is a directed path between them in the recipe's dependency graph.