# Composite Semantic Relation Classification

Source: [Composite Semantic Relation Classification](<https://www.sota2.com/research/paper/68fa64651e209131cea045ef>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-27T05:54:50.233Z

Authors: Siamak Barzegar, Andre Freitas, Siegfried Handschuh, Brian Davis

Published: 2018-05-16T20:41:33.000Z

## 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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1805.06521>)

[PDF](<https://arxiv.org/pdf/1805.06521.pdf>)
