Learning Arguments and Supertypes of Semantic Relations Using Recursive Patterns

A challenging problem in open information extraction and text mining is the learning of the selectional restrictions of semantic relations. We propose a minimally supervised bootstrapping algorithm that uses a single seed and a recursive lexico-syntactic pattern to learn the arguments and the supertypes of a diverse set of semantic relations from the Web. We evaluate the performance of our algorithm on multiple semantic relations expressed using "verb", "noun", and "verb prep" lexico-syntactic patterns. Humanbased evaluation shows that the accuracy of the harvested information is about 90%. We also compare our results with existing knowledge base to outline the similarities and differences of the granularity and diversity of the harvested knowledge.

• Type: Journal
• Year: 2010
• Where: ACL
• Authors: Zornitsa Kozareva, Eduard H. Hovy
• Keywords: ACL 2010, Computational Linguistics, Lexico-syntactic Patterns, Multiple Semantic Relations, Semantic Relations