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.
Cite
CITATION STYLE
Moshier, M. D., & Rounds, W. C. (1987). On the succinctness properties of unordered context-free Grammars. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (Vol. 1987-July, pp. 112–116). Association for Computational Linguistics (ACL). https://doi.org/10.3115/981175.981191
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
