论文信息 - Semi-Automatic Generation of Linear Event Extraction Patterns for Free Texts

Semi-Automatic Generation of Linear Event Extraction Patterns for Free Texts

In this paper we describe a semi-automatic approach to generating event extraction patterns for free texts. The algorithm is composed of four steps: we automatically extract possible events from a corpus of free documents, cluster them using dependency-based parse tree paths, validate random samples from each cluster and generate linear patterns using positive event clusters. We compare our algorithm with the system that uses manually created patterns.

Sergey Serebryakov | Daria Dzendzik

[1] Oren Etzioni,et al. Open Information Extraction from the Web , 2007, CACM.

[2] Nguyen Bach,et al. A Review of Relation Extraction , 2007 .

[3] Sergey Brin,et al. Extracting Patterns and Relations from the World Wide Web , 1998, WebDB.

[4] John Wilkes,et al. Hewlett-Packard Laboratories , 1988 .

[5] Doug Downey,et al. Web-scale information extraction in knowitall: (preliminary results) , 2004, WWW '04.

[6] Ralph Grishman,et al. Automatic Acquisition of Domain Knowledge for Information Extraction , 2000, COLING.

[7] Massih-Reza Amini,et al. Learning from Multiple Partially Observed Views - an Application to Multilingual Text Categorization , 2009, NIPS.

[8] Huang Xun,et al. A Review of Relation Extraction , 2013 .

[9] Oren Etzioni,et al. TextRunner: Open Information Extraction on the Web , 2007, NAACL.

[10] Frank Puppe,et al. Integrating the Rule-Based IE Component TextMarker into UIMA , 2008, LWA.

[11] Stephen Soderland,et al. Learning Information Extraction Rules for Semi-Structured and Free Text , 1999, Machine Learning.

[12] Sriram Raghavan,et al. Regular Expression Learning for Information Extraction , 2008, EMNLP.

[13] Luis Gravano,et al. Snowball: extracting relations from large plain-text collections , 2000, DL '00.

[14] Ryan McDonald. Extracting Relations from Unstructured Text , 2004 .