Efficient probabilistic top-down and left-corner parsing

Details Efficient probabilistic top-down and left-corner parsing Efficient probabilistic top-down and left-corner parsing

2000-08-21

arxiv.org/abs/cs/0008017v1

Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics, 1999, pages 421-428

Computer Science

Computation and Language

8 pages, 3 tables, 3 figures

Scientific paper

This paper examines efficient predictive broad-coverage 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, top-down 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.

Affiliated with

Also associated with

No associations

Rating

Efficient probabilistic top-down and left-corner parsing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient probabilistic top-down and left-corner parsing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient probabilistic top-down and left-corner parsing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-314137