Some novel applications of Explanation-Based Learning to parsing Lexicalized Tree-Adjoining Grammars

  • Authors:
  • B. Srinivas;Aravind K. Joshi

  • Affiliations:
  • University of Pennsylvania, Philadelphia, PA;University of Pennsylvania, Philadelphia, PA

  • Venue:
  • ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we present some novel applications of Explanation-Based Learning (EBL) technique to parsing Lexicalized Tree-Adjoining grammars. The novel aspects are (a) immediate generalization of parses in the training set, (b) generalization over recursive structures and (c) representation of generalized parses as Finite State Transducers. A highly impoverished parser called a "stapler" has also been introduced. We present experimental results using EBL for different corpora and architectures to show the effectiveness of our approach.