Using descriptions of trees in a tree adjoining grammar
Computational Linguistics
Formal and computational aspects of natural language syntax
Formal and computational aspects of natural language syntax
ACL '95 Proceedings of the 33rd 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
Feature structures based Tree Adjoining Grammars
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Computational Linguistics
Supertagging: an approach to almost parsing
Computational Linguistics
On building a more efficient grammar by exploiting types
Natural Language Engineering
An efficient kernel for multilingual generation in speech-to-speech dialogue translation
COLING '98 Proceedings of the 17th international 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
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
A principle-based hierarchical representation of LTAGs
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Computing phrasal-signs in HPSG prior to parsing
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
On the applicability of Global Index Grammars
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
STAR '01 Proceedings of the ACL 2001 Workshop on Sharing Tools and Resources - Volume 15
An extended architecture for robust generation
INLG '00 Proceedings of the first international conference on Natural language generation - Volume 14
Offline compilation of chains for head-driven generation with constraint-based grammars
CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing
Some interdefinability results for syntactic constraint classes
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Hi-index | 0.00 |
We present an implemented compilation algorithm that translates HPSG into lexicalized feature-based TAG, relating concepts of the two theories. While HPSG has a more elaborated principle-based theory of possible phrase structures, TAG provides the means to represent lexicalized structures more explicitly. Our objectives are met by giving clear definitions that determine the projection of structures from the lexicon, and identify "maximal" projections, auxiliary trees and foot nodes.