Efficient disjunctive unification for bottom-up parsing

  • Authors:
  • David Carter

  • Affiliations:
  • SRI International Cambridge Research Centre, Cambridge, 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 describes two novel techniques which, when applied together, in practice significantly reduce the time required for unifying disjunctive feature structures. The first is a safe but fast method for discarding irrelevant disjunctions from newly-created structures. The second reduces the time required to check the consistency of a structure from exponential to polynomial in the number of disjunctions, except in cases that, it will be argued, should be very unusual in practical systems. The techniques are implemented in an experimental Japanese analyser that uses a large, existing disjunctive Japanese grammar and lexicon. Observations of the time behaviour of this analyser suggest that a significant speed gain is achieved.