A note on the strong and weak generative powers of formal systems

Authors:
Aravind K. Joshi
Affiliations:
Department of Computer and Information Science, and Institute for Research in Cognitive Science, University of Pennsylvania, Room 555 Moore School, Philadelphia, PA
Venue:
Theoretical Computer Science - Algebraic methods in language processing
Year:
2003

Citing 7
Cited 0

Tree-adjoining grammars

Handbook of formal languages, vol. 3
Handbook of Logic and Language

Handbook of Logic and Language
An operational and denotational approach to non-context-freeness

Theoretical Computer Science - Algebraic methods in language processing
Context-sensitive immediate constituent analysis—context-free languages revisited

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Characterizing mildly context-sensitive grammar formalisms

Characterizing mildly context-sensitive grammar formalisms
Deductive systems and grammars: proofs as grammatical structures

Deductive systems and grammars: proofs as grammatical structures
An alternative conception of tree-adjoining derivation

Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is a note on some relationships between the strong and weak generative powers of formal systems, in particular, from the point of view of squeezing more strong power out of a formal system without increasing its weak generative power. We will comment on some old and new results from this perspective. Our main goal of this note is to comment on the strong generative power of context-free grammars, lexicalized tree-adjoining grammars (and some of their variants) and Lambek grammars, especially in the context of crossing dependencies, in view of the recent work of Tiede (Ph.D. Dissertation, Indiana University, Bloomington, 1999).