Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorNederhof, Mark Jan
dc.contributor.authorYli-Jyra, Anssi
dc.contributor.editorDrewes, Frank
dc.contributor.editorMartin-Vide, Carlos
dc.contributor.editorTruthe, Bianca
dc.date.accessioned2017-03-06T14:30:15Z
dc.date.available2017-03-06T14:30:15Z
dc.date.issued2017
dc.identifier248206244
dc.identifier6479a359-3a8d-402b-be00-eac1813ada83
dc.identifier85013414304
dc.identifier000418579700022
dc.identifier.citationNederhof , 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_22en
dc.identifier.citationconferenceen
dc.identifier.issn0302-9743
dc.identifier.otherORCID: /0000-0002-1845-6829/work/46002697
dc.identifier.urihttps://hdl.handle.net/10023/10406
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 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.
dc.format.extent301793
dc.language.isoeng
dc.publisherSpringer
dc.relation.ispartofLanguage and Automata Theory and Applicationsen
dc.relation.ispartofseriesLecture Notes in Computer Science (Theoretical Computer Science and General Issues)en
dc.subjectParsingen
dc.subjectGrammarsen
dc.subjectWeighted automataen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectComputational Theory and Mathematicsen
dc.subjectLanguage and Linguisticsen
dc.subjectT-NDASen
dc.subject.lccQA75en
dc.titleA derivational model of discontinuous parsingen
dc.typeConference itemen
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.identifier.doi10.1007/978-3-319-53733-7_22


This item appears in the following Collection(s)

Show simple item record