Synchronous Tree Substitution Grammars
Why Synchronous Tree Substitution Grammars?
... Abstract Synchronous tree substitution grammars are a translation model that is used in syntax-based machine ...bottom-up tree trans- ducer, which is the bottom-up analogue with one ...
9
Preservation of Recognizability for Synchronous Tree Substitution Grammars
... consider synchronous tree substitution grammars (S TSG ...weighted tree bimor- phisms, we show that both the forward and the backward application of an S TSG pre- serve recognizability ...
9
Toward Bayesian Synchronous Tree Substitution Grammars for Sentence Planning
... 9 Discussion and Conclusion We have presented a Bayesian nonparametric ap- proach to learning synchronous tree substitution grammars for sentence planning. This approach is designed to address ...
6
Synchronous Grammars as Tree Transducers
... Abstract Tree transducer formalisms were developed in the formal language theory community as generalizations of finite-state transduc- ers from strings to ...Independently, synchronous ...
8
Unifying Synchronous Tree Adjoining Grammars and Tree Transducers via Bimorphisms
... the tree relations defined by synchronous tree-substitution grammars were exactly the relations ...the tree language in such a bimorphism represents the set of derivation trees ...
8
Bayesian Synchronous Tree Substitution Grammar Induction and Its Application to Sentence Compression
... chronous tree-substitution (Eisner, 2003) or tree- adjoining grammars may better capture the pair- ...inducing synchronous tree-substitution grammars (STSG) using ...
11
Tree parsing with synchronous tree adjoining grammars
... F¨ul¨op et al. (2010) for the use of states in STSGs). The states make intersection with de- vices of finite-state power possible. More specif- ically, they allow for a product construction as is common in automata ...
12
A Tree Transducer Model for Synchronous Tree Adjoining Grammars
... 8 Conclusions We presented an alternative view on STAG us- ing tree transducers (or equivalently, STSG). Our main result shows that the syntactic characteri- zation of STAG as STSG plus adjunction rules also ...
10
A Decoder for Probabilistic Synchronous Tree Insertion Grammars
... P(r 5 ) = .9 Figure 1: The running example pSTAG G. In Fig. 1 we show the rules of our running ex- ample pSTAG, where the capital Roman letters are the nonterminals and the small Greek letters are the terminals. The ...
9
Probabilistic Synchronous Tree Adjoining Grammars for Machine Translation: The Argument from Bilingual Dictionaries
... A synchronous grammar formalism is built by synchronizing grammars from some base formal- ...elementary tree structures along with one or more combining ...context-free grammars, ...
8
D Tree Substitution Grammars
... Each elementary tree description can be seen as describing two aspects of the tree structure: one part of the description specifies phrase structure rules for lexical projections, a[r] ...
36
Inducing Tree-Substitution Grammars
... The MPD and MPT parsing algorithms require the computation of Monte-Carlo integrals over the large space of possible derivations or trees. Consequently, unless the distribution is extremely peaked the chance of sampling ...
44
Synchronous Tree Adjoining Grammars
... Synchronous Tree Adjoining Grammars Synchronous Tree Adjoining Grammars Stuart M Shieber Computer Science Department Hmward University Cambridge, MA USA Yves Schabes Computer and Information Sciences[.] ...
6
Generation and Synchronous Tree Adjoining Grammars
... Generation and Synchronous Tree Adjoining Grammars G e n e r a t i o n and S y n c h r o n o u s T r e e A d j o i n i n g G r a m m a r s Stuart M Shieber Aiken C o m p u t a t i o n Laboratory Divis[.] ...
6
Synchronous Context Free Tree Grammars
... context-free grammars, and weaker models of finite-state ...to tree languages next to string languages. In the realm of synchronous grammars, moreover, the technique generalizes to input ...
9
Synchronous Context-Free Tree Grammars
... context-free grammars, and weaker models of finite-state ...to tree languages next to string languages. In the realm of synchronous grammars, moreover, the technique generalizes to input ...
9
Node based Induction of Tree Substitution Grammars
... parse tree for a sentence, one can determine what CFG rules must have generated it simply by looking at each non- terminal node and its ...parse tree generated from a PTSG, it is less clear which rules ...
8
Native Language Detection with Tree Substitution Grammars
... More recently, (Sangati and Zuidema, 2011) pre- sented an elegantly simple heuristic inspired by tree kernels that they call DoubleDOP. They showed that manageable grammar sizes can be obtained from a corpus the ...
5
Insertion Operator for Bayesian Tree Substitution Grammars
... not. Note that we place no restriction on the initial trees. Our restricted formalism is a strict subset of TIG. We briefly refer to some differences between TAG, TIG and our insertion model. TAG generates tree ...
6
Blocked Inference in Bayesian Tree Substitution Grammars
... a tree substitution grammar is very challenging due to derivational am- ...small grammars composed of small generalis- able ...infinite tree sub- stitution grammar in a finite context free ...
6