Specifying and Annotating Reduced Argument Span Via QA-SRL

@inproceedings{Stanovsky2016SpecifyingAA,
  title={Specifying and Annotating Reduced Argument Span Via QA-SRL},
  author={Gabriel Stanovsky and Ido Dagan and Meni Adler},
  booktitle={Annual Meeting of the Association for Computational Linguistics},
  year={2016}
}
Prominent semantic annotations take an inclusive approach to argument span annotation, marking arguments as full constituency subtrees. Some works, however, showed that identifying a reduced argument span can be beneficial for various semantic tasks. While certain practical methods do extract reduced argument spans, such as in Open-IE , these solutions are often ad-hoc and system-dependent, with no commonly accepted standards. In this paper we propose a generic argument reduction criterion… 

Tables from this paper

Open Information Extraction from Conjunctive Sentences

The value of the CALM coordination analyzer is demonstrated in the end task of Open Information Extraction, where it performs extraction over the simple sentences identified by CALM to obtain up to 1.8x yield with a moderate increase in precision compared to extractions from original sentences.

Extraction from Conjunctive Sentences

This work develops CALM, a coordination analyzer that improves upon the conjuncts identified from dependency parses that performs extraction over the simple sentences identified by CALM to obtain up to 1.8x yield with a moderate increase in precision compared to extractions from original sentences.

Utilizing Automatic Predicate-Argument Analysis for Concept Map Mining

Drawing upon recent advances in automatic predicate-argument analysis, it is proposed to replace pattern-based extraction by usingpredicate-argument structures and shows that using predicate- arguments leads to a better extraction performance while being much easier to use.

Creating a Large Benchmark for Open Information Extraction

This work develops a methodology that leverages the recent QA-SRL annotation to create a first independent and large scale Open IE annotation and uses it to automatically compare the most prominent Open IE systems.

Corpus-Level Evaluation for Event QA: The IndiaPoliceEvents Corpus Covering the 2002 Gujarat Violence

The INDIAPOLICEEVENTS corpus—all 21,391 sentences from 1,257 English-language Times of India articles about events in the state of Gujarat during March 2002 is introduced and trained annotators read and label every document for mentions of police activity events, allowing for unbiased recall evaluations.

Automatic Structured Text Summarization with Concept Maps

This thesis lays the necessary ground for comparable research on computational models for concept map--based summarization by presenting a prototype system that demonstrates the use of automatically generated summary concept maps in practice and pointing out promising directions for future research on the topic of this thesis.

Leveraging Linguistic Structure For Open Domain Information Extraction

This work replaces this large pattern set with a few patterns for canonically structured sentences, and shifts the focus to a classifier which learns to extract self-contained clauses from longer sentences to determine the maximally specific arguments for each candidate triple.

Open IE as an Intermediate Structure for Semantic Tasks

This paper studies Open Information Extraction’s (Open IE) output as an additional intermediate structure and finds that for tasks such as text comprehension, word similarity and word analogy it can be very effective.

The Proposition Bank: An Annotated Corpus of Semantic Roles

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.

Question-Answer Driven Semantic Role Labeling: Using Natural Language to Annotate Natural Language

The results show that non-expert annotators can produce high quality QA-SRL data, and also establish baseline performance levels for future work on this task, and introduce simple classifierbased models for predicting which questions to ask and what their answers should be.

Identifying Relations for Open Information Extraction

Two simple syntactic and lexical constraints on binary relations expressed by verbs are introduced in the ReVerb Open IE system, which more than doubles the area under the precision-recall curve relative to previous extractors such as TextRunner and woepos.

Open Language Learning for Information Extraction

Open Information Extraction (IE) systems extract relational tuples from text, without requiring a pre-specified vocabulary, by identifying relation phrases and associated arguments in arbitrary

Optimization of natural language processing components for robustness and scalability

This thesis focuses on the optimization of NLP components for robustness and scalability, and introduces a new transition-based parsing algorithm and a bootstrapping technique, which shows significant improvement for parsing accuracy and semantic role labeling.

Open Information Extraction from the Web

Open IE (OIE), a new extraction paradigm where the system makes a single data-driven pass over its corpus and extracts a large set of relational tuples without requiring any human input, is introduced.

Cambridge Grammar of English

Cambridge grammar of English , Cambridge grammar of English , کتابخانه مرکزی دانشگاه علوم پزشکی تهران