[PDF] Top 20 String to Tree Multi Bottom up Tree Transducers

... the rules become too restrictive. Second, minimal rules (i.e., rules that cannot be obtained from other extracted rules) typically consist of a few lexi- cal items only and are thus not the most suitable to translate ... See full document

... In this paper we describe Travatar, a forest-to-string machine translation (MT) engine based on tree transducers. It pro- vides an open-source C++ implementation for the entire ... See full document

... CFG, tree ad- joining grammar (TAG; Joshi, Levy, and Takahashi 1975; Joshi and Schabes 1997), and more complex systems, as well as synchronous context-free grammar (SCFG) (Aho and Ullman 1972) and synchronous ... See full document

... the string (a, b, c) is the tree C(a, C(b, C(c, ...a tree, but with END yielding the empty string, we have the corresponding ...by multi-variable ...output string, we must study ... 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

... Much of natural language work over the past decade has employed probabilistic finite-state transducers (FSTs) operating on strings. This has occurred somewhat under the influence of speech recognition, where ... See full document

... free string grammars satisfy the additional condi- tion of a matching-like or well-nested rearrangement of the arguments of non-terminals on the right-hand sides of possible rules allowed by this type of gram- ... 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

... Tree transducers that model expressive linguistic phenomena often require word- alignments and a heuristic rule extractor to induce their ...of tree/string pairs is small compared to the size ... See full document

... In this paper I present a Master’s thesis proposal in syntax-based Statistical Machine Translation. I propose to build discrimina- tive SMT models using both tree-to-string and tree-to-tree ... See full document

... that we use (in a graphical representation of the trees and the alignment). Recently, a shallow ver- sion of MBOT has been integrated into the popular Moses toolkit (Braune et al., 2013). Our imple- mentation is exact in ... See full document

... weighted tree transducer may define a probabil- ity distribution, either a joint distribution over input and output pairs or a conditional distribution of the output given the ... See full document

... In order to ensure a robust and efficient archi- tecture, T ¨uSBL, a similarity-based chunk parser, is organized in a three-level architecture, with the output of each level serving as input for the next higher level. ... 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

... 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

... dependency tree as a finite ...on multi- text ...eralized tree-to-tree and tree-to-string transduc- ...or tree-based transduc- tion rules to model both source and target ... See full document

... output tree is typically the best parse of the string that we want to ...single tree, we want to use all parses of this sentence together with their parse ...weighted tree language, and ... See full document

... a string-generating device that can be thought of a context-free grammar in which each nonterminal has a fixed number of parameter positions, each of which contains a ...make up the strings for the ... 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

... the tree- to-graph model investigated ...bare string, these systems exploit features obtained from a precom- puted run of a dependency parser, thus committing to some best parse tree, similarly to ... See full document