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.
Citation
Nederhof , M J & Yli-Jyra , A 2017 , A derivational model of discontinuous parsing . in F Drewes , C Martin-Vide & B Truthe (eds) , Language and Automata Theory and Applications : 11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017, Proceedings . Lecture Notes in Computer Science (Theoretical Computer Science and General Issues) , vol. 10168 , Springer , Cham , pp. 299-310 , 11th International Conference on Language and Automata Theory and Applications , Umeå , Sweden , 6/03/17 . https://doi.org/10.1007/978-3-319-53733-7_22 conference
Publication
Language and Automata Theory and Applications
ISSN
0302-9743Type
Conference item
Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.