forked from sebastianruder/NLP-progress
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request sebastianruder#92 from yuvalpinter/master
new task - relation prediction on WN18RR
- Loading branch information
Showing
3 changed files
with
125 additions
and
7 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,74 @@ | ||
WN18RR: | ||
- | ||
model: Max-Margin Markov Graph Models (M3GM) | ||
authors: Pinter and Eisenstein | ||
year: 2018 | ||
H@10: 59.02 | ||
H@1: 45.37 | ||
MRR: 49.83 | ||
paper: Predicting Semantic Relations using Global Graph Properties | ||
url: https://arxiv.org/abs/1804.09530 | ||
code: | ||
- name: Official | ||
url: http://www.github.com/yuvalpinter/m3gm | ||
- | ||
model: TransE (reimplementation) | ||
authors: Pinter and Eisenstein | ||
year: 2018 | ||
H@10: 55.55 | ||
H@1: 42.26 | ||
MRR: 46.59 | ||
paper: Predicting Semantic Relations using Global Graph Properties | ||
url: https://arxiv.org/abs/1804.09530 | ||
code: | ||
- name: Reimplementation of Bordes et al. 2013. Translating embeddings for modeling multi-relational data. | ||
url: http://www.github.com/yuvalpinter/m3gm | ||
- | ||
model: ConvKB | ||
authors: Nguyen et al. | ||
year: 2018 | ||
H@10: 52.50 | ||
H@1: N/A | ||
MRR: 24.80 | ||
paper: A Novel Embedding Model for Knowledge Base Completion Based on Convolutional Neural Network | ||
url: http://www.aclweb.org/anthology/N18-2053 | ||
code: | ||
- name: Official | ||
url: https://github.com/daiquocnguyen/ConvKB | ||
- | ||
model: ConvE (v6) | ||
authors: Dettmers et al. | ||
year: 2018 | ||
H@10: 52.00 | ||
H@1: 40.00 | ||
MRR: 43.00 | ||
paper: Convolutional 2D Knowledge Graph Embeddings | ||
url: https://arxiv.org/abs/1707.01476 | ||
code: | ||
- name: Official | ||
url: https://github.com/TimDettmers/ConvE | ||
- | ||
model: ComplEx | ||
authors: Trouillon et al. | ||
year: 2016 | ||
H@10: 51.00 | ||
H@1: 41.00 | ||
MRR: 44.00 | ||
paper: Complex Embeddings for Simple Link Prediction | ||
url: http://www.jmlr.org/proceedings/papers/v48/trouillon16.pdf | ||
code: | ||
- name: Official | ||
url: https://github.com/ttrouill/complex | ||
- | ||
model: DistMult (reimplementation) | ||
authors: Dettmers et al. | ||
year: 2017 | ||
H@10: 49.00 | ||
H@1: 40.00 | ||
MRR: 43.00 | ||
paper: Convolutional 2D Knowledge Graph Embeddings | ||
url: https://arxiv.org/abs/1412.6575 | ||
code: | ||
- name: Reimplementation of Yang et al. 2013. Embedding Entities and Relations for Learning and Inference in Knowledge Bases. | ||
url: https://github.com/uclmr/inferbeddings | ||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,43 @@ | ||
# Relation Prediction | ||
|
||
## Task | ||
|
||
Relation Prediction is the task of recognizing a named relation between two named semantic entities. The common test setup is to hide one entity from the relation triplet, asking the system to recover it based on the other entity and the relation type. | ||
|
||
For example, given the triple \<*Roman Jakobson*, *born-in-city*, *?*\>, the system is required to replace the question mark with *Moscow*. | ||
|
||
Relation Prediction datasets are typically extracted from two types of resources: | ||
* *Knowledge Bases*: KBs such as [FreeBase](https://developers.google.com/freebase/) contain hundreds or thousands of relation types pertaining to world-knowledge obtained autmoatically or semi-automatically from various resources on millions of entities. These relations include *born-in*, *nationality*, *is-in* (for geographical entities), *part-of* (for organizations, among others), and more. | ||
* *Semantic Graphs*: SGs such as [WordNet](https://wordnet.princeton.edu/) are often manually-curated resources of semantic concepts, restricted to more "linguistic" relations compared to free real-world knowledge. The most common semantic relation is *hypernym*, also known as the *is-a* relation (example: \<*cat*, *hypernym*, *feline*\>). | ||
|
||
## Evaluation | ||
|
||
Evaluation in Relation Prediction hinges on a list of ranked candidates given by the system to the test instance. The metrics below are derived from the location of correct candidate(s) in that list. | ||
|
||
A common action performed before evaluation on a given list is *filtering*, where the list is cleaned of entities known to mismatch the type of expected entity to the relation. Unless specified otherwise, results here are from filtered lists. | ||
|
||
### Metrics | ||
|
||
#### Mean Reciprocal Rank (MRR): | ||
|
||
The mean of all reciprocal ranks for the true candidates over the test set (1/rank). | ||
|
||
#### Hits at k (H@k): | ||
|
||
The rate of correct entities appearing in the top *k* entries for each instance list. This number may exceed 1.00 if the average *k*-truncated list contains more than one true entity. | ||
|
||
### Datasets | ||
|
||
#### WordNet-18-RR (WN18RR) | ||
|
||
The WN18 dataset was introduced in Bordes et al., 2013. It included the full 18 relations scraped from WordNet for roughly 41,000 synsets. This dataset was found to suffer from major training set leakage, initially by Socher et al. 2013. This means reciprocal edges from symmetric relations (e.g. *hypernym*-*hyponym*) appear in one form in the training or dev set, and in the other in the test set. A trivial rule-based system recovering these regularities surpasses 90% performance on the test set. | ||
|
||
As a way to overcome this problem, Dettmers et al. (2018) introduced the WN18RR dataset, derived from WN18, which features 11 relations only, no pair of which is reciprocal (but still include four internally-symmetric relations like *verb_group*, allowing the rule-based system to reach 35 on all three metrics). | ||
|
||
The test set is composed of triplets, each used to create two test instances, one for each entity to be predicted. Since each instance is associated with a single true entity, the maximum value for all metrics is 1.00. | ||
|
||
{% include table.html | ||
results=site.data.relation_prediction.WN18RR | ||
scores='H@10,H@1,MRR' %} | ||
|
||
[Back to README](README.md) |