Hierarchical directed acyclic graph kernel

  • Authors:

  • Jun Suzuki;Yutaka Sasaki;Eisaku Maeda

  • Affiliations:

  • NTT Communication Science Laboratories, NTT Corporation, Kyoto, 619-0237 Japan and Graduate School of Information Science, Nara Institute of Science and Technology, Nara, 630-0192 Japan;NTT Communication Science Laboratories, NTT Corporation, Kyoto, 619-0237 Japan (Presently with Spoken Language Translation Research Laboratories, Advanced Telecommunications Research Institute Int ...;NTT Communication Science Laboratories, NTT Corporation, Kyoto, 619-0237 Japan

  • Venue:
  • Systems and Computers in Japan
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper devises a novel kernel function for natural language processing tasks. The new kernels, called Hierarchical Directed Acyclic Graph (HDAG) kernels, directly accept graphs whose nodes could contain graphs. HDAG data structures are needed to fully reflect the syntactic and semantic structures inherently possessed by natural language data. In this paper, we define the kernel function and describe how to achieve efficient calculation. Experimental results demonstrate that the proposed kernels are superior to other kernel functions, sequence kernels, dependency structure kernels, and bag-of-words kernels. © 2006 Wiley Periodicals, Inc. Syst Comp Jpn, 37(10): 58–68, 2006; Published online in Wiley InterScience (). DOI 10.1002/scj.20485