Preemptive information extraction using unrestricted relation discovery

Published 1 January 2006Open access

Yusuke Shinyama, Satoshi Sekine

DOI10.3115/1220835.1220874

Citations240

TL;DR

A technique called Unrestricted Relation Discovery is proposed that discovers all possible relations from texts and presents them as tables in order to extend the boundary of Information Extraction systems.

Abstract

We are trying to extend the boundary of Information Extraction (IE) systems. Existing IE systems require a lot of time and human effort to tune for a new scenario. Preemptive Information Extraction is an attempt to automatically create all feasible IE systems in advance without human intervention. We propose a technique called Unrestricted Relation Discovery that discovers all possible relations from texts and presents them as tables. We present a preliminary system that obtains reasonably good results.

Keywords

Computer Science

A maximum-entropy-inspired parser

1,496 Citations2000Eugene Charniak

A new parser for parsing down to Penn tree-bank style parse trees that achieves 90.1% average precision/recall for sentences of length 40 and less and 89.5% when trained and tested on the previously established sections of the Wall Street Journal treebank is presented.

<i>Snowball</i>

1,169 Citations2000Eugene Agichtein, Luis Gravano

This paper develops a scalable evaluation methodology and metrics for the task, and presents a thorough experimental evaluation of Snowball and comparable techniques over a collection of more than 300,000 newspaper documents.

Lecture notes in computer scienceExtracting Patterns and Relations from the World Wide Web

1,007 Citations1999Sergey Brin

This paper presents a technique which exploits the duality between sets of patterns and relations to grow the target relation starting from a small sample and uses it to extract a relation of (author,title) pairs from the World Wide Web.

Learning surface text patterns for a Question Answering system

813 Citations2001Deepak Ravichandran, Eduard Hovy

This paper has developed a method for learning an optimal set of surface text patterns automatically from a tagged corpus, and calculates the precision of each pattern, and the average precision for each question type.

View PDF

Automatically generating extraction patterns from untagged text

620 Citations1996Ellen Riloff

This work has developed a system called AutoSlog-TS that creates dictionaries of extraction patterns using only untagged text, and in experiments with the MUG-4 terrorism domain, created a dictionary of extraction pattern that performed comparably to a dictionary created by autoSlog, using only preclassified texts as input.

Discovering relations among named entities from large corpora

403 Citations2004Takaaki Hasegawa, Satoshi Sekine +1 more

Using one year of newspapers reveals not only that the relations among named entities could be detected with high recall and precision, but also that appropriate labels could be automatically provided for the relations.

View PDF

An improved extraction pattern representation model for automatic IE pattern acquisition

119 Citations2003Kiyoshi Sudo, Satoshi Sekine +1 more

A new model, the Subtree model, based on arbitrary subtrees of dependency trees, is introduced, describing a discovery procedure for this model and demonstrating experimentally an improvement in recall using Subtree patterns.

View PDF

Unsupervised discovery of scenario-level patterns for Information Extraction

89 Citations2000Roman Yangarber, Ralph Grishman +2 more

A system for finding patterns automatically from un-annotated text starting with a small initial set of seed patterns proposed by the user and applying an incremental discovery procedure to identify new patterns exhibit high precision and recall.

View PDF

Covering Treebanks with GLARF

27 Citations2001Adam Meyers, Ralph Grishman +2 more

GLARF, a framework for predicate argument structure, is introduced by report on converting the Penn Treebank II into GLARF by automatic methods that achieved about 90% precision/recall on test sentences from thePenn Treebank.

View PDF