Parsing and hypergraphs

Parsing and hypergraphs (2001)

by Dan Klein , Christopher D. Manning

Venue:	In IWPT
Citations:	42 - 3 self

Datum	Value	Source
TITLE	Parsing and hypergraphs	INFERENCE
AUTHOR NAME	Dan Klein	SVM HeaderParse 0.2
AUTHOR AFFIL	Computer Science Department; Stanford University	SVM HeaderParse 0.2
AUTHOR ADDR	Stanford, CA 94305-9040	SVM HeaderParse 0.2
AUTHOR NAME	Christopher D. Manning	SVM HeaderParse 0.2
AUTHOR AFFIL	Computer Science Department; Stanford University	SVM HeaderParse 0.2
AUTHOR ADDR	Stanford, CA 94305-9040	SVM HeaderParse 0.2
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	SVM HeaderParse 0.2
YEAR	2001	INFERENCE
VENUE	In IWPT	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	123--134	INFERENCE
CITATIONS	22 found	ParsCit 1.0