Composite semantic relation classification

2Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Different semantic interpretation tasks such as text entailment and question answering require the classification of semantic relations between terms or entities within text. However, in most cases it is not possible to assign a direct semantic relation between entities/terms. This paper proposes an approach for composite semantic relation classification, extending the traditional semantic relation classification task. Different from existing approaches, which use machine learning models built over lexical and distributional word vector features, the proposed model uses the combination of a large commonsense knowledge base of binary relations, a distributional navigational algorithm and sequence classification to provide a solution for the composite semantic relation classification problem.

Cite

CITATION STYLE

APA

Barzegar, S., Freitas, A., Handschuh, S., & Davis, B. (2017). Composite semantic relation classification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10260 LNCS, pp. 406–417). Springer Verlag. https://doi.org/10.1007/978-3-319-59569-6_49

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