论文信息 - Open Information Extraction to KBP Relations in 3 Hours

Open Information Extraction to KBP Relations in 3 Hours

We participated in both the English Slot Filling and Entity Linking in the 2013 TAC-KBP evaluation. Our Slot Filling system provides an answer to the following conjectures: Can Open Information Extraction (Open IE) form the basis of a high precision extractor for a set of target relations in an ontology? And, just as importantly, can this be done with a minimum of human knowledge engineering? We built rules to map Open IE extractions to KBP Slot Filling relations and found that just three hours of rule creation gave extractor precision of 0.79. Spending a total of 12 hours refining the rules increased precision slightly to 0.80 with recall near the median of other KBP systems.

Oren Etzioni | Daniel S. Weld | Stephen Soderland | John Gilmer | Robert Bart

[1] Oren Etzioni,et al. No Noun Phrase Left Behind: Detecting and Typing Unlinkable Entities , 2012, EMNLP.

[2] Oren Etzioni,et al. Identifying Relations for Open Information Extraction , 2011, EMNLP.

[3] Estevam R. Hruschka,et al. Toward an Architecture for Never-Ending Language Learning , 2010, AAAI.

[4] Oren Etzioni,et al. The Tradeoffs Between Open and Traditional Relation Extraction , 2008, ACL.

[5] Oren Etzioni,et al. Adapting Open Information Extraction to Domain-Specific Relations , 2010, AI Mag..

[6] Oren Etzioni,et al. Open Language Learning for Information Extraction , 2012, EMNLP.

[7] Oren Etzioni,et al. Open Information Extraction: The Second Generation , 2011, IJCAI.

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

[9] Oren Etzioni,et al. Machine Reading , 2006, AAAI.

[10] Oren Etzioni,et al. Entity Linking at Web Scale , 2012, AKBC-WEKEX@NAACL-HLT.