Efficient Information Extraction over Evolving Text Data
Authors:
- 1 April 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 943-952
Abstract
Most current information extraction (IE) approaches have considered only static text corpora, over which we typically have to apply IE only once. Many real-world text corpora however are dynamic. They evolve over time, and to keep extracted information up to date, we often must apply IE repeatedly, to consecutive corpus snapshots. We describe Cyclex, an approach that efficiently executes such repeated IE, by recycling previous IE efforts. Specifically, given a current corpus snapshot U, Cyclex identifies text portions of U that also appear in the previous corpus snapshot V. Since Cyclex has already executed IE over V, it can now recycle the IE results of these parts, by combining these results with the results of executing IE over the remaining parts of U, to produce the complete IE results for U. Realizing Cyclex raises many challenges, including modeling information extractors, exploring the trade-off between runtime and completeness in identifying overlapping text, and making informed, cost-based decisions between redoing IE from scratch and recycling previous IE results. We describe initial solutions to these challenges, and experiments over two real-world data sets that demonstrate the utility of our approach.Keywords
This publication has 14 references indexed in Scilit:
- Efficient Indexing of Versioned Document Sequences2007
- Efficient search in large textual collections with redundancy2007
- SQL Queries Over Unstructured Text Databases2007
- To search or to crawl?2006
- Efficient Batch Top-k Search for Dictionary-based Entity Recognition2006
- Personal information management with SEMEX2005
- An intelligent location management strategy for next generation wireless networks: a rule base approach2005
- Dynamic maintenance of web indexes using landmarks2003
- An adaptive model for optimizing performance of an incremental web crawler2001
- AnO(ND) difference algorithm and its variationsAlgorithmica, 1986