Partial descriptions and systemic grammar

  • Authors:
  • Chris Brew

  • Affiliations:
  • University of Edinburgh, Edinburgh, U.K.

  • Venue:
  • COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper examines the properties of featurebased partial descriptions built on top of Halliday's systemic networks. We show that the crucial operation of consistency checking for such descriptions is NP-complete, and therefore probably intractable, but proceed to develop algorithms which can sometimes alleviate the unpleasant consequences of this intractability.