GIGs: restricted context-sensitive descriptive power in bounded polynomial-time

Authors:
José M. Castaño
Affiliations:
Computer Science Department, Brandeis University, Waltham, MA
Venue:
CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing
Year:
2003

Citing 14
Cited 0

An efficient augmented-context-free parsing algorithm

Computational Linguistics
A geometric hierarchy beyond context-free languages

Theoretical Computer Science
Tree-Adjoining Language Parsing in o(n^6) Time

SIAM Journal on Computing
Grammars with controlled derivations

Handbook of formal languages, vol. 2
One-way nondeterministic real-time list-storage languages

Journal of the ACM (JACM)
Indexed Grammars—An Extension of Context-Free Grammars

Journal of the ACM (JACM)
Confluent and Other Types of Thue Systems

Journal of the ACM (JACM)
An efficient context-free parsing algorithm

Communications of the ACM
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory
Introduction to Formal Language Theory

Introduction to Formal Language Theory
Derivational Minimalism

LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics
Semilinearity as a Syntactic Invariant

LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics
Characterizing mildly context-sensitive grammar formalisms

Characterizing mildly context-sensitive grammar formalisms
Tree-adjoining grammar parsing and boolean matrix multiplication

Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present Global Index Grammars, a grammar formalism that uses a stack of indices associated to its productions. This formalism has restricted context-sensitive descriptive power. The recognition problem for this class of grammars is polynomial: the time complexity of the algorithm presented here is O(n6).