Sciweavers

IWPT
2001

Parsing and Hypergraphs

14 years 25 days ago
Parsing and Hypergraphs
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 Ǵҿ
Dan Klein, Christopher D. Manning
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2001
Where IWPT
Authors Dan Klein, Christopher D. Manning
Comments (0)