The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
LFP: a logic for linguistic descriptions and an analysis of its complexity
Computational Linguistics
Predicting Protein Secondary Structure Using Stochastic Tree Grammars
Machine Learning - Special issue on learning with probabilistic representations
DNA evolutionary linguistics and RNA structure modeling: a computational approach
INBS '95 Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95)
Parsing some constrained grammar formalisms
Computational Linguistics
An alternative conception of tree-adjoining derivation
Computational Linguistics
Tree-adjoining grammar parsing and boolean matrix multiplication
Computational Linguistics
Tree Adjoining Grammars in a fragment of the Lambek calculus
Computational Linguistics
The computational complexity of the correct-prefix property for TAGs
Computational Linguistics
The use of shared forests in tree adjoining grammar parsing
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Parsing idioms in lexicalized TAGs
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Tabular algorithms for TAG parsing
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Bidirectional parsing of lexicalized tree adjoining grammars
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
A structure-sharing parser for lexicalized grammars
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
The relationship between Tree Adjoining Grammars and Head Grammars
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
An efficient parsing algorithm for Tree Adjoining Grammars
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
An alternative conception of tree-adjoining derivation
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Polynomial learnability and locality of formal grammars
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
An Earley-type parsing algorithm for Tree Adjoining Grammars
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Synchronous tree-adjoining grammars
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Tree adjoining and head wrapping
COLING '86 Proceedings of the 11th coference on Computational linguistics
Feasible learnability of formal grammars and the theory of natural language acquisition
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Stochastic tree-adjoining grammars
HLT '91 Proceedings of the workshop on Speech and Natural Language
GenI: natural language generation in Haskell
Proceedings of the 2006 ACM SIGPLAN workshop on Haskell
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Spatially Constrained Grammars for Mobile Intention Recognition
Proceedings of the international conference on Spatial Cognition VI: Learning, Reasoning, and Talking about Space
Pseudoknot Identification through Learning TAGRNA
PRIB '08 Proceedings of the Third IAPR International Conference on Pattern Recognition in Bioinformatics
A compiler for parsing schemata
Software—Practice & Experience
RNA Pseudoknot Folding through Inference and Identification Using TAGRNA
BICoB '09 Proceedings of the 1st International Conference on Bioinformatics and Computational Biology
Improved Algorithms for Parsing ESLTAGs: A Grammatical Model Suitable for RNA Pseudoknots
ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
Non-local modeling with a mixture of PCFGs
CoNLL-X '06 Proceedings of the Tenth Conference on Computational Natural Language Learning
Generating XTAG parsers from algebraic specifications
TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
A polynomial-time parsing algorithm for TT-MCTAG
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
Word-order variation in natural language generation
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 2
Word-order variation in natural language generation
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 2
Improved Algorithms for Parsing ESLTAGs: A Grammatical Model Suitable for RNA Pseudoknots
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Complexity, parsing, and factorization of tree-local multi-component tree-adjoining grammar
Computational Linguistics
On Using Semi-Dyck Sets To Analyse Coupled-Context-Free Languages
Fundamenta Informaticae
Managing Multiple Knowledge Sources In Constraint-Based Parsing Of Spoken Language
Fundamenta Informaticae
| Hi-index | 0.00 |
Tree Adjoining Grammar (TAG) is a formalism for natural language grammars. Some of the basic notions of TAG's were introduced in [Joshi, Levy, and Takahashi 1975] and by [Joshi, 1983]. A detailed investigation of the linguistic relevance of TAG's has been carried out in [Kroch and Joshi, 1985]. In this paper, we will describe some new results for TAG's, especially in the following areas: (1) parsing complexity of TAG's, (2) some closure results for TAG's, and (3) the relationship to Head grammars.