Transition-based dependency parsing as latent-variable constituent parsing
MetadataShow full item record
We provide a theoretical argument that a common form of projective transition-based dependency parsing is less powerful than constituent parsing using latent variables. The argument is a proof that, under reasonable assumptions, a transition-based dependency parser can be converted to a latent-variable context-free grammar producing equivalent structures.
Nederhof , M J 2016 , Transition-based dependency parsing as latent-variable constituent parsing . in Proceedings of the SIGFSM Workshop on Statistical NLP and Weighted Automata . Association for Computational Linguistics , Berlin , pp. 21-31 , 54th Annual meeting of the Association for Computational Linguistics , Berlin , Germany , 7/08/16 .conference
Proceedings of the SIGFSM Workshop on Statistical NLP and Weighted Automata
© 2016, Association for Computational Linguistics. This work is 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 http://www.aclweb.org/anthology/W16-2403
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.