Building a question answering test collection
SIGIR '00 Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval
Machine Learning
Class-based probability estimation using a semantic hierarchy
Computational Linguistics
Generalizing case frames using a thesaurus and the MDL principle
Computational Linguistics
On learning more appropriate Selectional Restrictions
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Freebase: a collaboratively created graph database for structuring human knowledge
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
Discriminative learning of selectional preference from unlabeled text
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
The linguistic structure of English web-search queries
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Decoding wikipedia categories for knowledge acquisition
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Open information extraction from the web
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Large-scale taxonomy mapping for restructuring and integrating wikipedia
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Unsupervised relation extraction by mining Wikipedia texts using information from the web
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
Open information extraction using Wikipedia
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
A latent dirichlet allocation method for selectional preferences
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Understanding the semantic structure of noun phrase queries
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Learning arguments and supertypes of semantic relations using recursive patterns
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Entity disambiguation for knowledge base population
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Discovering relations between noun categories
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
| Hi-index | 0.00 |
Whether automatically extracted or human generated, open-domain factual knowledge is often available in the form of semantic annotations (e.g., composed-by) that take one or more specific instances (e.g., rhapsody in blue, george gershwin) as their arguments. This paper introduces a method for converting flat sets of instance-level annotations into hierarchically organized, concept-level annotations, which capture not only the broad semantics of the desired arguments (e.g., 'People' rather than 'Locations'), but also the correct level of generality (e.g., 'Composers' rather than 'People', or 'Jazz Composers'). The method refrains from encoding features specific to a particular domain or annotation, to ensure immediate applicability to new, previously unseen annotations. Over a gold standard of semantic annotations and concepts that best capture their arguments, the method substantially outperforms three baselines, on average, computing concepts that are less than one step in the hierarchy away from the corresponding gold standard concepts.