Some Novel Applications of Explanation-Based Learning to Parsing Lexicalized Tree-Adjoining Grammars
<|reference_start|>Some Novel Applications of Explanation-Based Learning to Parsing Lexicalized Tree-Adjoining Grammars: 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.<|reference_end|>
@article{srinivas1995some,
    title={Some Novel Applications of Explanation-Based Learning to Parsing
  Lexicalized Tree-Adjoining Grammars},
    author={B. Srinivas and Aravind Joshi (Department of Computer and Information
  Science, University of Pennsylvania)},
    journal={ACL 1995},
    year={1995},
    archivePrefix={arXiv},
    eprint={cmp-lg/9505023},
    primaryClass={cmp-lg cs.CL}
}