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.- Anthology ID:
- P17-1026
- Volume:
- Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
- Month:
- July
- Year:
- 2017
- Address:
- Vancouver, Canada
- Editors:
- Regina Barzilay, Min-Yen Kan
- Venue:
- ACL
- SIG:
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 277–287
- Language:
- URL:
- https://aclanthology.org/P17-1026
- DOI:
- 10.18653/v1/P17-1026
- Cite (ACL):
- Masashi Yoshikawa, Hiroshi Noji, and Yuji Matsumoto. 2017. A* CCG Parsing with a Supertag and Dependency Factored Model. In Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 277–287, Vancouver, Canada. Association for Computational Linguistics.
- Cite (Informal):
- A* CCG Parsing with a Supertag and Dependency Factored Model (Yoshikawa et al., ACL 2017)
- PDF:
- https://preview.aclanthology.org/nschneid-patch-3/P17-1026.pdf
- Code
- masashi-y/depccg