Show simple item record

Files in this item


Item metadata

dc.contributor.authorNederhof, Mark-Jan
dc.contributor.authorYli-Jyrä, Anssi
dc.identifier.citationNederhof , M-J & Yli-Jyrä , A 2020 , ' A derivational model of discontinuous parsing ' , Information and Computation , vol. In press , 104619 .
dc.identifier.otherPURE: 269843714
dc.identifier.otherPURE UUID: 4e55f91d-c99c-42a7-a56e-08eb597a7036
dc.identifier.otherRIS: urn:920DF2C16B2C438F3AED7AC9E2EB0DB7
dc.identifier.otherORCID: /0000-0002-1845-6829/work/79564674
dc.identifier.otherScopus: 85089148687
dc.identifier.otherWOS: 000672676900003
dc.description.abstractThe notion of latent-variable probabilistic context-free derivation of syntactic structures is enhanced to allow heads and unrestricted discontinuities. The chosen formalization covers both constituency parsing and dependency parsing. 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 cross-entropy. The derivational model is accompanied by an equivalent automaton model, which can be used for deterministic parsing.
dc.relation.ispartofInformation and Computationen
dc.rightsCopyright © 2020 Elsevier, Inc. This work has been made available online in accordance with publisher policies or with permission. Permission for further reuse of this content should be sought from the publisher or the rights holder. This is the author created accepted manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at
dc.subjectWeighted automataen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.titleA derivational model of discontinuous parsingen
dc.typeJournal articleen
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.description.statusPeer revieweden

This item appears in the following Collection(s)

Show simple item record