Improving Aspect Term Extraction with Bidirectional Dependency Tree Representation
arXiv:1805.07889
Abstract
Aspect term extraction is one of the important subtasks in aspect-based sentiment analysis. Previous studies have shown that using dependency tree structure representation is promising for this task. However, most dependency tree structures involve only one directional propagation on the dependency tree. In this paper, we first propose a novel bidirectional dependency tree network to extract dependency structure features from the given sentences. The key idea is to explicitly incorporate both representations gained separately from the bottom-up and top-down propagation on the given dependency syntactic tree. An end-to-end framework is then developed to integrate the embedded representations and BiLSTM plus CRF to learn both tree-structured and sequential features to solve the aspect term extraction problem. Experimental results demonstrate that the proposed model outperforms state-of-the-art baseline models on four benchmark SemEval datasets.
arXiv commentAccepted by TASLP
References in corpus (11)
- Adam: A Method for Stochastic Optimization
- Efficient Estimation of Word Representations in Vector Space
- TensorFlow: Large-Scale Machine Learning on Heterogeneous Distributed Systems
- End-to-End Relation Extraction using LSTMs on Sequences and Tree Structures
- A Dependency-Based Neural Network for Relation Classification
- Improved Neural Machine Translation with a Syntax-Aware Encoder and Decoder
- Bidirectional Tree-Structured LSTM with Head Lexicalization
- Lifelong Learning CRF for Supervised Aspect Extraction
- Bidirectional Recursive Neural Networks for Token-Level Labeling with Structure
- Multi-task memory networks for category-specific aspect and opinion terms co-extraction
- Unsupervised Aspect Term Extraction with B-LSTM & CRF using Automatically Labelled Datasets