Update README.md
Browse files
README.md
CHANGED
@@ -18,6 +18,25 @@ pretty_name: Relation Mapping
|
|
18 |
### Dataset Summary
|
19 |
Relation Mapping is a task to choose optimal combination of word pairs (see more detail in the [paper](https://www.jair.org/index.php/jair/article/view/10583)).
|
20 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
21 |
## Dataset Structure
|
22 |
### Data Instances
|
23 |
An example looks as follows.
|
@@ -33,6 +52,14 @@ An example looks as follows.
|
|
33 |
}
|
34 |
```
|
35 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
36 |
### Data Splits
|
37 |
| name |test|
|
38 |
|---------|----:|
|
|
|
18 |
### Dataset Summary
|
19 |
Relation Mapping is a task to choose optimal combination of word pairs (see more detail in the [paper](https://www.jair.org/index.php/jair/article/view/10583)).
|
20 |
|
21 |
+
|
22 |
+
Relation mapping `M` is the set of bijective map in between two sets of terms (`A` and `B`):
|
23 |
+
```
|
24 |
+
[set `A`]: ("solar system", "sun", "planet", "mass", "attracts", "revolves", "gravity")
|
25 |
+
[set `B`]: ("atom", "nucleus", "electron", "charge", "attracts", "revolves", "electromagnetism")
|
26 |
+
|
27 |
+
[Relation Mapping `M`]
|
28 |
+
* "solar system" -> "atom"
|
29 |
+
* "sun" -> "nucleus"
|
30 |
+
* "planet" -> "electron"
|
31 |
+
* "mass" -> "charge"
|
32 |
+
* "attracts" -> "attracts"
|
33 |
+
* "revolves" -> "revolves"
|
34 |
+
* "gravity" -> "electromagnetism"
|
35 |
+
```
|
36 |
+
|
37 |
+
***[Relation Mapping Problem](https://www.jair.org/index.php/jair/article/view/10583)*** is the task to identify the mapping `M` given the sets of terms `A` and `B`.
|
38 |
+
|
39 |
+
|
40 |
## Dataset Structure
|
41 |
### Data Instances
|
42 |
An example looks as follows.
|
|
|
52 |
}
|
53 |
```
|
54 |
|
55 |
+
- `source`: A list of terms, which is the source of the relation mapping from.
|
56 |
+
- `target_random`: A list of terms, where we want to find a mapping from `source` to.
|
57 |
+
- `target`: A correctly ordered `target_random` that aligns with the `source`.
|
58 |
+
|
59 |
+
Given `source` and `target_random`, the task is to predict the correct order of `target_random` so that it matches `target`.
|
60 |
+
In average 7 terms are in the set, so the total number of possible order is 5040.
|
61 |
+
|
62 |
+
|
63 |
### Data Splits
|
64 |
| name |test|
|
65 |
|---------|----:|
|