Hierarchical Directed Acyclic Graph Kernel: Methods for Structured Natural Language Data

by: Jun Suzuki, Tsutomu Hirao, Yutaka Sasaki, Eisaku Maeda

(2003)

View FullText article

CiteSeer (at Penn State), CiteSeer (at MIT), CiteSeer (at Zurich), CiteSeer (at Singapore)

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

vlachmore

Find related articles with these CiteULike tags

graph, graph_kernel, hierarchical, kernel

摘要

This paper proposes the "Hierarchical Directed Acyclic Graph (HDAG) Kernel" for structured natural language data. The HDAGKernel directly accepts several levels of both chunks and their relations, and then efficiently computes the weighed sum of the number of common attribute sequences of the HDAGs. We applied the proposed method to question classification and sentence alignment tasks to evaluate its performance as a similarity measure and a kernel function. The results of the...

@misc{citeulike:2281287, abstract = {This paper proposes the "Hierarchical Directed Acyclic Graph (HDAG) Kernel" for structured natural language data. The HDAGKernel directly accepts several levels of both chunks and their relations, and then efficiently computes the weighed sum of the number of common attribute sequences of the HDAGs. We applied the proposed method to question classification and sentence alignment tasks to evaluate its performance as a similarity measure and a kernel function. The results of the...}, author = {Suzuki, Jun and Hirao, Tsutomu and Sasaki, Yutaka and Maeda, Eisaku }, citeulike-article-id = {2281287}, keywords = {graph, graph\_kernel, hierarchical, kernel}, posted-at = {2008-01-23 18:02:14}, priority = {2}, title = {Hierarchical Directed Acyclic Graph Kernel: Methods for Structured Natural Language Data}, url = {http://citeseer.ist.psu.edu/suzuki03hierarchical.html}, year = {2003} }

RIS record

TY - GEN ID - citeulike:2281287 L3 - citeulike-article-id:2281287 N2 - This paper proposes the "Hierarchical Directed Acyclic Graph (HDAG) Kernel" for structured natural language data. The HDAGKernel directly accepts several levels of both chunks and their relations, and then efficiently computes the weighed sum of the number of common attribute sequences of the HDAGs. We applied the proposed method to question classification and sentence alignment tasks to evaluate its performance as a similarity measure and a kernel function. The results of the... TI - Hierarchical Directed Acyclic Graph Kernel: Methods for Structured Natural Language Data KW - graph KW - graph_kernel KW - hierarchical KW - kernel AU - Suzuki, Jun AU - Hirao, Tsutomu AU - Sasaki, Yutaka AU - Maeda, Eisaku PY - 2003/// UR - http://citeseer.ist.psu.edu/suzuki03hierarchical.html ER -

RIS BibTeX