Entity-aware dependency-based deep graph attention network for comparative preference classification

31Citations
Citations of this article
98Readers
Mendeley users who have this article in their library.

Abstract

This paper studies the task of comparative preference classification (CPC). Given two entities in a sentence, our goal is to classify whether the first (or the second) entity is preferred over the other or no comparison is expressed at all between the two entities. Existing works either do not learn entity-aware representations well and fail to deal with sentences involving multiple entity pairs or use sequential modeling approaches that are unable to capture long-range dependencies between the entities. Some also use traditional machine learning approaches that do not generalize well. This paper proposes a novel Entity-aware Dependency-based Deep Graph Attention Network (ED-GAT) that employs a multihop graph attention over a dependency graph sentence representation to leverage both the semantic information from word embeddings and the syntactic information from the dependency graph to solve the problem. Empirical evaluation shows that the proposed model achieves the state-of-the-art performance in comparative preference classification.

Cite

CITATION STYLE

APA

Ma, N., Mazumder, S., Wang, H., & Liu, B. (2020). Entity-aware dependency-based deep graph attention network for comparative preference classification. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (pp. 5782–5788). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2020.acl-main.512

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