Sciweavers

69 search results - page 3 / 14
» Synchronization of Grammars
Sort
View
NAACL
2007
13 years 7 months ago
Worst-Case Synchronous Grammar Rules
We relate the problem of finding the best application of a Synchronous ContextFree Grammar (SCFG) rule during parsing to a Markov Random Field. This representation allows us to u...
Daniel Gildea, Daniel Stefankovic
ACL
2010
13 years 3 months ago
A Tree Transducer Model for Synchronous Tree-Adjoining Grammars
A characterization of the expressive power of synchronous tree-adjoining grammars (STAGs) in terms of tree transducers (or equivalently, synchronous tree substitution grammars) is...
Andreas Maletti
EACL
2006
ACL Anthology
13 years 6 months ago
Unifying Synchronous Tree Adjoining Grammars and Tree Transducers via Bimorphisms
We place synchronous tree-adjoining grammars and tree transducers in the single overarching framework of bimorphisms, continuing the unification of synchronous grammars and tree t...
Stuart M. Shieber
ACL
2008
13 years 7 months ago
Bayesian Learning of Non-Compositional Phrases with Synchronous Parsing
We combine the strengths of Bayesian modeling and synchronous grammar in unsupervised learning of basic translation phrase pairs. The structured space of a synchronous grammar is ...
Hao Zhang, Chris Quirk, Robert C. Moore, Daniel Gi...
ACL
2009
13 years 3 months ago
Asynchronous Binarization for Synchronous Grammars
Binarization of n-ary rules is critical for the efficiency of syntactic machine translation decoding. Because the target side of a rule will generally reorder the source side, it ...
John DeNero, Adam Pauls, Dan Klein