Root-Weighted Tree Automata and their Applications to Tree Kernels
Formal Languages and Automata Theory
2015-01-19 v1
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.
Keywords
Cite
@article{arxiv.1501.03895,
title = {Root-Weighted Tree Automata and their Applications to Tree Kernels},
author = {Ludovic Mignot and Nadia Ouali-Sebti and Djelloul Ziadi},
journal= {arXiv preprint arXiv:1501.03895},
year = {2015}
}