Context-free grammar

Known as: Context-free grammars, CFG, Context Free Grammar 
A context-free grammar (CFG) is a term used in formal language theory to describe a certain type of formal grammar. A context-free grammar is a set… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
With the introduction of constraints based on finite automata a new line of research has opened where constraints are based on… (More)
  • figure 1
  • table 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
This paper describes a general methodology for automated recognition of complex human activities. The methodology uses a context… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
MOTIVATION As research into disease pathology and cellular function continues to generate vast amounts of data pertaining to… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing context-free grammars (CFGs), yielding the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We present an algorithm for approximating context-free languages with regular languages. The algorithm is based on a simple… (More)
  • figure 9.1
  • table 9.1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The assignment of probabilities to the productions of a context-free grammar may generate an improper distribution: the… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We describe a parsing system based upon a language model for English that is, in turn, based upon assigning probabilities to… (More)
Is this relevant?
1994
1994
This paper investigates the use of genetic algorithms for inferring small regular and context-free grammars. Applied simply, a… (More)
Is this relevant?
1991
1991
The articles [8], [5], [9], [1], [10], [11], [3], [2], [7], [4], and [6] provide the notation and terminology for this paper. We… (More)
Is this relevant?
Highly Cited
1966
Highly Cited
1966
In this report, certain properties of context-free (CF or type 2) grammars are investigated, like that of Chomsky. In particular… (More)
Is this relevant?