Skip to content

Research at St Andrews

A derivational model of discontinuous parsing

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

Author(s)

Mark Jan Nederhof, Anssi Yli-Jyra

School/Research organisations

Abstract

The notion of latent-variable probabilistic context-free derivation of syntactic structures is enhanced to allow heads and unrestricted discontinuities. The chosen formalization covers both constituent parsing and dependency parsing. The derivational model is accompanied by an equivalent probabilistic automaton model. By the new framework, one obtains a probability distribution over the space of all discontinuous parses. This lends itself to intrinsic evaluation in terms of perplexity, as shown in experiments.
Close

Details

Original languageEnglish
Title of host publicationLanguage and Automata Theory and Applications
Subtitle of host publication11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017, Proceedings
EditorsFrank Drewes, Carlos Martin-Vide, Bianca Truthe
Place of PublicationCham
PublisherSpringer
Pages299-310
DOIs
Publication statusPublished - 2017
Event11th International Conference on Language and Automata Theory and Applications - Umeå, Sweden
Duration: 6 Mar 20179 Mar 2017
Conference number: 11
http://grammars.grlmc.com/LATA2017/

Publication series

NameLecture Notes in Computer Science (Theoretical Computer Science and General Issues)
PublisherSpringer
Volume10168
ISSN (Print)0302-9743

Conference

Conference11th International Conference on Language and Automata Theory and Applications
Abbreviated titleLATA 2017
CountrySweden
CityUmeå
Period6/03/179/03/17
Internet address

    Research areas

  • Parsing, Grammars, Weighted automata

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

View graph of relations

Related by author

  1. Regular transductions with MCFG input syntax

    Nederhof, M. J. & Vogler, H., 23 Sep 2019, Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing. Maletti, A. & Vogler, H. (eds.). Dresden: Association for Computational Linguistics, p. 56-64 9 p.

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

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

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

  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: 248206244

Top