[PDF] Top 20 Exact Decoding with Multi Bottom Up Tree Transducers

... We presented our submission to the WMT15 shared translation task based on a novel, promising “full syntax, no pruning” tree-to-tree approach to statistical machine translation, inspired by Huang et al. ... See full document

... local multi bottom-up tree transducers (`MBOTs) as proposed in Maletti (2011) to statistical machine ...target tree fragments instead of a single tree fragment in their ... See full document

... that multi bottom–up tree transducers (MBOTs) (Lilin 1981; Arnold and Dauchet 1982; Engelfriet, Lilin, and Maletti 2009) provide a useful representation for natural language processing ... See full document

... We can observe from Table 1 that our `MBOT- based system outperforms the baseline. We ob- tain a BLEU score of 13.06, which is a gain of 0.46 BLEU points over the baseline. This im- provement is statistically significant ... See full document

... There are several benefits to this xRS formulation. First, it clarifies the model, in the same way that (Knight and Al-Onaizan, 1998; Kumar and Byrne, 2003) eluci- date other machine translation models in easily-grasped ... See full document

... derivation tree structure to allow sharing the ways an output span may align to a rhs substring of multiple consecutive variables; as a consequence, we must create some non-rule-labeled nodes, labeled by (with ... See full document

... We implement our VB training algorithm inside the tree transducer package Tiburon (May and Knight, 2006), and experiment with both manually set and automatically estimated priors. For our manually set priors, we ... See full document

... The tree languages in question are the multi- ple regular tree languages ((Raoult, 1997)) and the simple context-free tree languages ((Engel- friet and Maneth, ...the tree languages ... See full document

... We start by introducing the main model of this contribution. Extended top-down tree transducers (XTOP) are a generalization of the top-down tree transducers (TOP) of Rounds (1970) and Thatcher ... See full document

... Since the inception of the Universal Dependen- cies project (McDonald et al., 2013), a number of treebanks were converted from language spe- cific schemas to UD, in an effort to create a large multi-lingual ... See full document

... Macro Tree Transducers (MTTs) with regular look-ahead [EM99] can compute all MSO-definable ranked-tree-to-ranked-tree ...input tree in a top-down manner, and it is well-known that ... See full document

... the most prominent member of the first mathe- matically precise rendering of the notion of mild context-sensitivity. Well-nested multiple context- free string grammars satisfy the additional condi- tion of a ... See full document

... chronous tree substitution grammars (Eisner, 2003; Shieber, 2004) or multi bottom-up tree transducers (Lilin, 1978; Engelfriet et ...top-down tree transducer (XTOP), which ... See full document

... Evaluating a sentence ordering is a challenging task. Intrinsic evaluation that involves human judges to rank a set of sentence orderings is a nec- essary approach to this task (Barzilay et al., 2002; Okazaki et al., ... See full document

... expansion of the loss distribution for the stress event model. It turns out that the number of conditional loss distributions needed in our approach only increases mildly with the number of non-idiosyncratic factors. ... See full document

... induce tree to tree transducers us- ing a rule extraction algorithm that uses cost func- tions over pairs of tree fragments (instead of word- alignments), which increases the applicability of ... See full document

... the decoding strategy—how the spike trains are processed and the stimulus is estimated—is presented in the following section, where some related work is ...and tree induction is summarized in Section 4, ... See full document

... put/output transducers that captures the essence of process recipes and manufacturing resources, thus relating the syn- thesis of process-plan controllers to classical reactive syn- ...consider ... See full document

... Tree adjoining grammar (TAG) is a tree gram- mar formalism distinguished by its use of a tree adjunction operation. Traditional presentations of TAG, which we will assume familiarity with, take the ... See full document

... investigate unbiased sampling in addition to op- timisation. However, they start from a coarser upperbound with unigram probabilities, and their refinement strategies are based on exhaustive in- tersections with small ... See full document