SOTAVerified

A* CCG Parsing with a Supertag and Dependency Factored Model

2017-04-23ACL 2017Code Available0· sign in to hype

Masashi Yoshikawa, Hiroshi Noji, Yuji Matsumoto

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

We propose a new A* CCG parsing model in which the probability of a tree is decomposed into factors of CCG categories and its syntactic dependencies both defined on bi-directional LSTMs. Our factored model allows the precomputation of all probabilities and runs very efficiently, while modeling sentence structures explicitly via dependencies. Our model achieves the state-of-the-art results on English and Japanese CCG parsing.

Tasks

Reproductions