A Derivational Model of Discontinuous Parsing

Mark-Jan Nederhof, Anssi Mikael Yli-Jyrä

Research output: Chapter in Book/Report/Conference proceedingChapterScientificpeer-review

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.
Original languageEnglish
Title of host publicationLanguage and Automata Theory and Applications : LATA 2017
EditorsCarlos Martín-Vide
Number of pages12
Place of PublicationBerlin
PublisherSpringer-Verlag
Publication date6 Mar 2017
Pages299-310
ISBN (Print)978-3-319-53732-0
ISBN (Electronic)978-3-319-53733-7
DOIs
Publication statusPublished - 6 Mar 2017
MoE publication typeA3 Book chapter

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fields of Science

  • 111 Mathematics
  • grammars
  • perplexity
  • 113 Computer and information sciences
  • weighted automata
  • context-free derivation
  • discontinuity
  • derivation
  • 6121 Languages
  • parsing
  • syntactic structures

Cite this

Nederhof, M-J., & Yli-Jyrä, A. M. (2017). A Derivational Model of Discontinuous Parsing. In C. Martín-Vide (Ed.), Language and Automata Theory and Applications: LATA 2017 (pp. 299-310). (Lecture Notes in Computer Science). Berlin: Springer-Verlag. https://doi.org/10.1007/978-3-319-53733-7_22
Nederhof, Mark-Jan ; Yli-Jyrä, Anssi Mikael. / A Derivational Model of Discontinuous Parsing. Language and Automata Theory and Applications: LATA 2017. editor / Carlos Martín-Vide. Berlin : Springer-Verlag, 2017. pp. 299-310 (Lecture Notes in Computer Science).
@inbook{601967b67f9c46e9b8b077c46db8ba10,
title = "A Derivational Model of Discontinuous Parsing",
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.",
keywords = "111 Mathematics, derivaatio, grammars, perplexity, 113 Computer and information sciences, parsing, grammars, weighted automata, perplexity, derivations, Probabilistic model, weighted automata, context-free derivation, discontinuity, derivation, 6121 Languages, dependenssikielioppi, j{\"a}sent{\"a}minen, sanaj{\"a}rjestys, kielen kompleksisuus, parsing, syntactic structures",
author = "Mark-Jan Nederhof and Yli-Jyr{\"a}, {Anssi Mikael}",
year = "2017",
month = "3",
day = "6",
doi = "10.1007/978-3-319-53733-7_22",
language = "English",
isbn = "978-3-319-53732-0",
series = "Lecture Notes in Computer Science",
publisher = "Springer-Verlag",
pages = "299--310",
editor = "Carlos Mart{\'i}n-Vide",
booktitle = "Language and Automata Theory and Applications",
address = "Germany",

}

Nederhof, M-J & Yli-Jyrä, AM 2017, A Derivational Model of Discontinuous Parsing. in C Martín-Vide (ed.), Language and Automata Theory and Applications: LATA 2017. Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 299-310. https://doi.org/10.1007/978-3-319-53733-7_22

A Derivational Model of Discontinuous Parsing. / Nederhof, Mark-Jan; Yli-Jyrä, Anssi Mikael.

Language and Automata Theory and Applications: LATA 2017. ed. / Carlos Martín-Vide. Berlin : Springer-Verlag, 2017. p. 299-310 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceedingChapterScientificpeer-review

TY - CHAP

T1 - A Derivational Model of Discontinuous Parsing

AU - Nederhof, Mark-Jan

AU - Yli-Jyrä, Anssi Mikael

PY - 2017/3/6

Y1 - 2017/3/6

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

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

KW - 111 Mathematics

KW - derivaatio

KW - grammars

KW - perplexity

KW - 113 Computer and information sciences

KW - parsing

KW - grammars

KW - weighted automata

KW - perplexity

KW - derivations

KW - Probabilistic model

KW - weighted automata

KW - context-free derivation

KW - discontinuity

KW - derivation

KW - 6121 Languages

KW - dependenssikielioppi

KW - jäsentäminen

KW - sanajärjestys

KW - kielen kompleksisuus

KW - parsing

KW - syntactic structures

U2 - 10.1007/978-3-319-53733-7_22

DO - 10.1007/978-3-319-53733-7_22

M3 - Chapter

SN - 978-3-319-53732-0

T3 - Lecture Notes in Computer Science

SP - 299

EP - 310

BT - Language and Automata Theory and Applications

A2 - Martín-Vide, Carlos

PB - Springer-Verlag

CY - Berlin

ER -

Nederhof M-J, Yli-Jyrä AM. A Derivational Model of Discontinuous Parsing. In Martín-Vide C, editor, Language and Automata Theory and Applications: LATA 2017. Berlin: Springer-Verlag. 2017. p. 299-310. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-319-53733-7_22