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 Ǵҿ

• Type: Conference
• Year: 2001
• Where: IWPT
• Authors: Dan Klein, Christopher D. Manning
• Keywords: IWPT 2001, Probabilistic, Probabilistic Parsers, Symbolic Parsers, System Software