A* CCG parsing with a supertag and dependency factored model

Masashi Yoshikawa; Hiroshi Noji; Yuji Matsumoto

doi:10.18653/v1/P17-1026

A* CCG parsing with a supertag and dependency factored model

Masashi Yoshikawa, Hiroshi Noji, Yuji Matsumoto

Tough Cyberphysical AI Research Center (TCPAI)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

11 Citations (Scopus)

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.

Original language	English
Title of host publication	ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Long Papers)
Publisher	Association for Computational Linguistics (ACL)
Pages	277-287
Number of pages	11
ISBN (Electronic)	9781945626753
DOIs	https://doi.org/10.18653/v1/P17-1026
Publication status	Published - 2017
Event	55th Annual Meeting of the Association for Computational Linguistics, ACL 2017 - Vancouver, Canada Duration: 2017 Jul 30 → 2017 Aug 4

Publication series

Name	ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Long Papers)
Volume	1

Other

Other	55th Annual Meeting of the Association for Computational Linguistics, ACL 2017
Country	Canada
City	Vancouver
Period	17/7/30 → 17/8/4

ASJC Scopus subject areas

Language and Linguistics
Artificial Intelligence
Software
Linguistics and Language

Access to Document

10.18653/v1/P17-1026

Fingerprint Dive into the research topics of 'A* CCG parsing with a supertag and dependency factored model'. Together they form a unique fingerprint.

Cite this

Yoshikawa, M., Noji, H., & Matsumoto, Y. (2017). A* CCG parsing with a supertag and dependency factored model. In ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Long Papers) (pp. 277-287). (ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Long Papers); Vol. 1). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/P17-1026

A* CCG parsing with a supertag and dependency factored model. / Yoshikawa, Masashi; Noji, Hiroshi; Matsumoto, Yuji.

ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Long Papers). Association for Computational Linguistics (ACL), 2017. p. 277-287 (ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Long Papers); Vol. 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Yoshikawa, M, Noji, H & Matsumoto, Y 2017, A* CCG parsing with a supertag and dependency factored model. in ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Long Papers). ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Long Papers), vol. 1, Association for Computational Linguistics (ACL), pp. 277-287, 55th Annual Meeting of the Association for Computational Linguistics, ACL 2017, Vancouver, Canada, 17/7/30. https://doi.org/10.18653/v1/P17-1026

Yoshikawa M, Noji H, Matsumoto Y. A* CCG parsing with a supertag and dependency factored model. In ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Long Papers). Association for Computational Linguistics (ACL). 2017. p. 277-287. (ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Long Papers)). https://doi.org/10.18653/v1/P17-1026

Yoshikawa, Masashi ; Noji, Hiroshi ; Matsumoto, Yuji. / A* CCG parsing with a supertag and dependency factored model. ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Long Papers). Association for Computational Linguistics (ACL), 2017. pp. 277-287 (ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Long Papers)).

@inproceedings{7b5f74cc39d5495780aa86cd98fa6f27,

title = "A* CCG parsing with a supertag and dependency factored model",

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.",

author = "Masashi Yoshikawa and Hiroshi Noji and Yuji Matsumoto",

note = "Funding Information: We are grateful to Mike Lewis for answering our questions and your Github repository from which we learned many things. We also thank Yuichiro Sawai for the faster LSTM implementation. This work was in part supported by JSPS KAKENHI Grant Number 16H06981, and also by JST CREST Grant Number JPMJCR1301.; 55th Annual Meeting of the Association for Computational Linguistics, ACL 2017 ; Conference date: 30-07-2017 Through 04-08-2017",

year = "2017",

doi = "10.18653/v1/P17-1026",

language = "English",

series = "ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Long Papers)",

publisher = "Association for Computational Linguistics (ACL)",

pages = "277--287",

booktitle = "ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Long Papers)",

}

TY - GEN

T1 - A* CCG parsing with a supertag and dependency factored model

AU - Yoshikawa, Masashi

AU - Noji, Hiroshi

AU - Matsumoto, Yuji

N1 - Funding Information: We are grateful to Mike Lewis for answering our questions and your Github repository from which we learned many things. We also thank Yuichiro Sawai for the faster LSTM implementation. This work was in part supported by JSPS KAKENHI Grant Number 16H06981, and also by JST CREST Grant Number JPMJCR1301.

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85040905252&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85040905252&partnerID=8YFLogxK

U2 - 10.18653/v1/P17-1026

DO - 10.18653/v1/P17-1026

M3 - Conference contribution

AN - SCOPUS:85040905252

T3 - ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Long Papers)

SP - 277

EP - 287

BT - ACL 2017 - 55th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Long Papers)

PB - Association for Computational Linguistics (ACL)

T2 - 55th Annual Meeting of the Association for Computational Linguistics, ACL 2017

Y2 - 30 July 2017 through 4 August 2017

ER -