Conference paper
Reasoning about RoboCup soccer narratives
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
We introduce a new convolution kernel for labeled ordered trees with arbitrary subgraph features, and an efficient algorithm for computing the kernel with the same time complexity as that of the parse tree kernel. The proposed kernel is extended to allow mutations of labels and structures without increasing the order of computation time. Moreover, as a limit of generalization of the tree kernels, we show a hardness result in computing kernels for unordered rooted labeled trees with arbitrary subgraph features.
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
Annina Riedhauser, Viacheslav Snigirev, et al.
CLEO 2023
S. Winograd
Journal of the ACM