Some Novel Applications of Explanation-Based Learning to Parsing Lexicalized Tree-Adjoining Grammars

Simple item page
dc.creatorSrinivas, B.
dc.creatorJoshi, Aravind
dc.date1995-05-10
dc.date.accessioned2026-07-07T09:09:51Z
dc.date.available2026-07-07T09:09:51Z
dc.descriptionIn 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.
dc.descriptionuuencoded postscript file
dc.identifierhttps://arxiv.org/abs/cmp-lg/9505023
dc.identifierhttp://arxiv.org/abs/cmp-lg/9505023
dc.identifierACL 1995
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/151182
dc.subjectComputation and Language
dc.titleSome Novel Applications of Explanation-Based Learning to Parsing Lexicalized Tree-Adjoining Grammars
dc.typetext

Files

Collections

arXiv