Graph Ensemble Learning over Multiple Dependency Trees for Aspect-level Sentiment Classification

Xiaochen Hou, Peng Qi, Guangtao Wang, Rex Ying, Jing Huang, Xiaodong He, Bowen Zhou

Abstract

Aspect-level Sentiment Classification (ASC) aims to determine the sentiment expressed toward specific aspect terms within a sentence. While dependency trees are effective at capturing long-range syntactic relations between aspects and opinion words, current models are often limited by the inaccuracies of single dependency parsers. We propose GraphMerge, a novel ensemble framework that constructs a unified graph by taking the union of edges from multiple dependency parsers. This approach leverages the "wisdom of the crowd" to mitigate parsing errors and improve structural robustness. Our results show that GraphMerge achieves state-of-the-art performance across multiple benchmarks, including the adversarial ARTS dataset, while maintaining high parameter efficiency.

Introduction: The Brittleness of Single-Parser Dependency Trees

In Aspect-level Sentiment Classification (ASC), identifying the sentiment toward a specific aspect is crucial. For instance, in the sentence "The exterior, unlike the food, is unwelcoming," the sentiment is negative for "exterior" but positive for "food." To capture these nuances, state-of-the-art models utilize dependency trees—syntactic maps that connect aspect terms directly to their relevant opinion words, even when they are separated by many tokens.

Dependency tree representation for a sentence with contrasting sentiments for different aspects.

However, dependency parsers are prone to errors, particularly on informal text like tweets or online reviews. If a single parser mistakenly links an aspect to the wrong opinion word, the model's prediction will likely fail. Most existing models rely on a single parser, making them "brittle" and vulnerable to these inevitable syntactic mistakes.

Methodology: The GraphMerge Framework

To address this vulnerability, we introduce GraphMerge, a graph ensemble technique that leverages multiple syntactic perspectives from different parsers (specifically CoreNLP, Stanza, and the Berkeley neural parser). Instead of a traditional ensemble that averages model outputs, GraphMerge operates at the structural level.

The GraphMerge architecture, featuring the Edge Union of multiple dependency trees and a Relational Graph Attention Network (RGAT).

The framework consists of three primary components:

  1. Edge Union: The model takes the union of all edges predicted by the various parsers to construct a single "ensemble graph." This ensures that if at least one parser identifies the correct syntactic relationship, the information is available to the model.
  2. Relational Graph Attention Network (RGAT): An RGAT is applied over this combined graph. To preserve syntactic integrity, the model distinguishes between different edge types, including parent-to-child, child-to-parent, and self-loops.
  3. BERT Backbone: The model utilizes BERT to generate initial word representations, which are then refined by the graph-based syntactic information.

By combining graphs before the learning phase, the GNN can learn to prioritize relevant edges and ignore the noise introduced by faulty parsers during training.

Experimental Results and Robustness

GraphMerge was evaluated on three standard benchmarks: SemEval 2014 Task 4 (Restaurant and Laptop), ACL 14 Twitter, and the Aspect Robustness Test Set (ARTS).

Key results include:

  • Laptop Dataset: Achieved an accuracy of 81.35%, outperforming the best single-tree baseline by over 1.4%.
  • Twitter Dataset: Reached 78.18% accuracy, demonstrating strong performance on noisy, informal text.
  • Adversarial Robustness: On the ARTS dataset, GraphMerge showed a significantly lower performance drop compared to BERT-only or single-parser models, proving it is less susceptible to "distractor" aspect terms.

Key Insights: Shortening the Hop Distance

A critical finding is that GraphMerge effectively reduces the syntactic distance between aspect terms and their corresponding opinion words. By taking the union of multiple parses, there is a higher probability that at least one parser will create a "shortcut" (a 1-hop or 2-hop connection) between relevant words, facilitating more efficient information flow within the GNN.

Furthermore, GraphMerge is highly efficient. Unlike label or feature ensembles that increase model size, GraphMerge maintains the same number of parameters as a single-tree model, providing a "free" upgrade in terms of memory and parameter efficiency.

Conclusion

GraphMerge demonstrates that structural ensemble learning is a powerful and efficient way to improve the robustness of syntax-aware models. While its success depends on the diversity of the underlying parsers, the "Edge Union" approach provides a significant buffer against the errors of individual parsers. Future work may explore weighted edge schemes or apply this logic to other syntax-dependent NLP tasks like Relation Extraction.

Summary updated

Abstract

Recent work on aspect-level sentiment classification has demonstrated the efficacy of incorporating syntactic structures such as dependency trees with graph neural networks(GNN), but these approaches are usually vulnerable to parsing errors. To better leverage syntactic information in the face of unavoidable errors, we propose a simple yet effective graph ensemble technique, GraphMerge, to make use of the predictions from differ-ent parsers. Instead of assigning one set of model parameters to each dependency tree, we first combine the dependency relations from different parses before applying GNNs over the resulting graph. This allows GNN mod-els to be robust to parse errors at no additional computational cost, and helps avoid overparameterization and overfitting from GNN layer stacking by introducing more connectivity into the ensemble graph. Our experiments on the SemEval 2014 Task 4 and ACL 14 Twitter datasets show that our GraphMerge model not only outperforms models with single dependency tree, but also beats other ensemble mod-els without adding model parameters.
BibTeX
@inproceedings{hou2021graph,
  author = {Xiaochen Hou and Peng Qi and Guangtao Wang and Rex Ying and Jing Huang and Xiaodong He and Bowen Zhou},
  title = {{Graph Ensemble Learning over Multiple Dependency Trees for Aspect-level Sentiment Classification}},
  booktitle = {Conference of the North American Chapter of the Association for Computational Linguistics},
  year = {2021},
  doi = {10.18653/v1/2021.naacl-main.229},
}
Figure