Abstract
We generalize coarse-to-fine parsing to grammar formalisms that are more expressive than PCFGs and/or describe languages of trees or graphs. We evaluate our algorithm on PCFG, PTAG, and graph parsing. While we achieve the expected performance gains on PCFGs, coarse-to-fine does not help for PTAG and can even slow down parsing for graphs. We discuss the implications of this finding.- Anthology ID:
- W17-6317
- Volume:
- Proceedings of the 15th International Conference on Parsing Technologies
- Month:
- September
- Year:
- 2017
- Address:
- Pisa, Italy
- Editors:
- Yusuke Miyao, Kenji Sagae
- Venue:
- IWPT
- SIG:
- SIGPARSE
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 122–127
- Language:
- URL:
- https://aclanthology.org/W17-6317
- DOI:
- Cite (ACL):
- Christoph Teichmann, Alexander Koller, and Jonas Groschwitz. 2017. Coarse-To-Fine Parsing for Expressive Grammar Formalisms. In Proceedings of the 15th International Conference on Parsing Technologies, pages 122–127, Pisa, Italy. Association for Computational Linguistics.
- Cite (Informal):
- Coarse-To-Fine Parsing for Expressive Grammar Formalisms (Teichmann et al., IWPT 2017)
- PDF:
- https://preview.aclanthology.org/nschneid-patch-5/W17-6317.pdf