Coordination in Tree Adjoining Grammars: Formalization and Implementation

Simple item page
dc.creatorSarkar, Anoop
dc.creatorJoshi, Aravind
dc.date1996-06-07
dc.date.accessioned2026-07-07T09:10:22Z
dc.date.available2026-07-07T09:10:22Z
dc.descriptionIn this paper we show that an account for coordination can be constructed using the derivation structures in a lexicalized Tree Adjoining Grammar (LTAG). We present a notion of derivation in LTAGs that preserves the notion of fixed constituency in the LTAG lexicon while providing the flexibility needed for coordination phenomena. We also discuss the construction of a practical parser for LTAGs that can handle coordination including cases of non-constituent coordination.
dc.description6 pages, 16 Postscript figures, uses colap.sty. To appear in the proceedings of COLING 1996
dc.identifierhttps://arxiv.org/abs/cmp-lg/9606006
dc.identifierhttp://arxiv.org/abs/cmp-lg/9606006
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/151329
dc.subjectComputation and Language
dc.titleCoordination in Tree Adjoining Grammars: Formalization and Implementation
dc.typetext

Files

Collections

arXiv