[PDF] Top 20 Synchronous Context Free Tree Grammars

... transduction grammars (Wu, 1997), and models in the Hiero system (Chiang, ...are context- free, which is often too restrictive for practical ...as synchronous tree adjoining ... See full document

... mildly context-sensitive formalisms were introduced [14], which can capture more linguistic phenomena than REGs and ...mildly context-sensitive formalisms are linear context-free rewriting ... See full document

... tion to the problem of computing the co-domain with the help of the product construction of Defi- nition 5. However, the co-domain of an MBOT is not necessarily representable by a TSG, which is not due to ... See full document

... that generates meaning representations of English sentences is found in Figure 1. For the sake of simplicity, this paper does not target the learning of word-meaning pairs, but it is possible to apply the technique ... See full document

... (or tree-based) models. One of the old- est models is the synchronous context-free gram- mar (Aho and Ullman, ...Top-down tree transduc- ers (Rounds, 1970; Thatcher, 1970) have been ... See full document

... arbitrary tree frag- ments instead of traditional depth-one context-free grammar ...particular, Tree Substitu- tion Grammars (TSGs) retain the context-free prop- erties of ... See full document

... of synchronous context-free grammars to handle multiple tar- gets, and describe methods for rule extraction, scoring, pruning, and search with these mod- ... See full document

... probabilistic context- free ...of context-free ...probabilistic tree-adjoining grammars (Schabes, 1992; Sarkar, 1998), for which consistency results have not yet been shown in ... See full document

... Let G be a 2-LCFG and let t be a parse tree assigned by G to a string w ∈ Σ ∗ . We can associate with t a dependency structure, by considering all rule occurrences in t that link two lexical elements from w. For ... See full document

... uses synchronous context-free grammars (SCFG) that derive pairs of translationally equivalent ...use tree-to-string transducers (called xRLNS) that describe pairs of the form (phrase- ... See full document

... In each step of the derivation, an adjunction site is chosen, and an elementary tree is adjoined at that site. In particular, if the adjunction operations up to that point contributed foot nodes that are oper- ... See full document

... a context-free derivation tree τ is mapped to a derived object τ ˜ = d ...A context-free deriva- tion tree τ can be decomposed into a subtree σ and a tree-context χ ... See full document

... regular tree or by deterministic and nondeterministic context-free grammars Further more, parsing the same string by both parsers has shown that the PA-parser has less number of moves (shifts) ... See full document

... of tree-adjoining grammars and synchronous tree-adjoining gram- mars (Section ...relating context-free languages, tree homo- morphisms, tree automata, and ... See full document

... to context-free ...probabilistic tree adjoining gram- ...probabilistic synchronous context-free gram- mars was shown by Nederhof and Satta (2011b), which departed from earlier ... See full document

... )) time (Ra- jasekaran, 1996; Rajasekaran and Yooseph, 1998). From the view point of CFTG, the languages gener- ated by TAGs were examined (Fujiyoshi and Kasai, 2000; Fujiyoshi, 2004; M¨oennich, 1997), and it was shown ... See full document

... Despite the similarity between CFGs and SCFGs, it turns out that there is a consid- erable gap in the space and time complexity for recognition and parsing based on these two classes. More specifically, for a fixed CFG, ... See full document

... possible choice of subset U. In the worst case, this may result in an exponential blow-up of the source grammar. In the case of context-free grammars, this is usually circumvented by casting the ... See full document

... mild context-sensitivity. Well-nested multiple context- free string grammars satisfy the additional condi- tion of a matching-like or well-nested rearrangement of the arguments of ... See full document

... In the remainder of this section and the next section, we will present a series of algorithms that produce increasingly faster parsing strategies, by gradually relaxing the strong “continuity” constraint made by the ... See full document