Paper: Efficient Probabilistic Top-Down And Left-Corner Parsing

ACL ID P99-1054
Title Efficient Probabilistic Top-Down And Left-Corner Parsing
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1999

This paper examines efficient predictive broad- coverage parsing without dynamic program- ming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses that are fully connected trees spanning the entire left context, from which any kind of non-local dependency or partial semantic inter- pretation can in principle be read. We con- trast two predictive parsing approaches, top- down and left-corner parsing, and find both to be viable. In addition, we find that enhance- ment with non-local information not only im- proves parser accuracy, but also substantially improves the search efficiency.