Affiliation:
1. Department of Computer Science, Technische Universität Dresden, 01062 Dresden, Germany
Abstract
We show how to train a weighted regular tree grammar such that it best approximates a weighted linear context-free tree grammar concerning the Kullback–Leibler divergence between both grammars. Furthermore, we construct a regular tree grammar that approximates the tree language induced by a context-free tree grammar.
Publisher
World Scientific Pub Co Pte Lt
Subject
Computer Science (miscellaneous)