Adapting open information extraction to domain-specific relations

AI Magazine

Volumn 31, Issue 3, 2011, Pages 93-102

  Soderland, Stephen ^a   Roof, Brendan ^a   Qin, Bo ^a   Xu, Shi ^a   Mausam, ^a   Etzioni, Oren ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION RETRIEVAL; ONTOLOGY;

DOMAIN SPECIFIC; DOMAIN-SPECIFIC ONTOLOGIES; FREE TEXTS; QUESTION ANSWERING; SURFACE FORMS; TARGET DOMAIN; TEXT CORPORA; TRAINING EXAMPLE;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 79953704003     PISSN: 07384602     EISSN: None     Source Type: Journal    
DOI: 10.1609/aimag.v31i3.2305     Document Type: Article

References (22)

1. Agichtein, E., and Gravano, L. 2000. Snowball: Extracting Relations from Large Plain- Text Collections. In Proceedings of the Fifth ACM International Conference on Digital Libraries. New York: Association for Computing Machinery.
2. Banko, M., and Etzioni, O. 2008. The Tradeoffs Between Traditional and Open Relation Extraction. In Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics, 600-607. Stroudsburg, PA: Association for Computational Linguistics.
3. Banko, M.; Cafarella, M.; Soderland, S.; Broadhead, M.; and Etzioni, O. 2007. Open Information Extraction from the Web. In Proceedings of the 20th International Joint Conference on Artificial Intelligence. Menlo Park, CA: AAAI Press.
4. Califf, M. E., and Mooney, R. J. 1999. Relational Learning of Pattern-Match Rules for Information Extraction. In Proceeding of the 16th National Conference on Artificial Intelligence (AAAI-99), 329-334. Menlo Park, CA: AAAI Press.
5. Culotta, A.; McCallum, A.; and Betz, J. 2006. Integrating Probabilistic Extraction Models and Data Mining to Discover Relations and Patterns in Text. Paper presented at the Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics, Brooklyn, NY, 4-9 June.
6. Daume, H., III. 2007. Frustratingly Easy Domain Adaptation. In Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics. Stroudsburg, PA: Association for Computational Linguistics.
7. Etzioni, O.; Cafarella, M.; Downey, D.; Kok, S.; Popescu, A.; Shaked, T.; Soderland, S.; Weld, D.; and Yates, A. 2005. Unsupervised Named-Entity Extraction from the Web: An Experimental Study. Artificial Intelligence 165(1): 91-134. (Pubitemid 40556657)
8. Grishman, R., and Sundheim, B. 1996. Message Understanding Conference-6: A Brief History. Paper presented at the Sixteenth International Conference on Computational Linguistics (COLING-96), Copenhagen, Denmark, 5-9 August.
9. Hobbs, J.; Appelt, D.; Tyson, M.; Bear, J.; and Israel, D. 1992. Description of the FASTUS System Used for MUC4. In Proceedings of the Fourth Message Understanding Conference, 268-275. San Francisco: Morgan Kaufmann Publishers.
10. Krupka, G.; Jacobs, P.; Rau, L.; and Iwanska, L. 1991. GE: Description of the NLToolset System as Used for MUC-3. In Proceedings of the Third Message Understanding Conference. San Francisco: Morgan Kaufmann Publishers.
11. Lafferty, J.; McCallum, A.; and Pereira, F. 2001. Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data. In Proceedings of the Eighteenth International Conference on Machine Learning. San Francisco: Morgan Kaufmann Publishers.
12. Miller, S.; Crystal, M.; Fox, H.; Ramshaw, L.; Schwartz, R.; Stone, R.; and Weischedel, R. 1998. BBN: Description of the SIFT System as Used for MUC-7. In Proceedings of the Seventh Message Understanding Conference. Washington, DC: National Institute of Standards and Technology.
13. Moschitti, A.; Morarescu, P.; and Harabagiu, S. 2003. Open Domain Information Extraction Via Automatic Semantic Labeling. In Proceedings of the Sixteenth International Florida Artificial Intelligence Research Society Conference. Menlo Park, CA: AAAI Press.
14. Riloff, E. 1996. Automatically Constructing Extraction Patterns from Untagged Text. In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-96), 1044-1049. Menlo Park, CA: AAAI Press.
15. Riloff, E., and Jones, R. 1999. Learning Dictionaries for Information Extraction by Multi- level Boot-strapping. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), 1044-1049. Menlo Park, CA: AAAI Press.
16. Rosenfeld, B., and Feldman, R. 2007. Using Corpus Statistics on Entities to Improve Semi-Supervised Relation Extraction from the Web. In Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics, 600-607. Stroudsburg, PA: Association for Computational Linguistics.
17. Settles, B., and Craven, M. 2008. An Analysis of Active Learning Strategies For Sequence Labeling Tasks. Paper presented at the 2001 Conference on Empirical Methods in Natural Language Processing (EMNLP), 3-4 June.
18. Shinyama, Y., and Sekine, S. 2006. Preemptive Information Extraction Using Unrestricted Relation Discovery. Paper presented at the Human Language Technology Con- Articles 102 AI MAGAZINE ference of the North American Chapter of the Association for Computational Linguistics, Brooklyn, NY, 4-9 June.
19. Skounakis, M.; Craven, M.; and Ray, S. 2003. Hierarchical Hidden Markov Models for Information Extraction. In Proceedings of the 18th International Joint Conference on Artificial Intelligence, 427-433. San Francisco: Morgan Kaufmann Publishers.
20. Soderland, S. 1999. Learning Information Extraction Rules for Semi-Structured and Free Text. Machine Learning 34(1-3): 233-272.
21. Talukdar, P. P.; Reisinger, J.; Pasca, M.; Ravichandran, D.; Bhagat, R.; and Pereira, F. 2008. Weakly Supervised acquisition of Labeled Class Instances Using Graph Random Walks. Paper presented at the 2001 Conference on Empirical Methods in Natural Language Processing (EMNLP), 3-4 June.
22. Thompson, C.; Califf, M.; and Mooney, R. 1999. Active Learning for Natural Language Parsing and Information Extraction. In Proceedings of the 16th International Machine Learning Conference (ICML-99), 406-414. San Francisco: Morgan Kaufmann Publishers.