Coarse-To-Fine Parsing for Expressive Grammar Formalisms

Christoph Teichmann, Alexander Koller, Jonas Groschwitz


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
Venues:
IWPT | WS
SIG:
SIGPARSE
Publisher:
Association for Computational Linguistics
Note:
Pages:
122–127
Language:
URL:
https://www.aclweb.org/anthology/W17-6317
DOI:
Bib Export formats:
BibTeX MODS XML EndNote
PDF:
http://aclanthology.lst.uni-saarland.de/W17-6317.pdf