Regular transductions with MCFG input syntax

Mark-Jan Nederhof, Heiko Vogler


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.
Anthology ID:
W19-3109
Volume:
Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing
Month:
September
Year:
2019
Address:
Dresden, Germany
Editors:
Heiko Vogler, Andreas Maletti
Venue:
FSMNLP
SIG:
SIGFSM
Publisher:
Association for Computational Linguistics
Note:
Pages:
56–64
Language:
URL:
https://aclanthology.org/W19-3109
DOI:
10.18653/v1/W19-3109
Bibkey:
Cite (ACL):
Mark-Jan Nederhof and Heiko Vogler. 2019. Regular transductions with MCFG input syntax. In Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing, pages 56–64, Dresden, Germany. Association for Computational Linguistics.
Cite (Informal):
Regular transductions with MCFG input syntax (Nederhof & Vogler, FSMNLP 2019)
Copy Citation:
PDF:
https://aclanthology.org/W19-3109.pdf