Location of Repository

Probabilistic declarative information extraction

By Daisy Zhe Wang, Eirinaios Michelakis, Michael J. Franklin, Minos Garofalakis and Joseph M. Hellerstein

Abstract

Abstract — Unstructured text represents a large fraction of the world’s data. It often contains snippets of structured information (e.g., people’s names and zip codes). Information Extraction (IE) techniques identify such structured information in text. In recent years, database research has pursued IE on two fronts: declarative languages and systems for managing IE tasks, and probabilistic databases for querying the output of IE. In this paper, we make the first step to merge these two directions, without loss of statistical robustness, by implementing a state-ofthe-art statistical IE model – Conditional Random Fields (CRF) – in the setting of a Probabilistic Database that treats statistical models as first-class data objects. We show that the Viterbi algorithm for CRF inference can be specified declaratively in recursive SQL. We also show the performance benefits relative to a standalone open-source Viterbi implementation. This work opens up the optimization opportunities for queries involving both inference and relational operators over IE models. I

Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.188.7843
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.berkeley.edu/%7E... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.