Coordination in Tree Adjoining Grammars: formalization and implementation

Authors:
Anoop Sarkar;Aravind Joshi
Affiliations:
University of Pennsylvania, Philadelphia, PA;University of Pennsylvania, Philadelphia, PA
Venue:
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Year:
1996

Citing 1
Cited 7

An Earley-type parsing algorithm for Tree Adjoining Grammars

ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics

A uniform method of grammar extraction and its applications

EMNLP '00 Proceedings of the 2000 Joint SIGDAT conference on Empirical methods in natural language processing and very large corpora: held in conjunction with the 38th Annual Meeting of the Association for Computational Linguistics - Volume 13
Automated extraction of Tree-Adjoining Grammars from treebanks

Natural Language Engineering
Incremental LTAG parsing

HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
ELLEIPO: a module that computes coordinative ellipsis for language generators that don't

EACL '06 Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Posters & Demonstrations
A comparison of clausal coordinate ellipsis in Estonian and German: remarkably similar elision rules allow a language-independent ellipsis-generation module

EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Demonstrations Session
Generating clausal coordinate ellipsis multilingually: a uniform approach based on postediting

ENLG '09 Proceedings of the 12th European Workshop on Natural Language Generation
A tree adjoining grammar analysis of the syntax and semantics of it-clefts

TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms

Quantified Score

Hi-index	0.01

Visualization

Abstract

In 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.