Root-Weighted Tree Automata and their Applications to Tree Kernels

TL;DR

This paper introduces root-weighted tree automata supported only on final states, demonstrating their sequentializability, closure properties, and application to efficiently compute subtree kernels for finite tree languages.

Contribution

It presents a new class of weighted tree automata with weights on final states, along with their theoretical properties and practical application to tree kernel computation.

Findings

Automata are sequentializable.

Closure properties under classical operations are established.

Efficient subtree kernel computation method is developed.

Abstract

In this paper, we define a new kind of weighted tree automata where the weights are only supported by final states. We show that these automata are sequentializable and we study their closures under classical regular and algebraic operations. We then use these automata to compute the subtree kernel of two finite tree languages in an efficient way. Finally, we present some perspectives involving the root-weighted tree automata.