On the succinctness properties of unordered context-free grammars

Authors:
M. Drew Moshier;William C. Rounds
Affiliations:
University of Michigan, Ann Arbor, Michigan;University of Michigan, Ann Arbor, Michigan
Venue:
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Year:
1987

Citing 4
Cited 1

Simultaneous-distributive coordination and context-freeness

Computational Linguistics
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Computational Complexity and Natural Language

Computational Complexity and Natural Language
The computational difficulty of ID/LP parsing

ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics

Managing Multiple Knowledge Sources In Constraint-Based Parsing Of Spoken Language

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove in this paper that unordered, or ID/LP grammars, are exponentially more succinct than context-free grammars, by exhibiting a sequence (Ln) of finite languages such that the size of any CFG for Ln must grow exponentially in n, but which can be described by polynomial-size ID/LP grammars. The results have implications for the description of free word order languages.