Topic
Context-sensitive grammar
About: Context-sensitive grammar is a research topic. Over the lifetime, 1938 publications have been published within this topic receiving 45911 citations. The topic is also known as: CSG.
Papers published on a yearly basis
Papers
More filters
TL;DR: A coding theorem is proved which shows that a structured grammar-based code has maximal redundancy/sample O(1=logn) provided that a weak regular structure condition is satisfied.
Abstract: A grammar-based code losslessly compresses each finite-alphabet data string x by compressing a context-free grammar Gx which represents x in the sense that the language of Gx is fxg. In an earlier paper, we showed that if the grammar Gx is a type of grammar called ir- reducible grammar for every data string x, then the resulting grammar-based code has maximal redundancy/sample O(log logn=logn) for n data samples. To further reduce the maximal redun- dancy/sample, in the present paper, we first decompose a context-free grammar into its structure and its data content, then encode the data content conditional on the structure, and finally replace the irreducible grammar condition with a mild condition on the structures of all grammars used to repre- sent distinct data strings of a fixed length. The resulting grammar-based codes are called structured grammar-based codes. We prove a coding theorem which shows that a structured grammar-based code has maximal redundancy/sample O(1=logn) provided that a weak regular structure condition is satisfied.
15 citations
TL;DR: Productions of a context-free grammar can be given coefficients from semirings, inducing weights for both derivations in the grammar and strings over the terminal alphabet.
15 citations
03 Apr 2011
TL;DR: How alternative representations from graph theory including graphs, overcomplete graphs and hyperedge graphs can support some of the intuitions handled in shape grammars by direct visual computations with shapes is shown.
Abstract: An implementation of a shape grammar interpreter is described. The underlying graph-theoretic framework is briefly discussed to show how alternative representations from graph theory including graphs, overcomplete graphs and hyperedge graphs can support some of the intuitions handled in shape grammars by direct visual computations with shapes. The resulting plugin implemented in Rhino, code-named GRAPE, is briefly described in the end.
15 citations
15 citations
TL;DR: It is shown that every strict Deterministic language may be given a strict deterministic grammar which is also in Greibach normal form.
15 citations