Preemptive Information Extraction using Unrestricted Relation Discovery

@inproceedings{Shinyama2006PreemptiveIE,
  title={Preemptive Information Extraction using Unrestricted Relation Discovery},
  author={Y. Shinyama and S. Sekine},
  booktitle={HLT-NAACL},
  year={2006}
}
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… Expand
265 Citations
An Information Extraction Customizer
  • 6
  • PDF
Identifying Relations for Open Information Extraction
  • 1,151
  • PDF
TextRunner: Open Information Extraction on the Web
  • 308
  • PDF
SCHNÄPPER: A Web Toolkit for Exploratory Relation Extraction
  • 4
  • PDF
Open Information Extraction from the Web
  • 2,136
  • PDF
A Language Model for Extracting Implicit Relations
  • PDF
Exploratory relation extraction in large multilingual data
  • Highly Influenced
  • PDF
Entity Pairs , Types and Sentences X-Entity Y-Entity
  • 2014
Exploratory Relation Extraction in Large Text Corpora
  • 12
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 16 REFERENCES
Unsupervised Discovery of Scenario-Level Patterns for Information Extraction
  • 110
  • PDF
Discovering Relations among Named Entities from Large Corpora
  • 429
  • PDF
Extracting Patterns and Relations from the World Wide Web
  • 1,169
  • PDF
An Improved Extraction Pattern Representation Model for Automatic IE Pattern Acquisition
  • 138
  • PDF
Snowball: extracting relations from large plain-text collections
  • 1,300
  • PDF
Learning surface text patterns for a Question Answering System
  • 901
  • PDF
Automatically Generating Extraction Patterns from Untagged Text
  • E. Riloff
  • Computer Science
  • AAAI/IAAI, Vol. 2
  • 1996
  • 741
  • PDF
Covering Treebanks with GLARF
  • 29
  • PDF
A Maximum-Entropy-Inspired Parser
  • 1,821
  • PDF
Parsing and GLARFing
  • 19
...
1
2
...