Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 221,894,033 papers from all fields of science
Search
Sign In
Create Free Account
Context-free grammar
Known as:
Context-free grammars
, CFG
, Context Free Grammar
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ALGOL 68
ANTLR
Adaptive grammar
Affix grammar
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Learning Context Free Grammars with the Syntactic Concept Lattice
Alexander Clark
International Conference on Graphics and…
2010
Corpus ID: 17329749
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural…
Expand
2002
2002
Incremental Learning of Context Free Grammars
Katsuhiko Nakamura
,
Masashi Matsumoto
International Conference on Graphics and…
2002
Corpus ID: 30638988
This paper describes inductive inference for synthesizing context free grammars from positive and negative sample strings…
Expand
Highly Cited
1995
Highly Cited
1995
A Schema Theorem for context-free grammars
P. Whigham
Proceedings of IEEE International Conference on…
1995
Corpus ID: 16189468
The basic Schema Theorem for genetic algorithms is modified for a grammatically-based learning system. A context-free grammar is…
Expand
1993
1993
Stochastic Lexicalized Context-Free Grammar
Yves Schabes
,
R. Waters
International Workshop/Conference on Parsing…
1993
Corpus ID: 60662416
Stochastic lexicalized context-free grammar (SLCFG) is an attractive compromise between the parsing efficiency of stochastic…
Expand
1991
1991
Puzzle Grammars and Context-Free Array Grammars
M. Nivat
,
A. Saoudi
,
K. Subramanian
,
R. Siromoney
,
V. Dare
International journal of pattern recognition and…
1991
Corpus ID: 39845463
We introduce a new model for generating finite, digitized, connected pictures called puzzle grammars and study its generative…
Expand
Highly Cited
1991
Highly Cited
1991
Query term weights as constraints in fuzzy information retrieval
Gloria Bordogna
,
P. Carrara
,
G. Pasi
Information Processing & Management
1991
Corpus ID: 30552441
Highly Cited
1972
Highly Cited
1972
On the Covering and Reduction Problems for Context-Free Grammars
J. Gray
,
M. Harrison
JACM
1972
Corpus ID: 15956305
A formal definition of one grammar "covering" another grammar is presented. I t is argued that this definition has the property…
Expand
Highly Cited
1971
Highly Cited
1971
Pair Grammars, Graph Languages and String-to-Graph Translations
T. W. Pratt
Journal of computer and system sciences (Print)
1971
Corpus ID: 205894879
1971
1971
Branching processes with terminal types: application to context-free grammars
D. Sankoff
Journal of Applied Probability
1971
Corpus ID: 124314945
In this note we consider multi-type branching processes where certain terminal types of particles, once created, are subject…
Expand
Highly Cited
1967
Highly Cited
1967
Matrix Equations and Normal Forms for Context-Free Grammars
D. Rosenkrantz
JACM
1967
Corpus ID: 10964956
The relationship between the set of productions of a context-free grammar and the corresponding set of defining equations is…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE