Parsing and hypergraphs (2001)
Cached
Download Links
by
Dan Klein
,
Christopher D. Manning
| Venue: | In IWPT |
| Citations: | 42 - 3 self |
BibTeX
@INPROCEEDINGS{Klein01parsingand,
author = {Dan Klein and Christopher D. Manning},
title = {Parsing and hypergraphs},
booktitle = {In IWPT},
year = {2001},
pages = {123--134}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
While symbolic parsers can be viewed as deduction systems, this view is less natural for probabilistic parsers. We present a view of parsing as directed hypergraph analysis which naturally covers both symbolic and probabilistic parsing. We illustrate the approach by showing how a dynamic extension of Dijkstra’s algorithm can be used to construct a probabilistic chart parser with an Ç Ò time bound for arbitrary PCFGs, while preserving as much of the flexibility of symbolic chart parsers as allowed by the inherent ordering of probabilistic dependencies. 1
