PATTY: A taxonomy of relational patterns with semantic types

326Citations
Citations of this article
342Readers
Mendeley users who have this article in their library.

Abstract

This paper presents PATTY: a large resource for textual patterns that denote binary relations between entities. The patterns are semanti-cally typed and organized into a subsumption taxonomy. The PATTY system is based on efficient algorithms for frequent itemset mining and can process Web-scale corpora. It harnesses the rich type system and entity population of large knowledge bases. The PATTY taxonomy comprises 350,569 pattern synsets. Random-sampling-based evaluation shows a pattern accuracy of 84.7%. PATTY has 8,162 subsumptions, with a random-sampling-based precision of 75%. The PATTY resource is freely available for interactive access and download. © 2012 Association for Computational Linguistics.

Cite

CITATION STYLE

APA

Nakashole, N., Weikum, G., & Suchanek, F. (2012). PATTY: A taxonomy of relational patterns with semantic types. In EMNLP-CoNLL 2012 - 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, Proceedings of the Conference (pp. 1135–1145).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free