A derivational model of discontinuous parsing
MetadataShow full item record
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.
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_22conference
Language and Automata Theory and Applications
© 2017, Springer International Publishing AG. This work has been made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at link.springer.com / https://doi.org/10.1007/978-3-319-53733-7_22
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.