The weak generative capacity of linear tree-adjoining grammars

Authors:
David Chiang
Affiliations:
University of Southern California, Marina del Rey, CA
Venue:
TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
Year:
2006

Citing 8
Cited 1

Tree adjoining grammars for RNA structure prediction

Theoretical Computer Science - Special issue: Genome informatics
Independent parallelism in finite copying parallel rewriting systems

Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
A study of tree adjoining grammars

A study of tree adjoining grammars
Mathematical and computational aspects of lexicalized grammars

Mathematical and computational aspects of lexicalized grammars
Stochastic inversion transduction grammars and bilingual parsing of parallel corpora

Computational Linguistics
Restrictions on tree adjoining languages

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Capturing CFLs with Tree Adjoining Grammars

ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics

Evolving stories: tree adjoining grammar guided genetic programming for complex plot generation

SEAL'10 Proceedings of the 8th international conference on Simulated evolution and learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linear tree-adjoining grammars (TAGs), by analogy with linear context-free grammars, are tree-adjoining grammars in which at most one symbol in each elementary tree can be rewritten (adjoined or substituted at). Uemura et al. (1999), calling these grammars simple linear TAGs (SL-TAGs), show that they generate a class of languages incommensurate with the context-free languages, and can be recognized in O(n4) time.