Skip to content

Research at St Andrews

Regular transductions with MCFG input syntax

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Author(s)

Mark Jan Nederhof, Heiko Vogler

School/Research organisations

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.
Close

Details

Original languageEnglish
Title of host publicationProceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing
EditorsAndreas Maletti, Heiko Vogler
Place of PublicationDresden
PublisherAssociation for Computational Linguistics
Pages56-64
Number of pages9
Publication statusPublished - 23 Sep 2019
Event14th International Conference on Finite-State Methods and Natural Language Processing - Dresden, Dresden, Germany
Duration: 23 Sep 201925 Sep 2019
https://wwwtcs.inf.tu-dresden.de/fsmnlp2019/

Conference

Conference14th International Conference on Finite-State Methods and Natural Language Processing
CountryGermany
CityDresden
Period23/09/1925/09/19
Internet address

    Research areas

  • Parsing algorithms, Formal grammars

Discover related content
Find related publications, people, projects and more using interactive charts.

View graph of relations

Related by author

  1. Hybrid grammars for parsing of discontinuous phrase structures and non-projective dependency structures

    Gebhardt, K., Nederhof, M. J. & Vogler, H., Sep 2017, In : Computational Linguistics. 43, 3, p. 465-520 56 p.

    Research output: Contribution to journalArticle

  2. A probabilistic model of Ancient Egyptian writing

    Nederhof, M. J. & Rahman, F., 1 Jul 2017, In : Journal of Language Modelling. 5, 1, p. 131-163

    Research output: Contribution to journalArticle

  3. A derivational model of discontinuous parsing

    Nederhof, M. J. & Yli-Jyra, A., 2017, Language and Automata Theory and Applications: 11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017, Proceedings. Drewes, F., Martin-Vide, C. & Truthe, B. (eds.). Cham: Springer, p. 299-310 (Lecture Notes in Computer Science (Theoretical Computer Science and General Issues); vol. 10168).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  4. Non-self-embedding linear context-free tree grammars generate regular tree languages

    Nederhof, M. J., Teichmann, M. & Vogler, H., 12 Dec 2016, In : Journal of Automata, Languages Combinatorics. 21, 3, p. 203-246

    Research output: Contribution to journalArticle

ID: 263087945

Top