Capturing CFLs with Tree Adjoining Grammars

Authors:
James Rogers
Affiliations:
University of Delaware, Newark, DE
Venue:
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Year:
1994

Citing 5
Cited 8

Mathematical and computational aspects of lexicalized grammars

Mathematical and computational aspects of lexicalized grammars
Parsing some constrained grammar formalisms

Computational Linguistics
Lexicalized context-free grammars

ACL '93 Proceedings of the 31st 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
Stochastic lexicalized tree-adjoining grammars

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

Restrictions on tree adjoining languages

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
A meta-level grammar: redefining synchronous TAG for translation and paraphrase

ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Constraints on strong generative power

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Using model-theoretic semantic interpretation to guide statistical parsing and word recognition in a spoken language interface

ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Multi-component TAG and notions of formal power

ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
The weak generative capacity of linear tree-adjoining grammars

TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
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
Tree-rewriting models of multi-word expressions

MWE '11 Proceedings of the Workshop on Multiword Expressions: from Parsing and Generation to the Real World

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a decidable class of TAGs that is strongly equivalent to CFGs and is cubic-time parsable. This class serves to lexicalize CFGs in the same manner as the LCFGs of Schabes and Waters but with considerably less restriction on the form of the grammars. The class provides a normal form for TAGs that generate local sets in much the same way that regular grammars provide a normal form for CFGs that generate regular sets.