A Comparison of PARSIFAL with Augmented Transition Networks

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6289

Full metadata record

DC Field	Value	Language
dc.creator	Swartout, William R.	-
dc.date	2004-10-04T14:49:22Z	-
dc.date	2004-10-04T14:49:22Z	-
dc.date	1978-03-01	-
dc.date.accessioned	2013-10-09T02:44:37Z	-
dc.date.available	2013-10-09T02:44:37Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-462	-
dc.identifier	http://hdl.handle.net/1721.1/6289	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	This paper compares Marcus' parser, PARSIFAL with Woods' Augmented Transition Network (ATN) parser. In particular, the paper examines the two parsers in light of Marcus' Determinism Hypothesis. An overview of each parser is presented. Following that, the Determinism Hypothesis is examined in detail. A method for transforming the PARSIFAL grammar rules into the ATN formalism is outlined. This transformation shows some of the fundamental differences between PARSIFAL and ATN parsers, and the nature of the hypotheses used in PARSIFAL. Finally, the principle of least commitment is proposed as an alternative to the Determinism Hypothesis.	-
dc.format	5888027 bytes	-
dc.format	4293669 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-462	-
dc.title	A Comparison of PARSIFAL with Augmented Transition Networks	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI