CCG Parsing Algorithm with Incremental Tree Rotation

Milos Stanojevic; Mark Steedman

CCG Parsing Algorithm with Incremental Tree Rotation

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

Abstract / Description of output

The main obstacle to incremental sentence processing arises from right-branching constituent structures, which are present in the majority of English sentences, as well as from optional constituents that adjoin on the right, such as right adjuncts and right conjuncts. In CCG, many right-branching derivations can be replaced by semantically equivalent left-branching incremental derivations.

The problem of right-adjunction is more resistant to solution, and has been tackled in the past using revealing-based approaches that often rely either on the higher-order unification over lambda terms (Pareschi and Steedman, 1987) or heuristics over dependency representations that do not cover the whole CCGbank (Ambati et al., 2015).

We propose a new incremental parsing algorithm for CCG following the same revealing tradition of work but having a purely syntactic approach that does not depend on access to a distinct level of semantic representation. This algorithm can cover the whole CCGbank, with greater incrementality and accuracy than previous proposals.

Original language	English
Title of host publication	Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers)
Place of Publication	Minneapolis, Minnesota
Publisher	Association for Computational Linguistics
Pages	228–239
Number of pages	12
Volume	1
Publication status	Published - 7 Jun 2019
Event	2019 Annual Conference of the North American Chapter of the Association for Computational Linguistics - Minneapolis, United States Duration: 2 Jun 2019 → 7 Jun 2019 https://naacl2019.org/

Conference

Conference	2019 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Abbreviated title	NAACL-HLT 2019
Country/Territory	United States
City	Minneapolis
Period	2/06/19 → 7/06/19
Internet address	https://naacl2019.org/

Access to Document

CCG Parsing Algorithm_STANOJEVIC_DoA220219_AFVAccepted author manuscript, 229 KB

https://www.aclweb.org/anthology/N19-1020Licence: Creative Commons: Attribution (CC-BY)

SEMANTAX-Form-Independent Semantics for Natural Language Understanding
Steedman, M.
EU government bodies
1/08/17 → 31/07/23
Project: Research

File

Cite this

Stanojevic, M., & Steedman, M. (2019). CCG Parsing Algorithm with Incremental Tree Rotation. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers) (Vol. 1, pp. 228–239). Association for Computational Linguistics. https://www.aclweb.org/anthology/N19-1020

@inproceedings{121cd30eb679406299a70ba7f2e367f2,

title = "CCG Parsing Algorithm with Incremental Tree Rotation",

abstract = "The main obstacle to incremental sentence processing arises from right-branching constituent structures, which are present in the majority of English sentences, as well as from optional constituents that adjoin on the right, such as right adjuncts and right conjuncts. In CCG, many right-branching derivations can be replaced by semantically equivalent left-branching incremental derivations. The problem of right-adjunction is more resistant to solution, and has been tackled in the past using revealing-based approaches that often rely either on the higher-order unification over lambda terms (Pareschi and Steedman, 1987) or heuristics over dependency representations that do not cover the whole CCGbank (Ambati et al., 2015).We propose a new incremental parsing algorithm for CCG following the same revealing tradition of work but having a purely syntactic approach that does not depend on access to a distinct level of semantic representation. This algorithm can cover the whole CCGbank, with greater incrementality and accuracy than previous proposals.",

author = "Milos Stanojevic and Mark Steedman",

year = "2019",

month = jun,

day = "7",

language = "English",

volume = "1",

pages = "228–239",

booktitle = "Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers)",

publisher = "Association for Computational Linguistics",

note = "2019 Annual Conference of the North American Chapter of the Association for Computational Linguistics, NAACL-HLT 2019 ; Conference date: 02-06-2019 Through 07-06-2019",

url = "https://naacl2019.org/",

}

Stanojevic, M & Steedman, M 2019, CCG Parsing Algorithm with Incremental Tree Rotation. in Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers). vol. 1, Association for Computational Linguistics, Minneapolis, Minnesota, pp. 228–239, 2019 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Minneapolis, Minnesota, United States, 2/06/19. <https://www.aclweb.org/anthology/N19-1020>

CCG Parsing Algorithm with Incremental Tree Rotation. / Stanojevic, Milos; Steedman, Mark.
Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers). Vol. 1 Minneapolis, Minnesota: Association for Computational Linguistics, 2019. p. 228–239.

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

TY - GEN

T1 - CCG Parsing Algorithm with Incremental Tree Rotation

AU - Stanojevic, Milos

AU - Steedman, Mark

PY - 2019/6/7

Y1 - 2019/6/7

N2 - The main obstacle to incremental sentence processing arises from right-branching constituent structures, which are present in the majority of English sentences, as well as from optional constituents that adjoin on the right, such as right adjuncts and right conjuncts. In CCG, many right-branching derivations can be replaced by semantically equivalent left-branching incremental derivations. The problem of right-adjunction is more resistant to solution, and has been tackled in the past using revealing-based approaches that often rely either on the higher-order unification over lambda terms (Pareschi and Steedman, 1987) or heuristics over dependency representations that do not cover the whole CCGbank (Ambati et al., 2015).We propose a new incremental parsing algorithm for CCG following the same revealing tradition of work but having a purely syntactic approach that does not depend on access to a distinct level of semantic representation. This algorithm can cover the whole CCGbank, with greater incrementality and accuracy than previous proposals.

AB - The main obstacle to incremental sentence processing arises from right-branching constituent structures, which are present in the majority of English sentences, as well as from optional constituents that adjoin on the right, such as right adjuncts and right conjuncts. In CCG, many right-branching derivations can be replaced by semantically equivalent left-branching incremental derivations. The problem of right-adjunction is more resistant to solution, and has been tackled in the past using revealing-based approaches that often rely either on the higher-order unification over lambda terms (Pareschi and Steedman, 1987) or heuristics over dependency representations that do not cover the whole CCGbank (Ambati et al., 2015).We propose a new incremental parsing algorithm for CCG following the same revealing tradition of work but having a purely syntactic approach that does not depend on access to a distinct level of semantic representation. This algorithm can cover the whole CCGbank, with greater incrementality and accuracy than previous proposals.

M3 - Conference contribution

VL - 1

SP - 228

EP - 239

BT - Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers)

PB - Association for Computational Linguistics

CY - Minneapolis, Minnesota

T2 - 2019 Annual Conference of the North American Chapter of the Association for Computational Linguistics

Y2 - 2 June 2019 through 7 June 2019

ER -

CCG Parsing Algorithm with Incremental Tree Rotation

Abstract / Description of output

Conference

Access to Document

Fingerprint

Projects

SEMANTAX-Form-Independent Semantics for Natural Language Understanding

Cite this