Text Segmentation and Graph-based Method for Template Filling in Information Extraction
Published 1 November 2011
Ludovic Jean‐Louis, Romaric Besançon, Olivier Ferret
Citations14
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A twostep approach for template filling is proposed: first, an event-based segmentation is performed to select the parts of the text related to the target event; then, a graph-based method is applied to choose the most relevant entities in these parts for characterizing the event.
Abstract
In event-based Information Extraction systems, a major task is the automated filling from unstructured texts of a template gathering information related to a particular event. Such template filling may be a hard task when the information is scattered throughout the text and mixed with similar pieces of information relative to a different event. We propose in this paper a twostep approach for template filling: first, an event-based segmentation is performed to select the parts of the text related to the target event; then, a graph-based method is applied to choose the most relevant entities in these parts for characterizing the event. An evaluation of this model based on an annotated corpus for earthquake events shows that we achieve a 77 % F1-measure for the template-filling task. 1
Keywords
Computer Science
Computer Networks and ISDN SystemsThe anatomy of a large-scale hypertextual Web search engine
15,828 Citations1998Sergey Brin, Lawrence M. Page
This paper provides an in-depth description of Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext and looks at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want.
ScholarlyCommons (University of Pennsylvania)Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
12,978 Citations2001John Lafferty, Andrew McCallum +1 more
This work presents iterative parameter estimation algorithms for conditional random fields and compares the performance of the resulting models to HMMs and MEMMs on synthetic and natural-language data.
Message Understanding Conference-6
1,365 Citations1996Ralph Grishman, Beth Sundheim
MUC-6 introduced several innovations over prior MUCs, most notably in the range of different tasks for which evaluations were conducted and the motivations for the new format.
Graph-based ranking algorithms for sentence extraction, applied to text summarization
472 Citations2004Rada Mihalcea
This paper presents an innovative unsupervised method for automatic sentence extraction using graph-based ranking algorithms and shows that the results obtained compare favorably with previously published results on established benchmarks.
Overview of the TAC 2010 Knowledge Base Population Track
419 Citations2010Heng Ji, Ralph Grishman +3 more
An overview of the task definition and annotation challenges associated with KBP2010 is provided and the evaluation results and lessons that are learned are discussed based on detailed analysis.
ACM Computing SurveysAdaptive information extraction
190 Citations2006Jordi Turmo, Alicia Ageno +1 more
This survey describes and compares the main approaches to IE and the different ML techniques used to achieve Adaptive IE technology.
Template-Based Information Extraction without the Templates
172 Citations2011Nathanael Chambers, Dan Jurafsky
This paper describes an approach to template-based IE that removes this requirement and performs extraction without knowing the template structure in advance, and induces template structure very similar to hand-created gold structure from raw text.
Simple algorithms for complex relation extraction with applications to biomedical IE
126 Citations2005Ryan McDonald, Fernando Pereira +4 more
A simple two-stage method for extracting complex relations between named entities in text that creates a graph from pairs of entities that are likely to be related, and scores maximal cliques in that graph as potential complex relation instances.
Empirical Methods in Natural Language ProcessingEffective Information Extraction with Semantic Affinity Patterns and Relevant Regions
112 Citations2007Siddharth Patwardhan, Ellen Riloff
An information extraction system that decouples the tasks of finding relevant regions of text and applying extraction patterns is presented, using a self-trained relevant sentence classifier to identify relevant regions, and using a semantic affinity measure to automatically learn domain-relevant extraction patterns.
Integrating Unstructured Data into Relational Databases
97 Citations2006I.R. Mansuri, Sunita Sarawagi
This paper shows how to extend current highperforming models, Conditional Random Fields and their semi-markov counterparts, to effectively exploit a variety of recognition clues available in a database of entities, thereby significantly reducing the dependence on manually labeled training data.
Language Resources and EvaluationLIMA : A Multilingual Framework for Linguistic Analysis and Linguistic Resources Development and Evaluation
37 Citations2010Romaric Besançon, Gaël de Chalendar +5 more
This configurable platform has been designed to develop NLP based industrial applications while keeping enough flexibility to integrate various processes and resources and offers a set of tools dedicated to the test and the evaluation of linguistic modules.
Learning field compatibilities to extract database records from unstructured text
35 Citations2006Michael Wick, Aron Culotta +1 more
A record extraction system that assembles mentions into records (i.e. database tuples) is presented, and a probabilistic model of the compatibility between field values is constructed, then graph partitioning algorithms are employed to cluster fields into cohesive records.
Exploiting rich syntactic information for relation extraction from biomedical articles
31 Citations2007Yudong Liu, Zhongmin Shi +1 more
The experiments show that the use of rich syntactic features significantly outperforms shallow word-based features and the best accuracy is obtained by combining SRL features with tree kernels.
Using dependency parsing and probabilistic inference to extract relationships between genes, proteins and malignancies implicit among multiple biomedical research abstracts
27 Citations2006Ben Goertzel, Izabela Freire Goertzel +4 more
BioLiterate is a prototype software system which infers relationships involving relationships between genes, proteins and malignancies from research abstracts, and has initially been tested in the domain of the molecular genetics of oncology.
Computers and the HumanitiesFact distribution in Information Extraction
23 Citations2007Mark Stevenson
This paper compares three IE evaluation corpora, from the Message Understanding Conferences, and finds that a significant proportion of the facts mentioned therein are not described within a single sentence.
Extracting Data Records from Unstructured Biomedical Full Text
20 Citations2007Donghui Feng, Gully Burns +1 more
This paper derives a data record template including semantic language models from unstructured text and represent them with a discourse level Conditional Random Fields (CRF) model to achieve significant improvements on system performance compared with other baseline systems.
Segment-based hidden Markov models for information extraction
16 Citations2006Zhenmei Gu, Nick Cercone
This work proposes to use HMMs to model text at the segment level, in which the extraction process consists of two steps: a segment retrieval step followed by an extraction step, which achieves near zero extraction redundancy and has better overall extraction performance than traditional document HMM IE systems.
Exploiting structure for event discovery using the MDI algorithm
9 Citations2007Martina Naughton
The use of clustering methods for the task of grouping the text spans in a news article that refer to the same event are investigated, using a novel distance metric that exploits regularities in the sequential structure of events within a document.
Lecture notes in computer scienceUsing Temporal Cues for Segmenting Texts into Events
8 Citations2010Ludovic Jean‐Louis, Romaric Besançon +1 more
This article proposes new approaches to segment the text of news articles in units relative to only one event, in order to help the identification of relevant information associated with the main event of the news.