Incremental Discontinuous Phrase Structure Parsing with the GAP Transition

Maximin Coavoux; Benoit Crabbé

Incremental Discontinuous Phrase Structure Parsing with the GAP Transition

Maximin Coavoux, Benoit Crabbé

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

Abstract / Description of output

This article introduces a novel transition system for discontinuous lexicalized constituent parsing called SR-GAP. It is an extension of the shift-reduce algorithm with an additional gap transition. Evaluation on two German treebanks shows that SR-GAP outperforms the previous best transition-based discontinuous parser (Maier, 2015) by a large margin (it is notably twice as accurate on the prediction of discontinuous constituents), and is competitive with the state of the art (Fernández-González and Martins, 2015). As a side contribution, we adapt span features (Hall et al., 2014) to discontinuous parsing.

Original language	Undefined/Unknown
Title of host publication	Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers
Place of Publication	Valencia, Spain
Publisher	Association for Computational Linguistics
Pages	1259-1270
Number of pages	12
Publication status	Published - 1 Apr 2017
Event	The 15th Conference of the European Chapter of the Association for Computational Linguistics - Valencia, Spain Duration: 3 Apr 2017 → 7 Apr 2017

Conference

Conference	The 15th Conference of the European Chapter of the Association for Computational Linguistics
Abbreviated title	EACL 2017
Country/Territory	Spain
City	Valencia
Period	3/04/17 → 7/04/17

Access to Document

Cite this

@inproceedings{0c6401e30ceb460090a05dc86a2a8d2a,

title = "Incremental Discontinuous Phrase Structure Parsing with the GAP Transition",

abstract = "This article introduces a novel transition system for discontinuous lexicalized constituent parsing called SR-GAP. It is an extension of the shift-reduce algorithm with an additional gap transition. Evaluation on two German treebanks shows that SR-GAP outperforms the previous best transition-based discontinuous parser (Maier, 2015) by a large margin (it is notably twice as accurate on the prediction of discontinuous constituents), and is competitive with the state of the art (Fern{\'a}ndez-Gonz{\'a}lez and Martins, 2015). As a side contribution, we adapt span features (Hall et al., 2014) to discontinuous parsing.",

author = "Maximin Coavoux and Benoit Crabb{\'e}",

year = "2017",

month = apr,

day = "1",

language = "Undefined/Unknown",

pages = "1259--1270",

booktitle = "Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers",

publisher = "Association for Computational Linguistics",

note = "The 15th Conference of the European Chapter of the Association for Computational Linguistics ; Conference date: 03-04-2017 Through 07-04-2017",

}

Coavoux, M & Crabbé, B 2017, Incremental Discontinuous Phrase Structure Parsing with the GAP Transition. in Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers. Association for Computational Linguistics, Valencia, Spain, pp. 1259-1270, The 15th Conference of the European Chapter of the Association for Computational Linguistics, Valencia, Spain, 3/04/17. <http://www.aclweb.org/anthology/E17-1118>

Incremental Discontinuous Phrase Structure Parsing with the GAP Transition. / Coavoux, Maximin; Crabbé, Benoit.
Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers. Valencia, Spain: Association for Computational Linguistics, 2017. p. 1259-1270.

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

TY - GEN

T1 - Incremental Discontinuous Phrase Structure Parsing with the GAP Transition

AU - Coavoux, Maximin

AU - Crabbé, Benoit

PY - 2017/4/1

Y1 - 2017/4/1

N2 - This article introduces a novel transition system for discontinuous lexicalized constituent parsing called SR-GAP. It is an extension of the shift-reduce algorithm with an additional gap transition. Evaluation on two German treebanks shows that SR-GAP outperforms the previous best transition-based discontinuous parser (Maier, 2015) by a large margin (it is notably twice as accurate on the prediction of discontinuous constituents), and is competitive with the state of the art (Fernández-González and Martins, 2015). As a side contribution, we adapt span features (Hall et al., 2014) to discontinuous parsing.

AB - This article introduces a novel transition system for discontinuous lexicalized constituent parsing called SR-GAP. It is an extension of the shift-reduce algorithm with an additional gap transition. Evaluation on two German treebanks shows that SR-GAP outperforms the previous best transition-based discontinuous parser (Maier, 2015) by a large margin (it is notably twice as accurate on the prediction of discontinuous constituents), and is competitive with the state of the art (Fernández-González and Martins, 2015). As a side contribution, we adapt span features (Hall et al., 2014) to discontinuous parsing.

UR - https://mcoavoux.github.io/

M3 - Conference contribution

SP - 1259

EP - 1270

BT - Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers

PB - Association for Computational Linguistics

CY - Valencia, Spain

T2 - The 15th Conference of the European Chapter of the Association for Computational Linguistics

Y2 - 3 April 2017 through 7 April 2017

ER -

Incremental Discontinuous Phrase Structure Parsing with the GAP Transition

Abstract / Description of output

Conference

Access to Document

Other files and links

Cite this