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ández-González and Martins, 2015). As a side contribution, we adapt span features (Hall et al., 2014) to discontinuous parsing.- Anthology ID:
- E17-1118
- Volume:
- Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers
- Month:
- April
- Year:
- 2017
- Address:
- Valencia, Spain
- Editors:
- Mirella Lapata, Phil Blunsom, Alexander Koller
- Venue:
- EACL
- SIG:
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 1259–1270
- Language:
- URL:
- https://aclanthology.org/E17-1118
- DOI:
- Cite (ACL):
- Maximin Coavoux and Benoît Crabbé. 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, pages 1259–1270, Valencia, Spain. Association for Computational Linguistics.
- Cite (Informal):
- Incremental Discontinuous Phrase Structure Parsing with the GAP Transition (Coavoux & Crabbé, EACL 2017)
- PDF:
- https://preview.aclanthology.org/nschneid-patch-3/E17-1118.pdf
- Code
- mcoavoux/mtg