SemEval-2010 Task 8: Multi-Way Classification of Semantic Relations Between Pairs of Nominals

@inproceedings{Hendrickx2009SemEval2010T8,
  title={SemEval-2010 Task 8: Multi-Way Classification of Semantic Relations Between Pairs of Nominals},
  author={Iris Hendrickx and Su Nam Kim and Zornitsa Kozareva and Preslav Nakov and Diarmuid {\'O} S{\'e}aghdha and Marco Pennacchiotti and Lorenza Romano and Stan Szpakowicz},
  booktitle={HLT-NAACL 2009},
  year={2009}
}
We present a brief overview of the main challenges in the extraction of semantic relations from English text, and discuss the shortcomings of previous data sets and shared tasks. This leads us to introduce a new task, which will be part of SemEval-2010: multi-way classification of mutually exclusive semantic relations between pairs of common nominals. The task is designed to compare different approaches to the problem and to provide a standard testbed for future research, which can benefit many… 
A Richer-but-Smarter Shortest Dependency Path with Attentive Augmentation for Relation Extraction
TLDR
A combined deep neural model with a LSTM network on word sequences and a CNN on RbSP, which is based on the basic information in the SDP enhanced with information selected by several attention mechanisms with kernel filters, namely R bSP (Richer-but-Smarter SDP).
Learning Dual Retrieval Module for Semi-supervised Relation Extraction
TLDR
This paper proposes DualRE, a principled framework that introduces a retrieval module which is jointly trained with the original relation prediction module, and proposes a key insight that retrieving sentences expressing a relation is a dual task of predicting the relation label for a given sentence.
N ov 2 01 7 Structure Regularized Bidirectional Recurrent Convolutional Neural Network for Relation Classification
TLDR
A structure regularization model is proposed to learn relation representations along the SDP extracted from the forest formed by the structure regularized dependency tree, which benefits reducing the complexity of the whole model and helps improve the F1 score by 10.3.
Structure Regularized Bidirectional Recurrent Convolutional Neural Network for Relation Classification
  • Ji Wen
  • Computer Science
    ArXiv
  • 2017
TLDR
A structure regularization model is proposed to learn relation representations along the SDP extracted from the forest formed by the structure regularized dependency tree, which benefits reducing the complexity of the whole model and helps improve the $F_{1}$ score by 10.3.
H-FND: Hierarchical False-Negative Denoising for Distant Supervision Relation Extraction
TLDR
H-FND is proposed, a hierarchical false-negative denoising framework for robust distant supervision relation extraction that can revise FN instances correctly and maintains high F1 scores even when 50% of the instances have been turned into negatives.
ICDM 2019 Knowledge Graph Contest: Team UWA
TLDR
An overview of the triple extraction system, which uses a pipeline-based approach to extract a set of triples from a given document and provides the facility to visualise useful information about each triple such as the degree, betweenness, structured relation type(s), and named entity types.
REflex: Flexible Framework for Relation Extraction in Multiple Domains
TLDR
A systematic exploration of modeling, pre-processing and training methodologies for relation extraction finds that choices of preprocessing are a large contributor performance and that omission of such information can further hinder fair comparison.
Transfer Learning for Causal Sentence Detection
TLDR
This work considers the task of detecting sentences that express causality, as a step towards mining causal relations from texts, and exploits transfer learning, namely ELMO and BERT, using a bidirectional GRU with self-attention as a baseline.
Combining Long Short Term Memory and Convolutional Neural Network for Cross-Sentence n-ary Relation Extraction
TLDR
The LSTM-CNN model is evaluated on standard dataset on cross-sentence n-ary relation extraction, where it significantly outperforms baselines such as CNNs, LSTMs and also a combined CNN-LSTM model.
06 52 1 v 1 [ cs . C L ] 1 6 M ay 2 01 8 Composite Semantic Relation Classification
TLDR
The proposed model uses the combination of a large commonsense knowledge base of binary relations, a distributional navigational algorithm and sequence classification to provide a solution for the composite semantic relation classification problem.
...
...

References

SHOWING 1-10 OF 27 REFERENCES
Automatic Acquisition of Hyponyms from Large Text Corpora
TLDR
A set of lexico-syntactic patterns that are easily recognizable, that occur frequently and across text genre boundaries, and that indisputably indicate the lexical relation of interest are identified.
Classification of semantic relations between nominals
TLDR
This work presents the development and evaluation of a semantic analysis task: automatic recognition of relations between pairs of nominals in a sentence, part of SemEval-2007, the fourth edition of the semantic evaluation event previously known as SensEval.
Women, Fire, and Dangerous Things
Recognizing textual entailment: Rational, evaluation and approaches
TLDR
This special issue of the JNLE provides an opportunity to showcase some of the most important work in this emerging area of textual entailment, particularly automatic acquisition of paraphrases and lexical semantic relationships and unsupervised inference in applications such as question answering, information extraction and summarization.
On the semantics of noun compounds
Detecting Gene Relations from MEDLINE Abstracts
TLDR
The relative computational simplicity of the proposed method makes it possible to process and analyze large volumes of data in a short time and significantly contributes to and enhances a user's ability to discover such embedded information.
Learning Noun-Modifier Semantic Relations with Corpus-based and WordNet-based Features
TLDR
The performance of two representations of word meaning in learning noun-modifier semantic relations are studied, one based on lexical resources, in particular WordNet, and the other - on a corpus.
Automatic Interpretation of Noun Compounds Using WordNet Similarity
TLDR
The paper introduces a method for interpreting novel noun compounds with semantic relations built around word similarity with pre-tagged noun compounds, based on WordNet::Similarity, which was able to correctly classify 53.3% of the test noun compounds.
The Proposition Bank: An Annotated Corpus of Semantic Roles
TLDR
An automatic system for semantic role tagging trained on the corpus is described and the effect on its performance of various types of information is discussed, including a comparison of full syntactic parsing with a flat representation and the contribution of the empty trace categories of the treebank.
...
...