Files in this item
A derivational model of discontinuous parsing
Item metadata
dc.contributor.author | Nederhof, Mark Jan | |
dc.contributor.author | Yli-Jyra, Anssi | |
dc.contributor.editor | Drewes, Frank | |
dc.contributor.editor | Martin-Vide, Carlos | |
dc.contributor.editor | Truthe, Bianca | |
dc.date.accessioned | 2017-03-06T14:30:15Z | |
dc.date.available | 2017-03-06T14:30:15Z | |
dc.date.issued | 2017 | |
dc.identifier | 248206244 | |
dc.identifier | 6479a359-3a8d-402b-be00-eac1813ada83 | |
dc.identifier | 85013414304 | |
dc.identifier | 000418579700022 | |
dc.identifier.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 | en |
dc.identifier.citation | conference | en |
dc.identifier.issn | 0302-9743 | |
dc.identifier.other | ORCID: /0000-0002-1845-6829/work/46002697 | |
dc.identifier.uri | https://hdl.handle.net/10023/10406 | |
dc.description.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. | |
dc.format.extent | 301793 | |
dc.language.iso | eng | |
dc.publisher | Springer | |
dc.relation.ispartof | Language and Automata Theory and Applications | en |
dc.relation.ispartofseries | Lecture Notes in Computer Science (Theoretical Computer Science and General Issues) | en |
dc.subject | Parsing | en |
dc.subject | Grammars | en |
dc.subject | Weighted automata | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | Computational Theory and Mathematics | en |
dc.subject | Language and Linguistics | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | QA75 | en |
dc.title | A derivational model of discontinuous parsing | en |
dc.type | Conference item | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.identifier.doi | 10.1007/978-3-319-53733-7_22 |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.