Abstract
In this paper, we consider weighted synchronous context-free tree grammars and identify a certain syntactic restriction of these grammars. We suggest a new weighted tree transducer formalism and prove that the transformations of the restricted grammars are precisely those of the linear and nondeleting instances of these transducers. © 2014 Springer International Publishing Switzerland.
Cite
CITATION STYLE
Osterholzer, J. (2014). Pushdown machines for weighted context-free tree translation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8587 LNCS, pp. 290–303). Springer Verlag. https://doi.org/10.1007/978-3-319-08846-4_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
