Abstract
We formulate a generalization of Petrov et al. (2006)’s split/merge algorithm for interpreted regular tree grammars (Koller and Kuhlmann, 2011), which capture a large class of grammar formalisms. We evaluate its effectiveness empirically on the task of discontinuous constituent parsing with two mildly context-sensitive grammar formalisms: linear context-free rewriting systems (Vijay-Shanker et al., 1987) as well as hybrid grammars (Nederhof and Vogler, 2014).- Anthology ID:
- C18-1258
- Volume:
- Proceedings of the 27th International Conference on Computational Linguistics
- Month:
- August
- Year:
- 2018
- Address:
- Santa Fe, New Mexico, USA
- Editors:
- Emily M. Bender, Leon Derczynski, Pierre Isabelle
- Venue:
- COLING
- SIG:
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 3049–3063
- Language:
- URL:
- https://aclanthology.org/C18-1258
- DOI:
- Cite (ACL):
- Kilian Gebhardt. 2018. Generic refinement of expressive grammar formalisms with an application to discontinuous constituent parsing. In Proceedings of the 27th International Conference on Computational Linguistics, pages 3049–3063, Santa Fe, New Mexico, USA. Association for Computational Linguistics.
- Cite (Informal):
- Generic refinement of expressive grammar formalisms with an application to discontinuous constituent parsing (Gebhardt, COLING 2018)
- PDF:
- https://preview.aclanthology.org/emnlp-22-attachments/C18-1258.pdf