Quarterly (March, June, September, December)
160 pp. per issue
6 3/4 x 10
ISSN
0891-2017
E-ISSN
1530-9312
2014 Impact factor:
1.23

Computational Linguistics

Paola Merlo, Editor
June 2001, Vol. 27, No. 2, Pages 277-285
(doi: 10.1162/089120101750300535)
© 2001 Association for Computational Linguistics
Nonminimal Derivations in Unification-based Parsing
Article PDF (136.28 KB)
Abstract

Shieber's abstract parsing algorithm (Shieber 1992) for unification grammars is an extension of Earley's algorithm (Earley 1970) for context-free grammars to feature structures. In this paper, we show that, under certain conditions, Shieber's algorithm produces what we call a nonminimal derivation: a parse tree which contains additional features that are not in the licensing productions. While Shieber's definition of parse tree allows for such nonminimal derivations, we claim that they should be viewed as invalid. We describe the sources of the nonminimal derivation problem, and propose a precise definition of minimal parse tree, as well as a modification to Shieber's algorithm which ensures minimality, although at some computational cost.