Convolution Kernels with Feature Selection for Natural Language Processing Tasks

Convolution kernels, such as sequence and tree kernels, are advantageous for both the concept and accuracy of many natural language processing (NLP) tasks. Experiments have, however, shown that the over-fitting problem often arises when these kernels are used in NLP tasks. This paper discusses this issue of convolution kernels, and then proposes a new approach based on statistical feature selection that avoids this issue. To enable the proposed method to be executed efficiently, it is embedded into an original kernel calculation process by using sub-structure mining algorithms. Experiments are undertaken on real NLP tasks to confirm the problem with a conventional method and to compare its performance with that of the proposed method.

• Type: Conference
• Year: 2004
• Where: ACL
• Authors: Jun Suzuki, Hideki Isozaki, Eisaku Maeda
• Keywords: ACL 2004, ACL 2007, Convolution Kernels, NLP Tasks, Tree Kernels