Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
  • M. Ryoo, J. Aggarwal
  • IEEE Computer Society Conference on Computer…
  • 2006
  • Corpus ID: 14039104
This paper describes a general methodology for automated recognition of complex human activities. The methodology uses a context… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1997
Highly Cited
1997
This chapter is devoted to context-free languages. Context-free languages and grammars were designed initially to formalize… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We develop a formal grammatical system called a link grammar, show how English grammar can be encoded in such a system, and give… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
  • M. Pentus
  • [] Proceedings Eighth Annual IEEE Symposium on…
  • 1993
  • Corpus ID: 1910507
Basic categorial grammars are the context-free ones. Another kind of categorial grammars was introduced by J. Lambek (1958… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Abstract Multiple context-free grammars (mcfg's) is a subclass of generalized context-free grammars introduced by Pollard (1984… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
Highly Cited
1968
Highly Cited
1968
  • A. Aho
  • JACM
  • 1968
  • Corpus ID: 9539666
A new type of grammar for generating formal languages, called an indexed grammar, is presented. An indexed grammar is an… Expand
  • figure 1
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… Expand
Is this relevant?
Highly Cited
1965
Highly Cited
1965
A context>free phrase structure general~or is in..~landard jb~'m if and only if alt of its rules are of the form: Z-, aY… Expand
Is this relevant?