An incremental algorithm for transition-based CCG parsing

Bharat Ram Ambati; Tejaswini Deoskar; Mark Johnson; Mark Steedman

doi:10.3115/v1/n15-1006

An incremental algorithm for transition-based CCG parsing

Bharat Ram Ambati, Tejaswini Deoskar, Mark Johnson, Mark Steedman

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

13 Citations (Scopus)

38 Downloads (Pure)

Abstract

Incremental parsers have potential advantages for applications like language modeling for machine translation and speech recognition. We describe a new algorithm for incremental transition-based Combinatory Categorial Grammar parsing. As English CCGbank derivations are mostly right branching and non-incremental, we design our algorithm based on the dependencies resolved rather than the derivation. We introduce two new actions in the shift-reduce paradigm based on the idea of 'revealing' (Pareschi and Steedman, 1987) the required information during parsing. On the standard CCGbank test data, our algorithm achieved improvements of 0.88% in labeled and 2.0% in unlabeled F-score over a greedy non-incremental shift-reduce parser.

Original language	English
Title of host publication	2015 Conference of the North American Chapter of the Association for Computational Linguistics, NAACL HLT 2015
Subtitle of host publication	Human Language Technologies, Proceedings of the Conference
Place of Publication	Red Hook, NY
Publisher	Association for Computational Linguistics (ACL)
Pages	53-63
Number of pages	11
ISBN (Electronic)	9781941643495
DOIs	https://doi.org/10.3115/v1/n15-1006
Publication status	Published - 2015
Event	Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL HLT 2015 - Denver, United States Duration: 31 May 2015 → 5 Jun 2015

Other

Other	Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL HLT 2015
Country/Territory	United States
City	Denver
Period	31/05/15 → 5/06/15

Bibliographical note

Version archived for private and non-commercial use with the permission of the author/s and according to publisher conditions. For further rights please contact the publisher.

Access to Document

10.3115/v1/n15-1006

Publisher version (open access)Final published version, 1.06 MBLicence: CC BY-NC-SA

Cite this

Ambati, B. R., Deoskar, T., Johnson, M., & Steedman, M. (2015). An incremental algorithm for transition-based CCG parsing. In 2015 Conference of the North American Chapter of the Association for Computational Linguistics, NAACL HLT 2015: Human Language Technologies, Proceedings of the Conference (pp. 53-63). Association for Computational Linguistics (ACL). https://doi.org/10.3115/v1/n15-1006

Ambati, Bharat Ram ; Deoskar, Tejaswini ; Johnson, Mark et al. / An incremental algorithm for transition-based CCG parsing. 2015 Conference of the North American Chapter of the Association for Computational Linguistics, NAACL HLT 2015: Human Language Technologies, Proceedings of the Conference. Red Hook, NY : Association for Computational Linguistics (ACL), 2015. pp. 53-63

@inproceedings{7362f6247d9242929a3c6fac7006ef71,

title = "An incremental algorithm for transition-based CCG parsing",

abstract = "Incremental parsers have potential advantages for applications like language modeling for machine translation and speech recognition. We describe a new algorithm for incremental transition-based Combinatory Categorial Grammar parsing. As English CCGbank derivations are mostly right branching and non-incremental, we design our algorithm based on the dependencies resolved rather than the derivation. We introduce two new actions in the shift-reduce paradigm based on the idea of 'revealing' (Pareschi and Steedman, 1987) the required information during parsing. On the standard CCGbank test data, our algorithm achieved improvements of 0.88% in labeled and 2.0% in unlabeled F-score over a greedy non-incremental shift-reduce parser.",

author = "Ambati, {Bharat Ram} and Tejaswini Deoskar and Mark Johnson and Mark Steedman",

note = "Version archived for private and non-commercial use with the permission of the author/s and according to publisher conditions. For further rights please contact the publisher. ; Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL HLT 2015 ; Conference date: 31-05-2015 Through 05-06-2015",

year = "2015",

doi = "10.3115/v1/n15-1006",

language = "English",

pages = "53--63",

booktitle = "2015 Conference of the North American Chapter of the Association for Computational Linguistics, NAACL HLT 2015",

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

}

Ambati, BR, Deoskar, T, Johnson, M & Steedman, M 2015, An incremental algorithm for transition-based CCG parsing. in 2015 Conference of the North American Chapter of the Association for Computational Linguistics, NAACL HLT 2015: Human Language Technologies, Proceedings of the Conference. Association for Computational Linguistics (ACL), Red Hook, NY, pp. 53-63, Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL HLT 2015, Denver, United States, 31/05/15. https://doi.org/10.3115/v1/n15-1006

An incremental algorithm for transition-based CCG parsing. / Ambati, Bharat Ram; Deoskar, Tejaswini; Johnson, Mark et al.
2015 Conference of the North American Chapter of the Association for Computational Linguistics, NAACL HLT 2015: Human Language Technologies, Proceedings of the Conference. Red Hook, NY: Association for Computational Linguistics (ACL), 2015. p. 53-63.

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

TY - GEN

T1 - An incremental algorithm for transition-based CCG parsing

AU - Ambati, Bharat Ram

AU - Deoskar, Tejaswini

AU - Johnson, Mark

AU - Steedman, Mark

N1 - Version archived for private and non-commercial use with the permission of the author/s and according to publisher conditions. For further rights please contact the publisher.

PY - 2015

Y1 - 2015

N2 - Incremental parsers have potential advantages for applications like language modeling for machine translation and speech recognition. We describe a new algorithm for incremental transition-based Combinatory Categorial Grammar parsing. As English CCGbank derivations are mostly right branching and non-incremental, we design our algorithm based on the dependencies resolved rather than the derivation. We introduce two new actions in the shift-reduce paradigm based on the idea of 'revealing' (Pareschi and Steedman, 1987) the required information during parsing. On the standard CCGbank test data, our algorithm achieved improvements of 0.88% in labeled and 2.0% in unlabeled F-score over a greedy non-incremental shift-reduce parser.

AB - Incremental parsers have potential advantages for applications like language modeling for machine translation and speech recognition. We describe a new algorithm for incremental transition-based Combinatory Categorial Grammar parsing. As English CCGbank derivations are mostly right branching and non-incremental, we design our algorithm based on the dependencies resolved rather than the derivation. We introduce two new actions in the shift-reduce paradigm based on the idea of 'revealing' (Pareschi and Steedman, 1987) the required information during parsing. On the standard CCGbank test data, our algorithm achieved improvements of 0.88% in labeled and 2.0% in unlabeled F-score over a greedy non-incremental shift-reduce parser.

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

U2 - 10.3115/v1/n15-1006

DO - 10.3115/v1/n15-1006

M3 - Conference proceeding contribution

AN - SCOPUS:84960088489

SP - 53

EP - 63

BT - 2015 Conference of the North American Chapter of the Association for Computational Linguistics, NAACL HLT 2015

PB - Association for Computational Linguistics (ACL)

CY - Red Hook, NY

T2 - Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL HLT 2015

Y2 - 31 May 2015 through 5 June 2015

ER -

Ambati BR, Deoskar T, Johnson M, Steedman M. An incremental algorithm for transition-based CCG parsing. In 2015 Conference of the North American Chapter of the Association for Computational Linguistics, NAACL HLT 2015: Human Language Technologies, Proceedings of the Conference. Red Hook, NY: Association for Computational Linguistics (ACL). 2015. p. 53-63 doi: 10.3115/v1/n15-1006

An incremental algorithm for transition-based CCG parsing

Abstract

Other

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this