Efficient parsing for bilexical context-free grammars and head automaton grammars

  • Authors:
  • Jason Eisner;Giorgio Satta

  • Affiliations:
  • University of Pennsylvania, Philadelphia, PA;Università di Padova, Padova, Italy

  • Venue:
  • ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

Several recent stochastic parsers use bilexical grammars, where each word type idiosyncratically prefers particular complements with particular head words. We present O(n4) parsing algorithms for two bilexical formalisms, improving the prior upper bounds of O(n5). For a common special case that was known to allow O(n3) parsing (Eisner, 1997), we present an O(n3) algorithm with an improved grammar constant.