论文信息 - Regular transductions with MCFG input syntax

Regular transductions with MCFG input syntax

We show that regular transductions for which the input part is generated by some multiple context-free grammar can be simulated by synchronous multiple context-free grammars. We prove that synchronous multiple context-free grammars are strictly more powerful than this combination of regular transductions and multiple context-free grammars.

Heiko Vogler | Mark-Jan Nederhof

[1] Tadao Kasami,et al. On Multiple Context-Free Grammars , 1991, Theor. Comput. Sci..

[2] Richard Edwin Stearns,et al. Syntax-Directed Transduction , 1966, JACM.

[3] Rajeev Alur,et al. Nondeterministic Streaming String Transducers , 2011, ICALP.

[4] Pavol Cerný,et al. Expressiveness of streaming string transducers , 2010, FSTTCS.

[5] Miriam Kaeshammer. Synchronous Linear Context-Free Rewriting Systems for Machine Translation , 2013, SSST@NAACL-HLT.

[6] John C. Shepherdson,et al. The Reduction of Two-Way Automata to One-Way Automata , 1959, IBM J. Res. Dev..

[7] Mikolaj Bojanczyk,et al. Which Classes of Origin Graphs Are Generated by Transducers , 2017, ICALP.

[8] Alfred V. Aho,et al. A Characterization of Two-Way Deterministic Classes of Languages , 1969, J. Comput. Syst. Sci..

[9] Miles Osborne,et al. Statistical Machine Translation , 2010, Encyclopedia of Machine Learning and Data Mining.

[10] Joost Engelfriet,et al. MSO definable string transductions and two-way finite-state transducers , 1999, TOCL.

[11] D. Rubin,et al. Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[12] Robert L. Mercer,et al. The Mathematics of Statistical Machine Translation: Parameter Estimation , 1993, CL.

[13] David Chiang,et al. Hierarchical Phrase-Based Translation , 2007, CL.

[14] J. Engelfriet,et al. Graph Structure and Monadic Second-Order Logic: Monadic second-order logic , 2012 .