JOURNAL ARTICLE

Using a Hybrid Convolution Tree Kernel for Semantic Role Labeling

Wanxiang CheMin ZhangAiTi AwChew‐Lim TanTing LiuSheng Li

Year: 2008 Journal:   ACM Transactions on Asian Language Information Processing Vol: 7 (4)Pages: 1-23   Publisher: Association for Computing Machinery

Abstract

As a kind of Shallow Semantic Parsing, Semantic Role Labeling (SRL) is gaining more attention as it benefits a wide range of natural language processing applications. Given a sentence, the task of SRL is to recognize semantic arguments (roles) for each predicate (target verb or noun). Feature-based methods have achieved much success in SRL and are regarded as the state-of-the-art methods for SRL. However, these methods are less effective in modeling structured features. As an extension of feature-based methods, kernel-based methods are able to capture structured features more efficiently in a much higher dimension. Application of kernel methods to SRL has been achieved by selecting the tree portion of a predicate and one of its arguments as feature space, which is named as predicate-argument feature (PAF) kernel. The PAF kernel captures the syntactic tree structure features using convolution tree kernel, however, it does not distinguish between the path structure and the constituent structure. In this article, a hybrid convolution tree kernel is proposed to model different linguistic objects. The hybrid convolution tree kernel consists of two individual convolution tree kernels. They are a Path kernel, which captures predicate-argument link features, and a Constituent Structure kernel, which captures the syntactic structure features of arguments. Evaluations on the data sets of the CoNLL-2005 SRL shared task and the Chinese PropBank (CPB) show that our proposed hybrid convolution tree kernel statistically significantly outperforms the previous tree kernels. Moreover, in order to maximize the system performance, we present a composite kernel through combining our hybrid convolution tree kernel method with a feature-based method extended by the polynomial kernel. The experimental results show that the composite kernel achieves better performance than each of the individual methods and outperforms the best reported system on the CoNLL-2005 corpus when only one syntactic parser is used and on the CPB corpus when automated syntactic parse results and correct syntactic parse results are used respectively.

Keywords:
Tree kernel Computer science Artificial intelligence Kernel (algebra) Kernel embedding of distributions Predicate (mathematical logic) String kernel Tree (set theory) Semantic role labeling Natural language processing Kernel method Sentence Mathematics Support vector machine Programming language Discrete mathematics

Metrics

17
Cited By
2.79
FWCI (Field Weighted Citation Impact)
68
Refs
0.93
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Natural Language Processing Techniques
Physical Sciences →  Computer Science →  Artificial Intelligence
Topic Modeling
Physical Sciences →  Computer Science →  Artificial Intelligence
Text Readability and Simplification
Physical Sciences →  Computer Science →  Artificial Intelligence

Related Documents

BOOK-CHAPTER

Chinese Semantic Role Labeling Based on the Hybrid Convolution Tree Kernel

Chengmin WangJike Ge

Advances in intelligent systems and computing Year: 2012 Pages: 479-486
JOURNAL ARTICLE

Semantic Role Labeling Using a Grammar-Driven Convolution Tree Kernel

Min ZhangWanxiang CheGuodong ZhouAiTi AwChew Lim TanTing LiuSheng Li

Journal:   IEEE Transactions on Audio Speech and Language Processing Year: 2008 Vol: 16 (7)Pages: 1315-1329
JOURNAL ARTICLE

Tree kernel-based semantic role labeling with enriched parse tree structure

Guodong ZhouJunhui LiJianxi FanQiaoming Zhu

Journal:   Information Processing & Management Year: 2010 Vol: 47 (3)Pages: 349-362
© 2026 ScienceGate Book Chapters — All rights reserved.