Efficient probabilistic top-down and left-corner parsing

Brian Roark, Mark Johnson

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

2 Downloads (Pure)

Abstract

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.
Original languageEnglish
Title of host publicationProceedings of the 37th Annual Meeting of the Association for Computational Linguistics
Place of PublicationSan Francisco
PublisherAssociation for Computational Linguistics
Pages421-428
Number of pages8
ISBN (Print)1558606092
DOIs
Publication statusPublished - 1999
Externally publishedYes
EventAnnual Meeting of the Association for Computational Linguistics (37th : 1999) - University of Maryland, College Park, United States
Duration: 20 Jun 199926 Jun 1999

Conference

ConferenceAnnual Meeting of the Association for Computational Linguistics (37th : 1999)
CountryUnited States
CityCollege Park
Period20/06/9926/06/99

Bibliographical note

Copyright the Publisher 1999. Version archived for private and non-commercial use with the permission of the author/s and according to publisher conditions. For further rights please contact the publisher.

Fingerprint Dive into the research topics of 'Efficient probabilistic top-down and left-corner parsing'. Together they form a unique fingerprint.

Cite this