The proper treatment of word order in HPSG

  • Authors:

  • Karel Oliva

  • Affiliations:

  • University of Saarland, Saarbrücken, Federal Republic of Germany

  • Venue:
  • COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
  • Year:
  • 1992

  • Topological parsing

    EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes a possibility of expressing ordering constraints among non-sister constituents in binary branching syntactic structures on a local basis, supported by viewing the binary branching structure as a list (rather than a tree) of constitutents within HPSG-style grammars. The core idea of such a description of ordering is constituted by creating a type lattice for lists. The possibilities of expressing different approaches to word order in the framework are briefly discussed, exemplified and compared to other methods.