init
Browse files- README.md +53 -0
- lexical_relation_classification.py +1 -1
README.md
CHANGED
@@ -19,3 +19,56 @@ pretty_name: Lexical Relation Classification
|
|
19 |
### Dataset Summary
|
20 |
Five different datasets (`BLESS`, `CogALexV`, `EVALution`, `K&H+N`, `ROOT09`) for lexical relation classification used in [SphereRE](https://www.aclweb.org/anthology/P19-1169/).
|
21 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
19 |
### Dataset Summary
|
20 |
Five different datasets (`BLESS`, `CogALexV`, `EVALution`, `K&H+N`, `ROOT09`) for lexical relation classification used in [SphereRE](https://www.aclweb.org/anthology/P19-1169/).
|
21 |
|
22 |
+
|
23 |
+
### Dataset Summary
|
24 |
+
This dataset contains 5 different word analogy questions used in [Analogy Language Model](https://aclanthology.org/2021.acl-long.280/).
|
25 |
+
|
26 |
+
| name | Size (valid/test) | Num of choice | Num of relation group | Original Reference |
|
27 |
+
|---------|------------------:|--------------:|----------------------:|:--------------------------------------------------------------------------:|
|
28 |
+
| `sat_full`| -/374 | 5 | 2 | [Turney (2005)](https://arxiv.org/pdf/cs/0508053.pdf) |
|
29 |
+
| `sat` | 37/337 | 5 | 2 | [Turney (2005)](https://arxiv.org/pdf/cs/0508053.pdf) |
|
30 |
+
| `u2` | 24/228 | 5,4,3 | 9 | [EnglishForEveryone](https://englishforeveryone.org/Topics/Analogies.html) |
|
31 |
+
| `u4` | 48/432 | 5,4,3 | 5 | [EnglishForEveryone](https://englishforeveryone.org/Topics/Analogies.html) |
|
32 |
+
| `google` | 50/500 | 4 | 2 | [Mikolov et al., (2013)](https://www.aclweb.org/anthology/N13-1090.pdf) |
|
33 |
+
| `bats` | 199/1799 | 4 | 3 | [Gladkova et al., (2016)](https://www.aclweb.org/anthology/N18-2017.pdf) |
|
34 |
+
|
35 |
+
|
36 |
+
## Dataset Structure
|
37 |
+
### Data Instances
|
38 |
+
An example of `test` looks as follows.
|
39 |
+
```
|
40 |
+
{
|
41 |
+
"stem": ["raphael", "painter"],
|
42 |
+
"answer": 2,
|
43 |
+
"choice": [["andersen", "plato"],
|
44 |
+
["reading", "berkshire"],
|
45 |
+
["marx", "philosopher"],
|
46 |
+
["tolstoi", "edison"]]
|
47 |
+
}
|
48 |
+
```
|
49 |
+
where `stem` is the query word pair, `choice` has word pair candidates,
|
50 |
+
and `answer` indicates the index of correct candidate which starts from `0`.
|
51 |
+
All data is lowercased except Google dataset.
|
52 |
+
|
53 |
+
### Citation Information
|
54 |
+
```
|
55 |
+
@inproceedings{wang-etal-2019-spherere,
|
56 |
+
title = "{S}phere{RE}: Distinguishing Lexical Relations with Hyperspherical Relation Embeddings",
|
57 |
+
author = "Wang, Chengyu and
|
58 |
+
He, Xiaofeng and
|
59 |
+
Zhou, Aoying",
|
60 |
+
booktitle = "Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics",
|
61 |
+
month = jul,
|
62 |
+
year = "2019",
|
63 |
+
address = "Florence, Italy",
|
64 |
+
publisher = "Association for Computational Linguistics",
|
65 |
+
url = "https://aclanthology.org/P19-1169",
|
66 |
+
doi = "10.18653/v1/P19-1169",
|
67 |
+
pages = "1727--1737",
|
68 |
+
abstract = "Lexical relations describe how meanings of terms relate to each other. Typical examples include hypernymy, synonymy, meronymy, etc. Automatic distinction of lexical relations is vital for NLP applications, and also challenging due to the lack of contextual signals to discriminate between such relations. In this work, we present a neural representation learning model to distinguish lexical relations among term pairs based on Hyperspherical Relation Embeddings (SphereRE). Rather than learning embeddings for individual terms, the model learns representations of relation triples by mapping them to the hyperspherical embedding space, where relation triples of different lexical relations are well separated. Experiments over several benchmarks confirm SphereRE outperforms state-of-the-arts.",
|
69 |
+
}
|
70 |
+
```
|
71 |
+
|
72 |
+
### LICENSE
|
73 |
+
The LICENSE of all the resources are under [CC-BY-NC-4.0](./LICENSE). Thus, they are freely available for academic purpose or individual research, but restricted for commercial use.
|
74 |
+
|
lexical_relation_classification.py
CHANGED
@@ -40,7 +40,7 @@ _URLS = {
|
|
40 |
'EVALution': [f'{_URL}/EVALution/test.jsonl'],
|
41 |
},
|
42 |
str(datasets.Split.VALIDATION): {
|
43 |
-
'BLESS': [f'{_URL}/
|
44 |
'K&H+N': [f'{_URL}/K&H+N/val.jsonl'],
|
45 |
'ROOT09': [f'{_URL}/ROOT09/val.jsonl'],
|
46 |
'EVALution': [f'{_URL}/EVALution/val.jsonl'],
|
|
|
40 |
'EVALution': [f'{_URL}/EVALution/test.jsonl'],
|
41 |
},
|
42 |
str(datasets.Split.VALIDATION): {
|
43 |
+
'BLESS': [f'{_URL}/BLESS/val.jsonl'],
|
44 |
'K&H+N': [f'{_URL}/K&H+N/val.jsonl'],
|
45 |
'ROOT09': [f'{_URL}/ROOT09/val.jsonl'],
|
46 |
'EVALution': [f'{_URL}/EVALution/val.jsonl'],
|