Sciweavers

CORR
2000
Springer

Efficient probabilistic top-down and left-corner parsing

13 years 4 months ago
Efficient probabilistic top-down and left-corner parsing
This paper examines efficient predictive broadcoverage parsing without dynamic programming. 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 interpretation can in principle be read. We contrast two predictive parsing approaches, topdown and left-corner parsing, and find both to be viable. In addition, we find that enhancement with non-local information not only improves parser accuracy, but also substantially improves the search efficiency.
Brian Roark, Mark Johnson
Added 17 Dec 2010
Updated 17 Dec 2010
Type Journal
Year 2000
Where CORR
Authors Brian Roark, Mark Johnson
Comments (0)