Generating an LTAG out of a principle-based hierarchical representation

Authors:
Marie-Hélène Candito
Affiliations:
Université Paris, Paris, France
Venue:
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Year:
1996

Citing 5
Cited 1

XTAG: a graphical workbench for developing tree-adjoining grammars

ANLC '92 Proceedings of the third conference on Applied natural language processing
Encoding Lexicalized Tree Adjoining Grammars with a nonmonotonic inheritance hierarchy

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Reasoning with descriptions of trees

ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Parsing strategies with 'lexicalized' grammars: application to tree adjoining grammars

COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Structure sharing in lexicalized tree-adjoining grammars

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1

Building parallel LTAG for French and Italian

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Lexicalized Tree Adjoining Grammars have proved useful for NLP. However, numerous redundancy problems face LTAGs developers, as highlighted by Vijay-Shanker and Schabes (92).We present and a tool that automatically generates the tree families of an LTAG. It starts from a compact hierarchical organization of syntactic descriptions that is linguistically motivated and carries out all the relevant combinations of linguistic phenomena.