Results 1 
2 of
2
Tree Parsing with Synchronous TreeAdjoining Grammars
, 2011
"... Restricting the input or the output of a grammarinduced translation to a given set of trees plays an important role in statistical machine translation. The problem for practical systems is to find a compact (and in particular, finite) representation of said restriction. For the class of synchronous ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Restricting the input or the output of a grammarinduced translation to a given set of trees plays an important role in statistical machine translation. The problem for practical systems is to find a compact (and in particular, finite) representation of said restriction. For the class of synchronous treeadjoining grammars, partial solutions to this problem have been described, some being restricted to the unweighted case, some to the monolingual case. We introduce a formulation of this class of grammars which is effectively closed under input and output restrictions to regular tree languages, i.e., the restricted translations can again be represented by grammars. Moreover, we present an algorithm that constructs these grammars for input and output restriction, which is inspired by Earley’s algorithm.
Weighted Monadic Datalog Tree
, 2010
"... We introduce a weighted tree transducer model that combines aspects of weighted top down tree transducers and monadic datalog; this allows us to specify information transport for nonadjacent nodes in a single rule. We will investigate four different semantics for our weighted tree transducer model ..."
Abstract
 Add to MetaCart
(Show Context)
We introduce a weighted tree transducer model that combines aspects of weighted top down tree transducers and monadic datalog; this allows us to specify information transport for nonadjacent nodes in a single rule. We will investigate four different semantics for our weighted tree transducer model and prove that they coincide under certain conditions. We present and prove the correctness of an algorithm which determines an approximate solution to the best translation problem of our tree transducer model and which determines a precise solution to the nbest hyperpaths problem of a given hypergraph. Finally, we show that our transducer model is at least as expressive as weighted topdown tree transducers. 1