Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorNederhof, Mark-Jan
dc.contributor.authorYli-Jyrä, Anssi
dc.date.accessioned2021-08-09T23:41:28Z
dc.date.available2021-08-09T23:41:28Z
dc.date.issued2020-08-10
dc.identifier269843714
dc.identifier4e55f91d-c99c-42a7-a56e-08eb597a7036
dc.identifier85089148687
dc.identifier000672676900003
dc.identifier.citationNederhof , M-J & Yli-Jyrä , A 2020 , ' A derivational model of discontinuous parsing ' , Information and Computation , vol. In press , 104619 . https://doi.org/10.1016/j.ic.2020.104619en
dc.identifier.issn0890-5401
dc.identifier.otherRIS: urn:920DF2C16B2C438F3AED7AC9E2EB0DB7
dc.identifier.otherORCID: /0000-0002-1845-6829/work/79564674
dc.identifier.urihttps://hdl.handle.net/10023/23747
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.format.extent390063
dc.language.isoeng
dc.relation.ispartofInformation and Computationen
dc.subjectParsingen
dc.subjectGrammarsen
dc.subjectWeighted automataen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectT-NDASen
dc.subject.lccQA75en
dc.titleA derivational model of discontinuous parsingen
dc.typeJournal articleen
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.identifier.doi10.1016/j.ic.2020.104619
dc.description.statusPeer revieweden
dc.date.embargoedUntil2021-08-10


This item appears in the following Collection(s)

Show simple item record