Temporal Restricted Boltzmann Machines for Dependency Parsing

We propose a generative model based on Temporal Restricted Boltzmann Machines for transition based dependency parsing. The parse tree is built incrementally using a shiftreduce parse and an RBM is used to model each decision step. The RBM at the current time step induces latent features with the help of temporal connections to the relevant previous steps which provide context information. Our parser achieves labeled and unlabeled at

• Type: Journal
• Year: 2011
• Where: ACL
• Authors: Nikhil Garg, James Henderson
• Keywords: ACL 2011, Boltzmann Machines, Computational Linguistics, Generative Model, Parse Tree