Abstract
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.
Cite
CITATION STYLE
APA
Nederhof, M. J., & Vogler, H. (2019). Regular transductions with MCFG input syntax. In FSMNLP 2019 - 14th International Conference on Finite-State Methods and Natural Language Processing, Proceedings (pp. 56–64). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/w19-3109
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free