Discrete Mathematics in Computer Science
Discrete Mathematics in Computer Science
Unsupervised learning of semantic relation composition
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
A model for composing semantic relations
IWCS '11 Proceedings of the Ninth International Conference on Computational Semantics
Research on Co-occurrence Regularity of Semantic Relations in Objective Knowledge System
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03
Composition of semantic relations: Theoretical framework and case study
ACM Transactions on Speech and Language Processing (TSLP)
Hi-index | 0.00 |
This paper considers the composition of tuples from two relations in order to derive additional tuples of one of these relations. Our purpose is to determine when the composition is plausible and for which relation the new tuples are derived. We first present a formal definition of composition and our extension to it. We next define conditions on the domains and ranges of the relations that are necessary for extended composition to occur. We then show how a set of underlying attributes, independently specified for each relation, is sufficient for determining plausible composition, when the primitives are combined according to an algebra. Finally, we apply our method for extended composition to a representative group of semantic relations and evaluate the results.