Discontinuous dependency parsing of free and fixed word order: Work in progress

Abstract

The dependency–based free–word–order parsing algorithm of Covington (1987, 1990, 1992) can be extended to handle partly or completely fixed word order, while preserving its psychologically realistic preference for near attachment. By adding predictivity, this algorithm can be adapted to parse left–branching and right–branching structures in less stack space than center–embedded structures, just as the human parser appears to do.